./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/toy.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 57096758 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/toy.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs --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 1ba07ae5f9ba9742e473cf2ed151649cad165d7c ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/toy.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs --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 1ba07ae5f9ba9742e473cf2ed151649cad165d7c .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-5709675 [2021-10-16 02:17:35,199 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-16 02:17:35,201 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-16 02:17:35,234 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-16 02:17:35,235 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-16 02:17:35,236 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-16 02:17:35,238 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-16 02:17:35,241 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-16 02:17:35,243 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-16 02:17:35,244 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-16 02:17:35,245 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-16 02:17:35,247 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-16 02:17:35,248 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-16 02:17:35,249 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-16 02:17:35,251 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-16 02:17:35,253 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-16 02:17:35,254 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-16 02:17:35,255 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-16 02:17:35,257 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-16 02:17:35,260 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-16 02:17:35,262 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-16 02:17:35,264 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-16 02:17:35,265 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-16 02:17:35,266 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-16 02:17:35,270 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-16 02:17:35,271 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-16 02:17:35,271 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-16 02:17:35,272 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-16 02:17:35,273 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-16 02:17:35,274 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-16 02:17:35,275 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-16 02:17:35,276 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-16 02:17:35,277 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-16 02:17:35,278 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-16 02:17:35,279 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-16 02:17:35,280 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-16 02:17:35,281 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-16 02:17:35,281 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-16 02:17:35,282 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-16 02:17:35,283 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-16 02:17:35,284 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-16 02:17:35,285 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-16 02:17:35,313 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-16 02:17:35,313 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-16 02:17:35,314 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-16 02:17:35,314 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-16 02:17:35,314 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-16 02:17:35,315 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-16 02:17:35,315 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-16 02:17:35,315 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-16 02:17:35,315 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-16 02:17:35,315 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-16 02:17:35,316 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-16 02:17:35,316 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-16 02:17:35,316 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-16 02:17:35,316 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-16 02:17:35,316 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-16 02:17:35,317 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-16 02:17:35,317 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-16 02:17:35,318 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-16 02:17:35,318 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-16 02:17:35,318 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-16 02:17:35,318 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-16 02:17:35,318 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-16 02:17:35,319 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-16 02:17:35,319 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-16 02:17:35,319 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-16 02:17:35,319 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-16 02:17:35,319 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-16 02:17:35,320 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-16 02:17:35,320 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-16 02:17:35,320 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-16 02:17:35,320 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-16 02:17:35,321 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-16 02:17:35,321 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-16 02:17:35,321 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-16 02:17:35,321 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-16 02:17:35,321 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-16 02:17:35,322 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-16 02:17:35,322 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-16 02:17:35,322 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-16 02:17:35,322 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_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/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_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs 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 -> 1ba07ae5f9ba9742e473cf2ed151649cad165d7c [2021-10-16 02:17:35,612 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-16 02:17:35,646 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-16 02:17:35,650 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-16 02:17:35,651 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-16 02:17:35,652 INFO L275 PluginConnector]: CDTParser initialized [2021-10-16 02:17:35,653 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/../../sv-benchmarks/c/systemc/toy.cil.c [2021-10-16 02:17:35,722 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/data/16e008056/1c3f010cef6147918b5ae9f7b2c5e088/FLAG3c4c7d2cf [2021-10-16 02:17:36,179 INFO L306 CDTParser]: Found 1 translation units. [2021-10-16 02:17:36,180 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/sv-benchmarks/c/systemc/toy.cil.c [2021-10-16 02:17:36,192 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/data/16e008056/1c3f010cef6147918b5ae9f7b2c5e088/FLAG3c4c7d2cf [2021-10-16 02:17:36,553 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/data/16e008056/1c3f010cef6147918b5ae9f7b2c5e088 [2021-10-16 02:17:36,555 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-16 02:17:36,559 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-16 02:17:36,564 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-16 02:17:36,565 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-16 02:17:36,568 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-16 02:17:36,569 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 02:17:36" (1/1) ... [2021-10-16 02:17:36,570 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71c1c111 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:17:36, skipping insertion in model container [2021-10-16 02:17:36,570 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 02:17:36" (1/1) ... [2021-10-16 02:17:36,580 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-16 02:17:36,629 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-16 02:17:36,810 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_ca4315d4-1b84-489f-97dd-b4083ab676d8/sv-benchmarks/c/systemc/toy.cil.c[392,405] [2021-10-16 02:17:36,898 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-16 02:17:36,912 INFO L203 MainTranslator]: Completed pre-run [2021-10-16 02:17:36,942 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_ca4315d4-1b84-489f-97dd-b4083ab676d8/sv-benchmarks/c/systemc/toy.cil.c[392,405] [2021-10-16 02:17:37,003 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-16 02:17:37,021 INFO L208 MainTranslator]: Completed translation [2021-10-16 02:17:37,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:17:37 WrapperNode [2021-10-16 02:17:37,022 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-16 02:17:37,023 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-16 02:17:37,023 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-16 02:17:37,024 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-16 02:17:37,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:17:37" (1/1) ... [2021-10-16 02:17:37,043 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:17:37" (1/1) ... [2021-10-16 02:17:37,096 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-16 02:17:37,097 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-16 02:17:37,097 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-16 02:17:37,098 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-16 02:17:37,107 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:17:37" (1/1) ... [2021-10-16 02:17:37,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:17:37" (1/1) ... [2021-10-16 02:17:37,111 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:17:37" (1/1) ... [2021-10-16 02:17:37,111 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:17:37" (1/1) ... [2021-10-16 02:17:37,119 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:17:37" (1/1) ... [2021-10-16 02:17:37,128 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:17:37" (1/1) ... [2021-10-16 02:17:37,131 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:17:37" (1/1) ... [2021-10-16 02:17:37,136 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-16 02:17:37,137 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-16 02:17:37,137 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-16 02:17:37,137 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-16 02:17:37,138 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:17:37" (1/1) ... [2021-10-16 02:17:37,177 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-16 02:17:37,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/z3 [2021-10-16 02:17:37,208 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-16 02:17:37,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-16 02:17:37,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-16 02:17:37,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-16 02:17:37,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-16 02:17:37,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-16 02:17:38,946 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-16 02:17:38,947 INFO L299 CfgBuilder]: Removed 26 assume(true) statements. [2021-10-16 02:17:38,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:17:38 BoogieIcfgContainer [2021-10-16 02:17:38,951 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-16 02:17:38,956 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-16 02:17:38,956 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-16 02:17:38,960 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-16 02:17:38,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 02:17:36" (1/3) ... [2021-10-16 02:17:38,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46ebc8e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 02:17:38, skipping insertion in model container [2021-10-16 02:17:38,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:17:37" (2/3) ... [2021-10-16 02:17:38,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46ebc8e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 02:17:38, skipping insertion in model container [2021-10-16 02:17:38,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:17:38" (3/3) ... [2021-10-16 02:17:38,966 INFO L111 eAbstractionObserver]: Analyzing ICFG toy.cil.c [2021-10-16 02:17:38,977 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-16 02:17:38,978 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-16 02:17:39,054 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-16 02:17:39,068 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-16 02:17:39,068 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-16 02:17:39,092 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 40 states have (on average 1.7) internal successors, (68), 41 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:17:39,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-16 02:17:39,099 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:17:39,100 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:17:39,101 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:17:39,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:17:39,108 INFO L82 PathProgramCache]: Analyzing trace with hash -45786040, now seen corresponding path program 1 times [2021-10-16 02:17:39,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:17:39,122 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245306963] [2021-10-16 02:17:39,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:17:39,124 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:17:39,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:17:39,380 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-16 02:17:39,381 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:17:39,381 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245306963] [2021-10-16 02:17:39,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245306963] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:17:39,382 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:17:39,383 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-16 02:17:39,385 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587255595] [2021-10-16 02:17:39,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:17:39,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:17:39,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:17:39,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:17:39,412 INFO L87 Difference]: Start difference. First operand has 42 states, 40 states have (on average 1.7) internal successors, (68), 41 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:17:39,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:17:39,487 INFO L93 Difference]: Finished difference Result 109 states and 177 transitions. [2021-10-16 02:17:39,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:17:39,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2021-10-16 02:17:39,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:17:39,502 INFO L225 Difference]: With dead ends: 109 [2021-10-16 02:17:39,503 INFO L226 Difference]: Without dead ends: 65 [2021-10-16 02:17:39,506 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:17:39,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-10-16 02:17:39,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2021-10-16 02:17:39,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.5555555555555556) internal successors, (98), 63 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:17:39,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 98 transitions. [2021-10-16 02:17:39,579 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 98 transitions. Word has length 14 [2021-10-16 02:17:39,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:17:39,580 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 98 transitions. [2021-10-16 02:17:39,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:17:39,581 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 98 transitions. [2021-10-16 02:17:39,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-16 02:17:39,582 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:17:39,583 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:17:39,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-16 02:17:39,583 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:17:39,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:17:39,585 INFO L82 PathProgramCache]: Analyzing trace with hash -978452540, now seen corresponding path program 1 times [2021-10-16 02:17:39,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:17:39,585 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015958928] [2021-10-16 02:17:39,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:17:39,586 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:17:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:17:39,694 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-16 02:17:39,695 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:17:39,695 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015958928] [2021-10-16 02:17:39,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015958928] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:17:39,696 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:17:39,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-16 02:17:39,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454684721] [2021-10-16 02:17:39,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:17:39,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:17:39,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:17:39,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:17:39,700 INFO L87 Difference]: Start difference. First operand 64 states and 98 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:17:39,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:17:39,750 INFO L93 Difference]: Finished difference Result 116 states and 183 transitions. [2021-10-16 02:17:39,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:17:39,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2021-10-16 02:17:39,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:17:39,753 INFO L225 Difference]: With dead ends: 116 [2021-10-16 02:17:39,753 INFO L226 Difference]: Without dead ends: 81 [2021-10-16 02:17:39,755 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:17:39,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-10-16 02:17:39,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2021-10-16 02:17:39,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.5616438356164384) internal successors, (114), 73 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:17:39,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 114 transitions. [2021-10-16 02:17:39,768 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 114 transitions. Word has length 22 [2021-10-16 02:17:39,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:17:39,768 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 114 transitions. [2021-10-16 02:17:39,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:17:39,769 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 114 transitions. [2021-10-16 02:17:39,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-16 02:17:39,771 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:17:39,771 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] [2021-10-16 02:17:39,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-16 02:17:39,771 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:17:39,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:17:39,772 INFO L82 PathProgramCache]: Analyzing trace with hash 2142577232, now seen corresponding path program 1 times [2021-10-16 02:17:39,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:17:39,773 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511462100] [2021-10-16 02:17:39,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:17:39,774 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:17:39,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:17:39,917 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-16 02:17:39,918 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:17:39,918 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511462100] [2021-10-16 02:17:39,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511462100] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:17:39,919 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:17:39,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-16 02:17:39,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237829876] [2021-10-16 02:17:39,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:17:39,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:17:39,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:17:39,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:17:39,925 INFO L87 Difference]: Start difference. First operand 74 states and 114 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:17:40,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:17:40,046 INFO L93 Difference]: Finished difference Result 122 states and 189 transitions. [2021-10-16 02:17:40,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-16 02:17:40,047 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2021-10-16 02:17:40,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:17:40,055 INFO L225 Difference]: With dead ends: 122 [2021-10-16 02:17:40,055 INFO L226 Difference]: Without dead ends: 77 [2021-10-16 02:17:40,057 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-16 02:17:40,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-10-16 02:17:40,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2021-10-16 02:17:40,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.547945205479452) internal successors, (113), 73 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:17:40,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 113 transitions. [2021-10-16 02:17:40,089 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 113 transitions. Word has length 26 [2021-10-16 02:17:40,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:17:40,090 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 113 transitions. [2021-10-16 02:17:40,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:17:40,092 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 113 transitions. [2021-10-16 02:17:40,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-16 02:17:40,094 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:17:40,094 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] [2021-10-16 02:17:40,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-16 02:17:40,096 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:17:40,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:17:40,097 INFO L82 PathProgramCache]: Analyzing trace with hash 2097132956, now seen corresponding path program 1 times [2021-10-16 02:17:40,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:17:40,098 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050464996] [2021-10-16 02:17:40,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:17:40,099 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:17:40,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:17:40,184 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-16 02:17:40,185 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:17:40,185 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050464996] [2021-10-16 02:17:40,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050464996] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:17:40,186 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:17:40,186 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-16 02:17:40,186 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394665431] [2021-10-16 02:17:40,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:17:40,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:17:40,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:17:40,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:17:40,189 INFO L87 Difference]: Start difference. First operand 74 states and 113 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:17:40,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:17:40,239 INFO L93 Difference]: Finished difference Result 157 states and 246 transitions. [2021-10-16 02:17:40,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:17:40,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2021-10-16 02:17:40,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:17:40,241 INFO L225 Difference]: With dead ends: 157 [2021-10-16 02:17:40,242 INFO L226 Difference]: Without dead ends: 112 [2021-10-16 02:17:40,243 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:17:40,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-10-16 02:17:40,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2021-10-16 02:17:40,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 1.5363636363636364) internal successors, (169), 110 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:17:40,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 169 transitions. [2021-10-16 02:17:40,258 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 169 transitions. Word has length 26 [2021-10-16 02:17:40,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:17:40,259 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 169 transitions. [2021-10-16 02:17:40,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:17:40,259 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 169 transitions. [2021-10-16 02:17:40,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-10-16 02:17:40,262 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:17:40,262 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-10-16 02:17:40,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-16 02:17:40,263 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:17:40,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:17:40,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1514857393, now seen corresponding path program 1 times [2021-10-16 02:17:40,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:17:40,264 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222696605] [2021-10-16 02:17:40,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:17:40,265 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:17:40,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:17:40,412 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-16 02:17:40,412 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:17:40,412 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222696605] [2021-10-16 02:17:40,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222696605] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:17:40,413 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:17:40,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-16 02:17:40,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462464929] [2021-10-16 02:17:40,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:17:40,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:17:40,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:17:40,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:17:40,416 INFO L87 Difference]: Start difference. First operand 111 states and 169 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:17:40,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:17:40,458 INFO L93 Difference]: Finished difference Result 292 states and 448 transitions. [2021-10-16 02:17:40,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:17:40,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2021-10-16 02:17:40,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:17:40,461 INFO L225 Difference]: With dead ends: 292 [2021-10-16 02:17:40,461 INFO L226 Difference]: Without dead ends: 185 [2021-10-16 02:17:40,462 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:17:40,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-10-16 02:17:40,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2021-10-16 02:17:40,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.526946107784431) internal successors, (255), 167 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:17:40,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 255 transitions. [2021-10-16 02:17:40,483 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 255 transitions. Word has length 41 [2021-10-16 02:17:40,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:17:40,484 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 255 transitions. [2021-10-16 02:17:40,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:17:40,485 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 255 transitions. [2021-10-16 02:17:40,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-10-16 02:17:40,488 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:17:40,488 INFO L512 BasicCegarLoop]: trace histogram [4, 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, 1, 1] [2021-10-16 02:17:40,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-16 02:17:40,489 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:17:40,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:17:40,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1502525099, now seen corresponding path program 1 times [2021-10-16 02:17:40,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:17:40,491 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60631319] [2021-10-16 02:17:40,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:17:40,491 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:17:40,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:17:40,992 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:17:40,997 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:17:40,997 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60631319] [2021-10-16 02:17:40,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60631319] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-16 02:17:40,998 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224392500] [2021-10-16 02:17:40,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:17:40,998 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-16 02:17:40,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/z3 [2021-10-16 02:17:41,001 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-16 02:17:41,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-16 02:17:41,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:17:41,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 41 conjunts are in the unsatisfiable core [2021-10-16 02:17:41,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:17:44,298 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:17:44,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:17:48,726 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:17:48,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224392500] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-16 02:17:48,727 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1440250349] [2021-10-16 02:17:48,754 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2021-10-16 02:17:48,755 INFO L166 IcfgInterpreter]: Building call graph [2021-10-16 02:17:48,761 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-10-16 02:17:48,768 INFO L176 IcfgInterpreter]: Starting interpretation [2021-10-16 02:17:48,769 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-10-16 02:17:48,935 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:17:48,937 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-10-16 02:17:48,938 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:17:48,939 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-10-16 02:17:48,940 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-10-16 02:17:48,941 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:17:48,942 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-10-16 02:17:48,955 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 274 [2021-10-16 02:17:49,066 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:17:49,067 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:17:49,067 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:17:49,069 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:17:49,070 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-16 02:17:49,071 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:17:49,072 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-16 02:17:49,073 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-10-16 02:17:49,086 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:17:49,088 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:17:49,089 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:17:49,090 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:17:49,091 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-16 02:17:49,091 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:17:49,092 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-16 02:17:49,092 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-10-16 02:17:49,104 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:17:49,105 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:17:49,106 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:17:49,108 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:17:49,109 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-16 02:17:49,110 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:17:49,110 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-16 02:17:49,111 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-10-16 02:17:49,121 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:17:49,122 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:17:49,123 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:17:49,124 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:17:49,124 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-16 02:17:49,125 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:17:49,125 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-16 02:17:49,126 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-10-16 02:17:49,135 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:17:49,136 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:17:49,137 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:17:49,138 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:17:49,139 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-16 02:17:49,139 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:17:49,140 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-16 02:17:49,141 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-10-16 02:17:49,152 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:17:49,153 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:17:49,154 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:17:49,156 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:17:49,157 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-16 02:17:49,158 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:17:49,158 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-16 02:17:49,158 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-10-16 02:17:49,168 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:17:49,169 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:17:49,169 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:17:49,170 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:17:49,171 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-16 02:17:49,171 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:17:49,172 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-16 02:17:49,172 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-10-16 02:17:49,185 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:17:49,186 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:17:49,187 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:17:49,188 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:17:49,189 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-16 02:17:49,189 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:17:49,190 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-16 02:17:49,190 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-10-16 02:17:49,203 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:17:49,204 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:17:49,205 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:17:49,206 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:17:49,206 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-16 02:17:49,207 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:17:49,208 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-16 02:17:49,208 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-10-16 02:17:49,221 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:17:49,221 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:17:49,222 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:17:49,223 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:17:49,224 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-16 02:17:49,225 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:17:49,225 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-16 02:17:49,226 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-10-16 02:17:49,235 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:17:49,236 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:17:49,236 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:17:49,237 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:17:49,238 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-16 02:17:49,238 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:17:49,239 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-16 02:17:49,239 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-10-16 02:17:49,248 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:17:49,252 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:17:49,253 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:17:49,254 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:17:49,255 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-16 02:17:49,255 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:17:49,256 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-16 02:17:49,256 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-10-16 02:17:49,264 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:17:49,269 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:17:49,270 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:17:49,271 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:17:49,272 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-16 02:17:49,272 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:17:49,273 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-16 02:17:49,273 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-10-16 02:17:49,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:17:49,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:17:49,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:17:49,386 INFO L354 Elim1Store]: treesize reduction 68, result has 13.9 percent of original size [2021-10-16 02:17:49,387 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 42 [2021-10-16 02:17:49,388 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:17:49,391 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-10-16 02:17:49,393 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:17:49,397 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-10-16 02:17:49,397 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-10-16 02:17:49,407 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:17:49,408 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:17:49,409 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:17:49,410 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:17:49,410 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-16 02:17:49,411 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:17:49,412 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-16 02:17:49,412 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-10-16 02:17:49,419 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:17:49,420 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:17:49,421 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:17:49,422 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:17:49,422 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-16 02:17:49,423 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:17:49,424 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-16 02:17:49,424 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-10-16 02:17:49,427 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:17:49,452 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:17:49,458 INFO L180 QuantifierPusher]: treesize reduction 4, result has 98.0 percent of original size [2021-10-16 02:17:49,463 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 199 [2021-10-16 02:17:49,464 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-10-16 02:17:49,464 INFO L247 ElimStorePlain]: Needed 17 recursive calls to eliminate 1 variables, input treesize:3521, output treesize:199 [2021-10-16 02:17:49,514 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-16 02:17:49,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-16 02:17:49,683 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: No corresponding IProgramVar for |v_#length_29| 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-16 02:17:49,689 INFO L168 Benchmark]: Toolchain (without parser) took 13131.39 ms. Allocated memory was 83.9 MB in the beginning and 195.0 MB in the end (delta: 111.1 MB). Free memory was 48.3 MB in the beginning and 65.6 MB in the end (delta: -17.4 MB). Peak memory consumption was 93.9 MB. Max. memory is 16.1 GB. [2021-10-16 02:17:49,689 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 83.9 MB. Free memory was 64.5 MB in the beginning and 64.5 MB in the end (delta: 65.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-16 02:17:49,690 INFO L168 Benchmark]: CACSL2BoogieTranslator took 458.10 ms. Allocated memory was 83.9 MB in the beginning and 102.8 MB in the end (delta: 18.9 MB). Free memory was 48.1 MB in the beginning and 72.0 MB in the end (delta: -24.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-16 02:17:49,690 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.33 ms. Allocated memory is still 102.8 MB. Free memory was 72.0 MB in the beginning and 69.6 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-16 02:17:49,691 INFO L168 Benchmark]: Boogie Preprocessor took 38.90 ms. Allocated memory is still 102.8 MB. Free memory was 69.6 MB in the beginning and 67.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-16 02:17:49,691 INFO L168 Benchmark]: RCFGBuilder took 1813.82 ms. Allocated memory is still 102.8 MB. Free memory was 67.5 MB in the beginning and 58.4 MB in the end (delta: 9.1 MB). Peak memory consumption was 34.6 MB. Max. memory is 16.1 GB. [2021-10-16 02:17:49,692 INFO L168 Benchmark]: TraceAbstraction took 10732.13 ms. Allocated memory was 102.8 MB in the beginning and 195.0 MB in the end (delta: 92.3 MB). Free memory was 58.4 MB in the beginning and 65.6 MB in the end (delta: -7.2 MB). Peak memory consumption was 84.9 MB. Max. memory is 16.1 GB. [2021-10-16 02:17:49,696 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.31 ms. Allocated memory is still 83.9 MB. Free memory was 64.5 MB in the beginning and 64.5 MB in the end (delta: 65.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 458.10 ms. Allocated memory was 83.9 MB in the beginning and 102.8 MB in the end (delta: 18.9 MB). Free memory was 48.1 MB in the beginning and 72.0 MB in the end (delta: -24.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 73.33 ms. Allocated memory is still 102.8 MB. Free memory was 72.0 MB in the beginning and 69.6 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 38.90 ms. Allocated memory is still 102.8 MB. Free memory was 69.6 MB in the beginning and 67.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1813.82 ms. Allocated memory is still 102.8 MB. Free memory was 67.5 MB in the beginning and 58.4 MB in the end (delta: 9.1 MB). Peak memory consumption was 34.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 10732.13 ms. Allocated memory was 102.8 MB in the beginning and 195.0 MB in the end (delta: 92.3 MB). Free memory was 58.4 MB in the beginning and 65.6 MB in the end (delta: -7.2 MB). Peak memory consumption was 84.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: No corresponding IProgramVar for |v_#length_29| de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: No corresponding IProgramVar for |v_#length_29|: 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-16 02:17:49,767 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/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-5709675 [2021-10-16 02:17:52,801 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-16 02:17:52,804 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-16 02:17:52,849 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-16 02:17:52,850 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-16 02:17:52,851 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-16 02:17:52,854 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-16 02:17:52,857 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-16 02:17:52,861 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-16 02:17:52,862 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-16 02:17:52,864 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-16 02:17:52,866 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-16 02:17:52,867 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-16 02:17:52,869 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-16 02:17:52,871 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-16 02:17:52,873 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-16 02:17:52,875 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-16 02:17:52,876 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-16 02:17:52,879 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-16 02:17:52,883 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-16 02:17:52,886 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-16 02:17:52,888 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-16 02:17:52,890 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-16 02:17:52,892 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-16 02:17:52,897 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-16 02:17:52,897 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-16 02:17:52,898 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-16 02:17:52,899 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-16 02:17:52,900 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-16 02:17:52,901 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-16 02:17:52,902 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-16 02:17:52,903 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-16 02:17:52,904 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-16 02:17:52,906 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-16 02:17:52,907 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-16 02:17:52,908 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-16 02:17:52,909 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-16 02:17:52,910 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-16 02:17:52,910 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-16 02:17:52,912 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-16 02:17:52,913 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-16 02:17:52,914 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-10-16 02:17:52,961 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-16 02:17:52,962 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-16 02:17:52,963 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-16 02:17:52,964 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-16 02:17:52,965 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-16 02:17:52,965 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-16 02:17:52,966 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-16 02:17:52,966 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-16 02:17:52,966 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-16 02:17:52,968 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-16 02:17:52,968 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-16 02:17:52,969 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-16 02:17:52,969 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-16 02:17:52,970 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-16 02:17:52,970 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-16 02:17:52,971 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-16 02:17:52,971 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-16 02:17:52,972 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-10-16 02:17:52,972 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-10-16 02:17:52,973 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-16 02:17:52,973 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-16 02:17:52,973 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-16 02:17:52,974 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-16 02:17:52,974 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-16 02:17:52,974 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-16 02:17:52,975 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-16 02:17:52,975 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-16 02:17:52,976 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-16 02:17:52,976 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-16 02:17:52,976 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-16 02:17:52,976 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-10-16 02:17:52,977 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-10-16 02:17:52,977 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-16 02:17:52,977 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-16 02:17:52,978 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-16 02:17:52,978 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_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/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_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs 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 -> 1ba07ae5f9ba9742e473cf2ed151649cad165d7c [2021-10-16 02:17:53,393 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-16 02:17:53,421 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-16 02:17:53,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-16 02:17:53,426 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-16 02:17:53,427 INFO L275 PluginConnector]: CDTParser initialized [2021-10-16 02:17:53,429 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/../../sv-benchmarks/c/systemc/toy.cil.c [2021-10-16 02:17:53,509 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/data/554d64313/be897bd810b44201a836d813130aaa23/FLAG7fcc660c9 [2021-10-16 02:17:54,208 INFO L306 CDTParser]: Found 1 translation units. [2021-10-16 02:17:54,209 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/sv-benchmarks/c/systemc/toy.cil.c [2021-10-16 02:17:54,226 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/data/554d64313/be897bd810b44201a836d813130aaa23/FLAG7fcc660c9 [2021-10-16 02:17:54,525 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/data/554d64313/be897bd810b44201a836d813130aaa23 [2021-10-16 02:17:54,529 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-16 02:17:54,531 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-16 02:17:54,532 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-16 02:17:54,533 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-16 02:17:54,537 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-16 02:17:54,538 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 02:17:54" (1/1) ... [2021-10-16 02:17:54,540 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f26b0dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:17:54, skipping insertion in model container [2021-10-16 02:17:54,541 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 02:17:54" (1/1) ... [2021-10-16 02:17:54,550 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-16 02:17:54,592 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-16 02:17:54,759 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_ca4315d4-1b84-489f-97dd-b4083ab676d8/sv-benchmarks/c/systemc/toy.cil.c[392,405] [2021-10-16 02:17:54,885 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-16 02:17:54,904 INFO L203 MainTranslator]: Completed pre-run [2021-10-16 02:17:54,949 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_ca4315d4-1b84-489f-97dd-b4083ab676d8/sv-benchmarks/c/systemc/toy.cil.c[392,405] [2021-10-16 02:17:55,027 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-16 02:17:55,049 INFO L208 MainTranslator]: Completed translation [2021-10-16 02:17:55,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:17:55 WrapperNode [2021-10-16 02:17:55,050 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-16 02:17:55,052 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-16 02:17:55,052 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-16 02:17:55,052 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-16 02:17:55,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:17:55" (1/1) ... [2021-10-16 02:17:55,077 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:17:55" (1/1) ... [2021-10-16 02:17:55,117 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-16 02:17:55,118 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-16 02:17:55,118 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-16 02:17:55,119 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-16 02:17:55,130 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:17:55" (1/1) ... [2021-10-16 02:17:55,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:17:55" (1/1) ... [2021-10-16 02:17:55,136 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:17:55" (1/1) ... [2021-10-16 02:17:55,137 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:17:55" (1/1) ... [2021-10-16 02:17:55,148 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:17:55" (1/1) ... [2021-10-16 02:17:55,161 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:17:55" (1/1) ... [2021-10-16 02:17:55,165 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:17:55" (1/1) ... [2021-10-16 02:17:55,172 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-16 02:17:55,173 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-16 02:17:55,174 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-16 02:17:55,174 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-16 02:17:55,175 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:17:55" (1/1) ... [2021-10-16 02:17:55,185 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-16 02:17:55,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/z3 [2021-10-16 02:17:55,254 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-16 02:17:55,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-16 02:17:55,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-10-16 02:17:55,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-16 02:17:55,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-16 02:17:55,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-16 02:17:56,050 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-16 02:17:56,051 INFO L299 CfgBuilder]: Removed 26 assume(true) statements. [2021-10-16 02:17:56,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:17:56 BoogieIcfgContainer [2021-10-16 02:17:56,057 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-16 02:17:56,060 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-16 02:17:56,062 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-16 02:17:56,066 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-16 02:17:56,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 02:17:54" (1/3) ... [2021-10-16 02:17:56,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2250da34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 02:17:56, skipping insertion in model container [2021-10-16 02:17:56,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:17:55" (2/3) ... [2021-10-16 02:17:56,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2250da34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 02:17:56, skipping insertion in model container [2021-10-16 02:17:56,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:17:56" (3/3) ... [2021-10-16 02:17:56,072 INFO L111 eAbstractionObserver]: Analyzing ICFG toy.cil.c [2021-10-16 02:17:56,079 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-16 02:17:56,080 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-16 02:17:56,150 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-16 02:17:56,157 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-16 02:17:56,157 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-16 02:17:56,179 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 124 states have (on average 1.8790322580645162) internal successors, (233), 125 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:17:56,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-16 02:17:56,188 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:17:56,189 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:17:56,190 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:17:56,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:17:56,198 INFO L82 PathProgramCache]: Analyzing trace with hash -895776564, now seen corresponding path program 1 times [2021-10-16 02:17:56,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:17:56,215 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1999025596] [2021-10-16 02:17:56,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:17:56,217 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:17:56,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:17:56,240 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:17:56,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-10-16 02:17:56,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:17:56,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-16 02:17:56,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:17:56,693 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-16 02:17:56,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:17:56,886 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-16 02:17:56,888 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:17:56,889 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1999025596] [2021-10-16 02:17:56,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1999025596] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:17:56,890 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:17:56,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-16 02:17:56,892 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189853630] [2021-10-16 02:17:56,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:17:56,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:17:56,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:17:56,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:17:56,931 INFO L87 Difference]: Start difference. First operand has 126 states, 124 states have (on average 1.8790322580645162) internal successors, (233), 125 states have internal predecessors, (233), 0 states have call successors, (0), 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 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:17:57,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:17:57,025 INFO L93 Difference]: Finished difference Result 244 states and 453 transitions. [2021-10-16 02:17:57,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:17:57,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-10-16 02:17:57,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:17:57,048 INFO L225 Difference]: With dead ends: 244 [2021-10-16 02:17:57,049 INFO L226 Difference]: Without dead ends: 122 [2021-10-16 02:17:57,053 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:17:57,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-10-16 02:17:57,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2021-10-16 02:17:57,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 1.7768595041322315) internal successors, (215), 121 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:17:57,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 215 transitions. [2021-10-16 02:17:57,137 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 215 transitions. Word has length 36 [2021-10-16 02:17:57,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:17:57,138 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 215 transitions. [2021-10-16 02:17:57,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:17:57,139 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 215 transitions. [2021-10-16 02:17:57,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-16 02:17:57,144 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:17:57,145 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:17:57,163 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-10-16 02:17:57,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:17:57,359 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:17:57,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:17:57,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1597376438, now seen corresponding path program 1 times [2021-10-16 02:17:57,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:17:57,360 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1604463207] [2021-10-16 02:17:57,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:17:57,361 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:17:57,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:17:57,362 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:17:57,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-10-16 02:17:57,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:17:57,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 02:17:57,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:17:57,618 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-16 02:17:57,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:17:57,799 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-16 02:17:57,799 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:17:57,799 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1604463207] [2021-10-16 02:17:57,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1604463207] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:17:57,800 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:17:57,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-16 02:17:57,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413927174] [2021-10-16 02:17:57,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:17:57,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:17:57,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:17:57,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:17:57,805 INFO L87 Difference]: Start difference. First operand 122 states and 215 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:17:57,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:17:57,842 INFO L93 Difference]: Finished difference Result 234 states and 414 transitions. [2021-10-16 02:17:57,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:17:57,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-10-16 02:17:57,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:17:57,845 INFO L225 Difference]: With dead ends: 234 [2021-10-16 02:17:57,846 INFO L226 Difference]: Without dead ends: 122 [2021-10-16 02:17:57,847 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.7ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:17:57,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-10-16 02:17:57,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2021-10-16 02:17:57,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 1.7685950413223142) internal successors, (214), 121 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:17:57,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 214 transitions. [2021-10-16 02:17:57,862 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 214 transitions. Word has length 36 [2021-10-16 02:17:57,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:17:57,862 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 214 transitions. [2021-10-16 02:17:57,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:17:57,863 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 214 transitions. [2021-10-16 02:17:57,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-16 02:17:57,865 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:17:57,865 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:17:57,881 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-10-16 02:17:58,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:17:58,078 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:17:58,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:17:58,079 INFO L82 PathProgramCache]: Analyzing trace with hash -211173044, now seen corresponding path program 1 times [2021-10-16 02:17:58,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:17:58,080 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [762489173] [2021-10-16 02:17:58,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:17:58,081 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:17:58,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:17:58,082 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:17:58,118 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-10-16 02:17:58,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:17:58,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-16 02:17:58,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:17:58,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:17:58,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:17:58,416 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-16 02:17:58,417 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:17:58,417 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [762489173] [2021-10-16 02:17:58,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [762489173] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:17:58,418 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:17:58,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-16 02:17:58,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454174479] [2021-10-16 02:17:58,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:17:58,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:17:58,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:17:58,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:17:58,420 INFO L87 Difference]: Start difference. First operand 122 states and 214 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:17:58,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:17:58,478 INFO L93 Difference]: Finished difference Result 233 states and 411 transitions. [2021-10-16 02:17:58,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 02:17:58,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-10-16 02:17:58,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:17:58,481 INFO L225 Difference]: With dead ends: 233 [2021-10-16 02:17:58,481 INFO L226 Difference]: Without dead ends: 122 [2021-10-16 02:17:58,482 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:17:58,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-10-16 02:17:58,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2021-10-16 02:17:58,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 1.7024793388429753) internal successors, (206), 121 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:17:58,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 206 transitions. [2021-10-16 02:17:58,495 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 206 transitions. Word has length 36 [2021-10-16 02:17:58,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:17:58,496 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 206 transitions. [2021-10-16 02:17:58,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:17:58,496 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 206 transitions. [2021-10-16 02:17:58,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-16 02:17:58,498 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:17:58,498 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:17:58,513 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-10-16 02:17:58,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:17:58,713 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:17:58,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:17:58,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1741714488, now seen corresponding path program 1 times [2021-10-16 02:17:58,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:17:58,714 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1263554971] [2021-10-16 02:17:58,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:17:58,715 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:17:58,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:17:58,716 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:17:58,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-10-16 02:17:58,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:17:58,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-16 02:17:58,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:17:58,951 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-16 02:17:58,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:17:59,070 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-16 02:17:59,071 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:17:59,071 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1263554971] [2021-10-16 02:17:59,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1263554971] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:17:59,072 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:17:59,072 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-16 02:17:59,072 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796910866] [2021-10-16 02:17:59,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:17:59,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:17:59,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:17:59,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:17:59,074 INFO L87 Difference]: Start difference. First operand 122 states and 206 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:17:59,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:17:59,125 INFO L93 Difference]: Finished difference Result 232 states and 394 transitions. [2021-10-16 02:17:59,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 02:17:59,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-10-16 02:17:59,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:17:59,130 INFO L225 Difference]: With dead ends: 232 [2021-10-16 02:17:59,130 INFO L226 Difference]: Without dead ends: 122 [2021-10-16 02:17:59,132 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:17:59,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-10-16 02:17:59,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2021-10-16 02:17:59,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 1.6528925619834711) internal successors, (200), 121 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:17:59,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 200 transitions. [2021-10-16 02:17:59,155 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 200 transitions. Word has length 36 [2021-10-16 02:17:59,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:17:59,155 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 200 transitions. [2021-10-16 02:17:59,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:17:59,156 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 200 transitions. [2021-10-16 02:17:59,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-16 02:17:59,164 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:17:59,164 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:17:59,185 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-10-16 02:17:59,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:17:59,376 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:17:59,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:17:59,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1098350132, now seen corresponding path program 1 times [2021-10-16 02:17:59,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:17:59,377 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [157173380] [2021-10-16 02:17:59,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:17:59,378 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:17:59,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:17:59,378 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:17:59,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-10-16 02:17:59,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:17:59,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-16 02:17:59,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:17:59,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-16 02:17:59,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:17:59,739 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-16 02:17:59,739 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:17:59,740 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [157173380] [2021-10-16 02:17:59,740 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [157173380] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:17:59,740 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:17:59,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-16 02:17:59,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111170760] [2021-10-16 02:17:59,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:17:59,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:17:59,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:17:59,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:17:59,746 INFO L87 Difference]: Start difference. First operand 122 states and 200 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:17:59,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:17:59,794 INFO L93 Difference]: Finished difference Result 231 states and 381 transitions. [2021-10-16 02:17:59,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 02:17:59,795 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-10-16 02:17:59,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:17:59,801 INFO L225 Difference]: With dead ends: 231 [2021-10-16 02:17:59,802 INFO L226 Difference]: Without dead ends: 122 [2021-10-16 02:17:59,804 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:17:59,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-10-16 02:17:59,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2021-10-16 02:17:59,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 1.603305785123967) internal successors, (194), 121 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:17:59,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 194 transitions. [2021-10-16 02:17:59,826 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 194 transitions. Word has length 36 [2021-10-16 02:17:59,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:17:59,826 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 194 transitions. [2021-10-16 02:17:59,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:17:59,827 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 194 transitions. [2021-10-16 02:17:59,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-16 02:17:59,830 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:17:59,830 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:17:59,849 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-10-16 02:18:00,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:18:00,044 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:18:00,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:18:00,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1670308876, now seen corresponding path program 1 times [2021-10-16 02:18:00,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:18:00,045 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [745464733] [2021-10-16 02:18:00,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:18:00,046 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:18:00,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:18:00,049 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:18:00,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-10-16 02:18:00,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:18:00,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-16 02:18:00,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:18:00,312 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-16 02:18:00,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:18:00,399 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-16 02:18:00,399 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:18:00,400 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [745464733] [2021-10-16 02:18:00,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [745464733] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:18:00,402 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:18:00,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-16 02:18:00,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132308459] [2021-10-16 02:18:00,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:18:00,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:18:00,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:18:00,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:18:00,407 INFO L87 Difference]: Start difference. First operand 122 states and 194 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 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-16 02:18:00,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:18:00,469 INFO L93 Difference]: Finished difference Result 354 states and 563 transitions. [2021-10-16 02:18:00,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 02:18:00,470 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 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 36 [2021-10-16 02:18:00,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:18:00,472 INFO L225 Difference]: With dead ends: 354 [2021-10-16 02:18:00,472 INFO L226 Difference]: Without dead ends: 246 [2021-10-16 02:18:00,473 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 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-16 02:18:00,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2021-10-16 02:18:00,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 244. [2021-10-16 02:18:00,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 1.5679012345679013) internal successors, (381), 243 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:00,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 381 transitions. [2021-10-16 02:18:00,497 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 381 transitions. Word has length 36 [2021-10-16 02:18:00,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:18:00,499 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 381 transitions. [2021-10-16 02:18:00,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 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-16 02:18:00,500 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 381 transitions. [2021-10-16 02:18:00,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-16 02:18:00,504 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:18:00,504 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:18:00,521 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-10-16 02:18:00,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:18:00,718 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:18:00,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:18:00,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1194404470, now seen corresponding path program 1 times [2021-10-16 02:18:00,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:18:00,719 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1934761136] [2021-10-16 02:18:00,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:18:00,719 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:18:00,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:18:00,722 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:18:00,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-10-16 02:18:00,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:18:00,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 02:18:00,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:18:00,956 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-16 02:18:00,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:18:01,050 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-16 02:18:01,050 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:18:01,051 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1934761136] [2021-10-16 02:18:01,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1934761136] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:18:01,051 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:18:01,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-16 02:18:01,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627114917] [2021-10-16 02:18:01,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:18:01,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:18:01,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:18:01,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:18:01,053 INFO L87 Difference]: Start difference. First operand 244 states and 381 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:01,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:18:01,135 INFO L93 Difference]: Finished difference Result 788 states and 1247 transitions. [2021-10-16 02:18:01,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 02:18:01,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-10-16 02:18:01,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:18:01,140 INFO L225 Difference]: With dead ends: 788 [2021-10-16 02:18:01,140 INFO L226 Difference]: Without dead ends: 570 [2021-10-16 02:18:01,141 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 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-16 02:18:01,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2021-10-16 02:18:01,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 562. [2021-10-16 02:18:01,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 561 states have (on average 1.570409982174688) internal successors, (881), 561 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:01,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 881 transitions. [2021-10-16 02:18:01,188 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 881 transitions. Word has length 36 [2021-10-16 02:18:01,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:18:01,189 INFO L470 AbstractCegarLoop]: Abstraction has 562 states and 881 transitions. [2021-10-16 02:18:01,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:01,190 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 881 transitions. [2021-10-16 02:18:01,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-16 02:18:01,192 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:18:01,192 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:18:01,204 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-10-16 02:18:01,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:18:01,405 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:18:01,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:18:01,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1915223990, now seen corresponding path program 1 times [2021-10-16 02:18:01,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:18:01,406 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [261331529] [2021-10-16 02:18:01,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:18:01,407 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:18:01,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:18:01,408 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:18:01,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-10-16 02:18:01,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:18:01,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 02:18:01,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:18:01,678 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-16 02:18:01,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:18:01,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-16 02:18:01,788 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:18:01,788 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [261331529] [2021-10-16 02:18:01,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [261331529] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:18:01,789 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:18:01,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-16 02:18:01,789 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619332287] [2021-10-16 02:18:01,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:18:01,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:18:01,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:18:01,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:18:01,790 INFO L87 Difference]: Start difference. First operand 562 states and 881 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:01,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:18:01,869 INFO L93 Difference]: Finished difference Result 1244 states and 1956 transitions. [2021-10-16 02:18:01,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:18:01,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-10-16 02:18:01,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:18:01,874 INFO L225 Difference]: With dead ends: 1244 [2021-10-16 02:18:01,875 INFO L226 Difference]: Without dead ends: 710 [2021-10-16 02:18:01,876 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 69 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-16 02:18:01,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2021-10-16 02:18:01,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 708. [2021-10-16 02:18:01,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 707 states have (on average 1.5530410183875532) internal successors, (1098), 707 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:01,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1098 transitions. [2021-10-16 02:18:01,915 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1098 transitions. Word has length 36 [2021-10-16 02:18:01,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:18:01,916 INFO L470 AbstractCegarLoop]: Abstraction has 708 states and 1098 transitions. [2021-10-16 02:18:01,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:01,916 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1098 transitions. [2021-10-16 02:18:01,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-16 02:18:01,917 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:18:01,918 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:18:01,935 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-10-16 02:18:02,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:18:02,129 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:18:02,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:18:02,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1648654786, now seen corresponding path program 1 times [2021-10-16 02:18:02,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:18:02,130 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [98141671] [2021-10-16 02:18:02,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:18:02,131 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:18:02,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:18:02,132 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:18:02,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-10-16 02:18:02,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:18:02,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 02:18:02,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:18:02,458 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-16 02:18:02,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:18:02,578 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-16 02:18:02,578 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:18:02,578 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [98141671] [2021-10-16 02:18:02,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [98141671] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:18:02,578 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:18:02,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-16 02:18:02,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472871688] [2021-10-16 02:18:02,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:18:02,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:18:02,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:18:02,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:18:02,580 INFO L87 Difference]: Start difference. First operand 708 states and 1098 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:02,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:18:02,663 INFO L93 Difference]: Finished difference Result 1738 states and 2731 transitions. [2021-10-16 02:18:02,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:18:02,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-10-16 02:18:02,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:18:02,671 INFO L225 Difference]: With dead ends: 1738 [2021-10-16 02:18:02,671 INFO L226 Difference]: Without dead ends: 1084 [2021-10-16 02:18:02,672 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 89 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-16 02:18:02,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2021-10-16 02:18:02,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 1082. [2021-10-16 02:18:02,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 1081 states have (on average 1.5605920444033303) internal successors, (1687), 1081 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:02,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1687 transitions. [2021-10-16 02:18:02,738 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1687 transitions. Word has length 46 [2021-10-16 02:18:02,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:18:02,739 INFO L470 AbstractCegarLoop]: Abstraction has 1082 states and 1687 transitions. [2021-10-16 02:18:02,739 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:02,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1687 transitions. [2021-10-16 02:18:02,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-16 02:18:02,741 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:18:02,741 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:18:02,757 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-10-16 02:18:02,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:18:02,953 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:18:02,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:18:02,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1400508292, now seen corresponding path program 1 times [2021-10-16 02:18:02,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:18:02,954 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [546493333] [2021-10-16 02:18:02,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:18:02,955 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:18:02,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:18:02,956 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:18:02,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-10-16 02:18:03,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:18:03,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-16 02:18:03,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:18:03,357 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-16 02:18:03,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:18:03,482 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-16 02:18:03,482 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:18:03,482 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [546493333] [2021-10-16 02:18:03,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [546493333] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:18:03,483 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:18:03,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-16 02:18:03,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409199847] [2021-10-16 02:18:03,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:18:03,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:18:03,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:18:03,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:18:03,484 INFO L87 Difference]: Start difference. First operand 1082 states and 1687 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:03,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:18:03,548 INFO L93 Difference]: Finished difference Result 2066 states and 3248 transitions. [2021-10-16 02:18:03,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:18:03,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-10-16 02:18:03,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:18:03,555 INFO L225 Difference]: With dead ends: 2066 [2021-10-16 02:18:03,555 INFO L226 Difference]: Without dead ends: 1038 [2021-10-16 02:18:03,556 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 89 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-16 02:18:03,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2021-10-16 02:18:03,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 1038. [2021-10-16 02:18:03,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 1037 states have (on average 1.5718418514946961) internal successors, (1630), 1037 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:03,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1630 transitions. [2021-10-16 02:18:03,634 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1630 transitions. Word has length 46 [2021-10-16 02:18:03,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:18:03,635 INFO L470 AbstractCegarLoop]: Abstraction has 1038 states and 1630 transitions. [2021-10-16 02:18:03,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:03,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1630 transitions. [2021-10-16 02:18:03,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-16 02:18:03,636 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:18:03,637 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-16 02:18:03,653 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-10-16 02:18:03,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:18:03,849 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:18:03,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:18:03,849 INFO L82 PathProgramCache]: Analyzing trace with hash 666181047, now seen corresponding path program 1 times [2021-10-16 02:18:03,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:18:03,850 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1874618032] [2021-10-16 02:18:03,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:18:03,850 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:18:03,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:18:03,851 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:18:03,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-10-16 02:18:04,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:18:04,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 02:18:04,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:18:04,197 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-16 02:18:04,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:18:04,329 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-16 02:18:04,329 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:18:04,329 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1874618032] [2021-10-16 02:18:04,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1874618032] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:18:04,329 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:18:04,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-16 02:18:04,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938827902] [2021-10-16 02:18:04,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:18:04,330 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:18:04,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:18:04,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:18:04,331 INFO L87 Difference]: Start difference. First operand 1038 states and 1630 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-16 02:18:04,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:18:04,452 INFO L93 Difference]: Finished difference Result 2612 states and 4164 transitions. [2021-10-16 02:18:04,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:18:04,453 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-16 02:18:04,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:18:04,463 INFO L225 Difference]: With dead ends: 2612 [2021-10-16 02:18:04,463 INFO L226 Difference]: Without dead ends: 1628 [2021-10-16 02:18:04,465 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 91 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-16 02:18:04,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2021-10-16 02:18:04,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 1626. [2021-10-16 02:18:04,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1626 states, 1625 states have (on average 1.5864615384615384) internal successors, (2578), 1625 states have internal predecessors, (2578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:04,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 2578 transitions. [2021-10-16 02:18:04,582 INFO L78 Accepts]: Start accepts. Automaton has 1626 states and 2578 transitions. Word has length 47 [2021-10-16 02:18:04,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:18:04,583 INFO L470 AbstractCegarLoop]: Abstraction has 1626 states and 2578 transitions. [2021-10-16 02:18:04,583 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-16 02:18:04,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 2578 transitions. [2021-10-16 02:18:04,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-10-16 02:18:04,585 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:18:04,585 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, 1] [2021-10-16 02:18:04,600 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-10-16 02:18:04,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:18:04,797 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:18:04,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:18:04,797 INFO L82 PathProgramCache]: Analyzing trace with hash -656218967, now seen corresponding path program 1 times [2021-10-16 02:18:04,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:18:04,798 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [938946318] [2021-10-16 02:18:04,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:18:04,798 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:18:04,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:18:04,799 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:18:04,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-10-16 02:18:05,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:18:05,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 02:18:05,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:18:05,186 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-16 02:18:05,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:18:05,320 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-16 02:18:05,321 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:18:05,321 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [938946318] [2021-10-16 02:18:05,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [938946318] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:18:05,321 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:18:05,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-16 02:18:05,321 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345477666] [2021-10-16 02:18:05,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:18:05,322 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:18:05,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:18:05,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:18:05,323 INFO L87 Difference]: Start difference. First operand 1626 states and 2578 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:05,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:18:05,524 INFO L93 Difference]: Finished difference Result 4356 states and 7005 transitions. [2021-10-16 02:18:05,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:18:05,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2021-10-16 02:18:05,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:18:05,541 INFO L225 Difference]: With dead ends: 4356 [2021-10-16 02:18:05,541 INFO L226 Difference]: Without dead ends: 2788 [2021-10-16 02:18:05,546 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 93 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-16 02:18:05,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2788 states. [2021-10-16 02:18:05,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2788 to 2786. [2021-10-16 02:18:05,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2786 states, 2785 states have (on average 1.601077199281867) internal successors, (4459), 2785 states have internal predecessors, (4459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:05,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2786 states to 2786 states and 4459 transitions. [2021-10-16 02:18:05,757 INFO L78 Accepts]: Start accepts. Automaton has 2786 states and 4459 transitions. Word has length 48 [2021-10-16 02:18:05,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:18:05,758 INFO L470 AbstractCegarLoop]: Abstraction has 2786 states and 4459 transitions. [2021-10-16 02:18:05,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:05,758 INFO L276 IsEmpty]: Start isEmpty. Operand 2786 states and 4459 transitions. [2021-10-16 02:18:05,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-10-16 02:18:05,761 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:18:05,761 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, 1] [2021-10-16 02:18:05,773 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2021-10-16 02:18:05,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:18:05,973 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:18:05,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:18:05,973 INFO L82 PathProgramCache]: Analyzing trace with hash -408072473, now seen corresponding path program 1 times [2021-10-16 02:18:05,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:18:05,974 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1574110118] [2021-10-16 02:18:05,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:18:05,974 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:18:05,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:18:05,974 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:18:05,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-10-16 02:18:06,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:18:06,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 02:18:06,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:18:06,344 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-16 02:18:06,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:18:06,464 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-16 02:18:06,464 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:18:06,464 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1574110118] [2021-10-16 02:18:06,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1574110118] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:18:06,464 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:18:06,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-16 02:18:06,465 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843742691] [2021-10-16 02:18:06,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:18:06,465 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:18:06,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:18:06,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:18:06,466 INFO L87 Difference]: Start difference. First operand 2786 states and 4459 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:06,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:18:06,648 INFO L93 Difference]: Finished difference Result 5470 states and 8792 transitions. [2021-10-16 02:18:06,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:18:06,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 48 [2021-10-16 02:18:06,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:18:06,665 INFO L225 Difference]: With dead ends: 5470 [2021-10-16 02:18:06,665 INFO L226 Difference]: Without dead ends: 2742 [2021-10-16 02:18:06,669 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 93 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-16 02:18:06,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2742 states. [2021-10-16 02:18:06,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2742 to 2742. [2021-10-16 02:18:06,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2742 states, 2741 states have (on average 1.6067128785114921) internal successors, (4404), 2741 states have internal predecessors, (4404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:06,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2742 states to 2742 states and 4404 transitions. [2021-10-16 02:18:06,893 INFO L78 Accepts]: Start accepts. Automaton has 2742 states and 4404 transitions. Word has length 48 [2021-10-16 02:18:06,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:18:06,894 INFO L470 AbstractCegarLoop]: Abstraction has 2742 states and 4404 transitions. [2021-10-16 02:18:06,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:06,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2742 states and 4404 transitions. [2021-10-16 02:18:06,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-10-16 02:18:06,896 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:18:06,897 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, 1, 1] [2021-10-16 02:18:06,912 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2021-10-16 02:18:07,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:18:07,111 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:18:07,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:18:07,111 INFO L82 PathProgramCache]: Analyzing trace with hash 2128148300, now seen corresponding path program 1 times [2021-10-16 02:18:07,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:18:07,112 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1700556657] [2021-10-16 02:18:07,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:18:07,112 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:18:07,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:18:07,113 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:18:07,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-10-16 02:18:07,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:18:07,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 02:18:07,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:18:07,576 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-16 02:18:07,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:18:07,693 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-16 02:18:07,694 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:18:07,694 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1700556657] [2021-10-16 02:18:07,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1700556657] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:18:07,694 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:18:07,694 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-16 02:18:07,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368482484] [2021-10-16 02:18:07,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:18:07,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:18:07,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:18:07,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:18:07,699 INFO L87 Difference]: Start difference. First operand 2742 states and 4404 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:08,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:18:08,151 INFO L93 Difference]: Finished difference Result 9042 states and 14538 transitions. [2021-10-16 02:18:08,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 02:18:08,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2021-10-16 02:18:08,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:18:08,185 INFO L225 Difference]: With dead ends: 9042 [2021-10-16 02:18:08,185 INFO L226 Difference]: Without dead ends: 5352 [2021-10-16 02:18:08,190 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:18:08,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5352 states. [2021-10-16 02:18:08,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5352 to 3868. [2021-10-16 02:18:08,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3868 states, 3867 states have (on average 1.5963279027670028) internal successors, (6173), 3867 states have internal predecessors, (6173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:08,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3868 states to 3868 states and 6173 transitions. [2021-10-16 02:18:08,492 INFO L78 Accepts]: Start accepts. Automaton has 3868 states and 6173 transitions. Word has length 49 [2021-10-16 02:18:08,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:18:08,493 INFO L470 AbstractCegarLoop]: Abstraction has 3868 states and 6173 transitions. [2021-10-16 02:18:08,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:08,493 INFO L276 IsEmpty]: Start isEmpty. Operand 3868 states and 6173 transitions. [2021-10-16 02:18:08,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-10-16 02:18:08,497 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:18:08,497 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, 1, 1, 1, 1, 1, 1] [2021-10-16 02:18:08,512 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-10-16 02:18:08,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:18:08,709 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:18:08,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:18:08,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1878430016, now seen corresponding path program 1 times [2021-10-16 02:18:08,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:18:08,710 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [7957555] [2021-10-16 02:18:08,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:18:08,710 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:18:08,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:18:08,711 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:18:08,717 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-10-16 02:18:09,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:18:09,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 02:18:09,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:18:09,185 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-16 02:18:09,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:18:09,337 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-16 02:18:09,337 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:18:09,337 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [7957555] [2021-10-16 02:18:09,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [7957555] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:18:09,338 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:18:09,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-16 02:18:09,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490608254] [2021-10-16 02:18:09,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:18:09,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:18:09,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:18:09,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:18:09,339 INFO L87 Difference]: Start difference. First operand 3868 states and 6173 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 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-16 02:18:09,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:18:09,896 INFO L93 Difference]: Finished difference Result 12716 states and 20144 transitions. [2021-10-16 02:18:09,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 02:18:09,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 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 53 [2021-10-16 02:18:09,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:18:09,952 INFO L225 Difference]: With dead ends: 12716 [2021-10-16 02:18:09,952 INFO L226 Difference]: Without dead ends: 8898 [2021-10-16 02:18:09,960 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:18:09,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8898 states. [2021-10-16 02:18:10,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8898 to 6272. [2021-10-16 02:18:10,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6272 states, 6271 states have (on average 1.5638654122149578) internal successors, (9807), 6271 states have internal predecessors, (9807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:10,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6272 states to 6272 states and 9807 transitions. [2021-10-16 02:18:10,504 INFO L78 Accepts]: Start accepts. Automaton has 6272 states and 9807 transitions. Word has length 53 [2021-10-16 02:18:10,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:18:10,505 INFO L470 AbstractCegarLoop]: Abstraction has 6272 states and 9807 transitions. [2021-10-16 02:18:10,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 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-16 02:18:10,505 INFO L276 IsEmpty]: Start isEmpty. Operand 6272 states and 9807 transitions. [2021-10-16 02:18:10,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-10-16 02:18:10,510 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:18:10,510 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:18:10,526 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-10-16 02:18:10,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:18:10,723 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:18:10,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:18:10,724 INFO L82 PathProgramCache]: Analyzing trace with hash -753024327, now seen corresponding path program 1 times [2021-10-16 02:18:10,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:18:10,724 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1137777941] [2021-10-16 02:18:10,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:18:10,724 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:18:10,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:18:10,725 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:18:10,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-10-16 02:18:11,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:18:11,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 02:18:11,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:18:11,204 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-16 02:18:11,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:18:11,342 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-16 02:18:11,342 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:18:11,342 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1137777941] [2021-10-16 02:18:11,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1137777941] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:18:11,343 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:18:11,343 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-16 02:18:11,343 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916707885] [2021-10-16 02:18:11,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:18:11,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:18:11,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:18:11,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:18:11,344 INFO L87 Difference]: Start difference. First operand 6272 states and 9807 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:12,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:18:12,237 INFO L93 Difference]: Finished difference Result 22720 states and 35838 transitions. [2021-10-16 02:18:12,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 02:18:12,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-10-16 02:18:12,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:18:12,290 INFO L225 Difference]: With dead ends: 22720 [2021-10-16 02:18:12,290 INFO L226 Difference]: Without dead ends: 16451 [2021-10-16 02:18:12,302 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:18:12,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16451 states. [2021-10-16 02:18:13,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16451 to 10919. [2021-10-16 02:18:13,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10919 states, 10918 states have (on average 1.587745008243268) internal successors, (17335), 10918 states have internal predecessors, (17335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:13,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10919 states to 10919 states and 17335 transitions. [2021-10-16 02:18:13,249 INFO L78 Accepts]: Start accepts. Automaton has 10919 states and 17335 transitions. Word has length 55 [2021-10-16 02:18:13,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:18:13,249 INFO L470 AbstractCegarLoop]: Abstraction has 10919 states and 17335 transitions. [2021-10-16 02:18:13,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:13,249 INFO L276 IsEmpty]: Start isEmpty. Operand 10919 states and 17335 transitions. [2021-10-16 02:18:13,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-10-16 02:18:13,253 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:18:13,253 INFO L512 BasicCegarLoop]: trace histogram [3, 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-16 02:18:13,265 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2021-10-16 02:18:13,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:18:13,465 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:18:13,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:18:13,466 INFO L82 PathProgramCache]: Analyzing trace with hash -605096400, now seen corresponding path program 1 times [2021-10-16 02:18:13,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:18:13,467 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [635474453] [2021-10-16 02:18:13,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:18:13,467 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:18:13,467 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:18:13,468 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:18:13,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-10-16 02:18:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:18:13,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 02:18:13,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:18:14,002 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:18:14,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:18:14,187 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:18:14,188 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:18:14,188 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [635474453] [2021-10-16 02:18:14,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [635474453] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:18:14,188 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:18:14,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-16 02:18:14,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834471207] [2021-10-16 02:18:14,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:18:14,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:18:14,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:18:14,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:18:14,190 INFO L87 Difference]: Start difference. First operand 10919 states and 17335 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:14,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:18:14,731 INFO L93 Difference]: Finished difference Result 22161 states and 35136 transitions. [2021-10-16 02:18:14,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:18:14,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2021-10-16 02:18:14,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:18:14,761 INFO L225 Difference]: With dead ends: 22161 [2021-10-16 02:18:14,761 INFO L226 Difference]: Without dead ends: 11271 [2021-10-16 02:18:14,777 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:18:14,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11271 states. [2021-10-16 02:18:15,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11271 to 11239. [2021-10-16 02:18:15,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11239 states, 11238 states have (on average 1.5364833600284749) internal successors, (17267), 11238 states have internal predecessors, (17267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:15,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11239 states to 11239 states and 17267 transitions. [2021-10-16 02:18:15,705 INFO L78 Accepts]: Start accepts. Automaton has 11239 states and 17267 transitions. Word has length 86 [2021-10-16 02:18:15,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:18:15,705 INFO L470 AbstractCegarLoop]: Abstraction has 11239 states and 17267 transitions. [2021-10-16 02:18:15,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:15,706 INFO L276 IsEmpty]: Start isEmpty. Operand 11239 states and 17267 transitions. [2021-10-16 02:18:15,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-10-16 02:18:15,712 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:18:15,712 INFO L512 BasicCegarLoop]: trace histogram [3, 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] [2021-10-16 02:18:15,736 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2021-10-16 02:18:15,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:18:15,924 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:18:15,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:18:15,925 INFO L82 PathProgramCache]: Analyzing trace with hash 129921275, now seen corresponding path program 1 times [2021-10-16 02:18:15,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:18:15,926 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [871247951] [2021-10-16 02:18:15,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:18:15,926 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:18:15,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:18:15,928 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:18:15,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-10-16 02:18:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:18:16,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 02:18:16,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:18:16,494 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:18:16,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:18:16,658 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:18:16,659 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:18:16,659 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [871247951] [2021-10-16 02:18:16,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [871247951] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:18:16,659 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:18:16,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-16 02:18:16,659 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965295782] [2021-10-16 02:18:16,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:18:16,660 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:18:16,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:18:16,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:18:16,661 INFO L87 Difference]: Start difference. First operand 11239 states and 17267 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 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-16 02:18:17,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:18:17,307 INFO L93 Difference]: Finished difference Result 22959 states and 35212 transitions. [2021-10-16 02:18:17,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:18:17,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 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 87 [2021-10-16 02:18:17,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:18:17,328 INFO L225 Difference]: With dead ends: 22959 [2021-10-16 02:18:17,329 INFO L226 Difference]: Without dead ends: 11761 [2021-10-16 02:18:17,341 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 171 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-16 02:18:17,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11761 states. [2021-10-16 02:18:18,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11761 to 11713. [2021-10-16 02:18:18,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11713 states, 11712 states have (on average 1.4850580601092895) internal successors, (17393), 11712 states have internal predecessors, (17393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:18,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11713 states to 11713 states and 17393 transitions. [2021-10-16 02:18:18,200 INFO L78 Accepts]: Start accepts. Automaton has 11713 states and 17393 transitions. Word has length 87 [2021-10-16 02:18:18,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:18:18,200 INFO L470 AbstractCegarLoop]: Abstraction has 11713 states and 17393 transitions. [2021-10-16 02:18:18,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 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-16 02:18:18,201 INFO L276 IsEmpty]: Start isEmpty. Operand 11713 states and 17393 transitions. [2021-10-16 02:18:18,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-10-16 02:18:18,207 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:18:18,207 INFO L512 BasicCegarLoop]: trace histogram [3, 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] [2021-10-16 02:18:18,224 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-10-16 02:18:18,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:18:18,420 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:18:18,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:18:18,420 INFO L82 PathProgramCache]: Analyzing trace with hash 793269102, now seen corresponding path program 1 times [2021-10-16 02:18:18,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:18:18,421 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1007551519] [2021-10-16 02:18:18,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:18:18,421 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:18:18,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:18:18,422 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:18:18,429 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-10-16 02:18:18,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:18:18,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 02:18:18,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:18:19,002 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:18:19,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:18:19,170 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:18:19,170 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:18:19,170 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1007551519] [2021-10-16 02:18:19,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1007551519] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:18:19,170 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:18:19,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-16 02:18:19,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938355384] [2021-10-16 02:18:19,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:18:19,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:18:19,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:18:19,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:18:19,172 INFO L87 Difference]: Start difference. First operand 11713 states and 17393 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:19,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:18:19,700 INFO L93 Difference]: Finished difference Result 23581 states and 35085 transitions. [2021-10-16 02:18:19,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:18:19,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-10-16 02:18:19,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:18:19,718 INFO L225 Difference]: With dead ends: 23581 [2021-10-16 02:18:19,718 INFO L226 Difference]: Without dead ends: 11929 [2021-10-16 02:18:19,730 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 173 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-16 02:18:19,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11929 states. [2021-10-16 02:18:20,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11929 to 9072. [2021-10-16 02:18:20,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9072 states, 9071 states have (on average 1.4235475691764965) internal successors, (12913), 9071 states have internal predecessors, (12913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:20,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9072 states to 9072 states and 12913 transitions. [2021-10-16 02:18:20,384 INFO L78 Accepts]: Start accepts. Automaton has 9072 states and 12913 transitions. Word has length 88 [2021-10-16 02:18:20,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:18:20,385 INFO L470 AbstractCegarLoop]: Abstraction has 9072 states and 12913 transitions. [2021-10-16 02:18:20,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:20,385 INFO L276 IsEmpty]: Start isEmpty. Operand 9072 states and 12913 transitions. [2021-10-16 02:18:20,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-10-16 02:18:20,391 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:18:20,392 INFO L512 BasicCegarLoop]: trace histogram [3, 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-16 02:18:20,417 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-10-16 02:18:20,604 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:18:20,604 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:18:20,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:18:20,604 INFO L82 PathProgramCache]: Analyzing trace with hash -831404099, now seen corresponding path program 1 times [2021-10-16 02:18:20,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:18:20,605 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1679818805] [2021-10-16 02:18:20,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:18:20,605 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:18:20,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:18:20,606 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:18:20,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-10-16 02:18:21,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:18:21,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 02:18:21,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:18:21,255 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-16 02:18:21,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:18:21,441 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-16 02:18:21,441 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:18:21,442 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1679818805] [2021-10-16 02:18:21,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1679818805] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:18:21,442 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:18:21,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-16 02:18:21,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345089057] [2021-10-16 02:18:21,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:18:21,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:18:21,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:18:21,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:18:21,444 INFO L87 Difference]: Start difference. First operand 9072 states and 12913 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-16 02:18:22,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:18:22,420 INFO L93 Difference]: Finished difference Result 21308 states and 30010 transitions. [2021-10-16 02:18:22,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 02:18:22,420 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 89 [2021-10-16 02:18:22,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:18:22,441 INFO L225 Difference]: With dead ends: 21308 [2021-10-16 02:18:22,441 INFO L226 Difference]: Without dead ends: 11168 [2021-10-16 02:18:22,453 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:18:22,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11168 states. [2021-10-16 02:18:23,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11168 to 10832. [2021-10-16 02:18:23,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10832 states, 10831 states have (on average 1.348074969993537) internal successors, (14601), 10831 states have internal predecessors, (14601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:23,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10832 states to 10832 states and 14601 transitions. [2021-10-16 02:18:23,382 INFO L78 Accepts]: Start accepts. Automaton has 10832 states and 14601 transitions. Word has length 89 [2021-10-16 02:18:23,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:18:23,383 INFO L470 AbstractCegarLoop]: Abstraction has 10832 states and 14601 transitions. [2021-10-16 02:18:23,383 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-16 02:18:23,383 INFO L276 IsEmpty]: Start isEmpty. Operand 10832 states and 14601 transitions. [2021-10-16 02:18:23,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-10-16 02:18:23,410 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:18:23,410 INFO L512 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 02:18:23,427 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-10-16 02:18:23,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:18:23,628 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:18:23,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:18:23,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1827636855, now seen corresponding path program 1 times [2021-10-16 02:18:23,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:18:23,629 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [537079510] [2021-10-16 02:18:23,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:18:23,629 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:18:23,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:18:23,630 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:18:23,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-10-16 02:18:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:18:24,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 02:18:24,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:18:24,452 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-16 02:18:24,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:18:24,719 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-16 02:18:24,720 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:18:24,720 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [537079510] [2021-10-16 02:18:24,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [537079510] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:18:24,720 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:18:24,720 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-16 02:18:24,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911089303] [2021-10-16 02:18:24,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:18:24,721 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:18:24,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:18:24,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:18:24,722 INFO L87 Difference]: Start difference. First operand 10832 states and 14601 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:25,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:18:25,264 INFO L93 Difference]: Finished difference Result 21219 states and 28599 transitions. [2021-10-16 02:18:25,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:18:25,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2021-10-16 02:18:25,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:18:25,284 INFO L225 Difference]: With dead ends: 21219 [2021-10-16 02:18:25,285 INFO L226 Difference]: Without dead ends: 10778 [2021-10-16 02:18:25,296 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:18:25,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10778 states. [2021-10-16 02:18:26,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10778 to 10778. [2021-10-16 02:18:26,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10778 states, 10777 states have (on average 1.344993968636912) internal successors, (14495), 10777 states have internal predecessors, (14495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:26,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10778 states to 10778 states and 14495 transitions. [2021-10-16 02:18:26,099 INFO L78 Accepts]: Start accepts. Automaton has 10778 states and 14495 transitions. Word has length 116 [2021-10-16 02:18:26,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:18:26,099 INFO L470 AbstractCegarLoop]: Abstraction has 10778 states and 14495 transitions. [2021-10-16 02:18:26,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:26,100 INFO L276 IsEmpty]: Start isEmpty. Operand 10778 states and 14495 transitions. [2021-10-16 02:18:26,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-16 02:18:26,125 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:18:26,125 INFO L512 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 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] [2021-10-16 02:18:26,142 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-10-16 02:18:26,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:18:26,339 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:18:26,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:18:26,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1827087367, now seen corresponding path program 1 times [2021-10-16 02:18:26,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:18:26,340 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [408922023] [2021-10-16 02:18:26,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:18:26,340 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:18:26,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:18:26,341 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:18:26,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-10-16 02:18:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:18:26,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 02:18:26,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:18:27,150 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-16 02:18:27,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:18:27,434 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-16 02:18:27,434 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:18:27,435 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [408922023] [2021-10-16 02:18:27,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [408922023] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:18:27,435 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:18:27,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-16 02:18:27,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544979897] [2021-10-16 02:18:27,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:18:27,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:18:27,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:18:27,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:18:27,437 INFO L87 Difference]: Start difference. First operand 10778 states and 14495 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:28,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:18:28,064 INFO L93 Difference]: Finished difference Result 20792 states and 27997 transitions. [2021-10-16 02:18:28,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 02:18:28,067 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 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 128 [2021-10-16 02:18:28,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:18:28,079 INFO L225 Difference]: With dead ends: 20792 [2021-10-16 02:18:28,079 INFO L226 Difference]: Without dead ends: 10668 [2021-10-16 02:18:28,085 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 252 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-16 02:18:28,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10668 states. [2021-10-16 02:18:28,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10668 to 10666. [2021-10-16 02:18:28,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10666 states, 10665 states have (on average 1.3159868729488982) internal successors, (14035), 10665 states have internal predecessors, (14035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:28,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10666 states to 10666 states and 14035 transitions. [2021-10-16 02:18:28,667 INFO L78 Accepts]: Start accepts. Automaton has 10666 states and 14035 transitions. Word has length 128 [2021-10-16 02:18:28,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:18:28,667 INFO L470 AbstractCegarLoop]: Abstraction has 10666 states and 14035 transitions. [2021-10-16 02:18:28,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:28,668 INFO L276 IsEmpty]: Start isEmpty. Operand 10666 states and 14035 transitions. [2021-10-16 02:18:28,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-10-16 02:18:28,681 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:18:28,681 INFO L512 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 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] [2021-10-16 02:18:28,691 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2021-10-16 02:18:28,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:18:28,882 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:18:28,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:18:28,882 INFO L82 PathProgramCache]: Analyzing trace with hash 210660645, now seen corresponding path program 1 times [2021-10-16 02:18:28,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:18:28,882 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1470564702] [2021-10-16 02:18:28,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:18:28,883 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:18:28,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:18:28,884 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:18:28,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-10-16 02:18:29,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:18:29,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 02:18:29,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:18:29,765 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-10-16 02:18:29,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:18:30,072 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-10-16 02:18:30,072 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:18:30,072 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1470564702] [2021-10-16 02:18:30,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1470564702] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:18:30,072 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:18:30,072 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-16 02:18:30,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650012557] [2021-10-16 02:18:30,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:18:30,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:18:30,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:18:30,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:18:30,074 INFO L87 Difference]: Start difference. First operand 10666 states and 14035 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:30,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:18:30,676 INFO L93 Difference]: Finished difference Result 20945 states and 27558 transitions. [2021-10-16 02:18:30,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:18:30,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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 134 [2021-10-16 02:18:30,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:18:30,687 INFO L225 Difference]: With dead ends: 20945 [2021-10-16 02:18:30,687 INFO L226 Difference]: Without dead ends: 10665 [2021-10-16 02:18:30,693 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 265 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-16 02:18:30,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10665 states. [2021-10-16 02:18:31,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10665 to 10625. [2021-10-16 02:18:31,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10625 states, 10624 states have (on average 1.3132530120481927) internal successors, (13952), 10624 states have internal predecessors, (13952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:31,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10625 states to 10625 states and 13952 transitions. [2021-10-16 02:18:31,285 INFO L78 Accepts]: Start accepts. Automaton has 10625 states and 13952 transitions. Word has length 134 [2021-10-16 02:18:31,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:18:31,286 INFO L470 AbstractCegarLoop]: Abstraction has 10625 states and 13952 transitions. [2021-10-16 02:18:31,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:31,286 INFO L276 IsEmpty]: Start isEmpty. Operand 10625 states and 13952 transitions. [2021-10-16 02:18:31,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-10-16 02:18:31,297 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:18:31,297 INFO L512 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 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] [2021-10-16 02:18:31,306 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2021-10-16 02:18:31,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:18:31,498 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:18:31,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:18:31,498 INFO L82 PathProgramCache]: Analyzing trace with hash 80634053, now seen corresponding path program 1 times [2021-10-16 02:18:31,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:18:31,499 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [55090358] [2021-10-16 02:18:31,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:18:31,499 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:18:31,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:18:31,500 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:18:31,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-10-16 02:18:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:18:32,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 02:18:32,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:18:32,424 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-10-16 02:18:32,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:18:32,711 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-10-16 02:18:32,711 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:18:32,711 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [55090358] [2021-10-16 02:18:32,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [55090358] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:18:32,711 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:18:32,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-16 02:18:32,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669120302] [2021-10-16 02:18:32,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:18:32,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:18:32,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:18:32,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:18:32,713 INFO L87 Difference]: Start difference. First operand 10625 states and 13952 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:33,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:18:33,254 INFO L93 Difference]: Finished difference Result 20884 states and 27419 transitions. [2021-10-16 02:18:33,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:18:33,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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 134 [2021-10-16 02:18:33,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:18:33,265 INFO L225 Difference]: With dead ends: 20884 [2021-10-16 02:18:33,266 INFO L226 Difference]: Without dead ends: 10635 [2021-10-16 02:18:33,274 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 265 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-16 02:18:33,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10635 states. [2021-10-16 02:18:34,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10635 to 10595. [2021-10-16 02:18:34,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10595 states, 10594 states have (on average 1.31026996413064) internal successors, (13881), 10594 states have internal predecessors, (13881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:34,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10595 states to 10595 states and 13881 transitions. [2021-10-16 02:18:34,081 INFO L78 Accepts]: Start accepts. Automaton has 10595 states and 13881 transitions. Word has length 134 [2021-10-16 02:18:34,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:18:34,082 INFO L470 AbstractCegarLoop]: Abstraction has 10595 states and 13881 transitions. [2021-10-16 02:18:34,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:34,082 INFO L276 IsEmpty]: Start isEmpty. Operand 10595 states and 13881 transitions. [2021-10-16 02:18:34,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-10-16 02:18:34,095 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:18:34,095 INFO L512 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:18:34,105 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2021-10-16 02:18:34,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:18:34,297 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:18:34,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:18:34,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1507420786, now seen corresponding path program 1 times [2021-10-16 02:18:34,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:18:34,298 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [813585669] [2021-10-16 02:18:34,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:18:34,298 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:18:34,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:18:34,299 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:18:34,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-10-16 02:18:35,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:18:35,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 02:18:35,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:18:35,274 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-10-16 02:18:35,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:18:35,547 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-10-16 02:18:35,547 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:18:35,547 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [813585669] [2021-10-16 02:18:35,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [813585669] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:18:35,547 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:18:35,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-16 02:18:35,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746738357] [2021-10-16 02:18:35,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:18:35,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:18:35,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:18:35,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:18:35,549 INFO L87 Difference]: Start difference. First operand 10595 states and 13881 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:36,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:18:36,138 INFO L93 Difference]: Finished difference Result 18551 states and 24414 transitions. [2021-10-16 02:18:36,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 02:18:36,139 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 137 [2021-10-16 02:18:36,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:18:36,149 INFO L225 Difference]: With dead ends: 18551 [2021-10-16 02:18:36,149 INFO L226 Difference]: Without dead ends: 8328 [2021-10-16 02:18:36,159 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 270 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-16 02:18:36,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8328 states. [2021-10-16 02:18:36,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8328 to 8326. [2021-10-16 02:18:36,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8326 states, 8325 states have (on average 1.2804804804804806) internal successors, (10660), 8325 states have internal predecessors, (10660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:36,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8326 states to 8326 states and 10660 transitions. [2021-10-16 02:18:36,625 INFO L78 Accepts]: Start accepts. Automaton has 8326 states and 10660 transitions. Word has length 137 [2021-10-16 02:18:36,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:18:36,625 INFO L470 AbstractCegarLoop]: Abstraction has 8326 states and 10660 transitions. [2021-10-16 02:18:36,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:36,625 INFO L276 IsEmpty]: Start isEmpty. Operand 8326 states and 10660 transitions. [2021-10-16 02:18:36,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-10-16 02:18:36,633 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:18:36,633 INFO L512 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:18:36,653 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (26)] Ended with exit code 0 [2021-10-16 02:18:36,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:18:36,847 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:18:36,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:18:36,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1526376893, now seen corresponding path program 1 times [2021-10-16 02:18:36,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:18:36,848 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [767525092] [2021-10-16 02:18:36,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:18:36,848 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:18:36,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:18:36,849 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:18:36,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-10-16 02:18:37,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:18:37,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 02:18:37,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:18:37,828 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-10-16 02:18:37,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:18:38,085 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-10-16 02:18:38,086 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:18:38,086 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [767525092] [2021-10-16 02:18:38,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [767525092] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:18:38,086 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:18:38,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-16 02:18:38,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683879487] [2021-10-16 02:18:38,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:18:38,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:18:38,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:18:38,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:18:38,087 INFO L87 Difference]: Start difference. First operand 8326 states and 10660 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:38,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:18:38,428 INFO L93 Difference]: Finished difference Result 13873 states and 17765 transitions. [2021-10-16 02:18:38,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 02:18:38,429 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 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 137 [2021-10-16 02:18:38,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:18:38,435 INFO L225 Difference]: With dead ends: 13873 [2021-10-16 02:18:38,435 INFO L226 Difference]: Without dead ends: 5569 [2021-10-16 02:18:38,440 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 270 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-16 02:18:38,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5569 states. [2021-10-16 02:18:38,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5569 to 5513. [2021-10-16 02:18:38,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5513 states, 5512 states have (on average 1.2467343976777938) internal successors, (6872), 5512 states have internal predecessors, (6872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:38,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5513 states to 5513 states and 6872 transitions. [2021-10-16 02:18:38,807 INFO L78 Accepts]: Start accepts. Automaton has 5513 states and 6872 transitions. Word has length 137 [2021-10-16 02:18:38,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:18:38,807 INFO L470 AbstractCegarLoop]: Abstraction has 5513 states and 6872 transitions. [2021-10-16 02:18:38,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:38,808 INFO L276 IsEmpty]: Start isEmpty. Operand 5513 states and 6872 transitions. [2021-10-16 02:18:38,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-10-16 02:18:38,813 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:18:38,814 INFO L512 BasicCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 02:18:38,844 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2021-10-16 02:18:39,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:18:39,028 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:18:39,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:18:39,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1143751876, now seen corresponding path program 1 times [2021-10-16 02:18:39,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:18:39,029 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1146446834] [2021-10-16 02:18:39,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:18:39,030 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:18:39,030 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:18:39,031 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:18:39,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2021-10-16 02:18:39,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:18:39,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 02:18:39,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:18:40,237 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-10-16 02:18:40,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:18:40,530 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-10-16 02:18:40,530 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:18:40,530 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1146446834] [2021-10-16 02:18:40,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1146446834] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:18:40,531 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:18:40,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-16 02:18:40,531 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809640149] [2021-10-16 02:18:40,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:18:40,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:18:40,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:18:40,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:18:40,533 INFO L87 Difference]: Start difference. First operand 5513 states and 6872 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:40,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:18:40,865 INFO L93 Difference]: Finished difference Result 10666 states and 13325 transitions. [2021-10-16 02:18:40,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:18:40,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 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 176 [2021-10-16 02:18:40,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:18:40,871 INFO L225 Difference]: With dead ends: 10666 [2021-10-16 02:18:40,871 INFO L226 Difference]: Without dead ends: 5410 [2021-10-16 02:18:40,875 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 349 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-16 02:18:40,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5410 states. [2021-10-16 02:18:41,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5410 to 5148. [2021-10-16 02:18:41,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5148 states, 5147 states have (on average 1.234116961336701) internal successors, (6352), 5147 states have internal predecessors, (6352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:41,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5148 states to 5148 states and 6352 transitions. [2021-10-16 02:18:41,203 INFO L78 Accepts]: Start accepts. Automaton has 5148 states and 6352 transitions. Word has length 176 [2021-10-16 02:18:41,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:18:41,203 INFO L470 AbstractCegarLoop]: Abstraction has 5148 states and 6352 transitions. [2021-10-16 02:18:41,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:41,203 INFO L276 IsEmpty]: Start isEmpty. Operand 5148 states and 6352 transitions. [2021-10-16 02:18:41,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2021-10-16 02:18:41,207 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:18:41,207 INFO L512 BasicCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 02:18:41,217 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2021-10-16 02:18:41,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:18:41,408 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:18:41,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:18:41,408 INFO L82 PathProgramCache]: Analyzing trace with hash 709277431, now seen corresponding path program 1 times [2021-10-16 02:18:41,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:18:41,409 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1427450594] [2021-10-16 02:18:41,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:18:41,409 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:18:41,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:18:41,410 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:18:41,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2021-10-16 02:18:42,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:18:42,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 02:18:42,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:18:42,633 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-10-16 02:18:42,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:18:42,957 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-10-16 02:18:42,957 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:18:42,957 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1427450594] [2021-10-16 02:18:42,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1427450594] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:18:42,957 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:18:42,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-16 02:18:42,957 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073350175] [2021-10-16 02:18:42,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:18:42,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:18:42,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:18:42,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:18:42,958 INFO L87 Difference]: Start difference. First operand 5148 states and 6352 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:43,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:18:43,358 INFO L93 Difference]: Finished difference Result 11237 states and 13837 transitions. [2021-10-16 02:18:43,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:18:43,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 182 [2021-10-16 02:18:43,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:18:43,366 INFO L225 Difference]: With dead ends: 11237 [2021-10-16 02:18:43,366 INFO L226 Difference]: Without dead ends: 6346 [2021-10-16 02:18:43,370 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:18:43,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6346 states. [2021-10-16 02:18:43,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6346 to 5328. [2021-10-16 02:18:43,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5328 states, 5327 states have (on average 1.205556598460672) internal successors, (6422), 5327 states have internal predecessors, (6422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:43,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5328 states to 5328 states and 6422 transitions. [2021-10-16 02:18:43,762 INFO L78 Accepts]: Start accepts. Automaton has 5328 states and 6422 transitions. Word has length 182 [2021-10-16 02:18:43,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:18:43,762 INFO L470 AbstractCegarLoop]: Abstraction has 5328 states and 6422 transitions. [2021-10-16 02:18:43,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:43,762 INFO L276 IsEmpty]: Start isEmpty. Operand 5328 states and 6422 transitions. [2021-10-16 02:18:43,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-10-16 02:18:43,764 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:18:43,765 INFO L512 BasicCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 02:18:43,778 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2021-10-16 02:18:43,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:18:43,966 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:18:43,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:18:43,967 INFO L82 PathProgramCache]: Analyzing trace with hash 391755360, now seen corresponding path program 1 times [2021-10-16 02:18:43,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:18:43,967 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [143523667] [2021-10-16 02:18:43,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:18:43,967 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:18:43,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:18:43,968 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:18:43,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2021-10-16 02:18:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:18:44,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 11 conjunts are in the unsatisfiable core [2021-10-16 02:18:44,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:18:46,162 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-16 02:18:46,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:18:46,949 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 81 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-16 02:18:46,949 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:18:46,949 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [143523667] [2021-10-16 02:18:46,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [143523667] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-16 02:18:46,949 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1930809491] [2021-10-16 02:18:46,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:18:46,950 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-10-16 02:18:46,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/cvc4 [2021-10-16 02:18:46,953 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-10-16 02:18:46,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2021-10-16 02:18:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:18:48,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 13 conjunts are in the unsatisfiable core [2021-10-16 02:18:48,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:18:49,425 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-16 02:18:49,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:18:49,918 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 81 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-16 02:18:49,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1930809491] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-16 02:18:49,919 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11706129] [2021-10-16 02:18:49,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:18:49,919 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-16 02:18:49,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/z3 [2021-10-16 02:18:49,920 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-16 02:18:49,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2021-10-16 02:18:51,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:18:51,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 11 conjunts are in the unsatisfiable core [2021-10-16 02:18:51,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:18:52,282 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-16 02:18:52,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:18:52,755 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 81 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-16 02:18:52,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11706129] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-16 02:18:52,755 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2021-10-16 02:18:52,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11, 10, 11, 10] total 19 [2021-10-16 02:18:52,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396630393] [2021-10-16 02:18:52,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-10-16 02:18:52,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:18:52,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-10-16 02:18:52,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-10-16 02:18:52,757 INFO L87 Difference]: Start difference. First operand 5328 states and 6422 transitions. Second operand has 19 states, 19 states have (on average 18.63157894736842) internal successors, (354), 19 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:18:59,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:18:59,198 INFO L93 Difference]: Finished difference Result 48788 states and 58012 transitions. [2021-10-16 02:18:59,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2021-10-16 02:18:59,199 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 18.63157894736842) internal successors, (354), 19 states have internal predecessors, (354), 0 states have call successors, (0), 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 185 [2021-10-16 02:18:59,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:18:59,246 INFO L225 Difference]: With dead ends: 48788 [2021-10-16 02:18:59,246 INFO L226 Difference]: Without dead ends: 43290 [2021-10-16 02:18:59,255 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1214 GetRequests, 1134 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1776 ImplicationChecksByTransitivity, 2156.2ms TimeCoverageRelationStatistics Valid=693, Invalid=5469, Unknown=0, NotChecked=0, Total=6162 [2021-10-16 02:18:59,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43290 states. [2021-10-16 02:19:00,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43290 to 11576. [2021-10-16 02:19:00,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11576 states, 11575 states have (on average 1.2044060475161986) internal successors, (13941), 11575 states have internal predecessors, (13941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:19:00,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11576 states to 11576 states and 13941 transitions. [2021-10-16 02:19:00,341 INFO L78 Accepts]: Start accepts. Automaton has 11576 states and 13941 transitions. Word has length 185 [2021-10-16 02:19:00,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:19:00,341 INFO L470 AbstractCegarLoop]: Abstraction has 11576 states and 13941 transitions. [2021-10-16 02:19:00,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 18.63157894736842) internal successors, (354), 19 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:19:00,341 INFO L276 IsEmpty]: Start isEmpty. Operand 11576 states and 13941 transitions. [2021-10-16 02:19:00,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2021-10-16 02:19:00,346 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:19:00,346 INFO L512 BasicCegarLoop]: trace histogram [7, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 02:19:00,354 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/cvc4 --incremental --print-success --lang smt (31)] Forceful destruction successful, exit code 0 [2021-10-16 02:19:00,572 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2021-10-16 02:19:00,756 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (30)] Ended with exit code 0 [2021-10-16 02:19:00,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/cvc4 --incremental --print-success --lang smt,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:19:00,948 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:19:00,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:19:00,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1085364486, now seen corresponding path program 1 times [2021-10-16 02:19:00,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:19:00,949 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [741549451] [2021-10-16 02:19:00,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:19:00,950 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:19:00,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:19:00,950 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:19:00,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2021-10-16 02:19:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:19:02,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-16 02:19:02,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:19:03,190 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-10-16 02:19:03,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:19:03,822 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 95 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-10-16 02:19:03,822 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:19:03,822 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [741549451] [2021-10-16 02:19:03,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [741549451] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-16 02:19:03,822 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [829853899] [2021-10-16 02:19:03,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:19:03,823 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-10-16 02:19:03,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/cvc4 [2021-10-16 02:19:03,823 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-10-16 02:19:03,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2021-10-16 02:19:05,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:19:05,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 11 conjunts are in the unsatisfiable core [2021-10-16 02:19:05,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:19:06,585 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-10-16 02:19:06,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:19:07,090 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 95 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-10-16 02:19:07,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [829853899] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-16 02:19:07,091 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079992903] [2021-10-16 02:19:07,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:19:07,091 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-16 02:19:07,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/z3 [2021-10-16 02:19:07,092 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-16 02:19:07,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2021-10-16 02:19:08,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:19:08,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-16 02:19:08,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:19:09,752 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-10-16 02:19:09,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:19:10,310 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 95 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-10-16 02:19:10,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079992903] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-16 02:19:10,310 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2021-10-16 02:19:10,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10, 9, 10, 9] total 17 [2021-10-16 02:19:10,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298547787] [2021-10-16 02:19:10,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-10-16 02:19:10,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:19:10,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-10-16 02:19:10,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2021-10-16 02:19:10,313 INFO L87 Difference]: Start difference. First operand 11576 states and 13941 transitions. Second operand has 17 states, 17 states have (on average 21.11764705882353) internal successors, (359), 17 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:19:17,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:19:17,392 INFO L93 Difference]: Finished difference Result 68253 states and 81202 transitions. [2021-10-16 02:19:17,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-10-16 02:19:17,393 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 21.11764705882353) internal successors, (359), 17 states have internal predecessors, (359), 0 states have call successors, (0), 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 191 [2021-10-16 02:19:17,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:19:17,466 INFO L225 Difference]: With dead ends: 68253 [2021-10-16 02:19:17,467 INFO L226 Difference]: Without dead ends: 55831 [2021-10-16 02:19:17,483 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1236 GetRequests, 1166 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1385 ImplicationChecksByTransitivity, 1283.8ms TimeCoverageRelationStatistics Valid=638, Invalid=4192, Unknown=0, NotChecked=0, Total=4830 [2021-10-16 02:19:17,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55831 states. [2021-10-16 02:19:19,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55831 to 18344. [2021-10-16 02:19:19,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18344 states, 18343 states have (on average 1.2105980483018044) internal successors, (22206), 18343 states have internal predecessors, (22206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:19:19,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18344 states to 18344 states and 22206 transitions. [2021-10-16 02:19:19,529 INFO L78 Accepts]: Start accepts. Automaton has 18344 states and 22206 transitions. Word has length 191 [2021-10-16 02:19:19,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:19:19,529 INFO L470 AbstractCegarLoop]: Abstraction has 18344 states and 22206 transitions. [2021-10-16 02:19:19,529 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 21.11764705882353) internal successors, (359), 17 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:19:19,529 INFO L276 IsEmpty]: Start isEmpty. Operand 18344 states and 22206 transitions. [2021-10-16 02:19:19,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2021-10-16 02:19:19,544 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:19:19,545 INFO L512 BasicCegarLoop]: trace histogram [8, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 02:19:19,560 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2021-10-16 02:19:19,749 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/cvc4 --incremental --print-success --lang smt (34)] Ended with exit code 0 [2021-10-16 02:19:19,972 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2021-10-16 02:19:20,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/cvc4 --incremental --print-success --lang smt,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-16 02:19:20,146 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:19:20,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:19:20,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1502612859, now seen corresponding path program 1 times [2021-10-16 02:19:20,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:19:20,147 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [597553035] [2021-10-16 02:19:20,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:19:20,147 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:19:20,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:19:20,148 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:19:20,149 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2021-10-16 02:19:21,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:19:21,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 02:19:21,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:19:22,152 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-10-16 02:19:22,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:19:22,573 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-10-16 02:19:22,573 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:19:22,573 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [597553035] [2021-10-16 02:19:22,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [597553035] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:19:22,574 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:19:22,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-16 02:19:22,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896964175] [2021-10-16 02:19:22,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:19:22,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:19:22,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:19:22,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:19:22,575 INFO L87 Difference]: Start difference. First operand 18344 states and 22206 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:19:23,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:19:23,312 INFO L93 Difference]: Finished difference Result 24641 states and 29721 transitions. [2021-10-16 02:19:23,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:19:23,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 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 231 [2021-10-16 02:19:23,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:19:23,318 INFO L225 Difference]: With dead ends: 24641 [2021-10-16 02:19:23,318 INFO L226 Difference]: Without dead ends: 5284 [2021-10-16 02:19:23,328 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 459 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-16 02:19:23,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5284 states. [2021-10-16 02:19:23,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5284 to 2805. [2021-10-16 02:19:23,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2805 states, 2804 states have (on average 1.1815263908701854) internal successors, (3313), 2804 states have internal predecessors, (3313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:19:23,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2805 states to 2805 states and 3313 transitions. [2021-10-16 02:19:23,646 INFO L78 Accepts]: Start accepts. Automaton has 2805 states and 3313 transitions. Word has length 231 [2021-10-16 02:19:23,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:19:23,646 INFO L470 AbstractCegarLoop]: Abstraction has 2805 states and 3313 transitions. [2021-10-16 02:19:23,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:19:23,647 INFO L276 IsEmpty]: Start isEmpty. Operand 2805 states and 3313 transitions. [2021-10-16 02:19:23,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2021-10-16 02:19:23,648 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:19:23,649 INFO L512 BasicCegarLoop]: trace histogram [9, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 02:19:23,660 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2021-10-16 02:19:23,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:19:23,851 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:19:23,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:19:23,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1258410680, now seen corresponding path program 1 times [2021-10-16 02:19:23,852 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:19:23,852 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [447804565] [2021-10-16 02:19:23,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:19:23,853 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:19:23,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:19:23,854 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:19:23,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2021-10-16 02:19:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:19:25,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 02:19:25,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:19:26,009 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-10-16 02:19:26,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:19:26,431 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-10-16 02:19:26,431 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:19:26,431 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [447804565] [2021-10-16 02:19:26,431 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [447804565] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:19:26,432 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:19:26,432 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-16 02:19:26,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857992893] [2021-10-16 02:19:26,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:19:26,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:19:26,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:19:26,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:19:26,434 INFO L87 Difference]: Start difference. First operand 2805 states and 3313 transitions. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:19:26,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:19:26,593 INFO L93 Difference]: Finished difference Result 3182 states and 3724 transitions. [2021-10-16 02:19:26,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:19:26,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 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 251 [2021-10-16 02:19:26,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:19:26,595 INFO L225 Difference]: With dead ends: 3182 [2021-10-16 02:19:26,595 INFO L226 Difference]: Without dead ends: 0 [2021-10-16 02:19:26,597 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 499 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-16 02:19:26,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-16 02:19:26,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-16 02:19:26,597 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-16 02:19:26,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-16 02:19:26,598 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 251 [2021-10-16 02:19:26,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:19:26,598 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-16 02:19:26,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:19:26,599 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-16 02:19:26,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-16 02:19:26,601 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-16 02:19:26,616 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2021-10-16 02:19:26,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:19:26,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-16 02:19:26,826 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:19:31,827 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:19:31,828 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:19:31,835 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:19:32,501 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:19:33,321 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:19:33,586 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:19:46,073 WARN L207 SmtUtils]: Spent 12.48 s on a formula simplification. DAG size of input: 2030 DAG size of output: 1980 [2021-10-16 02:19:46,087 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:19:58,935 WARN L207 SmtUtils]: Spent 12.84 s on a formula simplification. DAG size of input: 2176 DAG size of output: 2130 [2021-10-16 02:19:58,943 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:19:59,882 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:20:00,706 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:20:01,627 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:20:03,035 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:20:16,794 WARN L207 SmtUtils]: Spent 13.76 s on a formula simplification. DAG size of input: 2204 DAG size of output: 2158 [2021-10-16 02:20:16,801 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:20:16,802 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:20:18,248 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:20:20,287 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:20:33,512 WARN L207 SmtUtils]: Spent 13.22 s on a formula simplification. DAG size of input: 2176 DAG size of output: 2130 [2021-10-16 02:20:33,519 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:20:35,671 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:20:49,304 WARN L207 SmtUtils]: Spent 13.63 s on a formula simplification. DAG size of input: 2285 DAG size of output: 2233 [2021-10-16 02:20:49,311 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:20:55,907 WARN L207 SmtUtils]: Spent 5.72 s on a formula simplification. DAG size of input: 368 DAG size of output: 76 [2021-10-16 02:21:07,085 WARN L207 SmtUtils]: Spent 6.38 s on a formula simplification. DAG size of input: 390 DAG size of output: 122 [2021-10-16 02:22:04,330 WARN L207 SmtUtils]: Spent 55.50 s on a formula simplification. DAG size of input: 1980 DAG size of output: 293 [2021-10-16 02:23:08,328 WARN L207 SmtUtils]: Spent 1.07 m on a formula simplification. DAG size of input: 2130 DAG size of output: 307 [2021-10-16 02:23:14,100 WARN L207 SmtUtils]: Spent 5.77 s on a formula simplification. DAG size of input: 524 DAG size of output: 96 [2021-10-16 02:23:19,984 WARN L207 SmtUtils]: Spent 5.88 s on a formula simplification. DAG size of input: 480 DAG size of output: 88 [2021-10-16 02:23:25,585 WARN L207 SmtUtils]: Spent 5.60 s on a formula simplification. DAG size of input: 594 DAG size of output: 104 [2021-10-16 02:23:38,586 WARN L207 SmtUtils]: Spent 13.00 s on a formula simplification. DAG size of input: 683 DAG size of output: 148 [2021-10-16 02:24:43,376 WARN L207 SmtUtils]: Spent 1.08 m on a formula simplification. DAG size of input: 2158 DAG size of output: 301 [2021-10-16 02:24:53,635 WARN L207 SmtUtils]: Spent 10.25 s on a formula simplification. DAG size of input: 556 DAG size of output: 115 [2021-10-16 02:25:06,841 WARN L207 SmtUtils]: Spent 13.20 s on a formula simplification. DAG size of input: 871 DAG size of output: 177 [2021-10-16 02:26:08,445 WARN L207 SmtUtils]: Spent 1.03 m on a formula simplification. DAG size of input: 2130 DAG size of output: 307 [2021-10-16 02:26:21,080 WARN L207 SmtUtils]: Spent 12.63 s on a formula simplification. DAG size of input: 868 DAG size of output: 175 [2021-10-16 02:27:27,480 WARN L207 SmtUtils]: Spent 1.11 m on a formula simplification. DAG size of input: 2233 DAG size of output: 301 [2021-10-16 02:27:33,103 WARN L207 SmtUtils]: Spent 5.62 s on a formula simplification. DAG size of input: 593 DAG size of output: 104 [2021-10-16 02:27:33,107 INFO L857 garLoopResultBuilder]: For program point L498(lines 498 502) no Hoare annotation was computed. [2021-10-16 02:27:33,108 INFO L853 garLoopResultBuilder]: At program point L234-1(lines 222 249) the Hoare annotation is: (let ((.cse38 (bvadd (_ bv1 32) ~t_b~0)) (.cse39 (bvadd (_ bv2 32) ~t_b~0))) (let ((.cse8 (not (= ~wl_pc~0 (_ bv2 32)))) (.cse31 (= .cse39 ~data~0)) (.cse33 (= .cse39 ~c_t~0)) (.cse5 (not (= (_ bv0 32) ~e_c~0))) (.cse14 (= ~data~0 .cse38)) (.cse20 (not (= ~e_wl~0 (_ bv0 32)))) (.cse12 (= ~wb_pc~0 (_ bv1 32))) (.cse21 (= .cse38 ~c_t~0)) (.cse15 (not (= ~e_wl~0 (_ bv1 32)))) (.cse36 (not (= ~c_req_up~0 (_ bv1 32)))) (.cse18 (= ~c2_st~0 (_ bv0 32))) (.cse9 (not (= ~wl_st~0 (_ bv0 32)))) (.cse34 (= ~c1_st~0 (_ bv0 32))) (.cse35 (= ~c1_pc~0 (_ bv0 32))) (.cse37 (= ~wl_pc~0 (_ bv1 32))) (.cse30 (= ~c2_pc~0 (_ bv0 32))) (.cse22 (= ~c_req_up~0 (_ bv0 32))) (.cse0 (= (_ bv2 32) ~e_f~0)) (.cse1 (= (_ bv1 32) ~c1_pc~0)) (.cse16 (not (= (_ bv0 32) ~r_st~0))) (.cse2 (= (_ bv2 32) ~e_wl~0)) (.cse3 (= (_ bv1 32) ~wb_i~0)) (.cse4 (= ~c2_i~0 (_ bv1 32))) (.cse23 (= ~data~0 ~t_b~0)) (.cse17 (not (= ~wb_st~0 (_ bv0 32)))) (.cse6 (= (_ bv1 32) ~c2_pc~0)) (.cse7 (= (_ bv2 32) ~e_e~0)) (.cse24 (= ~d~0 (_ bv0 32))) (.cse25 (= (_ bv0 32) ~processed~0)) (.cse19 (= (_ bv2 32) ~c1_st~0)) (.cse26 (= ~wb_pc~0 (_ bv0 32))) (.cse27 (= ~data~0 (_ bv0 32))) (.cse32 (= (_ bv2 32) ~c2_st~0)) (.cse28 (= (_ bv2 32) ~e_c~0)) (.cse10 (= (_ bv2 32) ~e_g~0)) (.cse11 (= ~c1_i~0 (_ bv1 32))) (.cse13 (= (_ bv0 32) ~r_i~0)) (.cse29 (= ~wl_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse0 .cse1 .cse15 .cse16 .cse3 .cse4 .cse17 .cse5 .cse6 .cse7 .cse8 .cse18 .cse9 .cse19 .cse20 .cse10 .cse11 .cse12 .cse21 .cse13) (and .cse22 .cse0 .cse1 .cse16 .cse2 .cse3 .cse4 .cse23 .cse17 .cse7 .cse24 .cse18 .cse25 .cse19 .cse26 .cse27 .cse28 .cse10 .cse11 .cse13 .cse29 .cse30) (and .cse0 .cse1 .cse15 .cse16 .cse3 .cse4 .cse17 .cse6 .cse7 .cse9 .cse19 .cse31 .cse32 .cse20 .cse28 .cse33 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse0 .cse1 .cse15 .cse16 .cse3 .cse4 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse34 .cse32 .cse20 .cse10 .cse11 .cse12 .cse21 .cse13) (and .cse22 .cse0 .cse16 .cse2 .cse3 .cse4 .cse23 .cse17 .cse7 .cse24 .cse18 .cse25 .cse26 .cse27 .cse34 .cse35 .cse28 .cse10 .cse11 .cse13 .cse29 .cse30) (and .cse22 .cse0 .cse16 .cse2 .cse3 .cse4 .cse23 .cse17 .cse6 .cse7 .cse24 .cse25 .cse26 .cse27 .cse34 .cse32 .cse35 .cse28 .cse10 .cse11 .cse13 .cse29) (and .cse0 .cse1 .cse15 .cse16 .cse3 .cse4 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse19 .cse31 .cse32 .cse20 .cse33 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse15 .cse36 .cse16 .cse3 .cse4 .cse23 .cse17 .cse6 .cse7 .cse24 .cse25 .cse9 .cse26 .cse27 .cse34 .cse32 .cse35 .cse28 .cse37 .cse10 .cse11 .cse13) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse13 .cse29) (and .cse0 .cse1 .cse15 .cse36 .cse16 .cse3 .cse4 .cse23 .cse17 .cse7 .cse24 .cse18 .cse25 .cse9 .cse19 .cse26 .cse27 .cse28 .cse37 .cse10 .cse11 .cse13 .cse30) (and .cse14 .cse0 .cse1 .cse15 .cse16 .cse3 .cse4 .cse17 .cse6 .cse7 .cse18 .cse9 .cse19 .cse20 .cse28 .cse10 .cse11 .cse12 .cse21 .cse13) (and .cse14 .cse0 .cse1 .cse15 .cse16 .cse3 .cse4 .cse17 .cse6 .cse7 .cse9 .cse34 .cse32 .cse20 .cse28 .cse10 .cse11 .cse12 .cse21 .cse13) (and .cse0 .cse1 .cse15 .cse36 .cse16 .cse3 .cse4 .cse23 .cse17 .cse6 .cse7 .cse24 .cse25 .cse9 .cse19 .cse26 .cse27 .cse32 .cse28 .cse37 .cse10 .cse11 .cse13) (and .cse0 .cse15 .cse36 .cse16 .cse3 .cse4 .cse23 .cse17 .cse7 .cse24 .cse18 .cse25 .cse9 .cse26 .cse27 .cse34 .cse35 .cse28 .cse37 .cse10 .cse11 .cse13 .cse30) (and .cse22 .cse0 .cse1 .cse16 .cse2 .cse3 .cse4 .cse23 .cse17 .cse6 .cse7 .cse24 .cse25 .cse19 .cse26 .cse27 .cse32 .cse28 .cse10 .cse11 .cse13 .cse29)))) [2021-10-16 02:27:33,108 INFO L857 garLoopResultBuilder]: For program point L631-1(lines 537 677) no Hoare annotation was computed. [2021-10-16 02:27:33,109 INFO L857 garLoopResultBuilder]: For program point L400(lines 400 410) no Hoare annotation was computed. [2021-10-16 02:27:33,109 INFO L857 garLoopResultBuilder]: For program point L400-2(lines 398 682) no Hoare annotation was computed. [2021-10-16 02:27:33,109 INFO L857 garLoopResultBuilder]: For program point L301(lines 301 309) no Hoare annotation was computed. [2021-10-16 02:27:33,109 INFO L857 garLoopResultBuilder]: For program point L235(line 235) no Hoare annotation was computed. [2021-10-16 02:27:33,109 INFO L857 garLoopResultBuilder]: For program point L136(lines 136 140) no Hoare annotation was computed. [2021-10-16 02:27:33,109 INFO L857 garLoopResultBuilder]: For program point L665(lines 665 673) no Hoare annotation was computed. [2021-10-16 02:27:33,109 INFO L857 garLoopResultBuilder]: For program point L599(lines 537 677) no Hoare annotation was computed. [2021-10-16 02:27:33,110 INFO L857 garLoopResultBuilder]: For program point L566-1(lines 537 677) no Hoare annotation was computed. [2021-10-16 02:27:33,110 INFO L857 garLoopResultBuilder]: For program point L401(lines 401 406) no Hoare annotation was computed. [2021-10-16 02:27:33,110 INFO L857 garLoopResultBuilder]: For program point L401-2(lines 401 406) no Hoare annotation was computed. [2021-10-16 02:27:33,110 INFO L853 garLoopResultBuilder]: At program point L137(lines 132 172) the Hoare annotation is: (let ((.cse29 (bvadd (_ bv1 32) ~t_b~0))) (let ((.cse26 (= ~data~0 ~t_b~0)) (.cse27 (= ~c2_st~0 (_ bv0 32))) (.cse28 (= ~data~0 ULTIMATE.start_write_loop_~t~0)) (.cse23 (= ~wb_st~0 (_ bv0 32))) (.cse25 (not (= ~c_req_up~0 (_ bv1 32)))) (.cse24 (= (_ bv0 32) ~processed~0)) (.cse21 (= (_ bv2 32) ~e_c~0)) (.cse2 (= (_ bv2 32) ~e_wl~0)) (.cse14 (= ~data~0 .cse29)) (.cse0 (= (_ bv2 32) ~e_f~0)) (.cse1 (= (_ bv1 32) ~c1_pc~0)) (.cse15 (not (= ~e_wl~0 (_ bv1 32)))) (.cse16 (not (= (_ bv0 32) ~r_st~0))) (.cse3 (= (_ bv1 32) ~wb_i~0)) (.cse17 (not (= ~c1_st~0 (_ bv0 32)))) (.cse4 (= ~c2_i~0 (_ bv1 32))) (.cse5 (not (= (_ bv0 32) ~e_c~0))) (.cse6 (= (_ bv1 32) ~c2_pc~0)) (.cse7 (= (_ bv2 32) ~e_e~0)) (.cse18 (= (_ bv2 32) ~wb_st~0)) (.cse8 (not (= ~wl_pc~0 (_ bv2 32)))) (.cse9 (not (= ~wl_st~0 (_ bv0 32)))) (.cse19 (= (_ bv2 32) ~c2_st~0)) (.cse20 (not (= ~e_wl~0 (_ bv0 32)))) (.cse10 (= (_ bv2 32) ~e_g~0)) (.cse11 (= ~c1_i~0 (_ bv1 32))) (.cse12 (= ~wb_pc~0 (_ bv1 32))) (.cse22 (= .cse29 ~c_t~0)) (.cse13 (= (_ bv0 32) ~r_i~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse0 .cse1 .cse15 .cse16 .cse3 .cse17 .cse4 .cse6 .cse7 .cse18 .cse9 .cse19 .cse20 .cse21 .cse10 .cse11 .cse12 .cse22 .cse13) (and .cse14 .cse0 .cse1 .cse15 .cse16 .cse3 .cse17 .cse4 .cse23 .cse6 .cse7 .cse24 .cse9 .cse19 .cse20 .cse21 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse0 .cse1 .cse15 .cse25 .cse16 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse18 .cse8 .cse24 .cse9 .cse19 .cse20 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse15 .cse25 .cse16 .cse3 .cse17 .cse4 .cse26 .cse6 .cse7 .cse18 .cse27 .cse24 .cse9 .cse20 .cse28 .cse21 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse15 .cse25 .cse16 .cse3 .cse17 .cse4 .cse26 .cse5 .cse6 .cse7 .cse18 .cse8 .cse27 .cse24 .cse9 .cse20 .cse28 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse0 .cse1 .cse15 .cse16 .cse3 .cse17 .cse4 .cse23 .cse5 .cse6 .cse7 .cse8 .cse24 .cse9 .cse19 .cse20 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse0 .cse1 .cse15 .cse25 .cse16 .cse3 .cse17 .cse4 .cse6 .cse7 .cse18 .cse24 .cse9 .cse19 .cse20 .cse21 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse13 (= ~wl_pc~0 (_ bv0 32))) (and .cse14 .cse0 .cse1 .cse15 .cse16 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse18 .cse8 .cse9 .cse19 .cse20 .cse10 .cse11 .cse12 .cse22 .cse13)))) [2021-10-16 02:27:33,111 INFO L853 garLoopResultBuilder]: At program point L71(lines 57 127) the Hoare annotation is: (let ((.cse24 (= ~c1_st~0 (_ bv0 32))) (.cse25 (= ~c1_pc~0 (_ bv0 32))) (.cse9 (= (_ bv2 32) ~wb_st~0)) (.cse21 (= ~c2_st~0 (_ bv0 32))) (.cse17 (= ~wb_pc~0 (_ bv1 32))) (.cse26 (= ~c2_pc~0 (_ bv0 32))) (.cse1 (= (_ bv2 32) ~e_f~0)) (.cse2 (= (_ bv1 32) ~c1_pc~0)) (.cse0 (not (= ~e_wl~0 (_ bv1 32)))) (.cse3 (not (= ~c_req_up~0 (_ bv1 32)))) (.cse4 (not (= (_ bv0 32) ~r_st~0))) (.cse5 (= (_ bv1 32) ~wb_i~0)) (.cse6 (= ~c2_i~0 (_ bv1 32))) (.cse19 (= ~data~0 ~t_b~0)) (.cse27 (= ~wb_st~0 (_ bv0 32))) (.cse7 (= (_ bv1 32) ~c2_pc~0)) (.cse8 (= (_ bv2 32) ~e_e~0)) (.cse20 (= ~d~0 (_ bv0 32))) (.cse10 (not (= ~wl_pc~0 (_ bv2 32)))) (.cse22 (= (_ bv0 32) ~processed~0)) (.cse11 (not (= ~wl_st~0 (_ bv0 32)))) (.cse12 (= (_ bv2 32) ~c1_st~0)) (.cse28 (= ~wb_pc~0 (_ bv0 32))) (.cse23 (= ~data~0 (_ bv0 32))) (.cse13 (= (_ bv2 32) ~c2_st~0)) (.cse14 (= (_ bv2 32) ~e_c~0)) (.cse15 (= (_ bv2 32) ~e_g~0)) (.cse16 (= ~c1_i~0 (_ bv1 32))) (.cse18 (= (_ bv0 32) ~r_i~0))) (or (and .cse0 (or (and (= ~data~0 (bvadd (_ bv1 32) ~t_b~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= (bvadd (_ bv2 32) ~t_b~0) ~data~0) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))) (and .cse1 .cse0 .cse3 .cse4 .cse5 .cse6 .cse19 .cse8 .cse9 .cse20 .cse10 .cse21 .cse22 .cse11 .cse23 .cse24 .cse25 .cse14 .cse15 .cse16 .cse17 .cse18 .cse26) (and .cse1 .cse2 .cse0 .cse3 .cse4 .cse5 .cse6 .cse19 .cse27 .cse8 .cse20 .cse10 .cse21 .cse22 .cse11 .cse12 .cse28 .cse23 .cse14 .cse15 .cse16 .cse18 .cse26) (and .cse1 .cse0 .cse3 .cse4 .cse5 .cse6 .cse19 .cse27 .cse8 .cse20 .cse10 .cse21 .cse22 .cse11 .cse28 .cse23 .cse24 .cse25 .cse14 .cse15 .cse16 .cse18 .cse26) (and .cse1 .cse0 .cse3 .cse4 .cse5 .cse6 .cse19 .cse27 .cse7 .cse8 .cse20 .cse10 .cse22 .cse11 .cse28 .cse23 .cse24 .cse13 .cse25 .cse14 .cse15 .cse16 .cse18) (and .cse1 .cse0 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse9 .cse20 .cse10 .cse22 .cse11 .cse23 .cse24 .cse13 .cse25 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse0 .cse3 .cse4 .cse5 .cse6 .cse19 .cse8 .cse9 .cse20 .cse10 .cse21 .cse22 .cse11 .cse12 .cse23 .cse14 .cse15 .cse16 .cse17 .cse18 .cse26) (and .cse1 .cse2 .cse0 .cse3 .cse4 .cse5 .cse6 .cse19 .cse27 .cse7 .cse8 .cse20 .cse10 .cse22 .cse11 .cse12 .cse28 .cse23 .cse13 .cse14 .cse15 .cse16 .cse18))) [2021-10-16 02:27:33,112 INFO L857 garLoopResultBuilder]: For program point L600(lines 600 604) no Hoare annotation was computed. [2021-10-16 02:27:33,112 INFO L853 garLoopResultBuilder]: At program point L468(lines 461 478) the Hoare annotation is: (let ((.cse0 (= (_ bv2 32) ~e_f~0)) (.cse1 (= (_ bv2 32) ~e_wl~0)) (.cse2 (= (_ bv1 32) ~wb_i~0)) (.cse3 (= ~c2_i~0 (_ bv1 32))) (.cse4 (= ~wb_st~0 (_ bv0 32))) (.cse5 (= (_ bv2 32) ~e_e~0)) (.cse6 (= ~c2_st~0 (_ bv0 32))) (.cse7 (= ~c1_st~0 (_ bv0 32))) (.cse8 (= (_ bv2 32) ~e_g~0)) (.cse9 (= ~c1_i~0 (_ bv1 32))) (.cse10 (= (_ bv0 32) ~r_i~0)) (.cse11 (= ~wl_pc~0 (_ bv0 32)))) (or (and (= ~c_req_up~0 (_ bv0 32)) (= (_ bv2 32) ~r_st~0) .cse0 .cse1 .cse2 .cse3 (= ~data~0 ~t_b~0) .cse4 .cse5 (= ~d~0 (_ bv0 32)) .cse6 (= (_ bv0 32) ~processed~0) (= ~wb_pc~0 (_ bv0 32)) (= ~data~0 (_ bv0 32)) .cse7 (= ~c1_pc~0 (_ bv0 32)) (= (_ bv2 32) ~e_c~0) .cse8 .cse9 .cse10 .cse11 (= ~c2_pc~0 (_ bv0 32))) (and .cse0 .cse1 .cse2 (= ~wl_st~0 (_ bv2 32)) .cse3 .cse4 (not (= (_ bv0 32) ~e_c~0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) [2021-10-16 02:27:33,112 INFO L857 garLoopResultBuilder]: For program point L469(lines 398 682) no Hoare annotation was computed. [2021-10-16 02:27:33,113 INFO L857 garLoopResultBuilder]: For program point L436-1(lines 398 682) no Hoare annotation was computed. [2021-10-16 02:27:33,113 INFO L857 garLoopResultBuilder]: For program point L304(lines 304 308) no Hoare annotation was computed. [2021-10-16 02:27:33,113 INFO L857 garLoopResultBuilder]: For program point L304-1(lines 290 388) no Hoare annotation was computed. [2021-10-16 02:27:33,113 INFO L857 garLoopResultBuilder]: For program point L668(lines 668 672) no Hoare annotation was computed. [2021-10-16 02:27:33,113 INFO L857 garLoopResultBuilder]: For program point L668-1(lines 398 682) no Hoare annotation was computed. [2021-10-16 02:27:33,113 INFO L857 garLoopResultBuilder]: For program point L470(lines 470 474) no Hoare annotation was computed. [2021-10-16 02:27:33,114 INFO L857 garLoopResultBuilder]: For program point L636-1(lines 537 677) no Hoare annotation was computed. [2021-10-16 02:27:33,114 INFO L857 garLoopResultBuilder]: For program point L538(line 538) no Hoare annotation was computed. [2021-10-16 02:27:33,114 INFO L857 garLoopResultBuilder]: For program point L571-1(lines 537 677) no Hoare annotation was computed. [2021-10-16 02:27:33,115 INFO L853 garLoopResultBuilder]: At program point L373(lines 290 388) the Hoare annotation is: (let ((.cse37 (bvadd (_ bv1 32) ~t_b~0)) (.cse50 (bvadd (_ bv2 32) ~t_b~0))) (let ((.cse45 (= .cse50 ~c_t~0)) (.cse48 (= .cse50 ~d~0)) (.cse15 (= ~wb_pc~0 (_ bv0 32))) (.cse33 (= ~d~0 (_ bv1 32))) (.cse35 (= ~c~0 (_ bv1 32))) (.cse36 (= ~c~0 .cse37)) (.cse39 (= ~data~0 ULTIMATE.start_write_loop_~t~0)) (.cse42 (= ~c1_st~0 (_ bv0 32))) (.cse43 (= ~c1_pc~0 (_ bv0 32))) (.cse40 (= ~c_req_up~0 (_ bv0 32))) (.cse44 (= ~wl_pc~0 (_ bv0 32))) (.cse24 (not (= (_ bv0 32) ~e_c~0))) (.cse27 (not (= ~wl_pc~0 (_ bv2 32)))) (.cse38 (= .cse37 ~c_t~0)) (.cse47 (= ~data~0 (_ bv1 32))) (.cse32 (= (_ bv0 32) ~t_b~0)) (.cse46 (= .cse50 ~c~0)) (.cse7 (= ~data~0 ~t_b~0)) (.cse10 (= ~d~0 (_ bv0 32))) (.cse16 (= ~data~0 (_ bv0 32))) (.cse18 (= ~wl_pc~0 (_ bv1 32))) (.cse22 (= ~c2_pc~0 (_ bv0 32))) (.cse23 (= ~data~0 .cse37)) (.cse11 (= ~c2_st~0 (_ bv0 32))) (.cse3 (not (= ~c_req_up~0 (_ bv1 32)))) (.cse41 (= (_ bv2 32) ~e_wl~0)) (.cse26 (= (_ bv2 32) ~wb_st~0)) (.cse0 (= (_ bv2 32) ~e_f~0)) (.cse1 (= (_ bv1 32) ~c1_pc~0)) (.cse2 (not (= ~e_wl~0 (_ bv1 32)))) (.cse4 (not (= (_ bv0 32) ~r_st~0))) (.cse5 (= (_ bv1 32) ~wb_i~0)) (.cse6 (= ~c2_i~0 (_ bv1 32))) (.cse8 (= ~wb_st~0 (_ bv0 32))) (.cse25 (= (_ bv1 32) ~c2_pc~0)) (.cse9 (= (_ bv2 32) ~e_e~0)) (.cse12 (= (_ bv0 32) ~processed~0)) (.cse13 (not (= ~wl_st~0 (_ bv0 32)))) (.cse14 (= (_ bv2 32) ~c1_st~0)) (.cse30 (= .cse50 ~data~0)) (.cse31 (= (_ bv2 32) ~c2_st~0)) (.cse28 (not (= ~e_wl~0 (_ bv0 32)))) (.cse17 (= (_ bv2 32) ~e_c~0)) (.cse19 (= (_ bv2 32) ~e_g~0)) (.cse20 (= ~c1_i~0 (_ bv1 32))) (.cse29 (= ~wb_pc~0 (_ bv1 32))) (.cse21 (= (_ bv0 32) ~r_i~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse11 .cse12 .cse13 .cse14 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse24 .cse25 .cse9 .cse27 .cse12 .cse13 .cse14 .cse30 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse2 (let ((.cse34 (or (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse14 .cse31 .cse28 .cse39 .cse17 .cse19 .cse20 .cse29 .cse21)))) (or (and .cse32 .cse33 .cse34 .cse35) (and .cse36 (= ~d~0 .cse37) .cse34 .cse38)))) (and .cse40 .cse0 .cse4 .cse41 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15 .cse16 .cse42 .cse43 .cse17 .cse19 .cse20 .cse21 .cse44 .cse22) (and .cse0 .cse1 .cse41 .cse5 .cse6 .cse24 .cse25 .cse9 .cse27 .cse13 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse42 .cse31 .cse43 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse42 .cse31 .cse28 .cse19 .cse20 .cse29 .cse38 .cse21) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21))) (and .cse40 .cse0 .cse4 .cse41 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse10 .cse12 .cse16 .cse42 .cse31 .cse43 .cse17 .cse19 .cse20 .cse29 .cse21 .cse44) (and .cse0 .cse1 .cse3 .cse41 .cse5 .cse6 .cse7 .cse25 .cse9 .cse32 .cse26 .cse10 .cse13 .cse14 .cse35 .cse31 .cse39 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse45 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse24 .cse25 .cse9 .cse27 .cse11 .cse12 .cse13 .cse14 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse12 .cse13 .cse16 .cse42 .cse43 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21 .cse22) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse12 .cse13 .cse42 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse40 .cse0 .cse4 .cse41 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse12 .cse15 .cse16 .cse42 .cse31 .cse43 .cse17 .cse19 .cse20 .cse21 .cse44) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse25 .cse9 .cse12 .cse13 .cse42 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse11 .cse12 .cse13 .cse42 .cse28 .cse39 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse14 .cse30 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse14 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse14 .cse31 .cse28 .cse39 .cse19 .cse20 .cse29 .cse21))) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse42 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse38 .cse21) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse46 .cse28 .cse17 .cse45 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse47 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse31 .cse46 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21 .cse48) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse30 .cse31 .cse46 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21 .cse48))) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse14 .cse31 .cse28 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse30 .cse31 .cse28 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse31 .cse28 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21))) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse11 .cse13 .cse14 .cse28 .cse17 .cse19 .cse20 .cse29 .cse38 .cse21) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse30 .cse31 .cse46 .cse28 .cse17 .cse45 .cse19 .cse20 .cse29 .cse21 .cse48) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse47 .cse25 .cse9 .cse32 .cse26 .cse14 .cse31 .cse46 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21 .cse48) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse32 .cse26 .cse14 .cse30 .cse31 .cse46 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21 .cse48))) (and .cse2 .cse10 .cse35 (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse5 .cse6 .cse47 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21))) (and .cse40 .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse12 .cse14 .cse16 .cse17 .cse19 .cse20 .cse29 .cse21 .cse44 .cse22) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse12 .cse13 .cse42 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse25 .cse9 .cse11 .cse12 .cse13 .cse14 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse24 .cse25 .cse9 .cse26 .cse27 .cse11 .cse12 .cse13 .cse42 .cse28 .cse39 .cse19 .cse20 .cse29 .cse21) (and .cse2 (or (and .cse23 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21))) (and .cse40 .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse31 .cse17 .cse19 .cse20 .cse21 .cse44) (and .cse40 .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse44 .cse22) (and .cse2 (or (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse39 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21)) .cse38) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse24 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse31 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse24 .cse25 .cse9 .cse27 .cse12 .cse13 .cse42 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse42 .cse43 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse41 .cse5 .cse6 .cse24 .cse9 .cse13 .cse19 .cse20 .cse21 .cse44) (and .cse2 (or (and .cse23 .cse0 .cse1 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse14 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse14 .cse30 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21))) (and .cse2 (let ((.cse49 (or (and .cse23 .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse39 .cse17 .cse19 .cse20 .cse29 .cse21)))) (or (and .cse32 .cse33 .cse35 .cse49) (and .cse36 .cse49 .cse38)))) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse10 .cse12 .cse13 .cse16 .cse42 .cse31 .cse43 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse40 .cse0 .cse4 .cse41 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse12 .cse16 .cse42 .cse43 .cse17 .cse19 .cse20 .cse29 .cse21 .cse44 .cse22) (and .cse40 .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse10 .cse12 .cse14 .cse16 .cse31 .cse17 .cse19 .cse20 .cse29 .cse21 .cse44) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse11 .cse13 .cse14 .cse28 .cse19 .cse20 .cse29 .cse38 .cse21) (and .cse2 .cse10 (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse30 .cse31 .cse46 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse47 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse31 .cse46 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21 .cse22) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse11 .cse12 .cse13 .cse14 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse41 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse25 .cse9 .cse12 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21)))) [2021-10-16 02:27:33,115 INFO L857 garLoopResultBuilder]: For program point L506-1(lines 398 682) no Hoare annotation was computed. [2021-10-16 02:27:33,115 INFO L857 garLoopResultBuilder]: For program point L441-1(lines 398 682) no Hoare annotation was computed. [2021-10-16 02:27:33,115 INFO L857 garLoopResultBuilder]: For program point L111(lines 111 121) no Hoare annotation was computed. [2021-10-16 02:27:33,115 INFO L853 garLoopResultBuilder]: At program point L343(lines 290 388) the Hoare annotation is: (let ((.cse37 (bvadd (_ bv1 32) ~t_b~0)) (.cse50 (bvadd (_ bv2 32) ~t_b~0))) (let ((.cse15 (= ~wb_pc~0 (_ bv0 32))) (.cse46 (= .cse50 ~c_t~0)) (.cse48 (= .cse50 ~d~0)) (.cse33 (= ~d~0 (_ bv1 32))) (.cse35 (= ~c~0 (_ bv1 32))) (.cse36 (= ~c~0 .cse37)) (.cse39 (= ~data~0 ULTIMATE.start_write_loop_~t~0)) (.cse42 (= ~c1_st~0 (_ bv0 32))) (.cse43 (= ~c1_pc~0 (_ bv0 32))) (.cse40 (= ~c_req_up~0 (_ bv0 32))) (.cse44 (= ~wl_pc~0 (_ bv0 32))) (.cse47 (= ~data~0 (_ bv1 32))) (.cse32 (= (_ bv0 32) ~t_b~0)) (.cse45 (= .cse50 ~c~0)) (.cse7 (= ~data~0 ~t_b~0)) (.cse10 (= ~d~0 (_ bv0 32))) (.cse16 (= ~data~0 (_ bv0 32))) (.cse18 (= ~wl_pc~0 (_ bv1 32))) (.cse22 (= ~c2_pc~0 (_ bv0 32))) (.cse11 (= ~c2_st~0 (_ bv0 32))) (.cse3 (not (= ~c_req_up~0 (_ bv1 32)))) (.cse41 (= (_ bv2 32) ~e_wl~0)) (.cse23 (= ~data~0 .cse37)) (.cse24 (not (= (_ bv0 32) ~e_c~0))) (.cse26 (= (_ bv2 32) ~wb_st~0)) (.cse27 (not (= ~wl_pc~0 (_ bv2 32)))) (.cse38 (= .cse37 ~c_t~0)) (.cse0 (= (_ bv2 32) ~e_f~0)) (.cse1 (= (_ bv1 32) ~c1_pc~0)) (.cse2 (not (= ~e_wl~0 (_ bv1 32)))) (.cse4 (not (= (_ bv0 32) ~r_st~0))) (.cse5 (= (_ bv1 32) ~wb_i~0)) (.cse6 (= ~c2_i~0 (_ bv1 32))) (.cse8 (= ~wb_st~0 (_ bv0 32))) (.cse25 (= (_ bv1 32) ~c2_pc~0)) (.cse9 (= (_ bv2 32) ~e_e~0)) (.cse12 (= (_ bv0 32) ~processed~0)) (.cse13 (not (= ~wl_st~0 (_ bv0 32)))) (.cse14 (= (_ bv2 32) ~c1_st~0)) (.cse30 (= .cse50 ~data~0)) (.cse31 (= (_ bv2 32) ~c2_st~0)) (.cse28 (not (= ~e_wl~0 (_ bv0 32)))) (.cse17 (= (_ bv2 32) ~e_c~0)) (.cse19 (= (_ bv2 32) ~e_g~0)) (.cse20 (= ~c1_i~0 (_ bv1 32))) (.cse29 (= ~wb_pc~0 (_ bv1 32))) (.cse21 (= (_ bv0 32) ~r_i~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse11 .cse12 .cse13 .cse14 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse24 .cse25 .cse9 .cse27 .cse12 .cse13 .cse14 .cse30 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse2 (let ((.cse34 (or (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse14 .cse31 .cse28 .cse39 .cse17 .cse19 .cse20 .cse29 .cse21)))) (or (and .cse32 .cse33 .cse34 .cse35) (and .cse36 (= ~d~0 .cse37) .cse34 .cse38)))) (and .cse40 .cse0 .cse4 .cse41 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15 .cse16 .cse42 .cse43 .cse17 .cse19 .cse20 .cse21 .cse44 .cse22) (and .cse0 .cse1 .cse41 .cse5 .cse6 .cse24 .cse25 .cse9 .cse27 .cse13 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse42 .cse31 .cse43 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse42 .cse31 .cse28 .cse19 .cse20 .cse29 .cse38 .cse21) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21))) (and .cse40 .cse0 .cse4 .cse41 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse10 .cse12 .cse16 .cse42 .cse31 .cse43 .cse17 .cse19 .cse20 .cse29 .cse21 .cse44) (and .cse0 .cse1 .cse3 .cse41 .cse5 .cse6 .cse7 .cse25 .cse9 .cse32 .cse26 .cse10 .cse13 .cse14 .cse35 .cse31 .cse39 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse24 .cse25 .cse9 .cse27 .cse11 .cse12 .cse13 .cse14 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse12 .cse13 .cse16 .cse42 .cse43 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21 .cse22) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse12 .cse13 .cse42 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse40 .cse0 .cse4 .cse41 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse12 .cse15 .cse16 .cse42 .cse31 .cse43 .cse17 .cse19 .cse20 .cse21 .cse44) (and .cse2 (or (and .cse23 .cse0 .cse1 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse28 .cse18 .cse19 .cse20 .cse29 .cse21))) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse25 .cse9 .cse12 .cse13 .cse42 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse11 .cse12 .cse13 .cse42 .cse28 .cse39 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse14 .cse30 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse14 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse14 .cse31 .cse28 .cse39 .cse19 .cse20 .cse29 .cse21))) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse42 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse38 .cse21) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse45 .cse28 .cse17 .cse46 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse47 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse31 .cse45 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21 .cse48) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse30 .cse31 .cse45 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21 .cse48))) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse14 .cse31 .cse28 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse30 .cse31 .cse28 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse31 .cse28 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21))) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse11 .cse13 .cse14 .cse28 .cse17 .cse19 .cse20 .cse29 .cse38 .cse21) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse30 .cse31 .cse45 .cse28 .cse17 .cse46 .cse19 .cse20 .cse29 .cse21 .cse48) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse47 .cse25 .cse9 .cse32 .cse26 .cse14 .cse31 .cse45 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21 .cse48) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse32 .cse26 .cse14 .cse30 .cse31 .cse45 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21 .cse48))) (and .cse2 .cse10 .cse35 (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse5 .cse6 .cse47 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21))) (and .cse40 .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse12 .cse14 .cse16 .cse17 .cse19 .cse20 .cse29 .cse21 .cse44 .cse22) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse12 .cse13 .cse42 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse25 .cse9 .cse11 .cse12 .cse13 .cse14 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse24 .cse25 .cse9 .cse26 .cse27 .cse11 .cse12 .cse13 .cse42 .cse28 .cse39 .cse19 .cse20 .cse29 .cse21) (and .cse2 (or (and .cse23 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21))) (and .cse40 .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse31 .cse17 .cse19 .cse20 .cse21 .cse44) (and .cse40 .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse44 .cse22) (and .cse2 (or (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse39 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21)) .cse38) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse24 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse31 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse24 .cse25 .cse9 .cse27 .cse12 .cse13 .cse42 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse42 .cse43 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse30 .cse31 .cse45 .cse17 .cse46 .cse19 .cse20 .cse29 .cse21 .cse48) (and .cse0 .cse41 .cse5 .cse6 .cse24 .cse9 .cse13 .cse19 .cse20 .cse21 .cse44) (and .cse2 (let ((.cse49 (or (and .cse23 .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse39 .cse17 .cse19 .cse20 .cse29 .cse21)))) (or (and .cse32 .cse33 .cse35 .cse49) (and .cse36 .cse49 .cse38)))) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse10 .cse12 .cse13 .cse16 .cse42 .cse31 .cse43 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse40 .cse0 .cse4 .cse41 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse12 .cse16 .cse42 .cse43 .cse17 .cse19 .cse20 .cse29 .cse21 .cse44 .cse22) (and .cse40 .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse10 .cse12 .cse14 .cse16 .cse31 .cse17 .cse19 .cse20 .cse29 .cse21 .cse44) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse11 .cse13 .cse14 .cse28 .cse19 .cse20 .cse29 .cse38 .cse21) (and .cse2 .cse10 (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse30 .cse31 .cse45 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse47 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse31 .cse45 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21 .cse22) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse11 .cse12 .cse13 .cse14 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse41 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse2 (or (and .cse23 .cse0 .cse1 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse14 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse14 .cse30 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21)) .cse38) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse25 .cse9 .cse12 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21)))) [2021-10-16 02:27:33,116 INFO L857 garLoopResultBuilder]: For program point L178(lines 178 186) no Hoare annotation was computed. [2021-10-16 02:27:33,116 INFO L857 garLoopResultBuilder]: For program point L145(line 145) no Hoare annotation was computed. [2021-10-16 02:27:33,116 INFO L857 garLoopResultBuilder]: For program point L608(lines 537 677) no Hoare annotation was computed. [2021-10-16 02:27:33,116 INFO L857 garLoopResultBuilder]: For program point L641-1(lines 537 677) no Hoare annotation was computed. [2021-10-16 02:27:33,116 INFO L857 garLoopResultBuilder]: For program point L377(lines 377 384) no Hoare annotation was computed. [2021-10-16 02:27:33,116 INFO L857 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2021-10-16 02:27:33,116 INFO L857 garLoopResultBuilder]: For program point L609(lines 609 613) no Hoare annotation was computed. [2021-10-16 02:27:33,116 INFO L857 garLoopResultBuilder]: For program point L576-1(lines 537 677) no Hoare annotation was computed. [2021-10-16 02:27:33,116 INFO L857 garLoopResultBuilder]: For program point L411-1(lines 398 682) no Hoare annotation was computed. [2021-10-16 02:27:33,116 INFO L857 garLoopResultBuilder]: For program point L114(lines 114 120) no Hoare annotation was computed. [2021-10-16 02:27:33,116 INFO L857 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2021-10-16 02:27:33,116 INFO L853 garLoopResultBuilder]: At program point L709(lines 684 711) the Hoare annotation is: (= ~c2_i~0 (_ bv1 32)) [2021-10-16 02:27:33,116 INFO L857 garLoopResultBuilder]: For program point L544(lines 544 554) no Hoare annotation was computed. [2021-10-16 02:27:33,116 INFO L857 garLoopResultBuilder]: For program point L511-1(lines 398 682) no Hoare annotation was computed. [2021-10-16 02:27:33,116 INFO L857 garLoopResultBuilder]: For program point L544-2(lines 544 554) no Hoare annotation was computed. [2021-10-16 02:27:33,117 INFO L853 garLoopResultBuilder]: At program point L313(lines 290 388) the Hoare annotation is: (let ((.cse37 (bvadd (_ bv1 32) ~t_b~0)) (.cse50 (bvadd (_ bv2 32) ~t_b~0))) (let ((.cse15 (= ~wb_pc~0 (_ bv0 32))) (.cse46 (= .cse50 ~c_t~0)) (.cse48 (= .cse50 ~d~0)) (.cse33 (= ~d~0 (_ bv1 32))) (.cse35 (= ~c~0 (_ bv1 32))) (.cse36 (= ~c~0 .cse37)) (.cse39 (= ~data~0 ULTIMATE.start_write_loop_~t~0)) (.cse42 (= ~c1_st~0 (_ bv0 32))) (.cse43 (= ~c1_pc~0 (_ bv0 32))) (.cse40 (= ~c_req_up~0 (_ bv0 32))) (.cse44 (= ~wl_pc~0 (_ bv0 32))) (.cse24 (not (= (_ bv0 32) ~e_c~0))) (.cse27 (not (= ~wl_pc~0 (_ bv2 32)))) (.cse38 (= .cse37 ~c_t~0)) (.cse47 (= ~data~0 (_ bv1 32))) (.cse32 (= (_ bv0 32) ~t_b~0)) (.cse45 (= .cse50 ~c~0)) (.cse7 (= ~data~0 ~t_b~0)) (.cse10 (= ~d~0 (_ bv0 32))) (.cse16 (= ~data~0 (_ bv0 32))) (.cse18 (= ~wl_pc~0 (_ bv1 32))) (.cse22 (= ~c2_pc~0 (_ bv0 32))) (.cse23 (= ~data~0 .cse37)) (.cse11 (= ~c2_st~0 (_ bv0 32))) (.cse3 (not (= ~c_req_up~0 (_ bv1 32)))) (.cse41 (= (_ bv2 32) ~e_wl~0)) (.cse26 (= (_ bv2 32) ~wb_st~0)) (.cse0 (= (_ bv2 32) ~e_f~0)) (.cse1 (= (_ bv1 32) ~c1_pc~0)) (.cse2 (not (= ~e_wl~0 (_ bv1 32)))) (.cse4 (not (= (_ bv0 32) ~r_st~0))) (.cse5 (= (_ bv1 32) ~wb_i~0)) (.cse6 (= ~c2_i~0 (_ bv1 32))) (.cse8 (= ~wb_st~0 (_ bv0 32))) (.cse25 (= (_ bv1 32) ~c2_pc~0)) (.cse9 (= (_ bv2 32) ~e_e~0)) (.cse12 (= (_ bv0 32) ~processed~0)) (.cse13 (not (= ~wl_st~0 (_ bv0 32)))) (.cse14 (= (_ bv2 32) ~c1_st~0)) (.cse30 (= .cse50 ~data~0)) (.cse31 (= (_ bv2 32) ~c2_st~0)) (.cse28 (not (= ~e_wl~0 (_ bv0 32)))) (.cse17 (= (_ bv2 32) ~e_c~0)) (.cse19 (= (_ bv2 32) ~e_g~0)) (.cse20 (= ~c1_i~0 (_ bv1 32))) (.cse29 (= ~wb_pc~0 (_ bv1 32))) (.cse21 (= (_ bv0 32) ~r_i~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse11 .cse12 .cse13 .cse14 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse24 .cse25 .cse9 .cse27 .cse12 .cse13 .cse14 .cse30 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse2 (let ((.cse34 (or (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse14 .cse31 .cse28 .cse39 .cse17 .cse19 .cse20 .cse29 .cse21)))) (or (and .cse32 .cse33 .cse34 .cse35) (and .cse36 (= ~d~0 .cse37) .cse34 .cse38)))) (and .cse40 .cse0 .cse4 .cse41 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15 .cse16 .cse42 .cse43 .cse17 .cse19 .cse20 .cse21 .cse44 .cse22) (and .cse0 .cse1 .cse41 .cse5 .cse6 .cse24 .cse25 .cse9 .cse27 .cse13 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse42 .cse31 .cse43 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse42 .cse31 .cse28 .cse19 .cse20 .cse29 .cse38 .cse21) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21))) (and .cse40 .cse0 .cse4 .cse41 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse10 .cse12 .cse16 .cse42 .cse31 .cse43 .cse17 .cse19 .cse20 .cse29 .cse21 .cse44) (and .cse0 .cse1 .cse3 .cse41 .cse5 .cse6 .cse7 .cse25 .cse9 .cse32 .cse26 .cse10 .cse13 .cse14 .cse35 .cse31 .cse39 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse24 .cse25 .cse9 .cse27 .cse11 .cse12 .cse13 .cse14 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse12 .cse13 .cse16 .cse42 .cse43 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21 .cse22) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse12 .cse13 .cse42 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse40 .cse0 .cse4 .cse41 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse12 .cse15 .cse16 .cse42 .cse31 .cse43 .cse17 .cse19 .cse20 .cse21 .cse44) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse25 .cse9 .cse12 .cse13 .cse42 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse11 .cse12 .cse13 .cse42 .cse28 .cse39 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse14 .cse30 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse14 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse14 .cse31 .cse28 .cse39 .cse19 .cse20 .cse29 .cse21))) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse42 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse38 .cse21) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse45 .cse28 .cse17 .cse46 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse47 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse31 .cse45 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21 .cse48) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse30 .cse31 .cse45 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21 .cse48))) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse14 .cse31 .cse28 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse30 .cse31 .cse28 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse31 .cse28 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21))) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse11 .cse13 .cse14 .cse28 .cse17 .cse19 .cse20 .cse29 .cse38 .cse21) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse30 .cse31 .cse45 .cse28 .cse17 .cse46 .cse19 .cse20 .cse29 .cse21 .cse48) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse47 .cse25 .cse9 .cse32 .cse26 .cse14 .cse31 .cse45 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21 .cse48) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse32 .cse26 .cse14 .cse30 .cse31 .cse45 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21 .cse48))) (and .cse2 .cse10 .cse35 (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse5 .cse6 .cse47 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21))) (and .cse40 .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse12 .cse14 .cse16 .cse17 .cse19 .cse20 .cse29 .cse21 .cse44 .cse22) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse12 .cse13 .cse42 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse25 .cse9 .cse11 .cse12 .cse13 .cse14 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse24 .cse25 .cse9 .cse26 .cse27 .cse11 .cse12 .cse13 .cse42 .cse28 .cse39 .cse19 .cse20 .cse29 .cse21) (and .cse2 (or (and .cse23 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21))) (and .cse40 .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse31 .cse17 .cse19 .cse20 .cse21 .cse44) (and .cse40 .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse44 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse24 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse31 .cse17 .cse18 .cse19 .cse20 .cse21) (and (= (_ bv1 32) ~c_t~0) (or (and .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse17 .cse19 .cse20 .cse29 .cse21)) .cse32 .cse33 .cse35) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse24 .cse25 .cse9 .cse27 .cse12 .cse13 .cse42 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse42 .cse43 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse30 .cse31 .cse45 .cse17 .cse46 .cse19 .cse20 .cse29 .cse21 .cse48) (and .cse0 .cse41 .cse5 .cse6 .cse24 .cse9 .cse13 .cse19 .cse20 .cse21 .cse44) (and .cse2 (let ((.cse49 (or (and .cse23 .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse39 .cse17 .cse19 .cse20 .cse29 .cse21)))) (or (and .cse32 .cse33 .cse35 .cse49) (and .cse36 .cse49 .cse38)))) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse10 .cse12 .cse13 .cse16 .cse42 .cse31 .cse43 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse40 .cse0 .cse4 .cse41 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse12 .cse16 .cse42 .cse43 .cse17 .cse19 .cse20 .cse29 .cse21 .cse44 .cse22) (and .cse40 .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse10 .cse12 .cse14 .cse16 .cse31 .cse17 .cse19 .cse20 .cse29 .cse21 .cse44) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse11 .cse13 .cse14 .cse28 .cse19 .cse20 .cse29 .cse38 .cse21) (and .cse2 .cse10 (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse30 .cse31 .cse45 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse47 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse31 .cse45 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21 .cse22) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse11 .cse12 .cse13 .cse14 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse41 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse25 .cse9 .cse12 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21)))) [2021-10-16 02:27:33,118 INFO L857 garLoopResultBuilder]: For program point L181(lines 181 185) no Hoare annotation was computed. [2021-10-16 02:27:33,118 INFO L853 garLoopResultBuilder]: At program point L16(lines 57 127) the Hoare annotation is: (and (not (= ~e_wl~0 (_ bv1 32))) (let ((.cse0 (let ((.cse10 (= ~c2_st~0 (_ bv0 32))) (.cse12 (= (_ bv2 32) ~c1_st~0)) (.cse1 (= (_ bv2 32) ~e_f~0)) (.cse2 (= (_ bv1 32) ~c1_pc~0)) (.cse3 (not (= ~c_req_up~0 (_ bv1 32)))) (.cse4 (not (= (_ bv0 32) ~r_st~0))) (.cse5 (= (_ bv1 32) ~wb_i~0)) (.cse6 (= ~c2_i~0 (_ bv1 32))) (.cse7 (= (_ bv1 32) ~c2_pc~0)) (.cse8 (= (_ bv2 32) ~e_e~0)) (.cse9 (= (_ bv2 32) ~wb_st~0)) (.cse11 (not (= ~wl_st~0 (_ bv0 32)))) (.cse19 (= ~c1_st~0 (_ bv0 32))) (.cse20 (= (_ bv2 32) ~c2_st~0)) (.cse13 (not (= ~e_wl~0 (_ bv0 32)))) (.cse14 (= (_ bv2 32) ~e_c~0)) (.cse15 (= (_ bv2 32) ~e_g~0)) (.cse16 (= ~c1_i~0 (_ bv1 32))) (.cse17 (= ~wb_pc~0 (_ bv1 32))) (.cse18 (= (_ bv0 32) ~r_i~0))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse20 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse19 .cse20 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))))) (or (and .cse0 (= ~data~0 ~t_b~0)) (and .cse0 (= (bvadd (_ bv2 32) ~t_b~0) ~data~0)) (and (= ~data~0 (bvadd (_ bv1 32) ~t_b~0)) .cse0)))) [2021-10-16 02:27:33,118 INFO L857 garLoopResultBuilder]: For program point L545(lines 545 550) no Hoare annotation was computed. [2021-10-16 02:27:33,118 INFO L857 garLoopResultBuilder]: For program point L479(lines 398 682) no Hoare annotation was computed. [2021-10-16 02:27:33,118 INFO L857 garLoopResultBuilder]: For program point L545-2(lines 545 550) no Hoare annotation was computed. [2021-10-16 02:27:33,119 INFO L857 garLoopResultBuilder]: For program point L446-1(lines 398 682) no Hoare annotation was computed. [2021-10-16 02:27:33,119 INFO L857 garLoopResultBuilder]: For program point L347(lines 347 354) no Hoare annotation was computed. [2021-10-16 02:27:33,119 INFO L853 garLoopResultBuilder]: At program point L182(lines 177 217) the Hoare annotation is: (let ((.cse29 (bvadd (_ bv1 32) ~t_b~0))) (let ((.cse24 (= ~data~0 ~t_b~0)) (.cse25 (= ~c1_st~0 (_ bv0 32))) (.cse26 (= ~data~0 ULTIMATE.start_write_loop_~t~0)) (.cse16 (not (= ~c_req_up~0 (_ bv1 32)))) (.cse22 (= (_ bv2 32) ~e_c~0)) (.cse2 (= (_ bv2 32) ~e_wl~0)) (.cse18 (= (_ bv2 32) ~wb_st~0)) (.cse28 (= .cse29 ~c_t~0)) (.cse14 (= ~data~0 .cse29)) (.cse0 (= (_ bv2 32) ~e_f~0)) (.cse1 (= (_ bv1 32) ~c1_pc~0)) (.cse15 (not (= ~e_wl~0 (_ bv1 32)))) (.cse17 (not (= (_ bv0 32) ~r_st~0))) (.cse3 (= (_ bv1 32) ~wb_i~0)) (.cse4 (= ~c2_i~0 (_ bv1 32))) (.cse27 (= ~wb_st~0 (_ bv0 32))) (.cse5 (not (= (_ bv0 32) ~e_c~0))) (.cse6 (= (_ bv1 32) ~c2_pc~0)) (.cse7 (= (_ bv2 32) ~e_e~0)) (.cse8 (not (= ~wl_pc~0 (_ bv2 32)))) (.cse19 (= (_ bv0 32) ~processed~0)) (.cse9 (not (= ~wl_st~0 (_ bv0 32)))) (.cse20 (= (_ bv2 32) ~c1_st~0)) (.cse21 (not (= ~e_wl~0 (_ bv0 32)))) (.cse10 (= (_ bv2 32) ~e_g~0)) (.cse23 (not (= ~c2_st~0 (_ bv0 32)))) (.cse11 (= ~c1_i~0 (_ bv1 32))) (.cse12 (= ~wb_pc~0 (_ bv1 32))) (.cse13 (= (_ bv0 32) ~r_i~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse0 .cse1 .cse15 .cse16 .cse17 .cse3 .cse4 .cse6 .cse7 .cse18 .cse19 .cse9 .cse20 .cse21 .cse22 .cse10 .cse23 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse15 .cse16 .cse17 .cse3 .cse4 .cse24 .cse5 .cse6 .cse7 .cse18 .cse8 .cse19 .cse9 .cse25 .cse21 .cse26 .cse10 .cse23 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse15 .cse16 .cse17 .cse3 .cse4 .cse24 .cse6 .cse7 .cse18 .cse19 .cse9 .cse25 .cse21 .cse26 .cse22 .cse10 .cse23 .cse11 .cse12 .cse13) (and .cse14 .cse0 .cse1 .cse15 .cse17 .cse3 .cse4 .cse27 .cse6 .cse7 .cse19 .cse9 .cse20 .cse21 .cse22 .cse10 .cse23 .cse11 .cse12 .cse13) (and .cse14 .cse0 .cse1 .cse15 .cse16 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse18 .cse8 .cse19 .cse9 .cse20 .cse21 .cse10 .cse23 .cse11 .cse12 .cse13) (and .cse14 .cse0 .cse1 .cse15 .cse17 .cse3 .cse4 .cse6 .cse7 .cse18 .cse9 .cse20 .cse21 .cse22 .cse10 .cse23 .cse11 .cse12 .cse28 .cse13) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse13 (= ~wl_pc~0 (_ bv0 32))) (and .cse14 .cse0 .cse1 .cse15 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse18 .cse8 .cse9 .cse20 .cse21 .cse10 .cse23 .cse11 .cse12 .cse28 .cse13) (and .cse14 .cse0 .cse1 .cse15 .cse17 .cse3 .cse4 .cse27 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse20 .cse21 .cse10 .cse23 .cse11 .cse12 .cse13)))) [2021-10-16 02:27:33,119 INFO L853 garLoopResultBuilder]: At program point L678(lines 395 683) the Hoare annotation is: (= ~c2_i~0 (_ bv1 32)) [2021-10-16 02:27:33,119 INFO L857 garLoopResultBuilder]: For program point L480(lines 480 484) no Hoare annotation was computed. [2021-10-16 02:27:33,120 INFO L857 garLoopResultBuilder]: For program point L646-1(lines 537 677) no Hoare annotation was computed. [2021-10-16 02:27:33,120 INFO L853 garLoopResultBuilder]: At program point L151-1(lines 132 172) the Hoare annotation is: (let ((.cse36 (bvadd (_ bv1 32) ~t_b~0))) (let ((.cse20 (= ~c2_pc~0 (_ bv0 32))) (.cse0 (= ~c_req_up~0 (_ bv0 32))) (.cse3 (= (_ bv2 32) ~e_wl~0)) (.cse19 (= ~wl_pc~0 (_ bv0 32))) (.cse35 (= .cse36 ~c_t~0)) (.cse34 (= ~data~0 .cse36)) (.cse11 (= ~c2_st~0 (_ bv0 32))) (.cse7 (= ~data~0 ~t_b~0)) (.cse8 (= ~wb_st~0 (_ bv0 32))) (.cse10 (= ~d~0 (_ bv0 32))) (.cse13 (= ~wb_pc~0 (_ bv0 32))) (.cse14 (= ~data~0 (_ bv0 32))) (.cse15 (= (_ bv2 32) ~e_c~0)) (.cse33 (= ~wl_pc~0 (_ bv1 32))) (.cse1 (= (_ bv2 32) ~e_f~0)) (.cse23 (= (_ bv1 32) ~c1_pc~0)) (.cse24 (not (= ~e_wl~0 (_ bv1 32)))) (.cse32 (not (= ~c_req_up~0 (_ bv1 32)))) (.cse2 (not (= (_ bv0 32) ~r_st~0))) (.cse4 (= (_ bv1 32) ~wb_i~0)) (.cse5 (not (= ~c1_st~0 (_ bv0 32)))) (.cse6 (= ~c2_i~0 (_ bv1 32))) (.cse30 (not (= (_ bv0 32) ~e_c~0))) (.cse25 (= (_ bv1 32) ~c2_pc~0)) (.cse9 (= (_ bv2 32) ~e_e~0)) (.cse21 (= (_ bv2 32) ~wb_st~0)) (.cse31 (not (= ~wl_pc~0 (_ bv2 32)))) (.cse12 (= (_ bv0 32) ~processed~0)) (.cse26 (not (= ~wl_st~0 (_ bv0 32)))) (.cse27 (= (bvadd (_ bv2 32) ~t_b~0) ~data~0)) (.cse28 (= (_ bv2 32) ~c2_st~0)) (.cse29 (not (= ~e_wl~0 (_ bv0 32)))) (.cse16 (= (_ bv2 32) ~e_g~0)) (.cse17 (= ~c1_i~0 (_ bv1 32))) (.cse22 (= ~wb_pc~0 (_ bv1 32))) (.cse18 (= (_ bv0 32) ~r_i~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse21 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse22 .cse18 .cse19 .cse20) (and .cse1 .cse23 .cse24 .cse2 .cse4 .cse5 .cse6 .cse8 .cse25 .cse9 .cse12 .cse26 .cse27 .cse28 .cse29 .cse15 .cse16 .cse17 .cse22 .cse18) (and .cse1 .cse23 .cse3 .cse4 .cse6 .cse30 .cse25 .cse9 .cse31 .cse26 .cse16 .cse17 .cse22 .cse18) (and .cse1 .cse23 .cse32 .cse2 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse21 .cse26 .cse28 .cse15 .cse16 .cse17 .cse22 .cse18) (and .cse1 .cse24 .cse32 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse26 .cse13 .cse14 .cse15 .cse33 .cse16 .cse17 .cse18 .cse20) (and .cse24 (or (and .cse34 .cse1 .cse23 .cse2 .cse4 .cse5 .cse6 .cse30 .cse25 .cse9 .cse21 .cse31 .cse26 .cse28 .cse29 .cse16 .cse17 .cse22 .cse18) (and .cse1 .cse23 .cse2 .cse4 .cse5 .cse6 .cse30 .cse25 .cse9 .cse21 .cse31 .cse26 .cse27 .cse28 .cse29 .cse16 .cse17 .cse22 .cse18)) .cse35) (and .cse1 .cse24 .cse32 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse21 .cse10 .cse11 .cse12 .cse26 .cse14 .cse15 .cse33 .cse16 .cse17 .cse22 .cse18 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse21 .cse10 .cse12 .cse14 .cse28 .cse15 .cse16 .cse17 .cse22 .cse18 .cse19) (and .cse34 .cse1 .cse23 .cse24 .cse2 .cse4 .cse5 .cse6 .cse8 .cse30 .cse25 .cse9 .cse31 .cse11 .cse12 .cse26 .cse29 .cse16 .cse17 .cse22 .cse18) (and .cse1 .cse23 .cse24 .cse32 .cse2 .cse4 .cse5 .cse6 .cse25 .cse9 .cse21 .cse12 .cse26 .cse27 .cse28 .cse29 .cse15 .cse16 .cse17 .cse22 .cse18) (and .cse1 .cse24 .cse32 .cse2 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse21 .cse10 .cse12 .cse26 .cse14 .cse28 .cse15 .cse33 .cse16 .cse17 .cse22 .cse18) (and .cse1 .cse24 .cse32 .cse2 .cse4 .cse5 .cse6 .cse25 .cse9 .cse21 .cse12 .cse26 .cse27 .cse28 .cse15 .cse33 .cse16 .cse17 .cse22 .cse18) (and .cse1 .cse23 .cse24 .cse2 .cse4 .cse5 .cse6 .cse8 .cse30 .cse25 .cse9 .cse31 .cse12 .cse26 .cse27 .cse28 .cse29 .cse16 .cse17 .cse22 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse12 .cse13 .cse14 .cse28 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse34 .cse1 .cse23 .cse24 .cse32 .cse2 .cse4 .cse5 .cse6 .cse30 .cse25 .cse9 .cse21 .cse31 .cse11 .cse12 .cse26 .cse29 .cse16 .cse17 .cse22 .cse18) (and .cse34 .cse1 .cse23 .cse24 .cse2 .cse4 .cse5 .cse6 .cse8 .cse25 .cse9 .cse11 .cse12 .cse26 .cse29 .cse15 .cse16 .cse17 .cse22 .cse18) (and .cse1 .cse3 .cse4 .cse6 .cse30 .cse9 .cse26 .cse16 .cse17 .cse18 .cse19) (and .cse24 .cse35 (or (and .cse1 .cse23 .cse2 .cse4 .cse5 .cse6 .cse25 .cse9 .cse21 .cse26 .cse27 .cse28 .cse29 .cse15 .cse16 .cse17 .cse22 .cse18) (and .cse1 .cse23 .cse2 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse21 .cse26 .cse28 .cse29 (= ~data~0 ULTIMATE.start_write_loop_~t~0) .cse15 .cse16 .cse17 .cse22 .cse18) (and .cse34 .cse1 .cse23 .cse2 .cse4 .cse5 .cse6 .cse25 .cse9 .cse21 .cse26 .cse28 .cse29 .cse15 .cse16 .cse17 .cse22 .cse18))) (and .cse34 .cse1 .cse23 .cse24 .cse32 .cse2 .cse4 .cse5 .cse6 .cse25 .cse9 .cse21 .cse11 .cse12 .cse26 .cse29 .cse15 .cse16 .cse17 .cse22 .cse18) (and .cse1 .cse24 .cse32 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse12 .cse26 .cse13 .cse14 .cse28 .cse15 .cse33 .cse16 .cse17 .cse18) (and .cse1 .cse23 .cse24 .cse32 .cse2 .cse4 .cse5 .cse6 .cse30 .cse25 .cse9 .cse21 .cse31 .cse12 .cse26 .cse27 .cse28 .cse29 .cse16 .cse17 .cse22 .cse18)))) [2021-10-16 02:27:33,120 INFO L857 garLoopResultBuilder]: For program point L85(lines 85 93) no Hoare annotation was computed. [2021-10-16 02:27:33,120 INFO L857 garLoopResultBuilder]: For program point L85-1(lines 79 122) no Hoare annotation was computed. [2021-10-16 02:27:33,121 INFO L857 garLoopResultBuilder]: For program point L416-1(lines 398 682) no Hoare annotation was computed. [2021-10-16 02:27:33,121 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-16 02:27:33,121 INFO L857 garLoopResultBuilder]: For program point L317(lines 317 324) no Hoare annotation was computed. [2021-10-16 02:27:33,121 INFO L857 garLoopResultBuilder]: For program point L86(lines 86 90) no Hoare annotation was computed. [2021-10-16 02:27:33,121 INFO L857 garLoopResultBuilder]: For program point L582(lines 582 586) no Hoare annotation was computed. [2021-10-16 02:27:33,121 INFO L857 garLoopResultBuilder]: For program point L516-1(lines 398 682) no Hoare annotation was computed. [2021-10-16 02:27:33,121 INFO L857 garLoopResultBuilder]: For program point L451-1(lines 398 682) no Hoare annotation was computed. [2021-10-16 02:27:33,122 INFO L857 garLoopResultBuilder]: For program point L154(lines 154 162) no Hoare annotation was computed. [2021-10-16 02:27:33,122 INFO L857 garLoopResultBuilder]: For program point L154-1(lines 154 162) no Hoare annotation was computed. [2021-10-16 02:27:33,122 INFO L857 garLoopResultBuilder]: For program point L617(lines 537 677) no Hoare annotation was computed. [2021-10-16 02:27:33,122 INFO L857 garLoopResultBuilder]: For program point L155(lines 155 159) no Hoare annotation was computed. [2021-10-16 02:27:33,122 INFO L857 garLoopResultBuilder]: For program point L618(lines 618 622) no Hoare annotation was computed. [2021-10-16 02:27:33,122 INFO L857 garLoopResultBuilder]: For program point L651-1(lines 537 677) no Hoare annotation was computed. [2021-10-16 02:27:33,122 INFO L857 garLoopResultBuilder]: For program point L421-1(lines 398 682) no Hoare annotation was computed. [2021-10-16 02:27:33,122 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-16 02:27:33,123 INFO L857 garLoopResultBuilder]: For program point L223(lines 223 231) no Hoare annotation was computed. [2021-10-16 02:27:33,123 INFO L857 garLoopResultBuilder]: For program point L190(line 190) no Hoare annotation was computed. [2021-10-16 02:27:33,123 INFO L857 garLoopResultBuilder]: For program point L58(lines 58 70) no Hoare annotation was computed. [2021-10-16 02:27:33,123 INFO L857 garLoopResultBuilder]: For program point L488(lines 398 682) no Hoare annotation was computed. [2021-10-16 02:27:33,123 INFO L857 garLoopResultBuilder]: For program point L521-1(lines 398 682) no Hoare annotation was computed. [2021-10-16 02:27:33,124 INFO L853 garLoopResultBuilder]: At program point L389(lines 281 394) the Hoare annotation is: (let ((.cse22 (bvadd (_ bv2 32) ~t_b~0)) (.cse28 (bvadd (_ bv1 32) ~t_b~0))) (let ((.cse26 (= ~data~0 ULTIMATE.start_write_loop_~t~0)) (.cse21 (= ~data~0 .cse28)) (.cse25 (not (= ~wl_pc~0 (_ bv2 32)))) (.cse12 (= .cse22 ~data~0)) (.cse0 (not (= ~e_wl~0 (_ bv1 32)))) (.cse20 (= ~data~0 ~t_b~0)) (.cse24 (not (= (_ bv0 32) ~e_c~0))) (.cse14 (not (= ~e_wl~0 (_ bv0 32)))) (.cse27 (= ~wl_pc~0 (_ bv1 32))) (.cse1 (= (_ bv2 32) ~e_f~0)) (.cse2 (= (_ bv1 32) ~c1_pc~0)) (.cse3 (not (= ~c_req_up~0 (_ bv1 32)))) (.cse4 (not (= (_ bv0 32) ~r_st~0))) (.cse23 (= (_ bv2 32) ~e_wl~0)) (.cse5 (= (_ bv1 32) ~wb_i~0)) (.cse6 (= ~c2_i~0 (_ bv1 32))) (.cse7 (= (_ bv1 32) ~c2_pc~0)) (.cse8 (= (_ bv2 32) ~e_e~0)) (.cse9 (= (_ bv2 32) ~wb_st~0)) (.cse10 (not (= ~wl_st~0 (_ bv0 32)))) (.cse11 (= (_ bv2 32) ~c1_st~0)) (.cse13 (= (_ bv2 32) ~c2_st~0)) (.cse15 (= (_ bv2 32) ~e_c~0)) (.cse16 (= (_ bv2 32) ~e_g~0)) (.cse17 (= ~c1_i~0 (_ bv1 32))) (.cse18 (= ~wb_pc~0 (_ bv1 32))) (.cse19 (= (_ bv0 32) ~r_i~0))) (or (and .cse0 (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse21 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19))) (and .cse1 .cse2 .cse0 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= .cse22 ~c_t~0) .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse2 .cse4 .cse23 .cse5 .cse6 .cse24 .cse7 .cse8 .cse25 .cse10 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse2 .cse0 .cse3 .cse4 .cse5 .cse6 .cse20 .cse24 .cse7 .cse8 .cse9 .cse25 .cse10 .cse11 .cse13 .cse14 .cse26 .cse16 .cse17 .cse18 .cse19) (and .cse0 (or (and .cse21 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19))) (and .cse0 (or (and .cse1 .cse2 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse26 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse21 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)) (= .cse28 ~c_t~0)) (and .cse1 .cse23 .cse5 .cse6 .cse24 .cse8 .cse10 .cse16 .cse17 .cse19 (= ~wl_pc~0 (_ bv0 32))) (and .cse0 (or (and .cse21 .cse1 .cse2 .cse4 .cse5 .cse6 .cse24 .cse7 .cse8 .cse9 .cse25 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse2 .cse4 .cse5 .cse6 .cse24 .cse7 .cse8 .cse9 .cse25 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19))) (and .cse1 .cse2 .cse0 .cse3 .cse4 .cse5 .cse6 .cse20 .cse24 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse27 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse2 .cse3 .cse4 .cse23 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19)))) [2021-10-16 02:27:33,124 INFO L857 garLoopResultBuilder]: For program point L257(lines 257 274) no Hoare annotation was computed. [2021-10-16 02:27:33,124 INFO L853 garLoopResultBuilder]: At program point L588(lines 581 598) the Hoare annotation is: (let ((.cse24 (bvadd (_ bv2 32) ~t_b~0))) (let ((.cse1 (= (_ bv2 32) ~e_f~0)) (.cse2 (= (_ bv1 32) ~c1_pc~0)) (.cse3 (not (= ~c_req_up~0 (_ bv1 32)))) (.cse4 (not (= (_ bv0 32) ~r_st~0))) (.cse5 (= (_ bv1 32) ~wb_i~0)) (.cse6 (= ~c2_i~0 (_ bv1 32))) (.cse7 (not (= (_ bv0 32) ~e_c~0))) (.cse8 (= (_ bv1 32) ~c2_pc~0)) (.cse9 (= (_ bv2 32) ~e_e~0)) (.cse11 (= (_ bv2 32) ~wb_st~0)) (.cse12 (not (= ~wl_st~0 (_ bv0 32)))) (.cse13 (= (_ bv2 32) ~c1_st~0)) (.cse14 (= .cse24 ~data~0)) (.cse15 (= (_ bv2 32) ~c2_st~0)) (.cse17 (not (= ~e_wl~0 (_ bv0 32)))) (.cse18 (= (_ bv2 32) ~e_g~0)) (.cse19 (= ~c1_i~0 (_ bv1 32))) (.cse20 (= ~wb_pc~0 (_ bv1 32))) (.cse21 (= (_ bv0 32) ~r_i~0)) (.cse32 (bvadd (_ bv1 32) ~t_b~0))) (let ((.cse16 (= .cse24 ~c~0)) (.cse29 (= (_ bv2 32) ~e_wl~0)) (.cse26 (not (= ~wl_pc~0 (_ bv2 32)))) (.cse25 (= ~data~0 .cse32)) (.cse27 (= ~data~0 ~t_b~0)) (.cse28 (= ~data~0 ULTIMATE.start_write_loop_~t~0)) (.cse0 (not (= ~e_wl~0 (_ bv1 32)))) (.cse10 (= (_ bv0 32) ~t_b~0)) (.cse30 (= ~d~0 (_ bv0 32))) (.cse31 (= ~c~0 (_ bv1 32))) (.cse23 (= ~data~0 (_ bv1 32))) (.cse34 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21))) (or (and .cse0 (let ((.cse22 (= .cse24 ~d~0))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= .cse24 ~c_t~0) .cse18 .cse19 .cse20 .cse21)))) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15 .cse17 (= (_ bv2 32) ~e_c~0) .cse18 .cse19 .cse20 .cse21) (and .cse0 (or (and .cse25 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse26 .cse12 .cse13 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse26 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse27 .cse7 .cse8 .cse9 .cse11 .cse26 .cse12 .cse13 .cse15 .cse17 .cse28 .cse18 .cse19 .cse20 .cse21))) (and .cse1 .cse29 .cse5 .cse6 .cse7 .cse9 .cse12 .cse18 .cse19 .cse21 (= ~wl_pc~0 (_ bv0 32))) (and .cse1 .cse2 .cse3 .cse4 .cse29 .cse5 .cse6 .cse27 .cse7 .cse8 .cse9 .cse10 .cse11 .cse30 .cse12 .cse13 .cse31 .cse15 .cse28 .cse18 .cse19 .cse20 .cse21) (and .cse1 .cse2 .cse0 .cse3 .cse4 .cse5 .cse6 .cse27 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15 .cse17 (= ~wl_pc~0 (_ bv1 32)) .cse18 .cse19 .cse20 .cse21) (and .cse0 (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse30 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse8 .cse9 .cse10 .cse11 .cse30 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))) (and .cse1 .cse2 .cse3 .cse4 .cse29 .cse5 .cse6 .cse7 .cse8 .cse9 .cse26 .cse12 .cse18 .cse19 .cse20 .cse21) (and .cse0 (let ((.cse33 (or (and .cse25 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21) .cse34 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse27 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15 .cse17 .cse28 .cse18 .cse19 .cse20 .cse21)))) (or (and (= ~c~0 .cse32) .cse33 (= .cse32 ~c_t~0)) (and .cse10 (= ~d~0 (_ bv1 32)) .cse31 .cse33)))) (and .cse0 .cse10 .cse30 .cse31 (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21) .cse34)))))) [2021-10-16 02:27:33,124 INFO L857 garLoopResultBuilder]: For program point L489(lines 489 493) no Hoare annotation was computed. [2021-10-16 02:27:33,125 INFO L857 garLoopResultBuilder]: For program point L456-1(lines 398 682) no Hoare annotation was computed. [2021-10-16 02:27:33,125 INFO L857 garLoopResultBuilder]: For program point L291(lines 290 388) no Hoare annotation was computed. [2021-10-16 02:27:33,125 INFO L857 garLoopResultBuilder]: For program point L258(lines 258 262) no Hoare annotation was computed. [2021-10-16 02:27:33,125 INFO L857 garLoopResultBuilder]: For program point L589(lines 537 677) no Hoare annotation was computed. [2021-10-16 02:27:33,125 INFO L857 garLoopResultBuilder]: For program point L556(lines 556 560) no Hoare annotation was computed. [2021-10-16 02:27:33,125 INFO L857 garLoopResultBuilder]: For program point L556-2(lines 537 677) no Hoare annotation was computed. [2021-10-16 02:27:33,126 INFO L853 garLoopResultBuilder]: At program point L358(lines 290 388) the Hoare annotation is: (let ((.cse37 (bvadd (_ bv1 32) ~t_b~0)) (.cse50 (bvadd (_ bv2 32) ~t_b~0))) (let ((.cse45 (= .cse50 ~c_t~0)) (.cse48 (= .cse50 ~d~0)) (.cse15 (= ~wb_pc~0 (_ bv0 32))) (.cse33 (= ~d~0 (_ bv1 32))) (.cse35 (= ~c~0 (_ bv1 32))) (.cse36 (= ~c~0 .cse37)) (.cse39 (= ~data~0 ULTIMATE.start_write_loop_~t~0)) (.cse42 (= ~c1_st~0 (_ bv0 32))) (.cse43 (= ~c1_pc~0 (_ bv0 32))) (.cse40 (= ~c_req_up~0 (_ bv0 32))) (.cse44 (= ~wl_pc~0 (_ bv0 32))) (.cse24 (not (= (_ bv0 32) ~e_c~0))) (.cse27 (not (= ~wl_pc~0 (_ bv2 32)))) (.cse38 (= .cse37 ~c_t~0)) (.cse47 (= ~data~0 (_ bv1 32))) (.cse32 (= (_ bv0 32) ~t_b~0)) (.cse46 (= .cse50 ~c~0)) (.cse7 (= ~data~0 ~t_b~0)) (.cse10 (= ~d~0 (_ bv0 32))) (.cse16 (= ~data~0 (_ bv0 32))) (.cse18 (= ~wl_pc~0 (_ bv1 32))) (.cse22 (= ~c2_pc~0 (_ bv0 32))) (.cse23 (= ~data~0 .cse37)) (.cse11 (= ~c2_st~0 (_ bv0 32))) (.cse3 (not (= ~c_req_up~0 (_ bv1 32)))) (.cse41 (= (_ bv2 32) ~e_wl~0)) (.cse26 (= (_ bv2 32) ~wb_st~0)) (.cse0 (= (_ bv2 32) ~e_f~0)) (.cse1 (= (_ bv1 32) ~c1_pc~0)) (.cse2 (not (= ~e_wl~0 (_ bv1 32)))) (.cse4 (not (= (_ bv0 32) ~r_st~0))) (.cse5 (= (_ bv1 32) ~wb_i~0)) (.cse6 (= ~c2_i~0 (_ bv1 32))) (.cse8 (= ~wb_st~0 (_ bv0 32))) (.cse25 (= (_ bv1 32) ~c2_pc~0)) (.cse9 (= (_ bv2 32) ~e_e~0)) (.cse12 (= (_ bv0 32) ~processed~0)) (.cse13 (not (= ~wl_st~0 (_ bv0 32)))) (.cse14 (= (_ bv2 32) ~c1_st~0)) (.cse30 (= .cse50 ~data~0)) (.cse31 (= (_ bv2 32) ~c2_st~0)) (.cse28 (not (= ~e_wl~0 (_ bv0 32)))) (.cse17 (= (_ bv2 32) ~e_c~0)) (.cse19 (= (_ bv2 32) ~e_g~0)) (.cse20 (= ~c1_i~0 (_ bv1 32))) (.cse29 (= ~wb_pc~0 (_ bv1 32))) (.cse21 (= (_ bv0 32) ~r_i~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse11 .cse12 .cse13 .cse14 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse24 .cse25 .cse9 .cse27 .cse12 .cse13 .cse14 .cse30 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse2 (let ((.cse34 (or (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse14 .cse31 .cse28 .cse39 .cse17 .cse19 .cse20 .cse29 .cse21)))) (or (and .cse32 .cse33 .cse34 .cse35) (and .cse36 (= ~d~0 .cse37) .cse34 .cse38)))) (and .cse40 .cse0 .cse4 .cse41 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15 .cse16 .cse42 .cse43 .cse17 .cse19 .cse20 .cse21 .cse44 .cse22) (and .cse0 .cse1 .cse41 .cse5 .cse6 .cse24 .cse25 .cse9 .cse27 .cse13 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse42 .cse31 .cse43 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse42 .cse31 .cse28 .cse19 .cse20 .cse29 .cse38 .cse21) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21))) (and .cse40 .cse0 .cse4 .cse41 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse10 .cse12 .cse16 .cse42 .cse31 .cse43 .cse17 .cse19 .cse20 .cse29 .cse21 .cse44) (and .cse0 .cse1 .cse3 .cse41 .cse5 .cse6 .cse7 .cse25 .cse9 .cse32 .cse26 .cse10 .cse13 .cse14 .cse35 .cse31 .cse39 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse45 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse24 .cse25 .cse9 .cse27 .cse11 .cse12 .cse13 .cse14 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse12 .cse13 .cse16 .cse42 .cse43 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21 .cse22) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse12 .cse13 .cse42 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse40 .cse0 .cse4 .cse41 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse12 .cse15 .cse16 .cse42 .cse31 .cse43 .cse17 .cse19 .cse20 .cse21 .cse44) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse25 .cse9 .cse12 .cse13 .cse42 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse11 .cse12 .cse13 .cse42 .cse28 .cse39 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse14 .cse30 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse14 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse14 .cse31 .cse28 .cse39 .cse19 .cse20 .cse29 .cse21))) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse42 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse38 .cse21) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse46 .cse28 .cse17 .cse45 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse47 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse31 .cse46 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21 .cse48) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse30 .cse31 .cse46 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21 .cse48))) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse14 .cse31 .cse28 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse30 .cse31 .cse28 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse31 .cse28 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21))) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse11 .cse13 .cse14 .cse28 .cse17 .cse19 .cse20 .cse29 .cse38 .cse21) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse30 .cse31 .cse46 .cse28 .cse17 .cse45 .cse19 .cse20 .cse29 .cse21 .cse48) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse47 .cse25 .cse9 .cse32 .cse26 .cse14 .cse31 .cse46 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21 .cse48) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse32 .cse26 .cse14 .cse30 .cse31 .cse46 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21 .cse48))) (and .cse2 .cse10 .cse35 (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse5 .cse6 .cse47 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21))) (and .cse40 .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse12 .cse14 .cse16 .cse17 .cse19 .cse20 .cse29 .cse21 .cse44 .cse22) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse12 .cse13 .cse42 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse25 .cse9 .cse11 .cse12 .cse13 .cse14 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse24 .cse25 .cse9 .cse26 .cse27 .cse11 .cse12 .cse13 .cse42 .cse28 .cse39 .cse19 .cse20 .cse29 .cse21) (and .cse2 (or (and .cse23 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21))) (and .cse40 .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse31 .cse17 .cse19 .cse20 .cse21 .cse44) (and .cse40 .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse44 .cse22) (and .cse2 (or (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse39 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21)) .cse38) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse24 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse31 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse24 .cse25 .cse9 .cse27 .cse12 .cse13 .cse42 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse42 .cse43 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse41 .cse5 .cse6 .cse24 .cse9 .cse13 .cse19 .cse20 .cse21 .cse44) (and .cse2 (or (and .cse23 .cse0 .cse1 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse14 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse14 .cse30 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21))) (and .cse2 (let ((.cse49 (or (and .cse23 .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse39 .cse17 .cse19 .cse20 .cse29 .cse21)))) (or (and .cse32 .cse33 .cse35 .cse49) (and .cse36 .cse49 .cse38)))) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse10 .cse12 .cse13 .cse16 .cse42 .cse31 .cse43 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse40 .cse0 .cse4 .cse41 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse12 .cse16 .cse42 .cse43 .cse17 .cse19 .cse20 .cse29 .cse21 .cse44 .cse22) (and .cse40 .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse10 .cse12 .cse14 .cse16 .cse31 .cse17 .cse19 .cse20 .cse29 .cse21 .cse44) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse11 .cse13 .cse14 .cse28 .cse19 .cse20 .cse29 .cse38 .cse21) (and .cse2 .cse10 (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse30 .cse31 .cse46 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse47 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse31 .cse46 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21 .cse22) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse11 .cse12 .cse13 .cse14 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse41 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse25 .cse9 .cse12 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21)))) [2021-10-16 02:27:33,127 INFO L857 garLoopResultBuilder]: For program point L226(lines 226 230) no Hoare annotation was computed. [2021-10-16 02:27:33,127 INFO L857 garLoopResultBuilder]: For program point L94(lines 94 102) no Hoare annotation was computed. [2021-10-16 02:27:33,127 INFO L857 garLoopResultBuilder]: For program point L61(lines 61 69) no Hoare annotation was computed. [2021-10-16 02:27:33,127 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-16 02:27:33,127 INFO L857 garLoopResultBuilder]: For program point L590(lines 590 594) no Hoare annotation was computed. [2021-10-16 02:27:33,127 INFO L853 garLoopResultBuilder]: At program point L227(lines 222 249) the Hoare annotation is: (let ((.cse25 (= ~c2_st~0 (_ bv0 32))) (.cse2 (= (_ bv2 32) ~e_wl~0)) (.cse22 (= ~data~0 (bvadd (_ bv1 32) ~t_b~0))) (.cse5 (not (= (_ bv0 32) ~e_c~0))) (.cse8 (not (= ~wl_pc~0 (_ bv2 32)))) (.cse23 (= ~c1_st~0 (_ bv0 32))) (.cse0 (= (_ bv2 32) ~e_f~0)) (.cse1 (= (_ bv1 32) ~c1_pc~0)) (.cse14 (not (= ~e_wl~0 (_ bv1 32)))) (.cse15 (not (= (_ bv0 32) ~r_st~0))) (.cse3 (= (_ bv1 32) ~wb_i~0)) (.cse4 (= ~c2_i~0 (_ bv1 32))) (.cse16 (not (= ~wb_st~0 (_ bv0 32)))) (.cse6 (= (_ bv1 32) ~c2_pc~0)) (.cse7 (= (_ bv2 32) ~e_e~0)) (.cse17 (= (_ bv0 32) ~processed~0)) (.cse9 (not (= ~wl_st~0 (_ bv0 32)))) (.cse18 (= (_ bv2 32) ~c1_st~0)) (.cse19 (= (bvadd (_ bv2 32) ~t_b~0) ~data~0)) (.cse20 (= (_ bv2 32) ~c2_st~0)) (.cse21 (not (= ~e_wl~0 (_ bv0 32)))) (.cse24 (= (_ bv2 32) ~e_c~0)) (.cse10 (= (_ bv2 32) ~e_g~0)) (.cse11 (= ~c1_i~0 (_ bv1 32))) (.cse12 (= ~wb_pc~0 (_ bv1 32))) (.cse13 (= (_ bv0 32) ~r_i~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse14 .cse15 .cse3 .cse4 .cse16 .cse5 .cse6 .cse7 .cse8 .cse17 .cse9 .cse18 .cse19 .cse20 .cse21 .cse10 .cse11 .cse12 .cse13) (and .cse22 .cse0 .cse1 .cse14 .cse15 .cse3 .cse4 .cse16 .cse6 .cse7 .cse17 .cse9 .cse23 .cse20 .cse21 .cse24 .cse10 .cse11 .cse12 .cse13) (and .cse22 .cse0 .cse1 .cse14 .cse15 .cse3 .cse4 .cse16 .cse5 .cse6 .cse7 .cse8 .cse25 .cse17 .cse9 .cse18 .cse21 .cse10 .cse11 .cse12 .cse13) (and .cse22 .cse0 .cse1 .cse14 .cse15 .cse3 .cse4 .cse16 .cse6 .cse7 .cse25 .cse17 .cse9 .cse18 .cse21 .cse24 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse13 (= ~wl_pc~0 (_ bv0 32))) (and .cse22 .cse0 .cse1 .cse14 .cse15 .cse3 .cse4 .cse16 .cse5 .cse6 .cse7 .cse8 .cse17 .cse9 .cse23 .cse20 .cse21 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse14 .cse15 .cse3 .cse4 .cse16 .cse6 .cse7 .cse17 .cse9 .cse18 .cse19 .cse20 .cse21 .cse24 .cse10 .cse11 .cse12 .cse13))) [2021-10-16 02:27:33,128 INFO L857 garLoopResultBuilder]: For program point L95(lines 95 99) no Hoare annotation was computed. [2021-10-16 02:27:33,128 INFO L853 garLoopResultBuilder]: At program point L62(lines 57 127) the Hoare annotation is: (let ((.cse8 (bvadd (_ bv2 32) ~t_b~0))) (let ((.cse0 (not (= ~e_wl~0 (_ bv1 32)))) (.cse5 (= .cse8 ~data~0)) (.cse4 (let ((.cse18 (= ~c2_st~0 (_ bv0 32))) (.cse20 (= (_ bv2 32) ~c1_st~0)) (.cse9 (= (_ bv2 32) ~e_f~0)) (.cse10 (= (_ bv1 32) ~c1_pc~0)) (.cse11 (not (= ~c_req_up~0 (_ bv1 32)))) (.cse12 (not (= (_ bv0 32) ~r_st~0))) (.cse13 (= (_ bv1 32) ~wb_i~0)) (.cse14 (= ~c2_i~0 (_ bv1 32))) (.cse15 (= (_ bv1 32) ~c2_pc~0)) (.cse16 (= (_ bv2 32) ~e_e~0)) (.cse17 (= (_ bv2 32) ~wb_st~0)) (.cse19 (not (= ~wl_st~0 (_ bv0 32)))) (.cse27 (= ~c1_st~0 (_ bv0 32))) (.cse28 (= (_ bv2 32) ~c2_st~0)) (.cse21 (not (= ~e_wl~0 (_ bv0 32)))) (.cse22 (= (_ bv2 32) ~e_c~0)) (.cse23 (= (_ bv2 32) ~e_g~0)) (.cse24 (= ~c1_i~0 (_ bv1 32))) (.cse25 (= ~wb_pc~0 (_ bv1 32))) (.cse26 (= (_ bv0 32) ~r_i~0))) (or (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse27 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse28 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse27 .cse28 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26)))) (.cse3 (= (_ bv0 32) ~t_b~0))) (or (and .cse0 (let ((.cse1 (bvadd (_ bv1 32) ~t_b~0))) (let ((.cse2 (or (and .cse4 (= ~data~0 ~t_b~0)) (and .cse4 .cse5) (and (= ~data~0 .cse1) .cse4)))) (or (and (= ~c~0 .cse1) (= ~d~0 .cse1) .cse2 (= .cse1 ~c_t~0)) (and .cse3 (= ~d~0 (_ bv1 32)) (= ~c~0 (_ bv1 32)) .cse2))))) (and .cse0 (let ((.cse6 (= .cse8 ~c~0)) (.cse7 (= .cse8 ~d~0))) (or (and .cse4 .cse3 .cse5 .cse6 .cse7) (and .cse4 .cse5 .cse6 (= .cse8 ~c_t~0) .cse7) (and .cse4 .cse3 (= ~data~0 (_ bv0 32)) .cse6 .cse7) (and .cse4 (= ~data~0 (_ bv1 32)) .cse3 .cse6 .cse7))))))) [2021-10-16 02:27:33,128 INFO L857 garLoopResultBuilder]: For program point L426-1(lines 398 682) no Hoare annotation was computed. [2021-10-16 02:27:33,128 INFO L857 garLoopResultBuilder]: For program point L526-1(lines 398 682) no Hoare annotation was computed. [2021-10-16 02:27:33,129 INFO L853 garLoopResultBuilder]: At program point L328(lines 290 388) the Hoare annotation is: (let ((.cse37 (bvadd (_ bv1 32) ~t_b~0)) (.cse50 (bvadd (_ bv2 32) ~t_b~0))) (let ((.cse15 (= ~wb_pc~0 (_ bv0 32))) (.cse46 (= .cse50 ~c_t~0)) (.cse48 (= .cse50 ~d~0)) (.cse33 (= ~d~0 (_ bv1 32))) (.cse35 (= ~c~0 (_ bv1 32))) (.cse36 (= ~c~0 .cse37)) (.cse39 (= ~data~0 ULTIMATE.start_write_loop_~t~0)) (.cse42 (= ~c1_st~0 (_ bv0 32))) (.cse43 (= ~c1_pc~0 (_ bv0 32))) (.cse40 (= ~c_req_up~0 (_ bv0 32))) (.cse44 (= ~wl_pc~0 (_ bv0 32))) (.cse47 (= ~data~0 (_ bv1 32))) (.cse32 (= (_ bv0 32) ~t_b~0)) (.cse45 (= .cse50 ~c~0)) (.cse7 (= ~data~0 ~t_b~0)) (.cse10 (= ~d~0 (_ bv0 32))) (.cse16 (= ~data~0 (_ bv0 32))) (.cse18 (= ~wl_pc~0 (_ bv1 32))) (.cse22 (= ~c2_pc~0 (_ bv0 32))) (.cse11 (= ~c2_st~0 (_ bv0 32))) (.cse3 (not (= ~c_req_up~0 (_ bv1 32)))) (.cse41 (= (_ bv2 32) ~e_wl~0)) (.cse23 (= ~data~0 .cse37)) (.cse24 (not (= (_ bv0 32) ~e_c~0))) (.cse26 (= (_ bv2 32) ~wb_st~0)) (.cse27 (not (= ~wl_pc~0 (_ bv2 32)))) (.cse38 (= .cse37 ~c_t~0)) (.cse0 (= (_ bv2 32) ~e_f~0)) (.cse1 (= (_ bv1 32) ~c1_pc~0)) (.cse2 (not (= ~e_wl~0 (_ bv1 32)))) (.cse4 (not (= (_ bv0 32) ~r_st~0))) (.cse5 (= (_ bv1 32) ~wb_i~0)) (.cse6 (= ~c2_i~0 (_ bv1 32))) (.cse8 (= ~wb_st~0 (_ bv0 32))) (.cse25 (= (_ bv1 32) ~c2_pc~0)) (.cse9 (= (_ bv2 32) ~e_e~0)) (.cse12 (= (_ bv0 32) ~processed~0)) (.cse13 (not (= ~wl_st~0 (_ bv0 32)))) (.cse14 (= (_ bv2 32) ~c1_st~0)) (.cse30 (= .cse50 ~data~0)) (.cse31 (= (_ bv2 32) ~c2_st~0)) (.cse28 (not (= ~e_wl~0 (_ bv0 32)))) (.cse17 (= (_ bv2 32) ~e_c~0)) (.cse19 (= (_ bv2 32) ~e_g~0)) (.cse20 (= ~c1_i~0 (_ bv1 32))) (.cse29 (= ~wb_pc~0 (_ bv1 32))) (.cse21 (= (_ bv0 32) ~r_i~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse11 .cse12 .cse13 .cse14 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse24 .cse25 .cse9 .cse27 .cse12 .cse13 .cse14 .cse30 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse2 (let ((.cse34 (or (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse14 .cse31 .cse28 .cse39 .cse17 .cse19 .cse20 .cse29 .cse21)))) (or (and .cse32 .cse33 .cse34 .cse35) (and .cse36 (= ~d~0 .cse37) .cse34 .cse38)))) (and .cse40 .cse0 .cse4 .cse41 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15 .cse16 .cse42 .cse43 .cse17 .cse19 .cse20 .cse21 .cse44 .cse22) (and .cse0 .cse1 .cse41 .cse5 .cse6 .cse24 .cse25 .cse9 .cse27 .cse13 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse42 .cse31 .cse43 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse42 .cse31 .cse28 .cse19 .cse20 .cse29 .cse38 .cse21) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21))) (and .cse40 .cse0 .cse4 .cse41 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse10 .cse12 .cse16 .cse42 .cse31 .cse43 .cse17 .cse19 .cse20 .cse29 .cse21 .cse44) (and .cse0 .cse1 .cse3 .cse41 .cse5 .cse6 .cse7 .cse25 .cse9 .cse32 .cse26 .cse10 .cse13 .cse14 .cse35 .cse31 .cse39 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse24 .cse25 .cse9 .cse27 .cse11 .cse12 .cse13 .cse14 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse12 .cse13 .cse16 .cse42 .cse43 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21 .cse22) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse12 .cse13 .cse42 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse40 .cse0 .cse4 .cse41 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse12 .cse15 .cse16 .cse42 .cse31 .cse43 .cse17 .cse19 .cse20 .cse21 .cse44) (and .cse2 (or (and .cse23 .cse0 .cse1 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse28 .cse18 .cse19 .cse20 .cse29 .cse21))) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse25 .cse9 .cse12 .cse13 .cse42 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse11 .cse12 .cse13 .cse42 .cse28 .cse39 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse14 .cse30 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse14 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse14 .cse31 .cse28 .cse39 .cse19 .cse20 .cse29 .cse21))) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse42 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse38 .cse21) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse45 .cse28 .cse17 .cse46 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse47 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse31 .cse45 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21 .cse48) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse30 .cse31 .cse45 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21 .cse48))) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse14 .cse31 .cse28 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse30 .cse31 .cse28 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse31 .cse28 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21))) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse11 .cse13 .cse14 .cse28 .cse17 .cse19 .cse20 .cse29 .cse38 .cse21) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse30 .cse31 .cse45 .cse28 .cse17 .cse46 .cse19 .cse20 .cse29 .cse21 .cse48) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse47 .cse25 .cse9 .cse32 .cse26 .cse14 .cse31 .cse45 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21 .cse48) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse32 .cse26 .cse14 .cse30 .cse31 .cse45 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21 .cse48))) (and .cse2 .cse10 .cse35 (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse5 .cse6 .cse47 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21))) (and .cse40 .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse12 .cse14 .cse16 .cse17 .cse19 .cse20 .cse29 .cse21 .cse44 .cse22) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse12 .cse13 .cse42 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse25 .cse9 .cse11 .cse12 .cse13 .cse14 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse24 .cse25 .cse9 .cse26 .cse27 .cse11 .cse12 .cse13 .cse42 .cse28 .cse39 .cse19 .cse20 .cse29 .cse21) (and .cse2 (or (and .cse23 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21))) (and .cse40 .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse31 .cse17 .cse19 .cse20 .cse21 .cse44) (and .cse40 .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse44 .cse22) (and .cse2 (or (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse39 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21)) .cse38) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse24 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse31 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse24 .cse25 .cse9 .cse27 .cse12 .cse13 .cse42 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse42 .cse43 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse30 .cse31 .cse45 .cse17 .cse46 .cse19 .cse20 .cse29 .cse21 .cse48) (and .cse0 .cse41 .cse5 .cse6 .cse24 .cse9 .cse13 .cse19 .cse20 .cse21 .cse44) (and .cse2 (let ((.cse49 (or (and .cse23 .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse39 .cse17 .cse19 .cse20 .cse29 .cse21)))) (or (and .cse32 .cse33 .cse35 .cse49) (and .cse36 .cse49 .cse38)))) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse10 .cse12 .cse13 .cse16 .cse42 .cse31 .cse43 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse40 .cse0 .cse4 .cse41 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse12 .cse16 .cse42 .cse43 .cse17 .cse19 .cse20 .cse29 .cse21 .cse44 .cse22) (and .cse40 .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse10 .cse12 .cse14 .cse16 .cse31 .cse17 .cse19 .cse20 .cse29 .cse21 .cse44) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse11 .cse13 .cse14 .cse28 .cse19 .cse20 .cse29 .cse38 .cse21) (and .cse2 .cse10 (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse30 .cse31 .cse45 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse47 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse31 .cse45 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21 .cse22) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse11 .cse12 .cse13 .cse14 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse41 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse2 (or (and .cse23 .cse0 .cse1 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse14 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse14 .cse30 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21)) .cse38) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse25 .cse9 .cse12 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21)))) [2021-10-16 02:27:33,130 INFO L857 garLoopResultBuilder]: For program point L295(lines 295 311) no Hoare annotation was computed. [2021-10-16 02:27:33,130 INFO L853 garLoopResultBuilder]: At program point L196-1(lines 177 217) the Hoare annotation is: (let ((.cse36 (bvadd (_ bv1 32) ~t_b~0))) (let ((.cse29 (= ~data~0 .cse36)) (.cse35 (= .cse36 ~c_t~0)) (.cse33 (= ~c_req_up~0 (_ bv0 32))) (.cse2 (= (_ bv2 32) ~e_wl~0)) (.cse34 (= ~wl_pc~0 (_ bv0 32))) (.cse1 (= (_ bv1 32) ~c1_pc~0)) (.cse5 (not (= (_ bv0 32) ~e_c~0))) (.cse6 (= (_ bv1 32) ~c2_pc~0)) (.cse27 (= (_ bv2 32) ~wb_st~0)) (.cse8 (not (= ~wl_pc~0 (_ bv2 32)))) (.cse21 (= (_ bv2 32) ~c1_st~0)) (.cse28 (= (bvadd (_ bv2 32) ~t_b~0) ~data~0)) (.cse31 (not (= ~e_wl~0 (_ bv0 32)))) (.cse12 (= ~wb_pc~0 (_ bv1 32))) (.cse0 (= (_ bv2 32) ~e_f~0)) (.cse14 (not (= ~e_wl~0 (_ bv1 32)))) (.cse15 (not (= ~c_req_up~0 (_ bv1 32)))) (.cse16 (not (= (_ bv0 32) ~r_st~0))) (.cse3 (= (_ bv1 32) ~wb_i~0)) (.cse4 (= ~c2_i~0 (_ bv1 32))) (.cse17 (= ~data~0 ~t_b~0)) (.cse18 (= ~wb_st~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~e_e~0)) (.cse19 (= ~d~0 (_ bv0 32))) (.cse20 (= (_ bv0 32) ~processed~0)) (.cse9 (not (= ~wl_st~0 (_ bv0 32)))) (.cse22 (= ~wb_pc~0 (_ bv0 32))) (.cse23 (= ~data~0 (_ bv0 32))) (.cse30 (= ~c1_st~0 (_ bv0 32))) (.cse32 (= ~c1_pc~0 (_ bv0 32))) (.cse24 (= (_ bv2 32) ~e_c~0)) (.cse25 (= ~wl_pc~0 (_ bv1 32))) (.cse10 (= (_ bv2 32) ~e_g~0)) (.cse26 (not (= ~c2_st~0 (_ bv0 32)))) (.cse11 (= ~c1_i~0 (_ bv1 32))) (.cse13 (= (_ bv0 32) ~r_i~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse14 .cse15 .cse16 .cse3 .cse4 .cse17 .cse18 .cse7 .cse19 .cse20 .cse9 .cse21 .cse22 .cse23 .cse24 .cse25 .cse10 .cse26 .cse11 .cse13) (and .cse0 .cse1 .cse14 .cse15 .cse16 .cse3 .cse4 .cse7 .cse27 .cse20 .cse9 .cse21 .cse28 .cse24 .cse25 .cse10 .cse26 .cse11 .cse12 .cse13) (and .cse29 .cse0 .cse1 .cse14 .cse15 .cse16 .cse3 .cse4 .cse6 .cse7 .cse27 .cse20 .cse9 .cse30 .cse31 .cse24 .cse10 .cse26 .cse11 .cse12 .cse13) (and .cse0 .cse14 .cse15 .cse16 .cse3 .cse4 .cse17 .cse7 .cse27 .cse19 .cse20 .cse9 .cse23 .cse30 .cse32 .cse24 .cse25 .cse10 .cse26 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse15 .cse16 .cse2 .cse3 .cse4 .cse6 .cse7 .cse27 .cse9 .cse21 .cse24 .cse10 .cse26 .cse11 .cse12 .cse13) (and .cse29 .cse0 .cse1 .cse14 .cse16 .cse3 .cse4 .cse18 .cse5 .cse6 .cse7 .cse8 .cse20 .cse9 .cse30 .cse31 .cse10 .cse26 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse14 .cse15 .cse16 .cse3 .cse4 .cse17 .cse7 .cse27 .cse19 .cse20 .cse9 .cse21 .cse23 .cse24 .cse25 .cse10 .cse26 .cse11 .cse12 .cse13) (and .cse33 .cse0 .cse1 .cse16 .cse2 .cse3 .cse4 .cse17 .cse18 .cse7 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse10 .cse26 .cse11 .cse13 .cse34) (and .cse29 .cse0 .cse1 .cse14 .cse15 .cse16 .cse3 .cse4 .cse5 .cse6 .cse7 .cse27 .cse8 .cse20 .cse9 .cse30 .cse31 .cse10 .cse26 .cse11 .cse12 .cse13) (and .cse33 .cse0 .cse16 .cse2 .cse3 .cse4 .cse17 .cse18 .cse7 .cse19 .cse20 .cse22 .cse23 .cse30 .cse32 .cse24 .cse10 .cse26 .cse11 .cse13 .cse34) (and .cse14 (or (and .cse0 .cse1 .cse16 .cse3 .cse4 .cse17 .cse6 .cse7 .cse27 .cse9 .cse21 .cse31 (= ~data~0 ULTIMATE.start_write_loop_~t~0) .cse24 .cse10 .cse26 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse16 .cse3 .cse4 .cse6 .cse7 .cse27 .cse9 .cse21 .cse28 .cse31 .cse24 .cse10 .cse26 .cse11 .cse12 .cse13) (and .cse29 .cse0 .cse1 .cse16 .cse3 .cse4 .cse6 .cse7 .cse27 .cse9 .cse21 .cse31 .cse24 .cse10 .cse26 .cse11 .cse12 .cse13)) .cse35) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse13 .cse34) (and .cse0 .cse1 .cse14 .cse16 .cse3 .cse4 .cse18 .cse6 .cse7 .cse20 .cse9 .cse21 .cse28 .cse31 .cse24 .cse10 .cse26 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse14 .cse15 .cse16 .cse3 .cse4 .cse6 .cse7 .cse27 .cse20 .cse9 .cse21 .cse28 .cse31 .cse24 .cse10 .cse26 .cse11 .cse12 .cse13) (and .cse29 .cse0 .cse1 .cse14 .cse16 .cse3 .cse4 .cse18 .cse6 .cse7 .cse20 .cse9 .cse30 .cse31 .cse24 .cse10 .cse26 .cse11 .cse12 .cse13) (and .cse33 .cse0 .cse16 .cse2 .cse3 .cse4 .cse17 .cse7 .cse27 .cse19 .cse20 .cse23 .cse30 .cse32 .cse24 .cse10 .cse26 .cse11 .cse12 .cse13 .cse34) (and .cse14 (or (and .cse0 .cse1 .cse16 .cse3 .cse4 .cse5 .cse6 .cse7 .cse27 .cse8 .cse9 .cse21 .cse28 .cse31 .cse10 .cse26 .cse11 .cse12 .cse13) (and .cse29 .cse0 .cse1 .cse16 .cse3 .cse4 .cse5 .cse6 .cse7 .cse27 .cse8 .cse9 .cse21 .cse31 .cse10 .cse26 .cse11 .cse12 .cse13)) .cse35) (and .cse33 .cse0 .cse1 .cse16 .cse2 .cse3 .cse4 .cse17 .cse7 .cse27 .cse19 .cse20 .cse21 .cse23 .cse24 .cse10 .cse26 .cse11 .cse12 .cse13 .cse34) (and .cse0 .cse1 .cse14 .cse16 .cse3 .cse4 .cse18 .cse5 .cse6 .cse7 .cse8 .cse20 .cse9 .cse21 .cse28 .cse31 .cse10 .cse26 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse14 .cse15 .cse16 .cse3 .cse4 .cse5 .cse6 .cse7 .cse27 .cse8 .cse20 .cse9 .cse21 .cse28 .cse31 .cse10 .cse26 .cse11 .cse12 .cse13) (and .cse0 .cse14 .cse15 .cse16 .cse3 .cse4 .cse17 .cse18 .cse7 .cse19 .cse20 .cse9 .cse22 .cse23 .cse30 .cse32 .cse24 .cse25 .cse10 .cse26 .cse11 .cse13)))) [2021-10-16 02:27:33,130 INFO L857 garLoopResultBuilder]: For program point L64(lines 64 68) no Hoare annotation was computed. [2021-10-16 02:27:33,130 INFO L857 garLoopResultBuilder]: For program point L659(lines 659 675) no Hoare annotation was computed. [2021-10-16 02:27:33,131 INFO L857 garLoopResultBuilder]: For program point L626-1(lines 537 677) no Hoare annotation was computed. [2021-10-16 02:27:33,131 INFO L857 garLoopResultBuilder]: For program point L362(lines 362 369) no Hoare annotation was computed. [2021-10-16 02:27:33,131 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-16 02:27:33,131 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 15) no Hoare annotation was computed. [2021-10-16 02:27:33,131 INFO L857 garLoopResultBuilder]: For program point L561-1(lines 537 677) no Hoare annotation was computed. [2021-10-16 02:27:33,131 INFO L857 garLoopResultBuilder]: For program point L462(lines 462 466) no Hoare annotation was computed. [2021-10-16 02:27:33,132 INFO L853 garLoopResultBuilder]: At program point L264(lines 257 274) the Hoare annotation is: (let ((.cse37 (bvadd (_ bv2 32) ~t_b~0)) (.cse34 (bvadd (_ bv1 32) ~t_b~0))) (let ((.cse13 (= ~c1_st~0 (_ bv0 32))) (.cse8 (= ~wb_st~0 (_ bv0 32))) (.cse24 (not (= ~wl_pc~0 (_ bv2 32)))) (.cse11 (= (_ bv0 32) ~processed~0)) (.cse23 (= ~data~0 ~t_b~0)) (.cse26 (= ~data~0 ULTIMATE.start_write_loop_~t~0)) (.cse0 (= ~data~0 .cse34)) (.cse28 (= ~c2_st~0 (_ bv0 32))) (.cse16 (= ~wl_pc~0 (_ bv1 32))) (.cse29 (= .cse34 ~c_t~0)) (.cse31 (= (_ bv2 32) ~e_wl~0)) (.cse9 (not (= (_ bv0 32) ~e_c~0))) (.cse1 (= (_ bv2 32) ~e_f~0)) (.cse2 (= (_ bv1 32) ~c1_pc~0)) (.cse21 (not (= ~c_req_up~0 (_ bv1 32)))) (.cse4 (not (= (_ bv0 32) ~r_st~0))) (.cse5 (= (_ bv1 32) ~wb_i~0)) (.cse6 (= ~c2_i~0 (_ bv1 32))) (.cse7 (not (= (_ bv0 32) ~e_e~0))) (.cse10 (= (_ bv1 32) ~c2_pc~0)) (.cse32 (= (_ bv0 32) ~t_b~0)) (.cse22 (= (_ bv2 32) ~wb_st~0)) (.cse12 (not (= ~wl_st~0 (_ bv0 32)))) (.cse25 (= (_ bv2 32) ~c1_st~0)) (.cse27 (= .cse37 ~data~0)) (.cse14 (= (_ bv2 32) ~c2_st~0)) (.cse15 (not (= ~e_wl~0 (_ bv0 32)))) (.cse30 (= (_ bv2 32) ~e_c~0)) (.cse17 (= (_ bv2 32) ~e_g~0)) (.cse18 (= ~c1_i~0 (_ bv1 32))) (.cse19 (= ~wb_pc~0 (_ bv1 32))) (.cse20 (= (_ bv0 32) ~r_i~0)) (.cse3 (not (= ~e_wl~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 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse22 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse3 (or (and .cse1 .cse2 .cse21 .cse4 .cse5 .cse6 .cse23 .cse7 .cse9 .cse10 .cse22 .cse24 .cse12 .cse25 .cse14 .cse15 .cse26 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse21 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse22 .cse24 .cse12 .cse25 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20) (and .cse1 .cse2 .cse21 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse22 .cse24 .cse12 .cse25 .cse27 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20))) (and .cse1 .cse2 .cse3 .cse21 .cse4 .cse5 .cse6 .cse23 .cse7 .cse9 .cse10 .cse22 .cse28 .cse11 .cse12 .cse13 .cse15 .cse26 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse28 .cse11 .cse12 .cse25 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse22 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse29 .cse20) (and (or (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse22 .cse12 .cse25 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse22 .cse12 .cse25 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)) .cse3) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse25 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse1 .cse2 .cse3 .cse21 .cse4 .cse5 .cse6 .cse23 .cse7 .cse10 .cse22 .cse24 .cse12 .cse25 .cse14 .cse15 .cse30 .cse17 .cse18 .cse19 .cse20) (and .cse1 .cse2 .cse4 .cse31 .cse5 .cse6 .cse7 .cse9 .cse10 .cse24 .cse12 .cse17 .cse18 .cse19 .cse20) (and .cse1 .cse2 .cse3 .cse21 .cse4 .cse5 .cse6 .cse23 .cse7 .cse9 .cse10 .cse22 .cse12 .cse25 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse22 .cse28 .cse11 .cse12 .cse25 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse3 (let ((.cse33 (or (and .cse1 .cse2 .cse21 .cse4 .cse5 .cse6 .cse7 .cse10 .cse22 .cse12 .cse25 .cse27 .cse14 .cse15 .cse30 .cse17 .cse18 .cse19 .cse20) (and .cse1 .cse2 .cse21 .cse4 .cse5 .cse6 .cse23 .cse7 .cse10 .cse22 .cse12 .cse25 .cse14 .cse15 .cse26 .cse30 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse21 .cse4 .cse5 .cse6 .cse7 .cse10 .cse22 .cse12 .cse25 .cse14 .cse15 .cse30 .cse17 .cse18 .cse19 .cse20)))) (or (and .cse32 (= ~d~0 (_ bv1 32)) (= ~c~0 (_ bv1 32)) .cse33) (and (= ~c~0 .cse34) (= ~d~0 .cse34) .cse29 .cse33)))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse22 .cse28 .cse12 .cse25 .cse15 .cse16 .cse17 .cse18 .cse19 .cse29 .cse20) (and .cse1 .cse31 .cse5 .cse6 .cse7 .cse9 .cse12 .cse17 .cse18 .cse20 (= ~wl_pc~0 (_ bv0 32))) (and (let ((.cse35 (= .cse37 ~c~0)) (.cse36 (= .cse37 ~d~0))) (or (and .cse1 .cse2 .cse21 .cse4 .cse5 .cse6 (= ~data~0 (_ bv1 32)) .cse7 .cse10 .cse32 .cse22 .cse12 .cse25 .cse14 .cse35 .cse15 .cse30 .cse17 .cse18 .cse19 .cse20 .cse36) (and .cse1 .cse2 .cse21 .cse4 .cse5 .cse6 .cse7 .cse10 .cse22 .cse12 .cse25 .cse27 .cse14 .cse35 .cse15 .cse30 (= .cse37 ~c_t~0) .cse17 .cse18 .cse19 .cse20 .cse36) (and .cse1 .cse2 .cse21 .cse4 .cse5 .cse6 .cse7 .cse10 .cse32 .cse22 .cse12 .cse25 .cse27 .cse14 .cse35 .cse15 .cse30 .cse17 .cse18 .cse19 .cse20 .cse36))) .cse3)))) [2021-10-16 02:27:33,132 INFO L857 garLoopResultBuilder]: For program point L298(lines 298 310) no Hoare annotation was computed. [2021-10-16 02:27:33,132 INFO L857 garLoopResultBuilder]: For program point L265(lines 257 274) no Hoare annotation was computed. [2021-10-16 02:27:33,132 INFO L857 garLoopResultBuilder]: For program point L199(lines 199 207) no Hoare annotation was computed. [2021-10-16 02:27:33,132 INFO L857 garLoopResultBuilder]: For program point L199-1(lines 199 207) no Hoare annotation was computed. [2021-10-16 02:27:33,133 INFO L857 garLoopResultBuilder]: For program point L133(lines 133 141) no Hoare annotation was computed. [2021-10-16 02:27:33,133 INFO L857 garLoopResultBuilder]: For program point L662(lines 662 674) no Hoare annotation was computed. [2021-10-16 02:27:33,133 INFO L857 garLoopResultBuilder]: For program point L497(lines 398 682) no Hoare annotation was computed. [2021-10-16 02:27:33,133 INFO L857 garLoopResultBuilder]: For program point L431-1(lines 398 682) no Hoare annotation was computed. [2021-10-16 02:27:33,133 INFO L857 garLoopResultBuilder]: For program point L332(lines 332 339) no Hoare annotation was computed. [2021-10-16 02:27:33,133 INFO L857 garLoopResultBuilder]: For program point L266(lines 266 270) no Hoare annotation was computed. [2021-10-16 02:27:33,133 INFO L857 garLoopResultBuilder]: For program point L200(lines 200 204) no Hoare annotation was computed. [2021-10-16 02:27:33,138 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-16 02:27:33,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 02:27:33 BoogieIcfgContainer [2021-10-16 02:27:33,400 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-16 02:27:33,401 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-16 02:27:33,401 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-16 02:27:33,401 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-16 02:27:33,402 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:17:56" (3/4) ... [2021-10-16 02:27:33,405 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-16 02:27:33,420 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-10-16 02:27:33,421 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-16 02:27:33,421 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-16 02:27:33,422 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-16 02:27:33,642 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/witness.graphml [2021-10-16 02:27:33,642 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-16 02:27:33,643 INFO L168 Benchmark]: Toolchain (without parser) took 579112.25 ms. Allocated memory was 54.5 MB in the beginning and 3.6 GB in the end (delta: 3.5 GB). Free memory was 32.8 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 915.2 MB. Max. memory is 16.1 GB. [2021-10-16 02:27:33,643 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 54.5 MB. Free memory is still 36.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-16 02:27:33,644 INFO L168 Benchmark]: CACSL2BoogieTranslator took 518.13 ms. Allocated memory was 54.5 MB in the beginning and 81.8 MB in the end (delta: 27.3 MB). Free memory was 32.6 MB in the beginning and 62.7 MB in the end (delta: -30.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-16 02:27:33,645 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.59 ms. Allocated memory is still 81.8 MB. Free memory was 62.7 MB in the beginning and 60.3 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-16 02:27:33,645 INFO L168 Benchmark]: Boogie Preprocessor took 54.27 ms. Allocated memory is still 81.8 MB. Free memory was 60.3 MB in the beginning and 58.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-16 02:27:33,646 INFO L168 Benchmark]: RCFGBuilder took 884.29 ms. Allocated memory is still 81.8 MB. Free memory was 58.2 MB in the beginning and 58.4 MB in the end (delta: -126.3 kB). Peak memory consumption was 21.4 MB. Max. memory is 16.1 GB. [2021-10-16 02:27:33,646 INFO L168 Benchmark]: TraceAbstraction took 577340.81 ms. Allocated memory was 81.8 MB in the beginning and 3.6 GB in the end (delta: 3.5 GB). Free memory was 57.7 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 2.3 GB. Max. memory is 16.1 GB. [2021-10-16 02:27:33,646 INFO L168 Benchmark]: Witness Printer took 241.08 ms. Allocated memory is still 3.6 GB. Free memory was 2.7 GB in the beginning and 2.7 GB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 16.1 GB. [2021-10-16 02:27:33,654 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 54.5 MB. Free memory is still 36.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 518.13 ms. Allocated memory was 54.5 MB in the beginning and 81.8 MB in the end (delta: 27.3 MB). Free memory was 32.6 MB in the beginning and 62.7 MB in the end (delta: -30.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 65.59 ms. Allocated memory is still 81.8 MB. Free memory was 62.7 MB in the beginning and 60.3 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 54.27 ms. Allocated memory is still 81.8 MB. Free memory was 60.3 MB in the beginning and 58.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 884.29 ms. Allocated memory is still 81.8 MB. Free memory was 58.2 MB in the beginning and 58.4 MB in the end (delta: -126.3 kB). Peak memory consumption was 21.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 577340.81 ms. Allocated memory was 81.8 MB in the beginning and 3.6 GB in the end (delta: 3.5 GB). Free memory was 57.7 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 2.3 GB. Max. memory is 16.1 GB. * Witness Printer took 241.08 ms. Allocated memory is still 3.6 GB. Free memory was 2.7 GB in the beginning and 2.7 GB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 15]: 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, 126 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 576989.6ms, OverallIterations: 32, TraceHistogramMax: 9, EmptinessCheckTime: 210.1ms, AutomataDifference: 24961.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 486305.3ms, InitialAbstractionConstructionTime: 15.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 7962 SDtfs, 15086 SDslu, 26127 SDs, 0 SdLazy, 2333 SolverSat, 613 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1980.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7702 GetRequests, 7509 SyntacticMatches, 5 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3161 ImplicationChecksByTransitivity, 3571.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=18344occurred in iteration=30, InterpolantAutomatonStates: 236, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 13886.6ms AutomataMinimizationTime, 32 MinimizatonAttempts, 86033 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 20 LocationsWithAnnotation, 20 PreInvPairs, 2326 NumberOfFragments, 40765 HoareAnnotationTreeSize, 20 FomulaSimplifications, 177391 FormulaSimplificationTreeSizeReduction, 83359.6ms HoareSimplificationTime, 20 FomulaSimplificationsInter, 32791420 FormulaSimplificationTreeSizeReductionInter, 402837.0ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 516.2ms SsaConstructionTime, 1734.6ms SatisfiabilityAnalysisTime, 21401.8ms InterpolantComputationTime, 3784 NumberOfCodeBlocks, 3784 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 7496 ConstructedInterpolants, 0 QuantifiedInterpolants, 17172 SizeOfPredicates, 64 NumberOfNonLiveVariables, 7428 ConjunctsInSsa, 139 ConjunctsInUnsatCore, 72 InterpolantComputations, 60 PerfectInterpolantSequences, 2904/3702 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 1 specifications checked. All of them hold - InvariantResult [Line: 395]: Loop Invariant Derived loop invariant: c2_i == 1bv32 - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: !(e_wl == 1bv32) && (((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) && data == t_b) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) && ~bvadd64(2bv32, t_b) == data)) || (data == ~bvadd64(1bv32, t_b) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) - InvariantResult [Line: 461]: Loop Invariant Derived loop invariant: (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == r_st) && 2bv32 == e_f) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32) || (((((((((((((2bv32 == e_f && 2bv32 == e_wl) && 1bv32 == wb_i) && wl_st == 2bv32) && c2_i == 1bv32) && wb_st == 0bv32) && !(0bv32 == e_c)) && 2bv32 == e_e) && c2_st == 0bv32) && c1_st == 0bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) - InvariantResult [Line: 222]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(wb_st == 0bv32)) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(wb_st == 0bv32)) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(wb_st == 0bv32)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && ~bvadd64(2bv32, t_b) == c_t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(wb_st == 0bv32)) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(wb_st == 0bv32)) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32)) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(wb_st == 0bv32)) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && 2bv32 == c2_st) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(wb_st == 0bv32)) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && ~bvadd64(2bv32, t_b) == c_t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(wb_st == 0bv32)) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && 2bv32 == c2_st) && c1_pc == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i)) || ((((((((((2bv32 == e_f && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 2bv32 == e_e) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(wb_st == 0bv32)) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32)) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(wb_st == 0bv32)) && 1bv32 == c2_pc) && 2bv32 == e_e) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(wb_st == 0bv32)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(wb_st == 0bv32)) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(wb_st == 0bv32)) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32)) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(wb_st == 0bv32)) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) - InvariantResult [Line: 581]: Loop Invariant Derived loop invariant: (((((((((!(e_wl == 1bv32) && (((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && ~bvadd64(2bv32, t_b) == c_t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && (((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || ((((((((((2bv32 == e_f && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 2bv32 == e_e) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && d == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && c == 1bv32) && 2bv32 == c2_st) && data == t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && d == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && d == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && (((c == ~bvadd64(1bv32, t_b) && ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && ~bvadd64(1bv32, t_b) == c_t) || (((0bv32 == t_b && d == 1bv32) && c == 1bv32) && ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))))) || ((((!(e_wl == 1bv32) && 0bv32 == t_b) && d == 0bv32) && c == 1bv32) && (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((((((!(e_wl == 1bv32) && ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32)) || ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32)) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32)) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && 2bv32 == c2_st) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && data == 0bv32) && c1_st == 0bv32) && 2bv32 == c2_st) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && data == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32)) || ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32) || (((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((0bv32 == t_b && d == 1bv32) && (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && c == 1bv32) || (((c == ~bvadd64(1bv32, t_b) && d == ~bvadd64(1bv32, t_b)) && (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && ~bvadd64(1bv32, t_b) == c_t)))) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32)) || (((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && 2bv32 == c2_st) && c1_pc == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && 0bv32 == processed) && data == 0bv32) && c1_st == 0bv32) && 2bv32 == c2_st) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && d == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && c == 1bv32) && 2bv32 == c2_st) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && 2bv32 == c2_st) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && ~bvadd64(2bv32, t_b) == c_t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)))) || (!(e_wl == 1bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && ~bvadd64(2bv32, t_b) == c_t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)))) || (((!(e_wl == 1bv32) && d == 0bv32) && c == 1bv32) && (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && 2bv32 == c1_st) && data == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32)) || (((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i)) || ((((1bv32 == c_t && ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && 0bv32 == t_b) && d == 1bv32) && c == 1bv32)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32)) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && 2bv32 == e_c) && ~bvadd64(2bv32, t_b) == c_t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)) || ((((((((((2bv32 == e_f && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 2bv32 == e_e) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || (!(e_wl == 1bv32) && ((((0bv32 == t_b && d == 1bv32) && c == 1bv32) && (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) || ((c == ~bvadd64(1bv32, t_b) && (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && ~bvadd64(1bv32, t_b) == c_t)))) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && data == 0bv32) && c1_st == 0bv32) && 2bv32 == c2_st) && c1_pc == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32)) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && 0bv32 == processed) && 2bv32 == c1_st) && data == 0bv32) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || ((!(e_wl == 1bv32) && d == 0bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && data == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32) || (((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((0bv32 == t_b && d == 1bv32) && (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && c == 1bv32) || (((c == ~bvadd64(1bv32, t_b) && d == ~bvadd64(1bv32, t_b)) && (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && ~bvadd64(1bv32, t_b) == c_t)))) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32)) || (((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && 2bv32 == c2_st) && c1_pc == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && 0bv32 == processed) && data == 0bv32) && c1_st == 0bv32) && 2bv32 == c2_st) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && d == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && c == 1bv32) && 2bv32 == c2_st) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && 2bv32 == c2_st) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || (!(e_wl == 1bv32) && (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && ~bvadd64(2bv32, t_b) == c_t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)))) || (!(e_wl == 1bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && ~bvadd64(2bv32, t_b) == c_t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)))) || (((!(e_wl == 1bv32) && d == 0bv32) && c == 1bv32) && (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && 2bv32 == c1_st) && data == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32)) || (((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32)) || ((!(e_wl == 1bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && ~bvadd64(1bv32, t_b) == c_t)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32)) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && 2bv32 == e_c) && ~bvadd64(2bv32, t_b) == c_t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)) || ((((((((((2bv32 == e_f && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 2bv32 == e_e) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || (!(e_wl == 1bv32) && ((((0bv32 == t_b && d == 1bv32) && c == 1bv32) && (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) || ((c == ~bvadd64(1bv32, t_b) && (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && ~bvadd64(1bv32, t_b) == c_t)))) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && data == 0bv32) && c1_st == 0bv32) && 2bv32 == c2_st) && c1_pc == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32)) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && 0bv32 == processed) && 2bv32 == c1_st) && data == 0bv32) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || ((!(e_wl == 1bv32) && d == 0bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && data == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((!(e_wl == 1bv32) && (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && ~bvadd64(1bv32, t_b) == c_t)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (!(e_wl == 1bv32) && ((((c == ~bvadd64(1bv32, t_b) && d == ~bvadd64(1bv32, t_b)) && (((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) && data == t_b) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) && ~bvadd64(2bv32, t_b) == data)) || (data == ~bvadd64(1bv32, t_b) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))))) && ~bvadd64(1bv32, t_b) == c_t) || (((0bv32 == t_b && d == 1bv32) && c == 1bv32) && (((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) && data == t_b) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) && ~bvadd64(2bv32, t_b) == data)) || (data == ~bvadd64(1bv32, t_b) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))))))) || (!(e_wl == 1bv32) && (((((((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) && 0bv32 == t_b) && ~bvadd64(2bv32, t_b) == data) && ~bvadd64(2bv32, t_b) == c) && ~bvadd64(2bv32, t_b) == d) || ((((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) && ~bvadd64(2bv32, t_b) == data) && ~bvadd64(2bv32, t_b) == c) && ~bvadd64(2bv32, t_b) == c_t) && ~bvadd64(2bv32, t_b) == d)) || ((((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) && 0bv32 == t_b) && data == 0bv32) && ~bvadd64(2bv32, t_b) == c) && ~bvadd64(2bv32, t_b) == d)) || ((((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) && data == 1bv32) && 0bv32 == t_b) && ~bvadd64(2bv32, t_b) == c) && ~bvadd64(2bv32, t_b) == d))) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && wb_st == 0bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((2bv32 == e_f && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 2bv32 == e_e) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i) - InvariantResult [Line: 222]: Loop Invariant Derived loop invariant: (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(wb_st == 0bv32)) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(wb_st == 0bv32)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(wb_st == 0bv32)) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(wb_st == 0bv32)) && 1bv32 == c2_pc) && 2bv32 == e_e) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((2bv32 == e_f && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 2bv32 == e_e) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(wb_st == 0bv32)) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(wb_st == 0bv32)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_e)) && wb_st == 0bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_e)) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == wb_st) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_e)) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_e)) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_e)) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_e)) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == wb_st) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && data == t) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_e)) && wb_st == 0bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_e)) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_e)) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_e)) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) && !(e_wl == 1bv32))) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_e)) && wb_st == 0bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_e)) && 1bv32 == c2_pc) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_e)) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_e)) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_e)) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == wb_st) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((0bv32 == t_b && d == 1bv32) && c == 1bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_e)) && 1bv32 == c2_pc) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_e)) && 1bv32 == c2_pc) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_e)) && 1bv32 == c2_pc) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) || (((c == ~bvadd64(1bv32, t_b) && d == ~bvadd64(1bv32, t_b)) && ~bvadd64(1bv32, t_b) == c_t) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_e)) && 1bv32 == c2_pc) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_e)) && 1bv32 == c2_pc) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_e)) && 1bv32 == c2_pc) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))))) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_e)) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || ((((((((((2bv32 == e_f && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_e)) && !(0bv32 == e_c)) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || ((((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == 1bv32) && !(0bv32 == e_e)) && 1bv32 == c2_pc) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_e)) && 1bv32 == c2_pc) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && ~bvadd64(2bv32, t_b) == c_t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_e)) && 1bv32 == c2_pc) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)) && !(e_wl == 1bv32)) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32) || (((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((0bv32 == t_b && d == 1bv32) && (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && c == 1bv32) || (((c == ~bvadd64(1bv32, t_b) && d == ~bvadd64(1bv32, t_b)) && (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && ~bvadd64(1bv32, t_b) == c_t)))) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32)) || (((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && 2bv32 == c2_st) && c1_pc == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && 0bv32 == processed) && data == 0bv32) && c1_st == 0bv32) && 2bv32 == c2_st) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && d == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && c == 1bv32) && 2bv32 == c2_st) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && ~bvadd64(2bv32, t_b) == c_t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && 2bv32 == c2_st) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && ~bvadd64(2bv32, t_b) == c_t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)))) || (!(e_wl == 1bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && ~bvadd64(2bv32, t_b) == c_t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)))) || (((!(e_wl == 1bv32) && d == 0bv32) && c == 1bv32) && (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && 2bv32 == c1_st) && data == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32)) || (((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32)) || ((!(e_wl == 1bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && ~bvadd64(1bv32, t_b) == c_t)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32)) || ((((((((((2bv32 == e_f && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 2bv32 == e_e) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || (!(e_wl == 1bv32) && (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (!(e_wl == 1bv32) && ((((0bv32 == t_b && d == 1bv32) && c == 1bv32) && (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) || ((c == ~bvadd64(1bv32, t_b) && (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && ~bvadd64(1bv32, t_b) == c_t)))) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && data == 0bv32) && c1_st == 0bv32) && 2bv32 == c2_st) && c1_pc == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32)) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && 0bv32 == processed) && 2bv32 == c1_st) && data == 0bv32) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || ((!(e_wl == 1bv32) && d == 0bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && data == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) - InvariantResult [Line: 684]: Loop Invariant Derived loop invariant: c2_i == 1bv32 - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: (((((((((!(e_wl == 1bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && ~bvadd64(2bv32, t_b) == c_t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || ((!(e_wl == 1bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && ~bvadd64(1bv32, t_b) == c_t)) || ((((((((((2bv32 == e_f && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 2bv32 == e_e) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || (!(e_wl == 1bv32) && (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 2bv32 == e_e) && 2bv32 == wb_st) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == e_c) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && data == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || (((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || ((!(e_wl == 1bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && ~bvadd64(1bv32, t_b) == c_t)) || ((((((((((2bv32 == e_f && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 2bv32 == e_e) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && 0bv32 == processed) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || ((!(e_wl == 1bv32) && (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && !(e_wl == 0bv32)) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && ~bvadd64(1bv32, t_b) == c_t)) || ((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && 0bv32 == processed) && 2bv32 == c1_st) && data == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && !(e_wl == 0bv32)) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && !(e_wl == 0bv32)) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && 0bv32 == r_i) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32) || (((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((0bv32 == t_b && d == 1bv32) && (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && c == 1bv32) || (((c == ~bvadd64(1bv32, t_b) && d == ~bvadd64(1bv32, t_b)) && (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && ~bvadd64(1bv32, t_b) == c_t)))) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32)) || (((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && 2bv32 == c2_st) && c1_pc == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && 0bv32 == processed) && data == 0bv32) && c1_st == 0bv32) && 2bv32 == c2_st) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && d == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && c == 1bv32) && 2bv32 == c2_st) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && 2bv32 == c2_st) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || (!(e_wl == 1bv32) && (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && ~bvadd64(2bv32, t_b) == c_t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)))) || (!(e_wl == 1bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && ~bvadd64(2bv32, t_b) == c_t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)))) || (((!(e_wl == 1bv32) && d == 0bv32) && c == 1bv32) && (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && 2bv32 == c1_st) && data == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32)) || (((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32)) || ((!(e_wl == 1bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && ~bvadd64(1bv32, t_b) == c_t)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32)) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && 2bv32 == e_c) && ~bvadd64(2bv32, t_b) == c_t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)) || ((((((((((2bv32 == e_f && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 2bv32 == e_e) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || (!(e_wl == 1bv32) && ((((0bv32 == t_b && d == 1bv32) && c == 1bv32) && (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) || ((c == ~bvadd64(1bv32, t_b) && (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && ~bvadd64(1bv32, t_b) == c_t)))) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && data == 0bv32) && c1_st == 0bv32) && 2bv32 == c2_st) && c1_pc == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32)) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && 0bv32 == processed) && 2bv32 == c1_st) && data == 0bv32) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || ((!(e_wl == 1bv32) && d == 0bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && data == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((!(e_wl == 1bv32) && (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && ~bvadd64(1bv32, t_b) == c_t)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32) || ((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && data == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == processed) && !(wl_st == 0bv32)) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32)) || ((!(e_wl == 1bv32) && (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && ~bvadd64(1bv32, t_b) == c_t)) || (((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && data == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32)) || ((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && 0bv32 == processed) && data == 0bv32) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && wb_st == 0bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 0bv32 == processed) && !(wl_st == 0bv32)) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && data == 0bv32) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 0bv32 == processed) && !(wl_st == 0bv32)) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && wb_st == 0bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || (((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((2bv32 == e_f && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 2bv32 == e_e) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || ((!(e_wl == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || ((((((((((2bv32 == e_f && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 2bv32 == e_e) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32) || (((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((0bv32 == t_b && d == 1bv32) && (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && c == 1bv32) || (((c == ~bvadd64(1bv32, t_b) && d == ~bvadd64(1bv32, t_b)) && (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && ~bvadd64(1bv32, t_b) == c_t)))) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32)) || (((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && 2bv32 == c2_st) && c1_pc == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && 0bv32 == processed) && data == 0bv32) && c1_st == 0bv32) && 2bv32 == c2_st) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && d == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && c == 1bv32) && 2bv32 == c2_st) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && ~bvadd64(2bv32, t_b) == c_t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && 2bv32 == c2_st) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && ~bvadd64(2bv32, t_b) == c_t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)))) || (!(e_wl == 1bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && ~bvadd64(2bv32, t_b) == c_t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)))) || (((!(e_wl == 1bv32) && d == 0bv32) && c == 1bv32) && (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && 2bv32 == c1_st) && data == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32)) || (((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32)) || ((!(e_wl == 1bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && ~bvadd64(1bv32, t_b) == c_t)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32)) || ((((((((((2bv32 == e_f && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 2bv32 == e_e) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || (!(e_wl == 1bv32) && (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (!(e_wl == 1bv32) && ((((0bv32 == t_b && d == 1bv32) && c == 1bv32) && (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) || ((c == ~bvadd64(1bv32, t_b) && (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && ~bvadd64(1bv32, t_b) == c_t)))) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && data == 0bv32) && c1_st == 0bv32) && 2bv32 == c2_st) && c1_pc == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32)) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && 0bv32 == processed) && 2bv32 == c1_st) && data == 0bv32) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || ((!(e_wl == 1bv32) && d == 0bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && data == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) RESULT: Ultimate proved your program to be correct! [2021-10-16 02:27:33,921 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4315d4-1b84-489f-97dd-b4083ab676d8/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...