/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/systemc/toy.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:28:59,475 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:28:59,478 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:28:59,517 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:28:59,517 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:28:59,519 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:28:59,521 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:28:59,523 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:28:59,526 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:28:59,527 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:28:59,528 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:28:59,529 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:28:59,530 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:28:59,531 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:28:59,532 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:28:59,534 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:28:59,535 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:28:59,536 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:28:59,538 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:28:59,541 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:28:59,543 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:28:59,545 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:28:59,564 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:28:59,565 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:28:59,570 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:28:59,571 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:28:59,571 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:28:59,575 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:28:59,576 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:28:59,579 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:28:59,579 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:28:59,580 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:28:59,581 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:28:59,583 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:28:59,584 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:28:59,585 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:28:59,586 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:28:59,586 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:28:59,590 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:28:59,594 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:28:59,595 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:28:59,596 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 19:28:59,653 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:28:59,653 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:28:59,655 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:28:59,656 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:28:59,656 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:28:59,656 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:28:59,657 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:28:59,657 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:28:59,659 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:28:59,659 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:28:59,660 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:28:59,660 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:28:59,661 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:28:59,661 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:28:59,661 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:28:59,662 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:28:59,662 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:28:59,662 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:28:59,662 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:28:59,662 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:28:59,663 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:28:59,663 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:28:59,663 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:28:59,663 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:28:59,663 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:28:59,664 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/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 [2021-01-06 19:29:00,032 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:29:00,062 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:29:00,066 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:29:00,068 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:29:00,068 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:29:00,069 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/toy.cil.c [2021-01-06 19:29:00,157 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/5bfab454b/5cc3fc5bbdb2461d9473e072f43b390c/FLAG8ef9beef7 [2021-01-06 19:29:00,925 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:29:00,926 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/toy.cil.c [2021-01-06 19:29:00,951 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/5bfab454b/5cc3fc5bbdb2461d9473e072f43b390c/FLAG8ef9beef7 [2021-01-06 19:29:01,237 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/5bfab454b/5cc3fc5bbdb2461d9473e072f43b390c [2021-01-06 19:29:01,247 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:29:01,250 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:29:01,254 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:29:01,254 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:29:01,258 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:29:01,260 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:29:01" (1/1) ... [2021-01-06 19:29:01,262 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a3827c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:29:01, skipping insertion in model container [2021-01-06 19:29:01,262 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:29:01" (1/1) ... [2021-01-06 19:29:01,271 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:29:01,335 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 19:29:01,470 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/toy.cil.c[392,405] left hand side expression in assignment: lhs: VariableLHS[~wl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_wl~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t~0,] left hand side expression in assignment: lhs: VariableLHS[~data~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~processed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_f~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_f~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t_b~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t~0,] left hand side expression in assignment: lhs: VariableLHS[~c1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_g~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wb_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_g~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c2_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_g~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wb_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_g~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wb_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wb_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~processed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_e~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_e~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~wl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~c1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~c2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~wb_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~r_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~c~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_c~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wb_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wb_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_f~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_g~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_e~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_c~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_wl~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wb_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_e~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_f~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_g~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_c~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_wl~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~c~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_c~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~e_f~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_g~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_e~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_c~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_wl~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wb_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_e~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_f~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_g~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_c~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_wl~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_wl~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_c~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_g~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_f~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_e~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c2_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wb_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wb_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c2_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] [2021-01-06 19:29:01,553 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:29:01,565 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 19:29:01,579 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/toy.cil.c[392,405] left hand side expression in assignment: lhs: VariableLHS[~wl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_wl~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t~0,] left hand side expression in assignment: lhs: VariableLHS[~data~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~processed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_f~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_f~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t_b~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t~0,] left hand side expression in assignment: lhs: VariableLHS[~c1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_g~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wb_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_g~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c2_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_g~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wb_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_g~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wb_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wb_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~processed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_e~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_e~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~wl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~c1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~c2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~wb_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~r_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~c~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_c~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wb_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wb_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_f~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_g~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_e~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_c~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_wl~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wb_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_e~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_f~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_g~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_c~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_wl~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~c~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_c~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~e_f~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_g~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_e~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_c~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_wl~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wb_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_e~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_f~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_g~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_c~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_wl~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_wl~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_c~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_g~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_f~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_e~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c2_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wb_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wb_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c2_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] [2021-01-06 19:29:01,662 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:29:01,681 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:29:01,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:29:01 WrapperNode [2021-01-06 19:29:01,681 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:29:01,683 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:29:01,683 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:29:01,683 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:29:01,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:29:01" (1/1) ... [2021-01-06 19:29:01,702 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:29:01" (1/1) ... [2021-01-06 19:29:01,737 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:29:01,739 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:29:01,739 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:29:01,739 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:29:01,749 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:29:01" (1/1) ... [2021-01-06 19:29:01,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:29:01" (1/1) ... [2021-01-06 19:29:01,756 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:29:01" (1/1) ... [2021-01-06 19:29:01,756 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:29:01" (1/1) ... [2021-01-06 19:29:01,768 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:29:01" (1/1) ... [2021-01-06 19:29:01,793 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:29:01" (1/1) ... [2021-01-06 19:29:01,799 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:29:01" (1/1) ... [2021-01-06 19:29:01,807 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:29:01,811 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:29:01,811 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:29:01,811 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:29:01,812 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:29:01" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:29:01,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:29:01,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:29:01,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:29:01,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:29:02,594 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:29:02,594 INFO L299 CfgBuilder]: Removed 26 assume(true) statements. [2021-01-06 19:29:02,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:29:02 BoogieIcfgContainer [2021-01-06 19:29:02,599 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:29:02,603 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:29:02,604 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:29:02,608 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:29:02,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:29:01" (1/3) ... [2021-01-06 19:29:02,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fc39f2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:29:02, skipping insertion in model container [2021-01-06 19:29:02,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:29:01" (2/3) ... [2021-01-06 19:29:02,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fc39f2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:29:02, skipping insertion in model container [2021-01-06 19:29:02,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:29:02" (3/3) ... [2021-01-06 19:29:02,618 INFO L111 eAbstractionObserver]: Analyzing ICFG toy.cil.c [2021-01-06 19:29:02,626 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:29:02,633 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 19:29:02,656 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 19:29:02,702 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:29:02,703 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:29:02,703 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:29:02,703 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:29:02,703 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:29:02,703 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:29:02,703 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:29:02,704 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:29:02,729 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2021-01-06 19:29:02,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-01-06 19:29:02,751 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:02,752 INFO L422 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-01-06 19:29:02,753 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:02,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:02,761 INFO L82 PathProgramCache]: Analyzing trace with hash -895776564, now seen corresponding path program 1 times [2021-01-06 19:29:02,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:02,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418274934] [2021-01-06 19:29:02,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:02,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:03,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:29:03,127 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418274934] [2021-01-06 19:29:03,131 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:03,132 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:29:03,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941009896] [2021-01-06 19:29:03,138 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:29:03,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:03,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:29:03,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:03,157 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 3 states. [2021-01-06 19:29:03,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:03,212 INFO L93 Difference]: Finished difference Result 244 states and 453 transitions. [2021-01-06 19:29:03,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:29:03,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2021-01-06 19:29:03,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:03,227 INFO L225 Difference]: With dead ends: 244 [2021-01-06 19:29:03,227 INFO L226 Difference]: Without dead ends: 122 [2021-01-06 19:29:03,231 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:03,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-01-06 19:29:03,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2021-01-06 19:29:03,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2021-01-06 19:29:03,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 215 transitions. [2021-01-06 19:29:03,284 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 215 transitions. Word has length 36 [2021-01-06 19:29:03,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:03,285 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 215 transitions. [2021-01-06 19:29:03,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:29:03,285 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 215 transitions. [2021-01-06 19:29:03,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-01-06 19:29:03,287 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:03,288 INFO L422 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-01-06 19:29:03,288 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:29:03,288 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:03,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:03,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1597376438, now seen corresponding path program 1 times [2021-01-06 19:29:03,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:03,290 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802040698] [2021-01-06 19:29:03,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:03,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:03,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-01-06 19:29:03,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802040698] [2021-01-06 19:29:03,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:03,382 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:29:03,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757301007] [2021-01-06 19:29:03,384 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:29:03,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:03,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:29:03,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:29:03,386 INFO L87 Difference]: Start difference. First operand 122 states and 215 transitions. Second operand 4 states. [2021-01-06 19:29:03,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:03,457 INFO L93 Difference]: Finished difference Result 328 states and 577 transitions. [2021-01-06 19:29:03,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:29:03,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2021-01-06 19:29:03,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:03,461 INFO L225 Difference]: With dead ends: 328 [2021-01-06 19:29:03,462 INFO L226 Difference]: Without dead ends: 209 [2021-01-06 19:29:03,464 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:03,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-01-06 19:29:03,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2021-01-06 19:29:03,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2021-01-06 19:29:03,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 361 transitions. [2021-01-06 19:29:03,503 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 361 transitions. Word has length 36 [2021-01-06 19:29:03,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:03,504 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 361 transitions. [2021-01-06 19:29:03,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:29:03,504 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 361 transitions. [2021-01-06 19:29:03,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-01-06 19:29:03,506 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:03,506 INFO L422 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-01-06 19:29:03,506 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:29:03,507 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:03,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:03,507 INFO L82 PathProgramCache]: Analyzing trace with hash -211173044, now seen corresponding path program 1 times [2021-01-06 19:29:03,508 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:03,508 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007268680] [2021-01-06 19:29:03,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:03,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:03,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:29:03,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007268680] [2021-01-06 19:29:03,570 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:03,570 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:29:03,570 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089116758] [2021-01-06 19:29:03,571 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:29:03,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:03,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:29:03,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:03,574 INFO L87 Difference]: Start difference. First operand 206 states and 361 transitions. Second operand 3 states. [2021-01-06 19:29:03,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:03,670 INFO L93 Difference]: Finished difference Result 403 states and 709 transitions. [2021-01-06 19:29:03,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:29:03,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2021-01-06 19:29:03,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:03,677 INFO L225 Difference]: With dead ends: 403 [2021-01-06 19:29:03,678 INFO L226 Difference]: Without dead ends: 206 [2021-01-06 19:29:03,681 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:03,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-01-06 19:29:03,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2021-01-06 19:29:03,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2021-01-06 19:29:03,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 349 transitions. [2021-01-06 19:29:03,725 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 349 transitions. Word has length 36 [2021-01-06 19:29:03,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:03,725 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 349 transitions. [2021-01-06 19:29:03,726 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:29:03,726 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 349 transitions. [2021-01-06 19:29:03,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-01-06 19:29:03,731 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:03,732 INFO L422 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-01-06 19:29:03,732 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:29:03,732 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:03,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:03,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1741714488, now seen corresponding path program 1 times [2021-01-06 19:29:03,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:03,733 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189607708] [2021-01-06 19:29:03,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:03,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:03,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:29:03,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189607708] [2021-01-06 19:29:03,799 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:03,799 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:29:03,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792272355] [2021-01-06 19:29:03,800 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:29:03,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:03,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:29:03,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:29:03,801 INFO L87 Difference]: Start difference. First operand 206 states and 349 transitions. Second operand 4 states. [2021-01-06 19:29:03,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:03,953 INFO L93 Difference]: Finished difference Result 559 states and 950 transitions. [2021-01-06 19:29:03,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:29:03,955 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2021-01-06 19:29:03,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:03,959 INFO L225 Difference]: With dead ends: 559 [2021-01-06 19:29:03,959 INFO L226 Difference]: Without dead ends: 363 [2021-01-06 19:29:03,964 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:03,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2021-01-06 19:29:04,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 206. [2021-01-06 19:29:04,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2021-01-06 19:29:04,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 346 transitions. [2021-01-06 19:29:04,004 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 346 transitions. Word has length 36 [2021-01-06 19:29:04,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:04,004 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 346 transitions. [2021-01-06 19:29:04,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:29:04,004 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 346 transitions. [2021-01-06 19:29:04,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-01-06 19:29:04,006 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:04,007 INFO L422 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-01-06 19:29:04,007 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:29:04,011 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:04,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:04,012 INFO L82 PathProgramCache]: Analyzing trace with hash 181513546, now seen corresponding path program 1 times [2021-01-06 19:29:04,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:04,012 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427415947] [2021-01-06 19:29:04,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:04,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:04,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:29:04,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427415947] [2021-01-06 19:29:04,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:04,110 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:29:04,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838056] [2021-01-06 19:29:04,110 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:29:04,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:04,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:29:04,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:29:04,116 INFO L87 Difference]: Start difference. First operand 206 states and 346 transitions. Second operand 4 states. [2021-01-06 19:29:04,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:04,221 INFO L93 Difference]: Finished difference Result 562 states and 946 transitions. [2021-01-06 19:29:04,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:29:04,222 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2021-01-06 19:29:04,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:04,226 INFO L225 Difference]: With dead ends: 562 [2021-01-06 19:29:04,226 INFO L226 Difference]: Without dead ends: 367 [2021-01-06 19:29:04,228 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:04,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2021-01-06 19:29:04,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 206. [2021-01-06 19:29:04,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2021-01-06 19:29:04,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 343 transitions. [2021-01-06 19:29:04,244 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 343 transitions. Word has length 36 [2021-01-06 19:29:04,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:04,244 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 343 transitions. [2021-01-06 19:29:04,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:29:04,244 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 343 transitions. [2021-01-06 19:29:04,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-01-06 19:29:04,249 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:04,250 INFO L422 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-01-06 19:29:04,250 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:29:04,250 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:04,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:04,251 INFO L82 PathProgramCache]: Analyzing trace with hash 243553160, now seen corresponding path program 1 times [2021-01-06 19:29:04,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:04,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337189364] [2021-01-06 19:29:04,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:04,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:04,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:29:04,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337189364] [2021-01-06 19:29:04,332 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:04,332 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:29:04,332 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445588111] [2021-01-06 19:29:04,333 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:29:04,333 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:04,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:29:04,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:29:04,334 INFO L87 Difference]: Start difference. First operand 206 states and 343 transitions. Second operand 4 states. [2021-01-06 19:29:04,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:04,420 INFO L93 Difference]: Finished difference Result 574 states and 957 transitions. [2021-01-06 19:29:04,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:29:04,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2021-01-06 19:29:04,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:04,423 INFO L225 Difference]: With dead ends: 574 [2021-01-06 19:29:04,423 INFO L226 Difference]: Without dead ends: 380 [2021-01-06 19:29:04,424 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:04,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2021-01-06 19:29:04,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 212. [2021-01-06 19:29:04,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2021-01-06 19:29:04,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 347 transitions. [2021-01-06 19:29:04,440 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 347 transitions. Word has length 36 [2021-01-06 19:29:04,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:04,440 INFO L481 AbstractCegarLoop]: Abstraction has 212 states and 347 transitions. [2021-01-06 19:29:04,440 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:29:04,440 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 347 transitions. [2021-01-06 19:29:04,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-01-06 19:29:04,441 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:04,441 INFO L422 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-01-06 19:29:04,442 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:29:04,442 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:04,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:04,443 INFO L82 PathProgramCache]: Analyzing trace with hash 384101770, now seen corresponding path program 1 times [2021-01-06 19:29:04,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:04,443 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421644279] [2021-01-06 19:29:04,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:04,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:04,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:29:04,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421644279] [2021-01-06 19:29:04,508 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:04,508 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:29:04,509 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182739388] [2021-01-06 19:29:04,509 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:29:04,509 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:04,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:29:04,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:29:04,510 INFO L87 Difference]: Start difference. First operand 212 states and 347 transitions. Second operand 4 states. [2021-01-06 19:29:04,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:04,621 INFO L93 Difference]: Finished difference Result 721 states and 1181 transitions. [2021-01-06 19:29:04,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:29:04,622 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2021-01-06 19:29:04,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:04,626 INFO L225 Difference]: With dead ends: 721 [2021-01-06 19:29:04,626 INFO L226 Difference]: Without dead ends: 522 [2021-01-06 19:29:04,627 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:04,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2021-01-06 19:29:04,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 345. [2021-01-06 19:29:04,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2021-01-06 19:29:04,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 562 transitions. [2021-01-06 19:29:04,655 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 562 transitions. Word has length 36 [2021-01-06 19:29:04,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:04,655 INFO L481 AbstractCegarLoop]: Abstraction has 345 states and 562 transitions. [2021-01-06 19:29:04,655 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:29:04,655 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 562 transitions. [2021-01-06 19:29:04,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-01-06 19:29:04,656 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:04,657 INFO L422 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-01-06 19:29:04,657 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:29:04,657 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:04,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:04,658 INFO L82 PathProgramCache]: Analyzing trace with hash 250088264, now seen corresponding path program 1 times [2021-01-06 19:29:04,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:04,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964852988] [2021-01-06 19:29:04,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:04,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:29:04,695 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964852988] [2021-01-06 19:29:04,695 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:04,695 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:29:04,696 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754476944] [2021-01-06 19:29:04,696 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:29:04,696 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:04,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:29:04,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:04,697 INFO L87 Difference]: Start difference. First operand 345 states and 562 transitions. Second operand 3 states. [2021-01-06 19:29:04,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:04,750 INFO L93 Difference]: Finished difference Result 822 states and 1345 transitions. [2021-01-06 19:29:04,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:29:04,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2021-01-06 19:29:04,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:04,754 INFO L225 Difference]: With dead ends: 822 [2021-01-06 19:29:04,754 INFO L226 Difference]: Without dead ends: 501 [2021-01-06 19:29:04,756 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:04,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2021-01-06 19:29:04,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 499. [2021-01-06 19:29:04,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2021-01-06 19:29:04,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 812 transitions. [2021-01-06 19:29:04,790 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 812 transitions. Word has length 36 [2021-01-06 19:29:04,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:04,790 INFO L481 AbstractCegarLoop]: Abstraction has 499 states and 812 transitions. [2021-01-06 19:29:04,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:29:04,790 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 812 transitions. [2021-01-06 19:29:04,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-01-06 19:29:04,791 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:04,791 INFO L422 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-01-06 19:29:04,792 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:29:04,792 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:04,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:04,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1539793604, now seen corresponding path program 1 times [2021-01-06 19:29:04,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:04,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730902782] [2021-01-06 19:29:04,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:04,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:04,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:29:04,826 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730902782] [2021-01-06 19:29:04,827 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:04,827 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:29:04,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176455494] [2021-01-06 19:29:04,827 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:29:04,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:04,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:29:04,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:29:04,829 INFO L87 Difference]: Start difference. First operand 499 states and 812 transitions. Second operand 4 states. [2021-01-06 19:29:04,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:04,926 INFO L93 Difference]: Finished difference Result 1271 states and 2069 transitions. [2021-01-06 19:29:04,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:29:04,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2021-01-06 19:29:04,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:04,931 INFO L225 Difference]: With dead ends: 1271 [2021-01-06 19:29:04,931 INFO L226 Difference]: Without dead ends: 789 [2021-01-06 19:29:04,933 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:04,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2021-01-06 19:29:04,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 499. [2021-01-06 19:29:04,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2021-01-06 19:29:04,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 804 transitions. [2021-01-06 19:29:04,982 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 804 transitions. Word has length 36 [2021-01-06 19:29:04,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:04,982 INFO L481 AbstractCegarLoop]: Abstraction has 499 states and 804 transitions. [2021-01-06 19:29:04,982 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:29:04,982 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 804 transitions. [2021-01-06 19:29:04,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-01-06 19:29:04,983 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:04,983 INFO L422 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-01-06 19:29:04,983 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:29:04,984 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:04,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:04,984 INFO L82 PathProgramCache]: Analyzing trace with hash -48554298, now seen corresponding path program 1 times [2021-01-06 19:29:04,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:04,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072280687] [2021-01-06 19:29:04,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:04,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:05,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:29:05,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072280687] [2021-01-06 19:29:05,021 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:05,021 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:29:05,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527332206] [2021-01-06 19:29:05,022 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:29:05,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:05,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:29:05,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:29:05,023 INFO L87 Difference]: Start difference. First operand 499 states and 804 transitions. Second operand 4 states. [2021-01-06 19:29:05,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:05,152 INFO L93 Difference]: Finished difference Result 1267 states and 2042 transitions. [2021-01-06 19:29:05,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:29:05,153 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2021-01-06 19:29:05,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:05,157 INFO L225 Difference]: With dead ends: 1267 [2021-01-06 19:29:05,158 INFO L226 Difference]: Without dead ends: 791 [2021-01-06 19:29:05,159 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:05,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2021-01-06 19:29:05,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 499. [2021-01-06 19:29:05,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2021-01-06 19:29:05,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 796 transitions. [2021-01-06 19:29:05,196 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 796 transitions. Word has length 36 [2021-01-06 19:29:05,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:05,197 INFO L481 AbstractCegarLoop]: Abstraction has 499 states and 796 transitions. [2021-01-06 19:29:05,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:29:05,197 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 796 transitions. [2021-01-06 19:29:05,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-01-06 19:29:05,198 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:05,198 INFO L422 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-01-06 19:29:05,198 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:29:05,198 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:05,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:05,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1328417976, now seen corresponding path program 1 times [2021-01-06 19:29:05,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:05,199 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508741450] [2021-01-06 19:29:05,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:05,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:05,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:29:05,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508741450] [2021-01-06 19:29:05,231 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:05,231 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:29:05,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019806498] [2021-01-06 19:29:05,232 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:29:05,232 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:05,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:29:05,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:29:05,233 INFO L87 Difference]: Start difference. First operand 499 states and 796 transitions. Second operand 4 states. [2021-01-06 19:29:05,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:05,337 INFO L93 Difference]: Finished difference Result 1206 states and 1920 transitions. [2021-01-06 19:29:05,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:29:05,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2021-01-06 19:29:05,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:05,342 INFO L225 Difference]: With dead ends: 1206 [2021-01-06 19:29:05,343 INFO L226 Difference]: Without dead ends: 724 [2021-01-06 19:29:05,344 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:05,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2021-01-06 19:29:05,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 547. [2021-01-06 19:29:05,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2021-01-06 19:29:05,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 853 transitions. [2021-01-06 19:29:05,383 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 853 transitions. Word has length 36 [2021-01-06 19:29:05,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:05,384 INFO L481 AbstractCegarLoop]: Abstraction has 547 states and 853 transitions. [2021-01-06 19:29:05,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:29:05,384 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 853 transitions. [2021-01-06 19:29:05,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-01-06 19:29:05,384 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:05,385 INFO L422 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-01-06 19:29:05,385 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:29:05,385 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:05,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:05,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1915223990, now seen corresponding path program 1 times [2021-01-06 19:29:05,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:05,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567925161] [2021-01-06 19:29:05,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:05,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:05,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:29:05,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567925161] [2021-01-06 19:29:05,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:05,414 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:29:05,414 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958501159] [2021-01-06 19:29:05,415 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:29:05,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:05,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:29:05,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:05,416 INFO L87 Difference]: Start difference. First operand 547 states and 853 transitions. Second operand 3 states. [2021-01-06 19:29:05,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:05,513 INFO L93 Difference]: Finished difference Result 1300 states and 2032 transitions. [2021-01-06 19:29:05,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:29:05,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2021-01-06 19:29:05,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:05,518 INFO L225 Difference]: With dead ends: 1300 [2021-01-06 19:29:05,518 INFO L226 Difference]: Without dead ends: 767 [2021-01-06 19:29:05,519 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:05,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2021-01-06 19:29:05,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 764. [2021-01-06 19:29:05,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764 states. [2021-01-06 19:29:05,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1177 transitions. [2021-01-06 19:29:05,574 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1177 transitions. Word has length 36 [2021-01-06 19:29:05,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:05,574 INFO L481 AbstractCegarLoop]: Abstraction has 764 states and 1177 transitions. [2021-01-06 19:29:05,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:29:05,574 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1177 transitions. [2021-01-06 19:29:05,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-01-06 19:29:05,575 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:05,575 INFO L422 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-01-06 19:29:05,576 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 19:29:05,576 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:05,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:05,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1648654786, now seen corresponding path program 1 times [2021-01-06 19:29:05,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:05,577 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101219069] [2021-01-06 19:29:05,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:05,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:05,611 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:29:05,611 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101219069] [2021-01-06 19:29:05,611 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:05,612 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:29:05,612 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905775633] [2021-01-06 19:29:05,613 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:29:05,613 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:05,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:29:05,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:05,614 INFO L87 Difference]: Start difference. First operand 764 states and 1177 transitions. Second operand 3 states. [2021-01-06 19:29:05,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:05,712 INFO L93 Difference]: Finished difference Result 1882 states and 2939 transitions. [2021-01-06 19:29:05,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:29:05,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2021-01-06 19:29:05,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:05,719 INFO L225 Difference]: With dead ends: 1882 [2021-01-06 19:29:05,719 INFO L226 Difference]: Without dead ends: 1145 [2021-01-06 19:29:05,721 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:05,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2021-01-06 19:29:05,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1143. [2021-01-06 19:29:05,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1143 states. [2021-01-06 19:29:05,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1776 transitions. [2021-01-06 19:29:05,812 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 1776 transitions. Word has length 46 [2021-01-06 19:29:05,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:05,813 INFO L481 AbstractCegarLoop]: Abstraction has 1143 states and 1776 transitions. [2021-01-06 19:29:05,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:29:05,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1776 transitions. [2021-01-06 19:29:05,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-01-06 19:29:05,814 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:05,814 INFO L422 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-01-06 19:29:05,815 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:29:05,815 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:05,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:05,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1400508292, now seen corresponding path program 1 times [2021-01-06 19:29:05,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:05,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490874549] [2021-01-06 19:29:05,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:05,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:05,840 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-06 19:29:05,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490874549] [2021-01-06 19:29:05,840 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:05,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:29:05,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866593009] [2021-01-06 19:29:05,841 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:29:05,841 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:05,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:29:05,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:05,842 INFO L87 Difference]: Start difference. First operand 1143 states and 1776 transitions. Second operand 3 states. [2021-01-06 19:29:05,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:05,948 INFO L93 Difference]: Finished difference Result 2237 states and 3493 transitions. [2021-01-06 19:29:05,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:29:05,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2021-01-06 19:29:05,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:05,955 INFO L225 Difference]: With dead ends: 2237 [2021-01-06 19:29:05,956 INFO L226 Difference]: Without dead ends: 1121 [2021-01-06 19:29:05,958 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:05,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2021-01-06 19:29:06,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1121. [2021-01-06 19:29:06,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1121 states. [2021-01-06 19:29:06,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1749 transitions. [2021-01-06 19:29:06,042 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1749 transitions. Word has length 46 [2021-01-06 19:29:06,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:06,043 INFO L481 AbstractCegarLoop]: Abstraction has 1121 states and 1749 transitions. [2021-01-06 19:29:06,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:29:06,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1749 transitions. [2021-01-06 19:29:06,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-01-06 19:29:06,044 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:06,044 INFO L422 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-01-06 19:29:06,044 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:29:06,044 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:06,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:06,045 INFO L82 PathProgramCache]: Analyzing trace with hash 666181047, now seen corresponding path program 1 times [2021-01-06 19:29:06,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:06,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540033353] [2021-01-06 19:29:06,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:06,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:06,073 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:29:06,074 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540033353] [2021-01-06 19:29:06,074 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:06,074 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:29:06,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692143058] [2021-01-06 19:29:06,075 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:29:06,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:06,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:29:06,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:06,076 INFO L87 Difference]: Start difference. First operand 1121 states and 1749 transitions. Second operand 3 states. [2021-01-06 19:29:06,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:06,230 INFO L93 Difference]: Finished difference Result 2849 states and 4504 transitions. [2021-01-06 19:29:06,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:29:06,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2021-01-06 19:29:06,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:06,239 INFO L225 Difference]: With dead ends: 2849 [2021-01-06 19:29:06,240 INFO L226 Difference]: Without dead ends: 1755 [2021-01-06 19:29:06,241 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:06,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1755 states. [2021-01-06 19:29:06,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1755 to 1753. [2021-01-06 19:29:06,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1753 states. [2021-01-06 19:29:06,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1753 states and 2759 transitions. [2021-01-06 19:29:06,376 INFO L78 Accepts]: Start accepts. Automaton has 1753 states and 2759 transitions. Word has length 47 [2021-01-06 19:29:06,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:06,376 INFO L481 AbstractCegarLoop]: Abstraction has 1753 states and 2759 transitions. [2021-01-06 19:29:06,376 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:29:06,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 2759 transitions. [2021-01-06 19:29:06,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-01-06 19:29:06,378 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:06,378 INFO L422 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-01-06 19:29:06,378 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:29:06,378 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:06,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:06,379 INFO L82 PathProgramCache]: Analyzing trace with hash -656218967, now seen corresponding path program 1 times [2021-01-06 19:29:06,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:06,379 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663343234] [2021-01-06 19:29:06,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:06,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:06,408 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:29:06,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663343234] [2021-01-06 19:29:06,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:06,409 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:29:06,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333701622] [2021-01-06 19:29:06,409 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:29:06,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:06,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:29:06,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:06,411 INFO L87 Difference]: Start difference. First operand 1753 states and 2759 transitions. Second operand 3 states. [2021-01-06 19:29:06,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:06,680 INFO L93 Difference]: Finished difference Result 4716 states and 7517 transitions. [2021-01-06 19:29:06,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:29:06,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2021-01-06 19:29:06,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:06,697 INFO L225 Difference]: With dead ends: 4716 [2021-01-06 19:29:06,697 INFO L226 Difference]: Without dead ends: 2992 [2021-01-06 19:29:06,700 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:06,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2992 states. [2021-01-06 19:29:06,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2992 to 2990. [2021-01-06 19:29:06,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2990 states. [2021-01-06 19:29:06,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2990 states to 2990 states and 4746 transitions. [2021-01-06 19:29:06,953 INFO L78 Accepts]: Start accepts. Automaton has 2990 states and 4746 transitions. Word has length 48 [2021-01-06 19:29:06,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:06,953 INFO L481 AbstractCegarLoop]: Abstraction has 2990 states and 4746 transitions. [2021-01-06 19:29:06,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:29:06,953 INFO L276 IsEmpty]: Start isEmpty. Operand 2990 states and 4746 transitions. [2021-01-06 19:29:06,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-01-06 19:29:06,955 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:06,956 INFO L422 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-01-06 19:29:06,956 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 19:29:06,956 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:06,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:06,957 INFO L82 PathProgramCache]: Analyzing trace with hash -408072473, now seen corresponding path program 1 times [2021-01-06 19:29:06,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:06,957 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771650644] [2021-01-06 19:29:06,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:06,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:06,980 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-06 19:29:06,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771650644] [2021-01-06 19:29:06,981 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:06,981 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:29:06,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324455439] [2021-01-06 19:29:06,981 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:29:06,982 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:06,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:29:06,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:06,983 INFO L87 Difference]: Start difference. First operand 2990 states and 4746 transitions. Second operand 3 states. [2021-01-06 19:29:07,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:07,194 INFO L93 Difference]: Finished difference Result 5929 states and 9433 transitions. [2021-01-06 19:29:07,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:29:07,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2021-01-06 19:29:07,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:07,210 INFO L225 Difference]: With dead ends: 5929 [2021-01-06 19:29:07,210 INFO L226 Difference]: Without dead ends: 2968 [2021-01-06 19:29:07,216 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:07,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2021-01-06 19:29:07,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 2968. [2021-01-06 19:29:07,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2968 states. [2021-01-06 19:29:07,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2968 states to 2968 states and 4720 transitions. [2021-01-06 19:29:07,470 INFO L78 Accepts]: Start accepts. Automaton has 2968 states and 4720 transitions. Word has length 48 [2021-01-06 19:29:07,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:07,470 INFO L481 AbstractCegarLoop]: Abstraction has 2968 states and 4720 transitions. [2021-01-06 19:29:07,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:29:07,470 INFO L276 IsEmpty]: Start isEmpty. Operand 2968 states and 4720 transitions. [2021-01-06 19:29:07,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-01-06 19:29:07,472 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:07,472 INFO L422 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-01-06 19:29:07,473 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 19:29:07,473 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:07,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:07,473 INFO L82 PathProgramCache]: Analyzing trace with hash 2128148300, now seen corresponding path program 1 times [2021-01-06 19:29:07,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:07,474 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452302459] [2021-01-06 19:29:07,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:07,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:07,517 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:29:07,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452302459] [2021-01-06 19:29:07,518 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:07,518 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:29:07,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387590636] [2021-01-06 19:29:07,525 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:29:07,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:07,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:29:07,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:29:07,526 INFO L87 Difference]: Start difference. First operand 2968 states and 4720 transitions. Second operand 4 states. [2021-01-06 19:29:07,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:07,939 INFO L93 Difference]: Finished difference Result 7517 states and 12005 transitions. [2021-01-06 19:29:07,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:29:07,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2021-01-06 19:29:07,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:07,960 INFO L225 Difference]: With dead ends: 7517 [2021-01-06 19:29:07,960 INFO L226 Difference]: Without dead ends: 3845 [2021-01-06 19:29:07,967 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:07,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3845 states. [2021-01-06 19:29:08,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3845 to 3845. [2021-01-06 19:29:08,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3845 states. [2021-01-06 19:29:08,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3845 states to 3845 states and 6086 transitions. [2021-01-06 19:29:08,329 INFO L78 Accepts]: Start accepts. Automaton has 3845 states and 6086 transitions. Word has length 49 [2021-01-06 19:29:08,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:08,330 INFO L481 AbstractCegarLoop]: Abstraction has 3845 states and 6086 transitions. [2021-01-06 19:29:08,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:29:08,330 INFO L276 IsEmpty]: Start isEmpty. Operand 3845 states and 6086 transitions. [2021-01-06 19:29:08,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-01-06 19:29:08,332 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:08,333 INFO L422 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] [2021-01-06 19:29:08,333 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 19:29:08,333 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:08,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:08,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1609174737, now seen corresponding path program 1 times [2021-01-06 19:29:08,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:08,335 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824260760] [2021-01-06 19:29:08,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:08,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:08,377 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:29:08,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824260760] [2021-01-06 19:29:08,378 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:08,378 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:29:08,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081352732] [2021-01-06 19:29:08,379 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:29:08,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:08,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:29:08,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:08,380 INFO L87 Difference]: Start difference. First operand 3845 states and 6086 transitions. Second operand 5 states. [2021-01-06 19:29:08,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:08,962 INFO L93 Difference]: Finished difference Result 9812 states and 15418 transitions. [2021-01-06 19:29:08,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 19:29:08,963 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2021-01-06 19:29:08,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:08,996 INFO L225 Difference]: With dead ends: 9812 [2021-01-06 19:29:08,996 INFO L226 Difference]: Without dead ends: 5990 [2021-01-06 19:29:09,003 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:29:09,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5990 states. [2021-01-06 19:29:09,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5990 to 4496. [2021-01-06 19:29:09,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4496 states. [2021-01-06 19:29:09,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4496 states to 4496 states and 6959 transitions. [2021-01-06 19:29:09,419 INFO L78 Accepts]: Start accepts. Automaton has 4496 states and 6959 transitions. Word has length 54 [2021-01-06 19:29:09,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:09,420 INFO L481 AbstractCegarLoop]: Abstraction has 4496 states and 6959 transitions. [2021-01-06 19:29:09,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:29:09,420 INFO L276 IsEmpty]: Start isEmpty. Operand 4496 states and 6959 transitions. [2021-01-06 19:29:09,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-01-06 19:29:09,424 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:09,424 INFO L422 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-01-06 19:29:09,424 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 19:29:09,425 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:09,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:09,425 INFO L82 PathProgramCache]: Analyzing trace with hash -605096400, now seen corresponding path program 1 times [2021-01-06 19:29:09,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:09,426 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194320130] [2021-01-06 19:29:09,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:09,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:09,463 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:29:09,464 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194320130] [2021-01-06 19:29:09,464 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:09,464 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:29:09,464 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218739341] [2021-01-06 19:29:09,465 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:29:09,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:09,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:29:09,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:09,466 INFO L87 Difference]: Start difference. First operand 4496 states and 6959 transitions. Second operand 3 states. [2021-01-06 19:29:09,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:09,963 INFO L93 Difference]: Finished difference Result 9315 states and 14384 transitions. [2021-01-06 19:29:09,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:29:09,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2021-01-06 19:29:09,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:09,983 INFO L225 Difference]: With dead ends: 9315 [2021-01-06 19:29:09,983 INFO L226 Difference]: Without dead ends: 4848 [2021-01-06 19:29:09,990 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:09,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4848 states. [2021-01-06 19:29:10,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4848 to 4816. [2021-01-06 19:29:10,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4816 states. [2021-01-06 19:29:10,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4816 states to 4816 states and 7208 transitions. [2021-01-06 19:29:10,434 INFO L78 Accepts]: Start accepts. Automaton has 4816 states and 7208 transitions. Word has length 86 [2021-01-06 19:29:10,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:10,435 INFO L481 AbstractCegarLoop]: Abstraction has 4816 states and 7208 transitions. [2021-01-06 19:29:10,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:29:10,435 INFO L276 IsEmpty]: Start isEmpty. Operand 4816 states and 7208 transitions. [2021-01-06 19:29:10,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-01-06 19:29:10,439 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:10,439 INFO L422 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-01-06 19:29:10,439 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 19:29:10,440 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:10,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:10,440 INFO L82 PathProgramCache]: Analyzing trace with hash 129921275, now seen corresponding path program 1 times [2021-01-06 19:29:10,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:10,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344392568] [2021-01-06 19:29:10,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:10,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:10,477 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:29:10,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344392568] [2021-01-06 19:29:10,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:10,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:29:10,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022555581] [2021-01-06 19:29:10,478 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:29:10,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:10,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:29:10,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:10,479 INFO L87 Difference]: Start difference. First operand 4816 states and 7208 transitions. Second operand 3 states. [2021-01-06 19:29:10,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:10,907 INFO L93 Difference]: Finished difference Result 10113 states and 15094 transitions. [2021-01-06 19:29:10,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:29:10,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2021-01-06 19:29:10,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:10,921 INFO L225 Difference]: With dead ends: 10113 [2021-01-06 19:29:10,921 INFO L226 Difference]: Without dead ends: 5338 [2021-01-06 19:29:10,929 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:10,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5338 states. [2021-01-06 19:29:11,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5338 to 5290. [2021-01-06 19:29:11,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5290 states. [2021-01-06 19:29:11,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5290 states to 5290 states and 7651 transitions. [2021-01-06 19:29:11,442 INFO L78 Accepts]: Start accepts. Automaton has 5290 states and 7651 transitions. Word has length 87 [2021-01-06 19:29:11,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:11,442 INFO L481 AbstractCegarLoop]: Abstraction has 5290 states and 7651 transitions. [2021-01-06 19:29:11,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:29:11,442 INFO L276 IsEmpty]: Start isEmpty. Operand 5290 states and 7651 transitions. [2021-01-06 19:29:11,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 19:29:11,448 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:11,449 INFO L422 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-01-06 19:29:11,449 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 19:29:11,449 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:11,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:11,450 INFO L82 PathProgramCache]: Analyzing trace with hash 793269102, now seen corresponding path program 1 times [2021-01-06 19:29:11,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:11,450 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594341127] [2021-01-06 19:29:11,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:11,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:11,486 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:29:11,487 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594341127] [2021-01-06 19:29:11,487 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:11,487 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:29:11,487 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508943755] [2021-01-06 19:29:11,488 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:29:11,488 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:11,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:29:11,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:11,489 INFO L87 Difference]: Start difference. First operand 5290 states and 7651 transitions. Second operand 3 states. [2021-01-06 19:29:12,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:12,030 INFO L93 Difference]: Finished difference Result 10887 states and 15753 transitions. [2021-01-06 19:29:12,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:29:12,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2021-01-06 19:29:12,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:12,044 INFO L225 Difference]: With dead ends: 10887 [2021-01-06 19:29:12,044 INFO L226 Difference]: Without dead ends: 5658 [2021-01-06 19:29:12,056 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:12,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5658 states. [2021-01-06 19:29:12,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5658 to 5076. [2021-01-06 19:29:12,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5076 states. [2021-01-06 19:29:12,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5076 states to 5076 states and 7021 transitions. [2021-01-06 19:29:12,489 INFO L78 Accepts]: Start accepts. Automaton has 5076 states and 7021 transitions. Word has length 88 [2021-01-06 19:29:12,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:12,489 INFO L481 AbstractCegarLoop]: Abstraction has 5076 states and 7021 transitions. [2021-01-06 19:29:12,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:29:12,489 INFO L276 IsEmpty]: Start isEmpty. Operand 5076 states and 7021 transitions. [2021-01-06 19:29:12,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-01-06 19:29:12,496 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:12,496 INFO L422 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-01-06 19:29:12,496 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 19:29:12,497 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:12,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:12,497 INFO L82 PathProgramCache]: Analyzing trace with hash -831404099, now seen corresponding path program 1 times [2021-01-06 19:29:12,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:12,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659040021] [2021-01-06 19:29:12,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:12,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:12,555 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-06 19:29:12,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659040021] [2021-01-06 19:29:12,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:12,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:29:12,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374846915] [2021-01-06 19:29:12,557 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:29:12,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:12,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:29:12,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:29:12,558 INFO L87 Difference]: Start difference. First operand 5076 states and 7021 transitions. Second operand 4 states. [2021-01-06 19:29:13,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:13,456 INFO L93 Difference]: Finished difference Result 9480 states and 13045 transitions. [2021-01-06 19:29:13,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:29:13,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2021-01-06 19:29:13,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:13,467 INFO L225 Difference]: With dead ends: 9480 [2021-01-06 19:29:13,468 INFO L226 Difference]: Without dead ends: 4855 [2021-01-06 19:29:13,475 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:13,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4855 states. [2021-01-06 19:29:13,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4855 to 4741. [2021-01-06 19:29:13,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4741 states. [2021-01-06 19:29:13,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4741 states to 4741 states and 6331 transitions. [2021-01-06 19:29:13,945 INFO L78 Accepts]: Start accepts. Automaton has 4741 states and 6331 transitions. Word has length 89 [2021-01-06 19:29:13,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:13,946 INFO L481 AbstractCegarLoop]: Abstraction has 4741 states and 6331 transitions. [2021-01-06 19:29:13,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:29:13,946 INFO L276 IsEmpty]: Start isEmpty. Operand 4741 states and 6331 transitions. [2021-01-06 19:29:13,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-01-06 19:29:13,957 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:13,958 INFO L422 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-01-06 19:29:13,958 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 19:29:13,958 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:13,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:13,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1827636855, now seen corresponding path program 1 times [2021-01-06 19:29:13,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:13,959 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988454536] [2021-01-06 19:29:13,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:13,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:14,000 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 19:29:14,000 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988454536] [2021-01-06 19:29:14,001 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:14,001 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:29:14,001 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603165294] [2021-01-06 19:29:14,001 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:29:14,002 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:14,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:29:14,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:14,002 INFO L87 Difference]: Start difference. First operand 4741 states and 6331 transitions. Second operand 3 states. [2021-01-06 19:29:14,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:14,363 INFO L93 Difference]: Finished difference Result 9037 states and 12059 transitions. [2021-01-06 19:29:14,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:29:14,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2021-01-06 19:29:14,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:14,373 INFO L225 Difference]: With dead ends: 9037 [2021-01-06 19:29:14,373 INFO L226 Difference]: Without dead ends: 4687 [2021-01-06 19:29:14,380 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:14,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4687 states. [2021-01-06 19:29:14,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4687 to 4687. [2021-01-06 19:29:14,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4687 states. [2021-01-06 19:29:14,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4687 states to 4687 states and 6225 transitions. [2021-01-06 19:29:14,748 INFO L78 Accepts]: Start accepts. Automaton has 4687 states and 6225 transitions. Word has length 116 [2021-01-06 19:29:14,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:14,749 INFO L481 AbstractCegarLoop]: Abstraction has 4687 states and 6225 transitions. [2021-01-06 19:29:14,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:29:14,749 INFO L276 IsEmpty]: Start isEmpty. Operand 4687 states and 6225 transitions. [2021-01-06 19:29:14,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-01-06 19:29:14,761 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:14,761 INFO L422 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-01-06 19:29:14,761 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 19:29:14,761 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:14,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:14,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1827087367, now seen corresponding path program 1 times [2021-01-06 19:29:14,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:14,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355006653] [2021-01-06 19:29:14,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:14,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:14,851 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 19:29:14,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355006653] [2021-01-06 19:29:14,851 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:14,851 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:29:14,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864154663] [2021-01-06 19:29:14,852 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:29:14,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:14,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:29:14,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:29:14,853 INFO L87 Difference]: Start difference. First operand 4687 states and 6225 transitions. Second operand 4 states. [2021-01-06 19:29:15,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:15,300 INFO L93 Difference]: Finished difference Result 8325 states and 11081 transitions. [2021-01-06 19:29:15,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:29:15,301 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2021-01-06 19:29:15,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:15,312 INFO L225 Difference]: With dead ends: 8325 [2021-01-06 19:29:15,312 INFO L226 Difference]: Without dead ends: 4607 [2021-01-06 19:29:15,318 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:15,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4607 states. [2021-01-06 19:29:15,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4607 to 4605. [2021-01-06 19:29:15,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4605 states. [2021-01-06 19:29:15,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4605 states to 4605 states and 6004 transitions. [2021-01-06 19:29:15,702 INFO L78 Accepts]: Start accepts. Automaton has 4605 states and 6004 transitions. Word has length 128 [2021-01-06 19:29:15,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:15,702 INFO L481 AbstractCegarLoop]: Abstraction has 4605 states and 6004 transitions. [2021-01-06 19:29:15,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:29:15,702 INFO L276 IsEmpty]: Start isEmpty. Operand 4605 states and 6004 transitions. [2021-01-06 19:29:15,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-01-06 19:29:15,713 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:15,713 INFO L422 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-01-06 19:29:15,713 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 19:29:15,714 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:15,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:15,714 INFO L82 PathProgramCache]: Analyzing trace with hash 210660645, now seen corresponding path program 1 times [2021-01-06 19:29:15,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:15,715 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512940428] [2021-01-06 19:29:15,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:15,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:15,764 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-01-06 19:29:15,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512940428] [2021-01-06 19:29:15,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:15,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:29:15,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605880614] [2021-01-06 19:29:15,765 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:29:15,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:15,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:29:15,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:15,766 INFO L87 Difference]: Start difference. First operand 4605 states and 6004 transitions. Second operand 3 states. [2021-01-06 19:29:16,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:16,099 INFO L93 Difference]: Finished difference Result 8823 states and 11496 transitions. [2021-01-06 19:29:16,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:29:16,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2021-01-06 19:29:16,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:16,110 INFO L225 Difference]: With dead ends: 8823 [2021-01-06 19:29:16,110 INFO L226 Difference]: Without dead ends: 4604 [2021-01-06 19:29:16,116 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:16,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4604 states. [2021-01-06 19:29:16,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4604 to 4564. [2021-01-06 19:29:16,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4564 states. [2021-01-06 19:29:16,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4564 states to 4564 states and 5921 transitions. [2021-01-06 19:29:16,553 INFO L78 Accepts]: Start accepts. Automaton has 4564 states and 5921 transitions. Word has length 134 [2021-01-06 19:29:16,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:16,554 INFO L481 AbstractCegarLoop]: Abstraction has 4564 states and 5921 transitions. [2021-01-06 19:29:16,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:29:16,554 INFO L276 IsEmpty]: Start isEmpty. Operand 4564 states and 5921 transitions. [2021-01-06 19:29:16,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-01-06 19:29:16,564 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:16,565 INFO L422 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-01-06 19:29:16,565 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 19:29:16,565 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:16,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:16,566 INFO L82 PathProgramCache]: Analyzing trace with hash 80634053, now seen corresponding path program 1 times [2021-01-06 19:29:16,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:16,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884840371] [2021-01-06 19:29:16,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:16,626 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-01-06 19:29:16,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884840371] [2021-01-06 19:29:16,627 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:16,627 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:29:16,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322078324] [2021-01-06 19:29:16,628 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:29:16,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:16,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:29:16,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:16,629 INFO L87 Difference]: Start difference. First operand 4564 states and 5921 transitions. Second operand 3 states. [2021-01-06 19:29:16,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:16,970 INFO L93 Difference]: Finished difference Result 8762 states and 11357 transitions. [2021-01-06 19:29:16,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:29:16,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2021-01-06 19:29:16,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:16,983 INFO L225 Difference]: With dead ends: 8762 [2021-01-06 19:29:16,983 INFO L226 Difference]: Without dead ends: 4574 [2021-01-06 19:29:16,993 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:16,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2021-01-06 19:29:17,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 4534. [2021-01-06 19:29:17,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4534 states. [2021-01-06 19:29:17,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4534 states to 4534 states and 5850 transitions. [2021-01-06 19:29:17,606 INFO L78 Accepts]: Start accepts. Automaton has 4534 states and 5850 transitions. Word has length 134 [2021-01-06 19:29:17,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:17,606 INFO L481 AbstractCegarLoop]: Abstraction has 4534 states and 5850 transitions. [2021-01-06 19:29:17,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:29:17,606 INFO L276 IsEmpty]: Start isEmpty. Operand 4534 states and 5850 transitions. [2021-01-06 19:29:17,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-01-06 19:29:17,617 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:17,617 INFO L422 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-01-06 19:29:17,617 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 19:29:17,617 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:17,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:17,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1507420786, now seen corresponding path program 1 times [2021-01-06 19:29:17,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:17,618 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706194666] [2021-01-06 19:29:17,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:17,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:17,682 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-01-06 19:29:17,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706194666] [2021-01-06 19:29:17,682 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:17,682 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:29:17,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252127460] [2021-01-06 19:29:17,683 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:29:17,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:17,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:29:17,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:29:17,684 INFO L87 Difference]: Start difference. First operand 4534 states and 5850 transitions. Second operand 4 states. [2021-01-06 19:29:18,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:18,065 INFO L93 Difference]: Finished difference Result 7387 states and 9578 transitions. [2021-01-06 19:29:18,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:29:18,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2021-01-06 19:29:18,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:18,072 INFO L225 Difference]: With dead ends: 7387 [2021-01-06 19:29:18,072 INFO L226 Difference]: Without dead ends: 3225 [2021-01-06 19:29:18,078 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:18,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3225 states. [2021-01-06 19:29:18,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3225 to 3223. [2021-01-06 19:29:18,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3223 states. [2021-01-06 19:29:18,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3223 states to 3223 states and 4052 transitions. [2021-01-06 19:29:18,382 INFO L78 Accepts]: Start accepts. Automaton has 3223 states and 4052 transitions. Word has length 137 [2021-01-06 19:29:18,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:18,382 INFO L481 AbstractCegarLoop]: Abstraction has 3223 states and 4052 transitions. [2021-01-06 19:29:18,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:29:18,383 INFO L276 IsEmpty]: Start isEmpty. Operand 3223 states and 4052 transitions. [2021-01-06 19:29:18,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-01-06 19:29:18,388 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:18,388 INFO L422 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-01-06 19:29:18,389 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 19:29:18,389 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:18,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:18,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1526376893, now seen corresponding path program 1 times [2021-01-06 19:29:18,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:18,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721161799] [2021-01-06 19:29:18,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:18,445 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-06 19:29:18,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721161799] [2021-01-06 19:29:18,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:18,446 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:29:18,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053421031] [2021-01-06 19:29:18,447 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:29:18,447 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:18,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:29:18,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:29:18,448 INFO L87 Difference]: Start difference. First operand 3223 states and 4052 transitions. Second operand 4 states. [2021-01-06 19:29:18,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:18,650 INFO L93 Difference]: Finished difference Result 5208 states and 6552 transitions. [2021-01-06 19:29:18,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:29:18,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2021-01-06 19:29:18,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:18,653 INFO L225 Difference]: With dead ends: 5208 [2021-01-06 19:29:18,653 INFO L226 Difference]: Without dead ends: 2057 [2021-01-06 19:29:18,657 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:18,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2057 states. [2021-01-06 19:29:18,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2057 to 2055. [2021-01-06 19:29:18,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2055 states. [2021-01-06 19:29:18,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 2514 transitions. [2021-01-06 19:29:18,820 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 2514 transitions. Word has length 137 [2021-01-06 19:29:18,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:18,820 INFO L481 AbstractCegarLoop]: Abstraction has 2055 states and 2514 transitions. [2021-01-06 19:29:18,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:29:18,821 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 2514 transitions. [2021-01-06 19:29:18,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-01-06 19:29:18,822 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:18,823 INFO L422 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-01-06 19:29:18,823 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 19:29:18,823 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:18,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:18,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1143751876, now seen corresponding path program 1 times [2021-01-06 19:29:18,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:18,824 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093909645] [2021-01-06 19:29:18,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:18,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:18,886 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-01-06 19:29:18,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093909645] [2021-01-06 19:29:18,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:18,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:29:18,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443307635] [2021-01-06 19:29:18,887 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:29:18,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:18,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:29:18,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:18,889 INFO L87 Difference]: Start difference. First operand 2055 states and 2514 transitions. Second operand 3 states. [2021-01-06 19:29:19,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:19,089 INFO L93 Difference]: Finished difference Result 3727 states and 4591 transitions. [2021-01-06 19:29:19,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:29:19,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2021-01-06 19:29:19,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:19,092 INFO L225 Difference]: With dead ends: 3727 [2021-01-06 19:29:19,092 INFO L226 Difference]: Without dead ends: 2013 [2021-01-06 19:29:19,094 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:19,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2013 states. [2021-01-06 19:29:19,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2013 to 1935. [2021-01-06 19:29:19,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2021-01-06 19:29:19,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2336 transitions. [2021-01-06 19:29:19,218 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2336 transitions. Word has length 176 [2021-01-06 19:29:19,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:19,219 INFO L481 AbstractCegarLoop]: Abstraction has 1935 states and 2336 transitions. [2021-01-06 19:29:19,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:29:19,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2336 transitions. [2021-01-06 19:29:19,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2021-01-06 19:29:19,220 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:19,220 INFO L422 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-01-06 19:29:19,221 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 19:29:19,221 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:19,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:19,221 INFO L82 PathProgramCache]: Analyzing trace with hash 709277431, now seen corresponding path program 1 times [2021-01-06 19:29:19,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:19,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542012169] [2021-01-06 19:29:19,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:19,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:19,282 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-01-06 19:29:19,282 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542012169] [2021-01-06 19:29:19,283 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:19,283 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:29:19,283 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876740017] [2021-01-06 19:29:19,283 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:29:19,284 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:19,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:29:19,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:19,284 INFO L87 Difference]: Start difference. First operand 1935 states and 2336 transitions. Second operand 3 states. [2021-01-06 19:29:19,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:19,499 INFO L93 Difference]: Finished difference Result 4164 states and 5063 transitions. [2021-01-06 19:29:19,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:29:19,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2021-01-06 19:29:19,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:19,503 INFO L225 Difference]: With dead ends: 4164 [2021-01-06 19:29:19,504 INFO L226 Difference]: Without dead ends: 2566 [2021-01-06 19:29:19,506 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:19,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2021-01-06 19:29:19,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 2213. [2021-01-06 19:29:19,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2213 states. [2021-01-06 19:29:19,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2213 states to 2213 states and 2636 transitions. [2021-01-06 19:29:19,741 INFO L78 Accepts]: Start accepts. Automaton has 2213 states and 2636 transitions. Word has length 182 [2021-01-06 19:29:19,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:19,741 INFO L481 AbstractCegarLoop]: Abstraction has 2213 states and 2636 transitions. [2021-01-06 19:29:19,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:29:19,742 INFO L276 IsEmpty]: Start isEmpty. Operand 2213 states and 2636 transitions. [2021-01-06 19:29:19,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-01-06 19:29:19,743 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:19,743 INFO L422 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-01-06 19:29:19,743 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-06 19:29:19,743 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:19,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:19,744 INFO L82 PathProgramCache]: Analyzing trace with hash 391755360, now seen corresponding path program 1 times [2021-01-06 19:29:19,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:19,744 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008067989] [2021-01-06 19:29:19,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:20,133 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 19:29:20,133 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008067989] [2021-01-06 19:29:20,133 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437278825] [2021-01-06 19:29:20,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:29:20,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:20,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 20 conjunts are in the unsatisfiable core [2021-01-06 19:29:20,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:29:20,654 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 81 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 19:29:20,654 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:29:20,655 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-01-06 19:29:20,655 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828316470] [2021-01-06 19:29:20,656 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-01-06 19:29:20,656 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:20,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-01-06 19:29:20,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-01-06 19:29:20,657 INFO L87 Difference]: Start difference. First operand 2213 states and 2636 transitions. Second operand 19 states. [2021-01-06 19:29:22,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:22,204 INFO L93 Difference]: Finished difference Result 7188 states and 8534 transitions. [2021-01-06 19:29:22,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-01-06 19:29:22,205 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 185 [2021-01-06 19:29:22,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:22,220 INFO L225 Difference]: With dead ends: 7188 [2021-01-06 19:29:22,220 INFO L226 Difference]: Without dead ends: 5299 [2021-01-06 19:29:22,224 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=237, Invalid=1569, Unknown=0, NotChecked=0, Total=1806 [2021-01-06 19:29:22,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5299 states. [2021-01-06 19:29:22,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5299 to 2902. [2021-01-06 19:29:22,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2902 states. [2021-01-06 19:29:22,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2902 states to 2902 states and 3449 transitions. [2021-01-06 19:29:22,578 INFO L78 Accepts]: Start accepts. Automaton has 2902 states and 3449 transitions. Word has length 185 [2021-01-06 19:29:22,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:22,579 INFO L481 AbstractCegarLoop]: Abstraction has 2902 states and 3449 transitions. [2021-01-06 19:29:22,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2021-01-06 19:29:22,579 INFO L276 IsEmpty]: Start isEmpty. Operand 2902 states and 3449 transitions. [2021-01-06 19:29:22,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2021-01-06 19:29:22,582 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:22,582 INFO L422 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-01-06 19:29:22,796 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2021-01-06 19:29:22,796 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:22,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:22,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1085364486, now seen corresponding path program 1 times [2021-01-06 19:29:22,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:22,797 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494356128] [2021-01-06 19:29:22,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:22,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:23,075 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-01-06 19:29:23,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494356128] [2021-01-06 19:29:23,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746928020] [2021-01-06 19:29:23,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:29:23,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:23,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 19 conjunts are in the unsatisfiable core [2021-01-06 19:29:23,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:29:23,549 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-01-06 19:29:23,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:29:23,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2021-01-06 19:29:23,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663427967] [2021-01-06 19:29:23,550 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 19:29:23,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:23,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 19:29:23,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-01-06 19:29:23,551 INFO L87 Difference]: Start difference. First operand 2902 states and 3449 transitions. Second operand 10 states. [2021-01-06 19:29:24,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:24,406 INFO L93 Difference]: Finished difference Result 6480 states and 7693 transitions. [2021-01-06 19:29:24,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 19:29:24,406 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 191 [2021-01-06 19:29:24,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:24,414 INFO L225 Difference]: With dead ends: 6480 [2021-01-06 19:29:24,414 INFO L226 Difference]: Without dead ends: 3902 [2021-01-06 19:29:24,418 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 191 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2021-01-06 19:29:24,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3902 states. [2021-01-06 19:29:24,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3902 to 3099. [2021-01-06 19:29:24,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3099 states. [2021-01-06 19:29:24,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3099 states to 3099 states and 3672 transitions. [2021-01-06 19:29:24,812 INFO L78 Accepts]: Start accepts. Automaton has 3099 states and 3672 transitions. Word has length 191 [2021-01-06 19:29:24,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:24,812 INFO L481 AbstractCegarLoop]: Abstraction has 3099 states and 3672 transitions. [2021-01-06 19:29:24,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 19:29:24,813 INFO L276 IsEmpty]: Start isEmpty. Operand 3099 states and 3672 transitions. [2021-01-06 19:29:24,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2021-01-06 19:29:24,817 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:24,817 INFO L422 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-01-06 19:29:25,031 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:29:25,032 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:25,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:25,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1258410680, now seen corresponding path program 1 times [2021-01-06 19:29:25,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:25,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871615355] [2021-01-06 19:29:25,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:25,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:25,125 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-01-06 19:29:25,125 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871615355] [2021-01-06 19:29:25,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:25,126 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:29:25,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468712154] [2021-01-06 19:29:25,126 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:29:25,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:25,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:29:25,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:25,127 INFO L87 Difference]: Start difference. First operand 3099 states and 3672 transitions. Second operand 3 states. [2021-01-06 19:29:25,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:25,353 INFO L93 Difference]: Finished difference Result 4753 states and 5608 transitions. [2021-01-06 19:29:25,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:29:25,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 251 [2021-01-06 19:29:25,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:25,357 INFO L225 Difference]: With dead ends: 4753 [2021-01-06 19:29:25,357 INFO L226 Difference]: Without dead ends: 2114 [2021-01-06 19:29:25,360 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:25,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2114 states. [2021-01-06 19:29:25,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2114 to 2081. [2021-01-06 19:29:25,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2081 states. [2021-01-06 19:29:25,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 2081 states and 2408 transitions. [2021-01-06 19:29:25,567 INFO L78 Accepts]: Start accepts. Automaton has 2081 states and 2408 transitions. Word has length 251 [2021-01-06 19:29:25,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:25,568 INFO L481 AbstractCegarLoop]: Abstraction has 2081 states and 2408 transitions. [2021-01-06 19:29:25,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:29:25,568 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 2408 transitions. [2021-01-06 19:29:25,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2021-01-06 19:29:25,570 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:25,570 INFO L422 BasicCegarLoop]: trace histogram [9, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-01-06 19:29:25,570 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-01-06 19:29:25,570 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:25,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:25,571 INFO L82 PathProgramCache]: Analyzing trace with hash 2068647826, now seen corresponding path program 1 times [2021-01-06 19:29:25,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:25,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974945409] [2021-01-06 19:29:25,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:25,691 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-01-06 19:29:25,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974945409] [2021-01-06 19:29:25,692 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:25,692 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:29:25,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214163058] [2021-01-06 19:29:25,692 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:29:25,693 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:25,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:29:25,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:25,693 INFO L87 Difference]: Start difference. First operand 2081 states and 2408 transitions. Second operand 3 states. [2021-01-06 19:29:25,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:25,821 INFO L93 Difference]: Finished difference Result 2385 states and 2747 transitions. [2021-01-06 19:29:25,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:29:25,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 275 [2021-01-06 19:29:25,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:25,823 INFO L225 Difference]: With dead ends: 2385 [2021-01-06 19:29:25,823 INFO L226 Difference]: Without dead ends: 815 [2021-01-06 19:29:25,824 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:25,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2021-01-06 19:29:25,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 815. [2021-01-06 19:29:25,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2021-01-06 19:29:25,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 901 transitions. [2021-01-06 19:29:25,919 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 901 transitions. Word has length 275 [2021-01-06 19:29:25,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:25,919 INFO L481 AbstractCegarLoop]: Abstraction has 815 states and 901 transitions. [2021-01-06 19:29:25,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:29:25,920 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 901 transitions. [2021-01-06 19:29:25,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2021-01-06 19:29:25,921 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:25,922 INFO L422 BasicCegarLoop]: trace histogram [9, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-01-06 19:29:25,922 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-01-06 19:29:25,922 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:25,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:25,923 INFO L82 PathProgramCache]: Analyzing trace with hash 625161699, now seen corresponding path program 1 times [2021-01-06 19:29:25,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:25,923 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945019411] [2021-01-06 19:29:25,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:26,024 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2021-01-06 19:29:26,024 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945019411] [2021-01-06 19:29:26,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:26,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:29:26,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472482474] [2021-01-06 19:29:26,025 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:29:26,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:26,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:29:26,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:26,030 INFO L87 Difference]: Start difference. First operand 815 states and 901 transitions. Second operand 3 states. [2021-01-06 19:29:26,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:26,128 INFO L93 Difference]: Finished difference Result 1159 states and 1277 transitions. [2021-01-06 19:29:26,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:29:26,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 277 [2021-01-06 19:29:26,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:26,131 INFO L225 Difference]: With dead ends: 1159 [2021-01-06 19:29:26,131 INFO L226 Difference]: Without dead ends: 745 [2021-01-06 19:29:26,132 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:26,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2021-01-06 19:29:26,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 737. [2021-01-06 19:29:26,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2021-01-06 19:29:26,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 809 transitions. [2021-01-06 19:29:26,229 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 809 transitions. Word has length 277 [2021-01-06 19:29:26,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:26,229 INFO L481 AbstractCegarLoop]: Abstraction has 737 states and 809 transitions. [2021-01-06 19:29:26,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:29:26,230 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 809 transitions. [2021-01-06 19:29:26,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2021-01-06 19:29:26,232 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:26,233 INFO L422 BasicCegarLoop]: trace histogram [10, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-01-06 19:29:26,233 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-01-06 19:29:26,233 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:26,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:26,233 INFO L82 PathProgramCache]: Analyzing trace with hash -469819346, now seen corresponding path program 1 times [2021-01-06 19:29:26,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:26,234 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929742554] [2021-01-06 19:29:26,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:26,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:26,569 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 237 proven. 30 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2021-01-06 19:29:26,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929742554] [2021-01-06 19:29:26,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960940983] [2021-01-06 19:29:26,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:29:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:26,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 17 conjunts are in the unsatisfiable core [2021-01-06 19:29:26,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:29:27,097 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 237 proven. 30 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2021-01-06 19:29:27,098 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:29:27,098 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2021-01-06 19:29:27,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673348465] [2021-01-06 19:29:27,100 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 19:29:27,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:27,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 19:29:27,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:29:27,101 INFO L87 Difference]: Start difference. First operand 737 states and 809 transitions. Second operand 9 states. [2021-01-06 19:29:27,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:27,444 INFO L93 Difference]: Finished difference Result 1053 states and 1149 transitions. [2021-01-06 19:29:27,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-06 19:29:27,444 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 289 [2021-01-06 19:29:27,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:27,445 INFO L225 Difference]: With dead ends: 1053 [2021-01-06 19:29:27,445 INFO L226 Difference]: Without dead ends: 0 [2021-01-06 19:29:27,447 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 294 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-01-06 19:29:27,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-01-06 19:29:27,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-01-06 19:29:27,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-01-06 19:29:27,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-01-06 19:29:27,447 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 289 [2021-01-06 19:29:27,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:27,447 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-01-06 19:29:27,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 19:29:27,448 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-01-06 19:29:27,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-01-06 19:29:27,662 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-01-06 19:29:27,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-01-06 19:29:29,567 WARN L197 SmtUtils]: Spent 1.88 s on a formula simplification. DAG size of input: 422 DAG size of output: 365 [2021-01-06 19:29:30,134 WARN L197 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 210 [2021-01-06 19:29:31,301 WARN L197 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 429 DAG size of output: 372 [2021-01-06 19:29:31,533 WARN L197 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 200 [2021-01-06 19:29:31,677 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 165 [2021-01-06 19:29:32,680 WARN L197 SmtUtils]: Spent 1000.00 ms on a formula simplification. DAG size of input: 440 DAG size of output: 383 [2021-01-06 19:29:32,921 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 190 [2021-01-06 19:29:33,085 WARN L197 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 191 [2021-01-06 19:29:33,987 WARN L197 SmtUtils]: Spent 892.00 ms on a formula simplification. DAG size of input: 429 DAG size of output: 372 [2021-01-06 19:29:34,303 WARN L197 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 304 DAG size of output: 271 [2021-01-06 19:29:34,458 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 190 [2021-01-06 19:29:35,274 WARN L197 SmtUtils]: Spent 814.00 ms on a formula simplification. DAG size of input: 435 DAG size of output: 378 [2021-01-06 19:29:35,602 WARN L197 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 304 DAG size of output: 271 [2021-01-06 19:29:35,728 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 171 [2021-01-06 19:29:35,850 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 201 [2021-01-06 19:29:42,406 WARN L197 SmtUtils]: Spent 6.55 s on a formula simplification. DAG size of input: 357 DAG size of output: 164 [2021-01-06 19:29:43,843 WARN L197 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 202 DAG size of output: 87 [2021-01-06 19:29:51,949 WARN L197 SmtUtils]: Spent 8.10 s on a formula simplification. DAG size of input: 364 DAG size of output: 162 [2021-01-06 19:29:53,162 WARN L197 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 107 DAG size of output: 78 [2021-01-06 19:29:54,411 WARN L197 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 192 DAG size of output: 85 [2021-01-06 19:29:55,321 WARN L197 SmtUtils]: Spent 907.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 83 [2021-01-06 19:30:02,368 WARN L197 SmtUtils]: Spent 7.04 s on a formula simplification. DAG size of input: 375 DAG size of output: 165 [2021-01-06 19:30:02,924 WARN L197 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 75 [2021-01-06 19:30:03,757 WARN L197 SmtUtils]: Spent 829.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 84 [2021-01-06 19:30:05,439 WARN L197 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 183 DAG size of output: 111 [2021-01-06 19:30:05,732 WARN L197 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2021-01-06 19:30:13,901 WARN L197 SmtUtils]: Spent 8.16 s on a formula simplification. DAG size of input: 364 DAG size of output: 162 [2021-01-06 19:30:15,971 WARN L197 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 263 DAG size of output: 128 [2021-01-06 19:30:16,781 WARN L197 SmtUtils]: Spent 807.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 84 [2021-01-06 19:30:25,217 WARN L197 SmtUtils]: Spent 8.43 s on a formula simplification. DAG size of input: 370 DAG size of output: 163 [2021-01-06 19:30:27,238 WARN L197 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 263 DAG size of output: 128 [2021-01-06 19:30:28,088 WARN L197 SmtUtils]: Spent 847.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 83 [2021-01-06 19:30:29,201 WARN L197 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 193 DAG size of output: 116 [2021-01-06 19:30:29,206 INFO L189 CegarLoopUtils]: For program point L498(lines 498 502) no Hoare annotation was computed. [2021-01-06 19:30:29,208 INFO L185 CegarLoopUtils]: At program point L234-1(lines 222 249) the Hoare annotation is: (let ((.cse24 (= ~c2_st~0 0)) (.cse25 (= ~c1_st~0 0)) (.cse34 (+ ~t_b~0 1))) (let ((.cse8 (= ~c2_pc~0 0)) (.cse9 (not (= 2 ~wl_pc~0))) (.cse32 (<= ~c_t~0 .cse34)) (.cse33 (<= .cse34 ~c_t~0)) (.cse29 (= ~c1_pc~0 1)) (.cse30 (not (= ~r_st~0 0))) (.cse35 (= ~wb_pc~0 1)) (.cse36 (not .cse25)) (.cse12 (not (= 0 ~wl_st~0))) (.cse28 (= ~c2_pc~0 1)) (.cse0 (= ~processed~0 0)) (.cse1 (= ~r_st~0 ~e_f~0)) (.cse2 (not (= ~wb_st~0 0))) (.cse4 (= ~data~0 0)) (.cse3 (not (= ~e_wl~0 1))) (.cse5 (= ~c2_i~0 1)) (.cse6 (= ~t_b~0 0)) (.cse7 (= ~wb_pc~0 0)) (.cse31 (not .cse24)) (.cse10 (= ~wb_i~0 1)) (.cse11 (not (= ~e_c~0 0))) (.cse13 (= ~e_f~0 2)) (.cse14 (= ~d~0 0)) (.cse16 (= ~c1_i~0 1)) (.cse15 (= ~e_c~0 2)) (.cse17 (not (= ~e_g~0 1))) (.cse18 (not (= ~e_e~0 1))) (.cse19 (not (= ~r_i~0 1))) (.cse20 (= ~c1_pc~0 0)) (.cse21 (not (= ~e_g~0 0))) (.cse26 (not (= ~e_wl~0 0))) (.cse22 (= ~c_req_up~0 ~r_i~0)) (.cse23 (not (= ~e_e~0 0))) (.cse27 (= 0 ~wl_pc~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 .cse23 .cse24 .cse25) (and .cse16 .cse3 .cse5 .cse17 .cse18 .cse19 .cse21 .cse26 .cse23 .cse10 .cse27 .cse11 .cse12 .cse13) (and .cse28 .cse16 .cse15 .cse2 .cse3 .cse29 .cse5 .cse30 .cse31 .cse32 .cse33 .cse17 .cse18 .cse19 .cse21 .cse26 (= ~data~0 .cse34) .cse35 .cse23 .cse10 .cse25 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse36 .cse24) (and .cse28 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse31 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25) (and .cse28 .cse0 .cse1 .cse2 .cse4 .cse3 .cse5 .cse6 .cse7 .cse31 .cse10 .cse11 .cse13 .cse14 .cse16 .cse15 .cse29 .cse17 .cse18 .cse19 .cse21 .cse26 .cse22 .cse23 .cse36 .cse27) (and .cse0 .cse1 .cse2 .cse4 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse16 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22 .cse23 .cse24 .cse27 .cse25) (and .cse28 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse31 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse36) (and .cse0 .cse1 .cse2 .cse4 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse16 .cse15 .cse29 .cse17 .cse18 .cse19 .cse21 .cse26 .cse22 .cse23 .cse36 .cse24 .cse27) (and .cse28 .cse16 .cse3 .cse29 .cse5 .cse9 .cse17 .cse18 .cse19 .cse21 .cse35 .cse26 .cse23 .cse10 .cse11 .cse12 .cse13) (and .cse28 .cse16 .cse15 .cse2 .cse3 .cse29 .cse5 .cse30 .cse32 .cse33 .cse17 .cse18 .cse19 .cse21 .cse35 .cse26 .cse23 .cse36 .cse24 .cse10 (<= ~data~0 .cse34) (<= .cse34 ~data~0) .cse12 .cse13) (let ((.cse37 (+ ~t_b~0 2))) (and .cse28 .cse16 .cse15 .cse2 .cse3 .cse29 .cse5 .cse30 (= ~data~0 .cse37) .cse31 (= ~c_t~0 .cse37) .cse17 .cse18 .cse19 .cse21 .cse26 .cse35 .cse23 .cse36 .cse10 .cse12 .cse13)) (and .cse28 .cse0 .cse1 .cse2 .cse4 .cse3 .cse5 .cse6 .cse7 .cse31 .cse10 .cse11 .cse13 .cse14 .cse16 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22 .cse23 .cse27 .cse25)))) [2021-01-06 19:30:29,208 INFO L189 CegarLoopUtils]: For program point L631-1(lines 537 677) no Hoare annotation was computed. [2021-01-06 19:30:29,208 INFO L189 CegarLoopUtils]: For program point L400(lines 400 410) no Hoare annotation was computed. [2021-01-06 19:30:29,208 INFO L189 CegarLoopUtils]: For program point L400-2(lines 398 682) no Hoare annotation was computed. [2021-01-06 19:30:29,208 INFO L189 CegarLoopUtils]: For program point L301(lines 301 309) no Hoare annotation was computed. [2021-01-06 19:30:29,209 INFO L189 CegarLoopUtils]: For program point L235(line 235) no Hoare annotation was computed. [2021-01-06 19:30:29,209 INFO L189 CegarLoopUtils]: For program point L136(lines 136 140) no Hoare annotation was computed. [2021-01-06 19:30:29,209 INFO L189 CegarLoopUtils]: For program point L665(lines 665 673) no Hoare annotation was computed. [2021-01-06 19:30:29,209 INFO L189 CegarLoopUtils]: For program point L599(lines 537 677) no Hoare annotation was computed. [2021-01-06 19:30:29,209 INFO L189 CegarLoopUtils]: For program point L566-1(lines 537 677) no Hoare annotation was computed. [2021-01-06 19:30:29,209 INFO L189 CegarLoopUtils]: For program point L401(lines 401 406) no Hoare annotation was computed. [2021-01-06 19:30:29,209 INFO L189 CegarLoopUtils]: For program point L401-2(lines 401 406) no Hoare annotation was computed. [2021-01-06 19:30:29,210 INFO L185 CegarLoopUtils]: At program point L137(lines 132 172) the Hoare annotation is: (let ((.cse19 (+ ~t_b~0 1)) (.cse24 (= ~c2_st~0 0)) (.cse25 (= ~wb_st~0 0))) (let ((.cse10 (not (= ~e_c~0 0))) (.cse15 (not .cse25)) (.cse13 (= ~c2_pc~0 1)) (.cse0 (= ~c1_i~0 1)) (.cse14 (= ~e_c~0 2)) (.cse23 (= ~processed~0 0)) (.cse1 (not (= ~e_wl~0 1))) (.cse16 (= ~c1_pc~0 1)) (.cse2 (= ~c2_i~0 1)) (.cse17 (not (= ~r_st~0 0))) (.cse18 (not .cse24)) (.cse3 (not (= ~e_g~0 1))) (.cse4 (not (= ~e_e~0 1))) (.cse5 (not (= ~r_i~0 1))) (.cse6 (not (= ~e_g~0 0))) (.cse7 (not (= ~e_wl~0 0))) (.cse21 (= ~wb_pc~0 1)) (.cse20 (= ~data~0 .cse19)) (.cse8 (not (= ~e_e~0 0))) (.cse22 (not (= ~c1_st~0 0))) (.cse9 (= ~wb_i~0 1)) (.cse11 (not (= 0 ~wl_st~0))) (.cse12 (= ~e_f~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ~wl_pc~0) .cse10 .cse11 .cse12) (and .cse13 .cse0 .cse14 .cse15 .cse1 .cse16 .cse2 .cse17 .cse18 (<= ~c_t~0 .cse19) (<= .cse19 ~c_t~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse21 .cse8 .cse22 .cse9 .cse11 .cse12) (and .cse13 .cse0 .cse1 .cse16 .cse2 (not (= 2 ~wl_pc~0)) .cse3 .cse4 .cse5 .cse6 .cse21 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (<= ~data~0 ~t_b~0) .cse13 .cse0 .cse14 (<= ~t_b~0 ~data~0) .cse23 .cse15 (= ULTIMATE.start_write_loop_~t~0 ~data~0) .cse1 .cse16 .cse2 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse22 .cse24 .cse9 .cse11 .cse12) (and .cse13 .cse0 .cse14 .cse23 .cse1 .cse16 .cse2 .cse25 .cse17 .cse18 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse20 .cse8 .cse22 .cse9 .cse11 .cse12)))) [2021-01-06 19:30:29,210 INFO L185 CegarLoopUtils]: At program point L71(lines 57 127) the Hoare annotation is: (let ((.cse24 (= ~c1_st~0 0)) (.cse26 (= ~c2_st~0 0)) (.cse6 (= ~wb_st~0 0))) (let ((.cse25 (= ~c2_pc~0 0)) (.cse8 (= ~wb_pc~0 0)) (.cse20 (= ~c1_pc~0 0)) (.cse0 (= ~c2_pc~0 1)) (.cse1 (= ~processed~0 0)) (.cse2 (= ~r_st~0 ~e_f~0)) (.cse27 (not .cse6)) (.cse3 (= ~data~0 0)) (.cse4 (not (= ~e_wl~0 1))) (.cse5 (= ~c2_i~0 1)) (.cse7 (= ~t_b~0 0)) (.cse9 (not .cse26)) (.cse10 (not (= 2 ~wl_pc~0))) (.cse28 (= ~wb_pc~0 1)) (.cse11 (= ~wb_i~0 1)) (.cse12 (not (= 0 ~wl_st~0))) (.cse13 (= ~e_f~0 2)) (.cse14 (= ~d~0 0)) (.cse15 (= ~c1_i~0 1)) (.cse16 (= ~e_c~0 2)) (.cse29 (= ~c1_pc~0 1)) (.cse17 (not (= ~e_g~0 1))) (.cse18 (not (= ~e_e~0 1))) (.cse19 (not (= ~r_i~0 1))) (.cse21 (not (= ~e_g~0 0))) (.cse22 (= ~c_req_up~0 ~r_i~0)) (.cse23 (not (= ~e_e~0 0))) (.cse30 (not .cse24))) (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 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse26 .cse24) (and .cse1 .cse2 .cse27 .cse3 .cse4 .cse5 .cse7 .cse25 .cse10 .cse28 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse26 .cse24) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse30 .cse26) (and .cse1 .cse2 .cse27 .cse3 .cse4 .cse5 .cse7 .cse25 .cse10 .cse28 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse30 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse30) (and .cse0 .cse1 .cse2 .cse27 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse28 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse27 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse28 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse30)))) [2021-01-06 19:30:29,211 INFO L189 CegarLoopUtils]: For program point L600(lines 600 604) no Hoare annotation was computed. [2021-01-06 19:30:29,211 INFO L185 CegarLoopUtils]: At program point L468(lines 461 478) the Hoare annotation is: (let ((.cse0 (= ~e_c~0 2)) (.cse1 (= ~c1_i~0 1)) (.cse2 (= ~c2_i~0 1)) (.cse3 (= ~wb_st~0 0)) (.cse4 (= ~e_g~0 ~e_f~0)) (.cse5 (not (= ~r_i~0 1))) (.cse6 (= ~c_req_up~0 ~r_i~0)) (.cse7 (= ~c2_st~0 0)) (.cse8 (= ~wb_i~0 1)) (.cse9 (= 0 ~wl_pc~0)) (.cse10 (= ~e_e~0 ~e_c~0)) (.cse11 (= ~c1_st~0 0)) (.cse12 (= ~e_f~0 2)) (.cse13 (= ~e_wl~0 ~e_c~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= 0 ~wl_st~0)) .cse12 .cse13) (and .cse0 .cse1 (= ~processed~0 0) (= ~r_st~0 ~e_f~0) (= ~data~0 0) .cse2 .cse3 (= ~t_b~0 0) .cse4 (= ~wb_pc~0 0) (= ~c2_pc~0 0) .cse5 (= ~c1_pc~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~d~0 0) .cse13))) [2021-01-06 19:30:29,211 INFO L189 CegarLoopUtils]: For program point L469(lines 398 682) no Hoare annotation was computed. [2021-01-06 19:30:29,211 INFO L189 CegarLoopUtils]: For program point L436-1(lines 398 682) no Hoare annotation was computed. [2021-01-06 19:30:29,211 INFO L189 CegarLoopUtils]: For program point L304(lines 304 308) no Hoare annotation was computed. [2021-01-06 19:30:29,211 INFO L189 CegarLoopUtils]: For program point L304-1(lines 290 388) no Hoare annotation was computed. [2021-01-06 19:30:29,211 INFO L189 CegarLoopUtils]: For program point L668(lines 668 672) no Hoare annotation was computed. [2021-01-06 19:30:29,212 INFO L189 CegarLoopUtils]: For program point L668-1(lines 398 682) no Hoare annotation was computed. [2021-01-06 19:30:29,212 INFO L189 CegarLoopUtils]: For program point L470(lines 470 474) no Hoare annotation was computed. [2021-01-06 19:30:29,212 INFO L189 CegarLoopUtils]: For program point L636-1(lines 537 677) no Hoare annotation was computed. [2021-01-06 19:30:29,212 INFO L189 CegarLoopUtils]: For program point L538(line 538) no Hoare annotation was computed. [2021-01-06 19:30:29,212 INFO L189 CegarLoopUtils]: For program point L571-1(lines 537 677) no Hoare annotation was computed. [2021-01-06 19:30:29,213 INFO L185 CegarLoopUtils]: At program point L373(lines 290 388) the Hoare annotation is: (let ((.cse25 (= ~c1_st~0 0)) (.cse50 (+ ~t_b~0 1)) (.cse23 (= ~c2_st~0 0)) (.cse5 (= ~wb_st~0 0)) (.cse53 (+ ~t_b~0 2))) (let ((.cse51 (= 2 ~wl_pc~0)) (.cse47 (= ~data~0 .cse53)) (.cse46 (= ULTIMATE.start_write_loop_~t~0 ~data~0)) (.cse26 (= ~c2_pc~0 1)) (.cse13 (= ~c1_i~0 1)) (.cse14 (= ~e_c~0 2)) (.cse34 (not .cse5)) (.cse3 (not (= ~e_wl~0 1))) (.cse27 (= ~c1_pc~0 1)) (.cse4 (= ~c2_i~0 1)) (.cse28 (not (= ~r_st~0 0))) (.cse35 (not .cse23)) (.cse15 (not (= ~e_g~0 1))) (.cse16 (not (= ~e_e~0 1))) (.cse17 (not (= ~r_i~0 1))) (.cse19 (not (= ~e_g~0 0))) (.cse52 (= ~data~0 .cse50)) (.cse20 (not (= ~e_wl~0 0))) (.cse29 (= ~wb_pc~0 1)) (.cse22 (not (= ~e_e~0 0))) (.cse30 (not .cse25)) (.cse9 (= ~wb_i~0 1)) (.cse33 (not (= 0 ~wl_st~0))) (.cse11 (= ~e_f~0 2))) (let ((.cse39 (<= .cse50 ~c~0)) (.cse40 (<= ~c~0 .cse50)) (.cse31 (<= ~data~0 .cse50)) (.cse32 (<= .cse50 ~data~0)) (.cse41 (<= ~c~0 1)) (.cse42 (or (and .cse26 .cse13 .cse14 .cse34 .cse3 .cse27 .cse4 .cse28 .cse47 .cse35 .cse15 .cse16 .cse17 .cse19 .cse20 .cse29 .cse22 .cse30 .cse9 .cse33 .cse11) (and (= ~data~0 ~t_b~0) .cse26 .cse13 .cse14 .cse34 .cse46 .cse3 .cse27 .cse4 .cse28 .cse35 .cse15 .cse16 .cse17 .cse19 .cse20 .cse29 .cse22 .cse30 .cse9 .cse33 .cse11) (and .cse26 .cse13 .cse14 .cse34 .cse3 .cse27 .cse4 .cse28 .cse35 .cse15 .cse16 .cse17 .cse19 .cse52 .cse20 .cse29 .cse22 .cse30 .cse9 .cse33 .cse11))) (.cse43 (<= 1 ~c_t~0)) (.cse44 (<= 1 ~c~0)) (.cse45 (<= ~c_t~0 1)) (.cse24 (= 0 ~wl_pc~0)) (.cse7 (= ~wb_pc~0 0)) (.cse8 (= ~c2_pc~0 0)) (.cse18 (= ~c1_pc~0 0)) (.cse36 (<= ~c_t~0 .cse50)) (.cse37 (<= .cse50 ~c_t~0)) (.cse49 (= ~c~0 .cse53)) (.cse48 (= ~c_t~0 .cse53)) (.cse0 (= ~processed~0 0)) (.cse1 (= ~r_st~0 ~e_f~0)) (.cse2 (= ~data~0 0)) (.cse6 (= ~t_b~0 0)) (.cse38 (not .cse51)) (.cse10 (not (= ~e_c~0 0))) (.cse12 (= ~d~0 0)) (.cse21 (= ~c_req_up~0 ~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 .cse23 .cse24 .cse25) (and .cse26 .cse13 .cse14 .cse0 .cse3 .cse27 .cse4 .cse5 .cse28 .cse15 .cse16 .cse17 .cse19 .cse29 .cse20 .cse30 .cse22 .cse23 .cse9 .cse31 .cse32 .cse33 .cse11) (and .cse0 .cse1 .cse34 .cse2 .cse3 .cse4 .cse6 .cse8 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse27 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse30 .cse23 .cse24) (and .cse26 .cse13 .cse14 .cse34 .cse3 .cse27 .cse4 .cse28 .cse35 .cse15 .cse16 .cse17 .cse19 .cse20 .cse29 .cse21 .cse22 .cse30 .cse9 .cse10 .cse33 .cse11) (and .cse26 .cse13 .cse14 .cse34 .cse3 .cse27 .cse4 .cse28 .cse36 .cse37 .cse15 .cse16 .cse17 .cse19 .cse29 .cse20 .cse22 .cse30 .cse9 .cse31 .cse32 .cse33 .cse11) (and .cse0 .cse1 .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse38 .cse9 .cse10 .cse33 .cse11 .cse12 .cse14 .cse13 .cse27 .cse15 .cse16 .cse17 .cse19 .cse21 .cse22 .cse30 .cse23) (and .cse0 .cse1 .cse34 .cse3 .cse2 .cse4 .cse6 .cse8 .cse38 .cse29 .cse9 .cse10 .cse33 .cse11 .cse12 .cse14 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse25) (and .cse26 .cse34 .cse3 .cse4 .cse35 .cse36 .cse37 .cse29 .cse9 .cse33 .cse11 .cse13 .cse14 .cse27 .cse39 .cse15 .cse16 .cse17 .cse19 .cse40 .cse20 .cse30 .cse22 .cse31 .cse32) (and (<= ~d~0 1) .cse41 (<= 1 ~d~0) .cse42 .cse43 .cse44 .cse45 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse27 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse30 .cse23 .cse24) (and .cse26 .cse13 .cse3 .cse27 .cse4 .cse38 .cse15 .cse16 .cse17 .cse19 .cse29 .cse20 .cse22 .cse9 .cse10 .cse33 .cse11) (and (<= ~data~0 ~t_b~0) .cse26 .cse13 .cse14 (<= ~t_b~0 ~data~0) .cse0 .cse34 .cse46 .cse3 .cse27 .cse4 .cse28 .cse15 .cse16 .cse17 .cse19 .cse20 .cse29 .cse22 .cse23 .cse9 .cse25 .cse33 .cse11) (and .cse26 .cse13 .cse14 .cse34 .cse3 .cse27 .cse4 .cse28 .cse47 .cse35 .cse48 .cse15 .cse16 .cse17 .cse19 .cse20 .cse29 .cse22 .cse30 .cse9 .cse33 .cse11) (and .cse26 .cse0 .cse1 .cse34 .cse3 .cse2 .cse4 .cse6 .cse35 .cse38 .cse29 .cse9 .cse10 .cse33 .cse11 .cse12 .cse14 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse25) (and .cse26 .cse0 .cse1 .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 .cse35 .cse38 .cse9 .cse10 .cse33 .cse11 .cse12 .cse14 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse25) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse35 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse27 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse30 .cse24) (and .cse26 .cse13 .cse14 .cse34 .cse3 .cse27 .cse49 .cse4 .cse47 .cse35 .cse48 .cse15 .cse16 .cse17 .cse19 .cse29 .cse20 .cse30 .cse22 .cse9 .cse33 .cse11) (and .cse26 .cse34 .cse3 .cse4 .cse35 (<= ~d~0 .cse50) .cse36 .cse37 .cse29 .cse9 .cse11 .cse13 .cse14 .cse27 .cse28 .cse39 (<= .cse50 ~d~0) .cse15 .cse16 .cse17 .cse51 .cse19 .cse20 .cse40 .cse22 .cse30 .cse31 .cse32) (and .cse13 .cse3 .cse4 .cse15 .cse16 .cse17 .cse19 .cse20 .cse22 .cse9 .cse24 .cse10 .cse33 .cse11) (and .cse26 .cse0 .cse1 .cse34 .cse2 .cse3 .cse4 .cse6 .cse35 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25) (and .cse26 .cse0 .cse1 .cse34 .cse3 .cse2 .cse4 .cse6 .cse35 .cse38 .cse29 .cse9 .cse10 .cse33 .cse11 .cse12 .cse14 .cse13 .cse27 .cse15 .cse16 .cse17 .cse19 .cse21 .cse22 .cse30) (and .cse0 .cse1 .cse34 .cse2 .cse3 .cse4 .cse6 .cse8 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse26 .cse0 .cse1 .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 .cse35 .cse38 .cse9 .cse10 .cse33 .cse11 .cse12 .cse14 .cse13 .cse27 .cse15 .cse16 .cse17 .cse19 .cse21 .cse22 .cse30) (and .cse26 .cse13 .cse14 .cse0 .cse3 .cse27 .cse4 .cse5 .cse28 .cse35 .cse15 .cse16 .cse17 .cse19 .cse20 .cse29 .cse22 .cse9 .cse31 .cse32 .cse25 .cse33 .cse11) (and .cse41 .cse42 .cse43 .cse44 .cse45 .cse6 .cse12) (and .cse0 .cse1 .cse34 .cse3 .cse2 .cse4 .cse6 .cse8 .cse38 .cse29 .cse9 .cse10 .cse33 .cse11 .cse12 .cse14 .cse13 .cse27 .cse15 .cse16 .cse17 .cse19 .cse21 .cse22 .cse30 .cse23) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse35 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25) (and .cse0 .cse1 .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse38 .cse9 .cse10 .cse33 .cse11 .cse12 .cse14 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse25) (and .cse26 .cse13 .cse14 .cse34 .cse3 .cse27 .cse4 .cse28 .cse35 .cse36 .cse37 .cse15 .cse16 .cse17 .cse19 .cse20 .cse52 .cse29 .cse22 .cse9 .cse33 .cse11) (and .cse26 .cse13 .cse14 .cse34 .cse3 .cse27 .cse49 .cse4 (= ~d~0 .cse53) .cse28 .cse47 .cse35 .cse48 .cse15 .cse16 .cse17 .cse51 .cse19 .cse29 .cse20 .cse22 .cse30 .cse9 .cse11) (and .cse26 .cse13 .cse14 .cse0 .cse3 .cse27 .cse4 .cse5 .cse28 .cse47 .cse35 .cse15 .cse16 .cse17 .cse19 .cse20 .cse29 .cse22 .cse30 .cse9 .cse33 .cse11) (and .cse26 .cse0 .cse1 .cse34 .cse2 .cse3 .cse4 .cse6 .cse35 .cse38 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse27 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse30))))) [2021-01-06 19:30:29,213 INFO L189 CegarLoopUtils]: For program point L506-1(lines 398 682) no Hoare annotation was computed. [2021-01-06 19:30:29,213 INFO L189 CegarLoopUtils]: For program point L441-1(lines 398 682) no Hoare annotation was computed. [2021-01-06 19:30:29,213 INFO L189 CegarLoopUtils]: For program point L111(lines 111 121) no Hoare annotation was computed. [2021-01-06 19:30:29,215 INFO L185 CegarLoopUtils]: At program point L343(lines 290 388) the Hoare annotation is: (let ((.cse35 (= ~c1_st~0 0)) (.cse46 (= 2 ~wl_pc~0)) (.cse33 (= ~c2_st~0 0)) (.cse26 (= ~wb_st~0 0)) (.cse47 (+ ~t_b~0 2)) (.cse45 (+ ~t_b~0 1))) (let ((.cse21 (= ULTIMATE.start_write_loop_~t~0 ~data~0)) (.cse41 (<= .cse45 ~c~0)) (.cse42 (<= ~c~0 .cse45)) (.cse36 (<= ~data~0 .cse45)) (.cse37 (<= .cse45 ~data~0)) (.cse34 (= 0 ~wl_pc~0)) (.cse27 (= ~wb_pc~0 0)) (.cse28 (= ~c2_pc~0 0)) (.cse31 (= ~c1_pc~0 0)) (.cse38 (<= ~c_t~0 .cse45)) (.cse39 (<= .cse45 ~c_t~0)) (.cse43 (= ~c~0 .cse47)) (.cse44 (= ~c_t~0 .cse47)) (.cse7 (not (= ~r_st~0 0))) (.cse8 (= ~data~0 .cse47)) (.cse19 (not (= 0 ~wl_st~0))) (.cse0 (= ~c2_pc~0 1)) (.cse23 (= ~processed~0 0)) (.cse24 (= ~r_st~0 ~e_f~0)) (.cse3 (not .cse26)) (.cse25 (= ~data~0 0)) (.cse4 (not (= ~e_wl~0 1))) (.cse6 (= ~c2_i~0 1)) (.cse22 (= ~t_b~0 0)) (.cse9 (not .cse33)) (.cse40 (not .cse46)) (.cse15 (= ~wb_pc~0 1)) (.cse18 (= ~wb_i~0 1)) (.cse29 (not (= ~e_c~0 0))) (.cse20 (= ~e_f~0 2)) (.cse30 (= ~d~0 0)) (.cse1 (= ~c1_i~0 1)) (.cse2 (= ~e_c~0 2)) (.cse5 (= ~c1_pc~0 1)) (.cse10 (not (= ~e_g~0 1))) (.cse11 (not (= ~e_e~0 1))) (.cse12 (not (= ~r_i~0 1))) (.cse13 (not (= ~e_g~0 0))) (.cse14 (not (= ~e_wl~0 0))) (.cse32 (= ~c_req_up~0 ~r_i~0)) (.cse16 (not (= ~e_e~0 0))) (.cse17 (not .cse35))) (or (and (<= ~d~0 1) (<= ~c~0 1) (<= 1 ~d~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 (= ~data~0 ~t_b~0) .cse0 .cse1 .cse2 .cse3 .cse21 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)) (<= 1 ~c_t~0) (<= 1 ~c~0) (<= ~c_t~0 1) .cse22) (and .cse23 .cse24 .cse25 .cse4 .cse6 .cse26 .cse22 .cse27 .cse28 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse10 .cse11 .cse12 .cse31 .cse13 .cse14 .cse32 .cse16 .cse33 .cse34 .cse35) (and .cse0 .cse1 .cse2 .cse23 .cse4 .cse5 .cse6 .cse26 .cse7 .cse10 .cse11 .cse12 .cse13 .cse15 .cse14 .cse17 .cse16 .cse33 .cse18 .cse36 .cse37 .cse19 .cse20) (and .cse23 .cse24 .cse3 .cse25 .cse4 .cse6 .cse22 .cse28 .cse15 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse5 .cse10 .cse11 .cse12 .cse13 .cse14 .cse32 .cse16 .cse17 .cse33 .cse34) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse32 .cse16 .cse17 .cse18 .cse29 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse38 .cse39 .cse10 .cse11 .cse12 .cse13 .cse15 .cse14 .cse16 .cse17 .cse18 .cse36 .cse37 .cse19 .cse20) (and .cse23 .cse24 .cse4 .cse25 .cse6 .cse26 .cse22 .cse27 .cse28 .cse40 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse5 .cse10 .cse11 .cse12 .cse13 .cse32 .cse16 .cse17 .cse33) (and .cse23 .cse24 .cse3 .cse4 .cse25 .cse6 .cse22 .cse28 .cse40 .cse15 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse10 .cse11 .cse12 .cse31 .cse13 .cse32 .cse16 .cse33 .cse35) (and .cse0 .cse3 .cse4 .cse6 .cse9 .cse38 .cse39 .cse15 .cse18 .cse19 .cse20 .cse1 .cse2 .cse5 .cse41 .cse10 .cse11 .cse12 .cse13 .cse42 .cse14 .cse17 .cse16 .cse36 .cse37) (and .cse23 .cse24 .cse25 .cse4 .cse6 .cse26 .cse22 .cse27 .cse28 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse5 .cse10 .cse11 .cse12 .cse13 .cse14 .cse32 .cse16 .cse17 .cse33 .cse34) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse40 .cse10 .cse11 .cse12 .cse13 .cse15 .cse14 .cse16 .cse18 .cse29 .cse19 .cse20) (and (<= ~data~0 ~t_b~0) .cse0 .cse1 .cse2 (<= ~t_b~0 ~data~0) .cse23 .cse3 .cse21 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse33 .cse18 .cse35 .cse19 .cse20) (and .cse0 .cse23 .cse24 .cse3 .cse4 .cse25 .cse6 .cse22 .cse9 .cse40 .cse15 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse10 .cse11 .cse12 .cse31 .cse13 .cse32 .cse16 .cse35) (and .cse0 .cse23 .cse24 .cse4 .cse25 .cse6 .cse26 .cse22 .cse27 .cse9 .cse40 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse10 .cse11 .cse12 .cse31 .cse13 .cse32 .cse16 .cse35) (and .cse0 .cse23 .cse24 .cse25 .cse4 .cse6 .cse26 .cse22 .cse27 .cse9 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse5 .cse10 .cse11 .cse12 .cse13 .cse14 .cse32 .cse16 .cse17 .cse34) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse43 .cse6 .cse8 .cse9 .cse44 .cse10 .cse11 .cse12 .cse13 .cse15 .cse14 .cse17 .cse16 .cse18 .cse19 .cse20) (and .cse0 .cse3 .cse4 .cse6 .cse9 (<= ~d~0 .cse45) .cse38 .cse39 .cse15 .cse18 .cse20 .cse1 .cse2 .cse5 .cse7 .cse41 (<= .cse45 ~d~0) .cse10 .cse11 .cse12 .cse46 .cse13 .cse14 .cse42 .cse16 .cse17 .cse36 .cse37) (and .cse1 .cse4 .cse6 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse18 .cse34 .cse29 .cse19 .cse20) (and .cse0 .cse23 .cse24 .cse3 .cse25 .cse4 .cse6 .cse22 .cse9 .cse15 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse10 .cse11 .cse12 .cse31 .cse13 .cse14 .cse32 .cse16 .cse34 .cse35) (and .cse0 .cse23 .cse24 .cse3 .cse4 .cse25 .cse6 .cse22 .cse9 .cse40 .cse15 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse5 .cse10 .cse11 .cse12 .cse13 .cse32 .cse16 .cse17) (and .cse23 .cse24 .cse3 .cse25 .cse4 .cse6 .cse22 .cse28 .cse15 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse10 .cse11 .cse12 .cse31 .cse13 .cse14 .cse32 .cse16 .cse33 .cse34 .cse35) (and .cse0 .cse23 .cse24 .cse4 .cse25 .cse6 .cse26 .cse22 .cse27 .cse9 .cse40 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse5 .cse10 .cse11 .cse12 .cse13 .cse32 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse23 .cse4 .cse5 .cse6 .cse26 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse36 .cse37 .cse35 .cse19 .cse20) (and .cse23 .cse24 .cse3 .cse4 .cse25 .cse6 .cse22 .cse28 .cse40 .cse15 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse5 .cse10 .cse11 .cse12 .cse13 .cse32 .cse16 .cse17 .cse33) (and .cse0 .cse23 .cse24 .cse25 .cse4 .cse6 .cse26 .cse22 .cse27 .cse9 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse10 .cse11 .cse12 .cse31 .cse13 .cse14 .cse32 .cse16 .cse34 .cse35) (and .cse23 .cse24 .cse4 .cse25 .cse6 .cse26 .cse22 .cse27 .cse28 .cse40 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse10 .cse11 .cse12 .cse31 .cse13 .cse32 .cse16 .cse33 .cse35) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse38 .cse39 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~data~0 .cse45) .cse15 .cse16 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse43 .cse6 (= ~d~0 .cse47) .cse7 .cse8 .cse9 .cse44 .cse10 .cse11 .cse12 .cse46 .cse13 .cse15 .cse14 .cse16 .cse17 .cse18 .cse20) (and .cse0 .cse1 .cse2 .cse23 .cse4 .cse5 .cse6 .cse26 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse23 .cse24 .cse3 .cse25 .cse4 .cse6 .cse22 .cse9 .cse40 .cse15 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse5 .cse10 .cse11 .cse12 .cse13 .cse14 .cse32 .cse16 .cse17)))) [2021-01-06 19:30:29,215 INFO L189 CegarLoopUtils]: For program point L178(lines 178 186) no Hoare annotation was computed. [2021-01-06 19:30:29,215 INFO L189 CegarLoopUtils]: For program point L145(line 145) no Hoare annotation was computed. [2021-01-06 19:30:29,215 INFO L189 CegarLoopUtils]: For program point L608(lines 537 677) no Hoare annotation was computed. [2021-01-06 19:30:29,215 INFO L189 CegarLoopUtils]: For program point L641-1(lines 537 677) no Hoare annotation was computed. [2021-01-06 19:30:29,215 INFO L189 CegarLoopUtils]: For program point L377(lines 377 384) no Hoare annotation was computed. [2021-01-06 19:30:29,215 INFO L189 CegarLoopUtils]: For program point L80(line 80) no Hoare annotation was computed. [2021-01-06 19:30:29,215 INFO L189 CegarLoopUtils]: For program point L609(lines 609 613) no Hoare annotation was computed. [2021-01-06 19:30:29,215 INFO L189 CegarLoopUtils]: For program point L576-1(lines 537 677) no Hoare annotation was computed. [2021-01-06 19:30:29,216 INFO L189 CegarLoopUtils]: For program point L411-1(lines 398 682) no Hoare annotation was computed. [2021-01-06 19:30:29,216 INFO L189 CegarLoopUtils]: For program point L114(lines 114 120) no Hoare annotation was computed. [2021-01-06 19:30:29,216 INFO L189 CegarLoopUtils]: For program point L15(line 15) no Hoare annotation was computed. [2021-01-06 19:30:29,216 INFO L185 CegarLoopUtils]: At program point L709(lines 684 711) the Hoare annotation is: (= ~c2_i~0 1) [2021-01-06 19:30:29,216 INFO L189 CegarLoopUtils]: For program point L544(lines 544 554) no Hoare annotation was computed. [2021-01-06 19:30:29,216 INFO L189 CegarLoopUtils]: For program point L511-1(lines 398 682) no Hoare annotation was computed. [2021-01-06 19:30:29,216 INFO L189 CegarLoopUtils]: For program point L544-2(lines 544 554) no Hoare annotation was computed. [2021-01-06 19:30:29,217 INFO L185 CegarLoopUtils]: At program point L313(lines 290 388) the Hoare annotation is: (let ((.cse35 (= ~c1_st~0 0)) (.cse46 (= 2 ~wl_pc~0)) (.cse33 (= ~c2_st~0 0)) (.cse26 (= ~wb_st~0 0)) (.cse47 (+ ~t_b~0 2)) (.cse45 (+ ~t_b~0 1))) (let ((.cse21 (= ULTIMATE.start_write_loop_~t~0 ~data~0)) (.cse41 (<= .cse45 ~c~0)) (.cse42 (<= ~c~0 .cse45)) (.cse34 (= 0 ~wl_pc~0)) (.cse27 (= ~wb_pc~0 0)) (.cse28 (= ~c2_pc~0 0)) (.cse31 (= ~c1_pc~0 0)) (.cse43 (= ~c~0 .cse47)) (.cse44 (= ~c_t~0 .cse47)) (.cse39 (<= ~c_t~0 .cse45)) (.cse40 (<= .cse45 ~c_t~0)) (.cse36 (<= ~data~0 .cse45)) (.cse37 (<= .cse45 ~data~0)) (.cse7 (not (= ~r_st~0 0))) (.cse8 (= ~data~0 .cse47)) (.cse19 (not (= 0 ~wl_st~0))) (.cse0 (= ~c2_pc~0 1)) (.cse23 (= ~processed~0 0)) (.cse24 (= ~r_st~0 ~e_f~0)) (.cse3 (not .cse26)) (.cse25 (= ~data~0 0)) (.cse4 (not (= ~e_wl~0 1))) (.cse6 (= ~c2_i~0 1)) (.cse22 (= ~t_b~0 0)) (.cse9 (not .cse33)) (.cse38 (not .cse46)) (.cse15 (= ~wb_pc~0 1)) (.cse18 (= ~wb_i~0 1)) (.cse29 (not (= ~e_c~0 0))) (.cse20 (= ~e_f~0 2)) (.cse30 (= ~d~0 0)) (.cse1 (= ~c1_i~0 1)) (.cse2 (= ~e_c~0 2)) (.cse5 (= ~c1_pc~0 1)) (.cse10 (not (= ~e_g~0 1))) (.cse11 (not (= ~e_e~0 1))) (.cse12 (not (= ~r_i~0 1))) (.cse13 (not (= ~e_g~0 0))) (.cse14 (not (= ~e_wl~0 0))) (.cse32 (= ~c_req_up~0 ~r_i~0)) (.cse16 (not (= ~e_e~0 0))) (.cse17 (not .cse35))) (or (and (<= ~d~0 1) (<= ~c~0 1) (<= 1 ~d~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 (= ~data~0 ~t_b~0) .cse0 .cse1 .cse2 .cse3 .cse21 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)) (<= 1 ~c_t~0) (<= 1 ~c~0) (<= ~c_t~0 1) .cse22) (and .cse23 .cse24 .cse25 .cse4 .cse6 .cse26 .cse22 .cse27 .cse28 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse10 .cse11 .cse12 .cse31 .cse13 .cse14 .cse32 .cse16 .cse33 .cse34 .cse35) (and .cse0 .cse1 .cse2 .cse23 .cse4 .cse5 .cse6 .cse26 .cse7 .cse10 .cse11 .cse12 .cse13 .cse15 .cse14 .cse17 .cse16 .cse33 .cse18 .cse36 .cse37 .cse19 .cse20) (and .cse23 .cse24 .cse3 .cse25 .cse4 .cse6 .cse22 .cse28 .cse15 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse5 .cse10 .cse11 .cse12 .cse13 .cse14 .cse32 .cse16 .cse17 .cse33 .cse34) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse32 .cse16 .cse17 .cse18 .cse29 .cse19 .cse20) (and .cse23 .cse24 .cse4 .cse25 .cse6 .cse26 .cse22 .cse27 .cse28 .cse38 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse5 .cse10 .cse11 .cse12 .cse13 .cse32 .cse16 .cse17 .cse33) (and .cse23 .cse24 .cse3 .cse4 .cse25 .cse6 .cse22 .cse28 .cse38 .cse15 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse10 .cse11 .cse12 .cse31 .cse13 .cse32 .cse16 .cse33 .cse35) (and .cse0 .cse3 .cse4 .cse6 .cse9 .cse39 .cse40 .cse15 .cse18 .cse19 .cse20 .cse1 .cse2 .cse5 .cse41 .cse10 .cse11 .cse12 .cse13 .cse42 .cse14 .cse17 .cse16 .cse36 .cse37) (and .cse23 .cse24 .cse25 .cse4 .cse6 .cse26 .cse22 .cse27 .cse28 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse5 .cse10 .cse11 .cse12 .cse13 .cse14 .cse32 .cse16 .cse17 .cse33 .cse34) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse38 .cse10 .cse11 .cse12 .cse13 .cse15 .cse14 .cse16 .cse18 .cse29 .cse19 .cse20) (and (<= ~data~0 ~t_b~0) .cse0 .cse1 .cse2 (<= ~t_b~0 ~data~0) .cse23 .cse3 .cse21 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse33 .cse18 .cse35 .cse19 .cse20) (and .cse0 .cse23 .cse24 .cse3 .cse4 .cse25 .cse6 .cse22 .cse9 .cse38 .cse15 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse10 .cse11 .cse12 .cse31 .cse13 .cse32 .cse16 .cse35) (and .cse0 .cse23 .cse24 .cse4 .cse25 .cse6 .cse26 .cse22 .cse27 .cse9 .cse38 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse10 .cse11 .cse12 .cse31 .cse13 .cse32 .cse16 .cse35) (and .cse0 .cse23 .cse24 .cse25 .cse4 .cse6 .cse26 .cse22 .cse27 .cse9 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse5 .cse10 .cse11 .cse12 .cse13 .cse14 .cse32 .cse16 .cse17 .cse34) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse43 .cse6 .cse8 .cse9 .cse44 .cse10 .cse11 .cse12 .cse13 .cse15 .cse14 .cse17 .cse16 .cse18 .cse19 .cse20) (and .cse0 .cse3 .cse4 .cse6 .cse9 (<= ~d~0 .cse45) .cse39 .cse40 .cse15 .cse18 .cse20 .cse1 .cse2 .cse5 .cse7 .cse41 (<= .cse45 ~d~0) .cse10 .cse11 .cse12 .cse46 .cse13 .cse14 .cse42 .cse16 .cse17 .cse36 .cse37) (and .cse1 .cse4 .cse6 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse18 .cse34 .cse29 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse39 .cse40 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~data~0 .cse45) .cse15 .cse16 .cse18 .cse35 .cse19 .cse20) (and .cse0 .cse23 .cse24 .cse3 .cse25 .cse4 .cse6 .cse22 .cse9 .cse15 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse10 .cse11 .cse12 .cse31 .cse13 .cse14 .cse32 .cse16 .cse34 .cse35) (and .cse0 .cse23 .cse24 .cse3 .cse4 .cse25 .cse6 .cse22 .cse9 .cse38 .cse15 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse5 .cse10 .cse11 .cse12 .cse13 .cse32 .cse16 .cse17) (and .cse23 .cse24 .cse3 .cse25 .cse4 .cse6 .cse22 .cse28 .cse15 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse10 .cse11 .cse12 .cse31 .cse13 .cse14 .cse32 .cse16 .cse33 .cse34 .cse35) (and .cse0 .cse23 .cse24 .cse4 .cse25 .cse6 .cse26 .cse22 .cse27 .cse9 .cse38 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse5 .cse10 .cse11 .cse12 .cse13 .cse32 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse23 .cse4 .cse5 .cse6 .cse26 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse36 .cse37 .cse35 .cse19 .cse20) (and .cse23 .cse24 .cse3 .cse4 .cse25 .cse6 .cse22 .cse28 .cse38 .cse15 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse5 .cse10 .cse11 .cse12 .cse13 .cse32 .cse16 .cse17 .cse33) (and .cse0 .cse23 .cse24 .cse25 .cse4 .cse6 .cse26 .cse22 .cse27 .cse9 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse10 .cse11 .cse12 .cse31 .cse13 .cse14 .cse32 .cse16 .cse34 .cse35) (and .cse23 .cse24 .cse4 .cse25 .cse6 .cse26 .cse22 .cse27 .cse28 .cse38 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse10 .cse11 .cse12 .cse31 .cse13 .cse32 .cse16 .cse33 .cse35) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse43 .cse6 (= ~d~0 .cse47) .cse7 .cse8 .cse9 .cse44 .cse10 .cse11 .cse12 .cse46 .cse13 .cse15 .cse14 .cse16 .cse17 .cse18 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse39 .cse40 .cse10 .cse11 .cse12 .cse13 .cse15 .cse14 .cse16 .cse17 .cse33 .cse18 .cse36 .cse37 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse23 .cse4 .cse5 .cse6 .cse26 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse23 .cse24 .cse3 .cse25 .cse4 .cse6 .cse22 .cse9 .cse38 .cse15 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse5 .cse10 .cse11 .cse12 .cse13 .cse14 .cse32 .cse16 .cse17)))) [2021-01-06 19:30:29,218 INFO L189 CegarLoopUtils]: For program point L181(lines 181 185) no Hoare annotation was computed. [2021-01-06 19:30:29,218 INFO L185 CegarLoopUtils]: At program point L16(lines 57 127) the Hoare annotation is: (let ((.cse2 (= ~c2_pc~0 1)) (.cse3 (not (= ~wb_st~0 0))) (.cse4 (not (= ~e_wl~0 1))) (.cse6 (= ~c2_i~0 1)) (.cse13 (= ~wb_pc~0 1)) (.cse15 (= ~wb_i~0 1)) (.cse16 (not (= 0 ~wl_st~0))) (.cse17 (= ~e_f~0 2)) (.cse0 (= ~c1_i~0 1)) (.cse1 (= ~e_c~0 2)) (.cse5 (= ~c1_pc~0 1)) (.cse8 (not (= ~e_g~0 1))) (.cse9 (not (= ~e_e~0 1))) (.cse10 (not (= ~r_i~0 1))) (.cse11 (not (= ~e_g~0 0))) (.cse12 (not (= ~e_wl~0 0))) (.cse14 (not (= ~e_e~0 0)))) (or (and (let ((.cse7 (not (= ~r_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~data~0 (+ ~t_b~0 2)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~data~0 (+ ~t_b~0 1)) .cse14 .cse15 .cse16 .cse17) (and (= ~data~0 ~t_b~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) (= 2 ~wl_pc~0)) (and .cse2 (= ~processed~0 0) (= ~r_st~0 ~e_f~0) .cse3 (= ~data~0 0) .cse4 .cse6 (= ~t_b~0 0) (not (= ~c2_st~0 0)) .cse13 .cse15 .cse16 .cse17 (= ~d~0 0) .cse0 .cse1 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~c_req_up~0 ~r_i~0) .cse14 (not (= ~c1_st~0 0))))) [2021-01-06 19:30:29,218 INFO L189 CegarLoopUtils]: For program point L545(lines 545 550) no Hoare annotation was computed. [2021-01-06 19:30:29,218 INFO L189 CegarLoopUtils]: For program point L479(lines 398 682) no Hoare annotation was computed. [2021-01-06 19:30:29,218 INFO L189 CegarLoopUtils]: For program point L545-2(lines 545 550) no Hoare annotation was computed. [2021-01-06 19:30:29,219 INFO L189 CegarLoopUtils]: For program point L446-1(lines 398 682) no Hoare annotation was computed. [2021-01-06 19:30:29,219 INFO L189 CegarLoopUtils]: For program point L347(lines 347 354) no Hoare annotation was computed. [2021-01-06 19:30:29,219 INFO L185 CegarLoopUtils]: At program point L182(lines 177 217) the Hoare annotation is: (let ((.cse24 (= ~wb_st~0 0)) (.cse25 (= ~c1_st~0 0)) (.cse19 (+ ~t_b~0 1))) (let ((.cse10 (not (= ~e_c~0 0))) (.cse20 (= ~data~0 .cse19)) (.cse22 (not .cse25)) (.cse13 (= ~c2_pc~0 1)) (.cse0 (= ~c1_i~0 1)) (.cse14 (= ~e_c~0 2)) (.cse23 (= ~processed~0 0)) (.cse15 (not .cse24)) (.cse1 (not (= ~e_wl~0 1))) (.cse16 (= ~c1_pc~0 1)) (.cse2 (= ~c2_i~0 1)) (.cse17 (not (= ~r_st~0 0))) (.cse18 (not (= ~c2_st~0 0))) (.cse3 (not (= ~e_g~0 1))) (.cse4 (not (= ~e_e~0 1))) (.cse5 (not (= ~r_i~0 1))) (.cse6 (not (= ~e_g~0 0))) (.cse7 (not (= ~e_wl~0 0))) (.cse21 (= ~wb_pc~0 1)) (.cse8 (not (= ~e_e~0 0))) (.cse9 (= ~wb_i~0 1)) (.cse11 (not (= 0 ~wl_st~0))) (.cse12 (= ~e_f~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ~wl_pc~0) .cse10 .cse11 .cse12) (and .cse13 .cse0 .cse14 .cse15 .cse1 .cse16 .cse2 .cse17 .cse18 (<= ~c_t~0 .cse19) (<= .cse19 ~c_t~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse21 .cse8 .cse22 .cse9 .cse11 .cse12) (and .cse13 .cse0 .cse1 .cse16 .cse2 (not (= 2 ~wl_pc~0)) .cse3 .cse4 .cse5 .cse6 .cse21 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse0 .cse14 .cse23 .cse1 .cse16 .cse2 .cse24 .cse17 .cse18 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse20 .cse8 .cse22 .cse9 .cse11 .cse12) (and (<= ~data~0 ~t_b~0) .cse13 .cse0 .cse14 (<= ~t_b~0 ~data~0) .cse23 .cse15 .cse1 (= ULTIMATE.start_write_loop_~t~0 ~data~0) .cse16 .cse2 .cse17 .cse18 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse25 .cse11 .cse12)))) [2021-01-06 19:30:29,219 INFO L185 CegarLoopUtils]: At program point L678(lines 395 683) the Hoare annotation is: (= ~c2_i~0 1) [2021-01-06 19:30:29,219 INFO L189 CegarLoopUtils]: For program point L480(lines 480 484) no Hoare annotation was computed. [2021-01-06 19:30:29,219 INFO L189 CegarLoopUtils]: For program point L646-1(lines 537 677) no Hoare annotation was computed. [2021-01-06 19:30:29,220 INFO L185 CegarLoopUtils]: At program point L151-1(lines 132 172) the Hoare annotation is: (let ((.cse5 (= ~wb_st~0 0)) (.cse24 (= ~c2_st~0 0)) (.cse35 (+ ~t_b~0 1))) (let ((.cse7 (= ~wb_pc~0 0)) (.cse31 (<= ~data~0 .cse35)) (.cse32 (<= .cse35 ~data~0)) (.cse9 (not (= 2 ~wl_pc~0))) (.cse27 (= ~c2_pc~0 1)) (.cse28 (= ~c1_pc~0 1)) (.cse29 (not (= ~r_st~0 0))) (.cse34 (not .cse24)) (.cse12 (not (= 0 ~wl_st~0))) (.cse0 (= ~processed~0 0)) (.cse1 (= ~r_st~0 ~e_f~0)) (.cse33 (not .cse5)) (.cse2 (= ~data~0 0)) (.cse3 (not (= ~e_wl~0 1))) (.cse4 (= ~c2_i~0 1)) (.cse6 (= ~t_b~0 0)) (.cse8 (= ~c2_pc~0 0)) (.cse30 (= ~wb_pc~0 1)) (.cse10 (= ~wb_i~0 1)) (.cse11 (not (= ~e_c~0 0))) (.cse13 (= ~e_f~0 2)) (.cse14 (= ~d~0 0)) (.cse15 (= ~c1_i~0 1)) (.cse16 (= ~e_c~0 2)) (.cse17 (not (= ~e_g~0 1))) (.cse18 (not (= ~e_e~0 1))) (.cse19 (not (= ~r_i~0 1))) (.cse20 (not (= ~e_g~0 0))) (.cse25 (not (= ~e_wl~0 0))) (.cse21 (= ~c_req_up~0 ~r_i~0)) (.cse22 (not (= ~c1_st~0 0))) (.cse23 (not (= ~e_e~0 0))) (.cse26 (= 0 ~wl_pc~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 .cse23 .cse24) (and .cse15 .cse3 .cse4 .cse17 .cse18 .cse19 .cse20 .cse25 .cse23 .cse10 .cse26 .cse11 .cse12 .cse13) (and .cse27 .cse15 .cse16 .cse0 .cse3 .cse28 .cse4 .cse5 .cse29 .cse17 .cse18 .cse19 .cse20 .cse30 .cse25 .cse22 .cse23 .cse24 .cse10 .cse31 .cse32 .cse12 .cse13) (and .cse27 .cse15 .cse16 .cse33 .cse3 .cse28 .cse4 .cse29 .cse34 .cse17 .cse18 .cse19 .cse20 .cse25 .cse30 .cse21 .cse23 .cse22 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse25 .cse21 .cse23 .cse22 .cse24 .cse26) (and .cse27 .cse0 .cse1 .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 .cse34 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse25 .cse21 .cse23 .cse22 .cse26) (and .cse27 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse34 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse27 .cse15 .cse16 .cse33 .cse3 .cse28 .cse4 .cse29 .cse34 (<= ~c_t~0 .cse35) .cse17 .cse18 .cse19 (<= .cse35 ~c_t~0) .cse20 .cse25 .cse30 .cse23 .cse22 .cse10 .cse31 .cse32 .cse12 .cse13) (and .cse27 .cse15 .cse3 .cse28 .cse4 .cse9 .cse17 .cse18 .cse19 .cse20 .cse30 .cse25 .cse23 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse33 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 .cse30 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse22 .cse24) (and .cse27 .cse0 .cse33 .cse1 .cse2 .cse3 .cse4 .cse6 .cse34 .cse30 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse25 .cse21 .cse22 .cse23 .cse26) (and .cse27 .cse0 .cse1 .cse33 .cse2 .cse3 .cse4 .cse6 .cse34 .cse9 .cse30 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse27 .cse15 .cse16 .cse0 .cse3 .cse28 .cse4 .cse5 .cse29 (= ~data~0 (+ ~t_b~0 2)) .cse34 .cse17 .cse18 .cse19 .cse20 .cse25 .cse30 .cse23 .cse22 .cse10 .cse12 .cse13) (and .cse0 .cse1 .cse33 .cse2 .cse3 .cse4 .cse6 .cse8 .cse30 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse25 .cse21 .cse22 .cse23 .cse24 .cse26)))) [2021-01-06 19:30:29,220 INFO L189 CegarLoopUtils]: For program point L85(lines 85 93) no Hoare annotation was computed. [2021-01-06 19:30:29,220 INFO L189 CegarLoopUtils]: For program point L85-1(lines 79 122) no Hoare annotation was computed. [2021-01-06 19:30:29,221 INFO L189 CegarLoopUtils]: For program point L416-1(lines 398 682) no Hoare annotation was computed. [2021-01-06 19:30:29,221 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-01-06 19:30:29,221 INFO L189 CegarLoopUtils]: For program point L317(lines 317 324) no Hoare annotation was computed. [2021-01-06 19:30:29,221 INFO L189 CegarLoopUtils]: For program point L86(lines 86 90) no Hoare annotation was computed. [2021-01-06 19:30:29,221 INFO L189 CegarLoopUtils]: For program point L582(lines 582 586) no Hoare annotation was computed. [2021-01-06 19:30:29,221 INFO L189 CegarLoopUtils]: For program point L516-1(lines 398 682) no Hoare annotation was computed. [2021-01-06 19:30:29,221 INFO L189 CegarLoopUtils]: For program point L451-1(lines 398 682) no Hoare annotation was computed. [2021-01-06 19:30:29,221 INFO L189 CegarLoopUtils]: For program point L154(lines 154 162) no Hoare annotation was computed. [2021-01-06 19:30:29,221 INFO L189 CegarLoopUtils]: For program point L154-1(lines 154 162) no Hoare annotation was computed. [2021-01-06 19:30:29,222 INFO L189 CegarLoopUtils]: For program point L617(lines 537 677) no Hoare annotation was computed. [2021-01-06 19:30:29,222 INFO L189 CegarLoopUtils]: For program point L155(lines 155 159) no Hoare annotation was computed. [2021-01-06 19:30:29,222 INFO L189 CegarLoopUtils]: For program point L618(lines 618 622) no Hoare annotation was computed. [2021-01-06 19:30:29,222 INFO L189 CegarLoopUtils]: For program point L651-1(lines 537 677) no Hoare annotation was computed. [2021-01-06 19:30:29,222 INFO L189 CegarLoopUtils]: For program point L421-1(lines 398 682) no Hoare annotation was computed. [2021-01-06 19:30:29,222 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-01-06 19:30:29,222 INFO L189 CegarLoopUtils]: For program point L223(lines 223 231) no Hoare annotation was computed. [2021-01-06 19:30:29,222 INFO L189 CegarLoopUtils]: For program point L190(line 190) no Hoare annotation was computed. [2021-01-06 19:30:29,223 INFO L189 CegarLoopUtils]: For program point L58(lines 58 70) no Hoare annotation was computed. [2021-01-06 19:30:29,223 INFO L189 CegarLoopUtils]: For program point L488(lines 398 682) no Hoare annotation was computed. [2021-01-06 19:30:29,223 INFO L189 CegarLoopUtils]: For program point L521-1(lines 398 682) no Hoare annotation was computed. [2021-01-06 19:30:29,223 INFO L185 CegarLoopUtils]: At program point L389(lines 281 394) the Hoare annotation is: (let ((.cse31 (+ ~t_b~0 2))) (let ((.cse30 (= ~data~0 .cse31)) (.cse19 (= ~c2_pc~0 1)) (.cse0 (= ~c1_i~0 1)) (.cse25 (= ~e_c~0 2)) (.cse20 (not (= ~wb_st~0 0))) (.cse1 (not (= ~e_wl~0 1))) (.cse26 (= ~c1_pc~0 1)) (.cse2 (= ~c2_i~0 1)) (.cse29 (not (= ~r_st~0 0))) (.cse21 (not (= ~c2_st~0 0))) (.cse3 (not (= ~e_g~0 1))) (.cse4 (not (= ~e_e~0 1))) (.cse5 (not (= ~r_i~0 1))) (.cse6 (not (= ~e_g~0 0))) (.cse32 (+ ~t_b~0 1)) (.cse7 (not (= ~e_wl~0 0))) (.cse23 (= ~wb_pc~0 1)) (.cse8 (not (= ~e_e~0 0))) (.cse28 (not (= ~c1_st~0 0))) (.cse9 (= ~wb_i~0 1)) (.cse11 (not (= 0 ~wl_st~0))) (.cse12 (= ~e_f~0 2))) (let ((.cse27 (= ~c_req_up~0 ~r_i~0)) (.cse22 (not (= 2 ~wl_pc~0))) (.cse10 (not (= ~e_c~0 0))) (.cse13 (<= ~c~0 1)) (.cse15 (<= 1 ~c_t~0)) (.cse16 (<= 1 ~c~0)) (.cse17 (<= ~c_t~0 1)) (.cse18 (= ~t_b~0 0)) (.cse24 (= ~d~0 0)) (.cse14 (or (and .cse19 .cse0 .cse25 .cse20 .cse1 .cse26 .cse2 .cse29 .cse30 .cse21 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse28 .cse9 .cse11 .cse12) (and (= ~data~0 ~t_b~0) .cse19 .cse0 .cse25 .cse20 (= ULTIMATE.start_write_loop_~t~0 ~data~0) .cse1 .cse26 .cse2 .cse29 .cse21 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse28 .cse9 .cse11 .cse12) (and .cse19 .cse0 .cse25 .cse20 .cse1 .cse26 .cse2 .cse29 .cse21 .cse3 .cse4 .cse5 .cse6 (= ~data~0 .cse32) .cse7 .cse23 .cse8 .cse28 .cse9 .cse11 .cse12)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ~wl_pc~0) .cse10 .cse11 .cse12) (and (<= ~d~0 1) .cse13 (<= 1 ~d~0) .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 (= ~processed~0 0) (= ~r_st~0 ~e_f~0) .cse20 .cse1 (= ~data~0 0) .cse2 .cse18 .cse21 .cse22 .cse23 .cse9 .cse10 .cse11 .cse12 .cse24 .cse25 .cse0 .cse26 .cse3 .cse4 .cse5 .cse6 .cse27 .cse8 .cse28) (and .cse19 .cse0 .cse25 .cse20 .cse1 .cse26 .cse2 .cse29 .cse21 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse27 .cse8 .cse28 .cse9 .cse10 .cse11 .cse12) (and .cse19 .cse0 .cse25 .cse20 .cse1 .cse26 .cse2 .cse29 .cse30 .cse21 (= ~c_t~0 .cse31) .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse28 .cse9 .cse11 .cse12) (and .cse19 .cse0 .cse1 .cse26 .cse2 .cse29 .cse22 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse24) (and (<= ~c_t~0 .cse32) (<= .cse32 ~c_t~0) .cse14 (<= ~data~0 .cse32) (<= .cse32 ~data~0)))))) [2021-01-06 19:30:29,223 INFO L189 CegarLoopUtils]: For program point L257(lines 257 274) no Hoare annotation was computed. [2021-01-06 19:30:29,224 INFO L185 CegarLoopUtils]: At program point L588(lines 581 598) the Hoare annotation is: (let ((.cse10 (not (= ~e_c~0 0))) (.cse13 (= ~c2_pc~0 1)) (.cse0 (= ~c1_i~0 1)) (.cse14 (not (= ~wb_st~0 0))) (.cse1 (not (= ~e_wl~0 1))) (.cse15 (= ~c1_pc~0 1)) (.cse2 (= ~c2_i~0 1)) (.cse17 (not (= ~r_st~0 0))) (.cse18 (not (= ~c2_st~0 0))) (.cse3 (not (= ~e_g~0 1))) (.cse4 (not (= ~e_e~0 1))) (.cse5 (not (= ~r_i~0 1))) (.cse6 (not (= ~e_g~0 0))) (.cse7 (not (= ~e_wl~0 0))) (.cse19 (= ~wb_pc~0 1)) (.cse8 (not (= ~e_e~0 0))) (.cse20 (not (= ~c1_st~0 0))) (.cse9 (= ~wb_i~0 1)) (.cse11 (not (= 0 ~wl_st~0))) (.cse12 (= ~e_f~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ~wl_pc~0) .cse10 .cse11 .cse12) (let ((.cse16 (+ ~t_b~0 2))) (and .cse13 .cse0 .cse14 .cse1 .cse15 (= ~c~0 .cse16) .cse2 .cse17 (= ~data~0 .cse16) .cse18 (= ~c_t~0 .cse16) .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12)) (and .cse13 .cse0 .cse15 .cse2 .cse17 (not (= 2 ~wl_pc~0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse19 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse21 (+ ~t_b~0 1))) (and .cse13 .cse14 .cse1 .cse2 .cse18 (<= ~c_t~0 .cse21) (<= .cse21 ~c_t~0) .cse19 .cse9 .cse10 .cse11 .cse12 .cse0 .cse15 .cse17 (<= .cse21 ~c~0) .cse3 .cse4 .cse5 .cse6 (<= ~c~0 .cse21) .cse7 (= ~data~0 .cse21) .cse20 .cse8)) (and .cse13 .cse0 (= ~e_c~0 2) .cse14 .cse1 .cse15 .cse2 .cse17 .cse18 .cse3 .cse4 .cse5 .cse6 .cse7 .cse19 .cse8 .cse20 .cse9 .cse11 .cse12))) [2021-01-06 19:30:29,224 INFO L189 CegarLoopUtils]: For program point L489(lines 489 493) no Hoare annotation was computed. [2021-01-06 19:30:29,224 INFO L189 CegarLoopUtils]: For program point L456-1(lines 398 682) no Hoare annotation was computed. [2021-01-06 19:30:29,224 INFO L189 CegarLoopUtils]: For program point L291(lines 290 388) no Hoare annotation was computed. [2021-01-06 19:30:29,224 INFO L189 CegarLoopUtils]: For program point L258(lines 258 262) no Hoare annotation was computed. [2021-01-06 19:30:29,224 INFO L189 CegarLoopUtils]: For program point L589(lines 537 677) no Hoare annotation was computed. [2021-01-06 19:30:29,225 INFO L189 CegarLoopUtils]: For program point L556(lines 556 560) no Hoare annotation was computed. [2021-01-06 19:30:29,225 INFO L189 CegarLoopUtils]: For program point L556-2(lines 537 677) no Hoare annotation was computed. [2021-01-06 19:30:29,226 INFO L185 CegarLoopUtils]: At program point L358(lines 290 388) the Hoare annotation is: (let ((.cse35 (= ~c1_st~0 0)) (.cse46 (= 2 ~wl_pc~0)) (.cse33 (= ~c2_st~0 0)) (.cse26 (= ~wb_st~0 0)) (.cse47 (+ ~t_b~0 2)) (.cse45 (+ ~t_b~0 1))) (let ((.cse21 (= ULTIMATE.start_write_loop_~t~0 ~data~0)) (.cse41 (<= .cse45 ~c~0)) (.cse42 (<= ~c~0 .cse45)) (.cse36 (<= ~data~0 .cse45)) (.cse37 (<= .cse45 ~data~0)) (.cse34 (= 0 ~wl_pc~0)) (.cse27 (= ~wb_pc~0 0)) (.cse28 (= ~c2_pc~0 0)) (.cse31 (= ~c1_pc~0 0)) (.cse38 (<= ~c_t~0 .cse45)) (.cse39 (<= .cse45 ~c_t~0)) (.cse44 (= ~c~0 .cse47)) (.cse43 (= ~c_t~0 .cse47)) (.cse7 (not (= ~r_st~0 0))) (.cse8 (= ~data~0 .cse47)) (.cse19 (not (= 0 ~wl_st~0))) (.cse0 (= ~c2_pc~0 1)) (.cse23 (= ~processed~0 0)) (.cse24 (= ~r_st~0 ~e_f~0)) (.cse3 (not .cse26)) (.cse25 (= ~data~0 0)) (.cse4 (not (= ~e_wl~0 1))) (.cse6 (= ~c2_i~0 1)) (.cse22 (= ~t_b~0 0)) (.cse9 (not .cse33)) (.cse40 (not .cse46)) (.cse15 (= ~wb_pc~0 1)) (.cse18 (= ~wb_i~0 1)) (.cse29 (not (= ~e_c~0 0))) (.cse20 (= ~e_f~0 2)) (.cse30 (= ~d~0 0)) (.cse1 (= ~c1_i~0 1)) (.cse2 (= ~e_c~0 2)) (.cse5 (= ~c1_pc~0 1)) (.cse10 (not (= ~e_g~0 1))) (.cse11 (not (= ~e_e~0 1))) (.cse12 (not (= ~r_i~0 1))) (.cse13 (not (= ~e_g~0 0))) (.cse14 (not (= ~e_wl~0 0))) (.cse32 (= ~c_req_up~0 ~r_i~0)) (.cse16 (not (= ~e_e~0 0))) (.cse17 (not .cse35))) (or (and (<= ~d~0 1) (<= ~c~0 1) (<= 1 ~d~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 (= ~data~0 ~t_b~0) .cse0 .cse1 .cse2 .cse3 .cse21 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)) (<= 1 ~c_t~0) (<= 1 ~c~0) (<= ~c_t~0 1) .cse22) (and .cse23 .cse24 .cse25 .cse4 .cse6 .cse26 .cse22 .cse27 .cse28 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse10 .cse11 .cse12 .cse31 .cse13 .cse14 .cse32 .cse16 .cse33 .cse34 .cse35) (and .cse0 .cse1 .cse2 .cse23 .cse4 .cse5 .cse6 .cse26 .cse7 .cse10 .cse11 .cse12 .cse13 .cse15 .cse14 .cse17 .cse16 .cse33 .cse18 .cse36 .cse37 .cse19 .cse20) (and .cse23 .cse24 .cse3 .cse25 .cse4 .cse6 .cse22 .cse28 .cse15 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse5 .cse10 .cse11 .cse12 .cse13 .cse14 .cse32 .cse16 .cse17 .cse33 .cse34) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse32 .cse16 .cse17 .cse18 .cse29 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse38 .cse39 .cse10 .cse11 .cse12 .cse13 .cse15 .cse14 .cse16 .cse17 .cse18 .cse36 .cse37 .cse19 .cse20) (and .cse23 .cse24 .cse4 .cse25 .cse6 .cse26 .cse22 .cse27 .cse28 .cse40 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse5 .cse10 .cse11 .cse12 .cse13 .cse32 .cse16 .cse17 .cse33) (and .cse23 .cse24 .cse3 .cse4 .cse25 .cse6 .cse22 .cse28 .cse40 .cse15 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse10 .cse11 .cse12 .cse31 .cse13 .cse32 .cse16 .cse33 .cse35) (and .cse0 .cse3 .cse4 .cse6 .cse9 .cse38 .cse39 .cse15 .cse18 .cse19 .cse20 .cse1 .cse2 .cse5 .cse41 .cse10 .cse11 .cse12 .cse13 .cse42 .cse14 .cse17 .cse16 .cse36 .cse37) (and .cse23 .cse24 .cse25 .cse4 .cse6 .cse26 .cse22 .cse27 .cse28 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse5 .cse10 .cse11 .cse12 .cse13 .cse14 .cse32 .cse16 .cse17 .cse33 .cse34) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse40 .cse10 .cse11 .cse12 .cse13 .cse15 .cse14 .cse16 .cse18 .cse29 .cse19 .cse20) (and (<= ~data~0 ~t_b~0) .cse0 .cse1 .cse2 (<= ~t_b~0 ~data~0) .cse23 .cse3 .cse21 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse33 .cse18 .cse35 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse43 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse23 .cse24 .cse3 .cse4 .cse25 .cse6 .cse22 .cse9 .cse40 .cse15 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse10 .cse11 .cse12 .cse31 .cse13 .cse32 .cse16 .cse35) (and .cse0 .cse23 .cse24 .cse4 .cse25 .cse6 .cse26 .cse22 .cse27 .cse9 .cse40 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse10 .cse11 .cse12 .cse31 .cse13 .cse32 .cse16 .cse35) (and .cse0 .cse23 .cse24 .cse25 .cse4 .cse6 .cse26 .cse22 .cse27 .cse9 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse5 .cse10 .cse11 .cse12 .cse13 .cse14 .cse32 .cse16 .cse17 .cse34) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse44 .cse6 .cse8 .cse9 .cse43 .cse10 .cse11 .cse12 .cse13 .cse15 .cse14 .cse17 .cse16 .cse18 .cse19 .cse20) (and .cse0 .cse3 .cse4 .cse6 .cse9 (<= ~d~0 .cse45) .cse38 .cse39 .cse15 .cse18 .cse20 .cse1 .cse2 .cse5 .cse7 .cse41 (<= .cse45 ~d~0) .cse10 .cse11 .cse12 .cse46 .cse13 .cse14 .cse42 .cse16 .cse17 .cse36 .cse37) (and .cse1 .cse4 .cse6 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse18 .cse34 .cse29 .cse19 .cse20) (and .cse0 .cse23 .cse24 .cse3 .cse25 .cse4 .cse6 .cse22 .cse9 .cse15 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse10 .cse11 .cse12 .cse31 .cse13 .cse14 .cse32 .cse16 .cse34 .cse35) (and .cse0 .cse23 .cse24 .cse3 .cse4 .cse25 .cse6 .cse22 .cse9 .cse40 .cse15 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse5 .cse10 .cse11 .cse12 .cse13 .cse32 .cse16 .cse17) (and .cse23 .cse24 .cse3 .cse25 .cse4 .cse6 .cse22 .cse28 .cse15 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse10 .cse11 .cse12 .cse31 .cse13 .cse14 .cse32 .cse16 .cse33 .cse34 .cse35) (and .cse0 .cse23 .cse24 .cse4 .cse25 .cse6 .cse26 .cse22 .cse27 .cse9 .cse40 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse5 .cse10 .cse11 .cse12 .cse13 .cse32 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse23 .cse4 .cse5 .cse6 .cse26 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse36 .cse37 .cse35 .cse19 .cse20) (and .cse23 .cse24 .cse3 .cse4 .cse25 .cse6 .cse22 .cse28 .cse40 .cse15 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse5 .cse10 .cse11 .cse12 .cse13 .cse32 .cse16 .cse17 .cse33) (and .cse0 .cse23 .cse24 .cse25 .cse4 .cse6 .cse26 .cse22 .cse27 .cse9 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse10 .cse11 .cse12 .cse31 .cse13 .cse14 .cse32 .cse16 .cse34 .cse35) (and .cse23 .cse24 .cse4 .cse25 .cse6 .cse26 .cse22 .cse27 .cse28 .cse40 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse10 .cse11 .cse12 .cse31 .cse13 .cse32 .cse16 .cse33 .cse35) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse38 .cse39 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~data~0 .cse45) .cse15 .cse16 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse44 .cse6 (= ~d~0 .cse47) .cse7 .cse8 .cse9 .cse43 .cse10 .cse11 .cse12 .cse46 .cse13 .cse15 .cse14 .cse16 .cse17 .cse18 .cse20) (and .cse0 .cse1 .cse2 .cse23 .cse4 .cse5 .cse6 .cse26 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse23 .cse24 .cse3 .cse25 .cse4 .cse6 .cse22 .cse9 .cse40 .cse15 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse5 .cse10 .cse11 .cse12 .cse13 .cse14 .cse32 .cse16 .cse17)))) [2021-01-06 19:30:29,226 INFO L189 CegarLoopUtils]: For program point L226(lines 226 230) no Hoare annotation was computed. [2021-01-06 19:30:29,226 INFO L189 CegarLoopUtils]: For program point L94(lines 94 102) no Hoare annotation was computed. [2021-01-06 19:30:29,226 INFO L189 CegarLoopUtils]: For program point L61(lines 61 69) no Hoare annotation was computed. [2021-01-06 19:30:29,226 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-01-06 19:30:29,226 INFO L189 CegarLoopUtils]: For program point L590(lines 590 594) no Hoare annotation was computed. [2021-01-06 19:30:29,227 INFO L185 CegarLoopUtils]: At program point L227(lines 222 249) the Hoare annotation is: (let ((.cse26 (+ ~t_b~0 1)) (.cse24 (= ~c1_st~0 0)) (.cse25 (= ~c2_st~0 0))) (let ((.cse20 (not .cse25)) (.cse13 (= ~c2_pc~0 1)) (.cse0 (= ~c1_i~0 1)) (.cse16 (= ~e_c~0 2)) (.cse17 (= ~processed~0 0)) (.cse18 (not (= ~wb_st~0 0))) (.cse1 (not (= ~e_wl~0 1))) (.cse14 (= ~c1_pc~0 1)) (.cse2 (= ~c2_i~0 1)) (.cse19 (not (= ~r_st~0 0))) (.cse3 (not (= ~e_g~0 1))) (.cse4 (not (= ~e_e~0 1))) (.cse5 (not (= ~r_i~0 1))) (.cse6 (not (= ~e_g~0 0))) (.cse15 (= ~wb_pc~0 1)) (.cse7 (not (= ~e_wl~0 0))) (.cse21 (not .cse24)) (.cse8 (not (= ~e_e~0 0))) (.cse9 (= ~wb_i~0 1)) (.cse22 (<= ~data~0 .cse26)) (.cse23 (<= .cse26 ~data~0)) (.cse10 (not (= ~e_c~0 0))) (.cse11 (not (= 0 ~wl_st~0))) (.cse12 (= ~e_f~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ~wl_pc~0) .cse10 .cse11 .cse12) (and .cse13 .cse0 .cse1 .cse14 .cse2 (not (= 2 ~wl_pc~0)) .cse3 .cse4 .cse5 .cse6 .cse15 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse0 .cse16 .cse17 .cse18 .cse1 .cse14 .cse2 .cse19 (= ~data~0 (+ ~t_b~0 2)) .cse20 .cse3 .cse4 .cse5 .cse6 .cse15 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse0 .cse16 .cse17 .cse18 .cse1 .cse14 .cse2 .cse19 .cse20 .cse3 .cse4 .cse5 .cse6 .cse15 .cse7 .cse8 .cse9 .cse22 .cse23 .cse24 .cse10 .cse11 .cse12) (and .cse13 .cse0 .cse16 .cse17 .cse18 .cse1 .cse14 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse15 .cse7 .cse21 .cse8 .cse25 .cse9 .cse22 .cse23 .cse10 .cse11 .cse12)))) [2021-01-06 19:30:29,227 INFO L189 CegarLoopUtils]: For program point L95(lines 95 99) no Hoare annotation was computed. [2021-01-06 19:30:29,227 INFO L185 CegarLoopUtils]: At program point L62(lines 57 127) the Hoare annotation is: (let ((.cse9 (= ~c1_i~0 1)) (.cse10 (= ~e_c~0 2)) (.cse0 (= ~c2_pc~0 1)) (.cse1 (not (= ~wb_st~0 0))) (.cse2 (not (= ~e_wl~0 1))) (.cse11 (= ~c1_pc~0 1)) (.cse3 (= ~c2_i~0 1)) (.cse12 (not (= ~r_st~0 0))) (.cse13 (not (= ~e_g~0 1))) (.cse14 (not (= ~e_e~0 1))) (.cse15 (not (= ~r_i~0 1))) (.cse16 (= 2 ~wl_pc~0)) (.cse17 (not (= ~e_g~0 0))) (.cse18 (not (= ~e_wl~0 0))) (.cse5 (= ~wb_pc~0 1)) (.cse19 (not (= ~e_e~0 0))) (.cse6 (= ~wb_i~0 1)) (.cse7 (not (= 0 ~wl_st~0))) (.cse8 (= ~e_f~0 2))) (or (let ((.cse4 (+ ~t_b~0 1))) (and .cse0 .cse1 .cse2 .cse3 (<= ~d~0 .cse4) (<= ~c_t~0 .cse4) (<= .cse4 ~c_t~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= .cse4 ~c~0) (<= .cse4 ~d~0) .cse13 .cse14 .cse15 .cse16 .cse17 (<= ~c~0 .cse4) .cse18 .cse19 (<= ~data~0 .cse4) (<= .cse4 ~data~0))) (let ((.cse20 (+ ~t_b~0 2))) (and .cse9 .cse10 .cse0 .cse1 .cse2 .cse11 (= ~c~0 .cse20) .cse3 (= ~d~0 .cse20) .cse12 (= ~data~0 .cse20) (= ~c_t~0 .cse20) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse5 .cse19 .cse6 .cse7 .cse8)))) [2021-01-06 19:30:29,227 INFO L189 CegarLoopUtils]: For program point L426-1(lines 398 682) no Hoare annotation was computed. [2021-01-06 19:30:29,227 INFO L189 CegarLoopUtils]: For program point L526-1(lines 398 682) no Hoare annotation was computed. [2021-01-06 19:30:29,229 INFO L185 CegarLoopUtils]: At program point L328(lines 290 388) the Hoare annotation is: (let ((.cse35 (= ~c1_st~0 0)) (.cse46 (= 2 ~wl_pc~0)) (.cse33 (= ~c2_st~0 0)) (.cse26 (= ~wb_st~0 0)) (.cse47 (+ ~t_b~0 2)) (.cse45 (+ ~t_b~0 1))) (let ((.cse21 (= ULTIMATE.start_write_loop_~t~0 ~data~0)) (.cse41 (<= .cse45 ~c~0)) (.cse42 (<= ~c~0 .cse45)) (.cse36 (<= ~data~0 .cse45)) (.cse37 (<= .cse45 ~data~0)) (.cse34 (= 0 ~wl_pc~0)) (.cse27 (= ~wb_pc~0 0)) (.cse28 (= ~c2_pc~0 0)) (.cse31 (= ~c1_pc~0 0)) (.cse38 (<= ~c_t~0 .cse45)) (.cse39 (<= .cse45 ~c_t~0)) (.cse43 (= ~c~0 .cse47)) (.cse44 (= ~c_t~0 .cse47)) (.cse7 (not (= ~r_st~0 0))) (.cse8 (= ~data~0 .cse47)) (.cse19 (not (= 0 ~wl_st~0))) (.cse0 (= ~c2_pc~0 1)) (.cse23 (= ~processed~0 0)) (.cse24 (= ~r_st~0 ~e_f~0)) (.cse3 (not .cse26)) (.cse25 (= ~data~0 0)) (.cse4 (not (= ~e_wl~0 1))) (.cse6 (= ~c2_i~0 1)) (.cse22 (= ~t_b~0 0)) (.cse9 (not .cse33)) (.cse40 (not .cse46)) (.cse15 (= ~wb_pc~0 1)) (.cse18 (= ~wb_i~0 1)) (.cse29 (not (= ~e_c~0 0))) (.cse20 (= ~e_f~0 2)) (.cse30 (= ~d~0 0)) (.cse1 (= ~c1_i~0 1)) (.cse2 (= ~e_c~0 2)) (.cse5 (= ~c1_pc~0 1)) (.cse10 (not (= ~e_g~0 1))) (.cse11 (not (= ~e_e~0 1))) (.cse12 (not (= ~r_i~0 1))) (.cse13 (not (= ~e_g~0 0))) (.cse14 (not (= ~e_wl~0 0))) (.cse32 (= ~c_req_up~0 ~r_i~0)) (.cse16 (not (= ~e_e~0 0))) (.cse17 (not .cse35))) (or (and (<= ~d~0 1) (<= ~c~0 1) (<= 1 ~d~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 (= ~data~0 ~t_b~0) .cse0 .cse1 .cse2 .cse3 .cse21 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)) (<= 1 ~c_t~0) (<= 1 ~c~0) (<= ~c_t~0 1) .cse22) (and .cse23 .cse24 .cse25 .cse4 .cse6 .cse26 .cse22 .cse27 .cse28 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse10 .cse11 .cse12 .cse31 .cse13 .cse14 .cse32 .cse16 .cse33 .cse34 .cse35) (and .cse0 .cse1 .cse2 .cse23 .cse4 .cse5 .cse6 .cse26 .cse7 .cse10 .cse11 .cse12 .cse13 .cse15 .cse14 .cse17 .cse16 .cse33 .cse18 .cse36 .cse37 .cse19 .cse20) (and .cse23 .cse24 .cse3 .cse25 .cse4 .cse6 .cse22 .cse28 .cse15 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse5 .cse10 .cse11 .cse12 .cse13 .cse14 .cse32 .cse16 .cse17 .cse33 .cse34) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse32 .cse16 .cse17 .cse18 .cse29 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse38 .cse39 .cse10 .cse11 .cse12 .cse13 .cse15 .cse14 .cse16 .cse17 .cse18 .cse36 .cse37 .cse19 .cse20) (and .cse23 .cse24 .cse4 .cse25 .cse6 .cse26 .cse22 .cse27 .cse28 .cse40 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse5 .cse10 .cse11 .cse12 .cse13 .cse32 .cse16 .cse17 .cse33) (and .cse23 .cse24 .cse3 .cse4 .cse25 .cse6 .cse22 .cse28 .cse40 .cse15 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse10 .cse11 .cse12 .cse31 .cse13 .cse32 .cse16 .cse33 .cse35) (and .cse0 .cse3 .cse4 .cse6 .cse9 .cse38 .cse39 .cse15 .cse18 .cse19 .cse20 .cse1 .cse2 .cse5 .cse41 .cse10 .cse11 .cse12 .cse13 .cse42 .cse14 .cse17 .cse16 .cse36 .cse37) (and .cse23 .cse24 .cse25 .cse4 .cse6 .cse26 .cse22 .cse27 .cse28 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse5 .cse10 .cse11 .cse12 .cse13 .cse14 .cse32 .cse16 .cse17 .cse33 .cse34) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse40 .cse10 .cse11 .cse12 .cse13 .cse15 .cse14 .cse16 .cse18 .cse29 .cse19 .cse20) (and (<= ~data~0 ~t_b~0) .cse0 .cse1 .cse2 (<= ~t_b~0 ~data~0) .cse23 .cse3 .cse21 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse33 .cse18 .cse35 .cse19 .cse20) (and .cse0 .cse23 .cse24 .cse3 .cse4 .cse25 .cse6 .cse22 .cse9 .cse40 .cse15 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse10 .cse11 .cse12 .cse31 .cse13 .cse32 .cse16 .cse35) (and .cse0 .cse23 .cse24 .cse4 .cse25 .cse6 .cse26 .cse22 .cse27 .cse9 .cse40 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse10 .cse11 .cse12 .cse31 .cse13 .cse32 .cse16 .cse35) (and .cse0 .cse23 .cse24 .cse25 .cse4 .cse6 .cse26 .cse22 .cse27 .cse9 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse5 .cse10 .cse11 .cse12 .cse13 .cse14 .cse32 .cse16 .cse17 .cse34) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse43 .cse6 .cse8 .cse9 .cse44 .cse10 .cse11 .cse12 .cse13 .cse15 .cse14 .cse17 .cse16 .cse18 .cse19 .cse20) (and .cse0 .cse3 .cse4 .cse6 .cse9 (<= ~d~0 .cse45) .cse38 .cse39 .cse15 .cse18 .cse20 .cse1 .cse2 .cse5 .cse7 .cse41 (<= .cse45 ~d~0) .cse10 .cse11 .cse12 .cse46 .cse13 .cse14 .cse42 .cse16 .cse17 .cse36 .cse37) (and .cse1 .cse4 .cse6 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse18 .cse34 .cse29 .cse19 .cse20) (and .cse0 .cse23 .cse24 .cse3 .cse25 .cse4 .cse6 .cse22 .cse9 .cse15 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse10 .cse11 .cse12 .cse31 .cse13 .cse14 .cse32 .cse16 .cse34 .cse35) (and .cse0 .cse23 .cse24 .cse3 .cse4 .cse25 .cse6 .cse22 .cse9 .cse40 .cse15 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse5 .cse10 .cse11 .cse12 .cse13 .cse32 .cse16 .cse17) (and .cse23 .cse24 .cse3 .cse25 .cse4 .cse6 .cse22 .cse28 .cse15 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse10 .cse11 .cse12 .cse31 .cse13 .cse14 .cse32 .cse16 .cse33 .cse34 .cse35) (and .cse0 .cse23 .cse24 .cse4 .cse25 .cse6 .cse26 .cse22 .cse27 .cse9 .cse40 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse5 .cse10 .cse11 .cse12 .cse13 .cse32 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse23 .cse4 .cse5 .cse6 .cse26 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse36 .cse37 .cse35 .cse19 .cse20) (and .cse23 .cse24 .cse3 .cse4 .cse25 .cse6 .cse22 .cse28 .cse40 .cse15 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse5 .cse10 .cse11 .cse12 .cse13 .cse32 .cse16 .cse17 .cse33) (and .cse0 .cse23 .cse24 .cse25 .cse4 .cse6 .cse26 .cse22 .cse27 .cse9 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse10 .cse11 .cse12 .cse31 .cse13 .cse14 .cse32 .cse16 .cse34 .cse35) (and .cse23 .cse24 .cse4 .cse25 .cse6 .cse26 .cse22 .cse27 .cse28 .cse40 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse10 .cse11 .cse12 .cse31 .cse13 .cse32 .cse16 .cse33 .cse35) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse38 .cse39 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~data~0 .cse45) .cse15 .cse16 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse43 .cse6 (= ~d~0 .cse47) .cse7 .cse8 .cse9 .cse44 .cse10 .cse11 .cse12 .cse46 .cse13 .cse15 .cse14 .cse16 .cse17 .cse18 .cse20) (and .cse0 .cse1 .cse2 .cse23 .cse4 .cse5 .cse6 .cse26 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse23 .cse24 .cse3 .cse25 .cse4 .cse6 .cse22 .cse9 .cse40 .cse15 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse5 .cse10 .cse11 .cse12 .cse13 .cse14 .cse32 .cse16 .cse17)))) [2021-01-06 19:30:29,229 INFO L189 CegarLoopUtils]: For program point L295(lines 295 311) no Hoare annotation was computed. [2021-01-06 19:30:29,229 INFO L185 CegarLoopUtils]: At program point L196-1(lines 177 217) the Hoare annotation is: (let ((.cse32 (= ~c1_st~0 0)) (.cse27 (= ~wb_st~0 0)) (.cse35 (+ ~t_b~0 1))) (let ((.cse33 (<= ~data~0 .cse35)) (.cse34 (<= .cse35 ~data~0)) (.cse8 (not (= 2 ~wl_pc~0))) (.cse1 (not .cse27)) (.cse29 (= ~c2_pc~0 1)) (.cse17 (= ~c1_pc~0 1)) (.cse30 (not (= ~r_st~0 0))) (.cse9 (= ~wb_pc~0 1)) (.cse23 (not .cse32)) (.cse12 (not (= 0 ~wl_st~0))) (.cse0 (= ~processed~0 0)) (.cse2 (= ~r_st~0 ~e_f~0)) (.cse4 (not (= ~e_wl~0 1))) (.cse3 (= ~data~0 0)) (.cse5 (= ~c2_i~0 1)) (.cse6 (= ~t_b~0 0)) (.cse28 (= ~wb_pc~0 0)) (.cse7 (not (= ~c2_st~0 0))) (.cse10 (= ~wb_i~0 1)) (.cse11 (not (= ~e_c~0 0))) (.cse13 (= ~e_f~0 2)) (.cse14 (= ~d~0 0)) (.cse15 (= ~c1_i~0 1)) (.cse16 (= ~e_c~0 2)) (.cse18 (not (= ~e_g~0 1))) (.cse19 (not (= ~e_e~0 1))) (.cse20 (not (= ~r_i~0 1))) (.cse31 (= ~c1_pc~0 0)) (.cse21 (not (= ~e_g~0 0))) (.cse25 (not (= ~e_wl~0 0))) (.cse22 (= ~c_req_up~0 ~r_i~0)) (.cse24 (not (= ~e_e~0 0))) (.cse26 (= 0 ~wl_pc~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 .cse23 .cse24) (and .cse15 .cse4 .cse5 .cse18 .cse19 .cse20 .cse21 .cse25 .cse24 .cse10 .cse26 .cse11 .cse12 .cse13) (and .cse0 .cse2 .cse4 .cse3 .cse5 .cse27 .cse6 .cse28 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse22 .cse24 .cse23 .cse26) (and .cse29 .cse15 .cse16 .cse1 .cse4 .cse17 .cse5 .cse30 .cse7 .cse18 .cse19 .cse20 .cse21 .cse25 .cse9 .cse22 .cse24 .cse23 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse2 .cse4 .cse3 .cse5 .cse27 .cse6 .cse28 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse31 .cse21 .cse22 .cse24 .cse32) (and .cse29 .cse15 .cse16 .cse0 .cse4 .cse17 .cse5 .cse27 .cse30 .cse7 .cse18 .cse19 .cse20 .cse21 .cse25 .cse9 .cse24 .cse10 .cse33 .cse34 .cse32 .cse12 .cse13) (and .cse29 .cse15 .cse16 .cse1 .cse4 .cse17 .cse5 .cse30 .cse7 (<= ~c_t~0 .cse35) .cse18 .cse19 .cse20 (<= .cse35 ~c_t~0) .cse21 .cse25 .cse9 .cse24 .cse23 .cse10 .cse33 .cse34 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse31 .cse21 .cse22 .cse24 .cse32) (and .cse0 .cse2 .cse4 .cse3 .cse5 .cse27 .cse6 .cse28 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24 .cse23) (and .cse29 .cse15 .cse4 .cse17 .cse5 .cse8 .cse18 .cse19 .cse20 .cse21 .cse9 .cse25 .cse24 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse22 .cse23 .cse24 .cse26) (and .cse0 .cse2 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse31 .cse21 .cse25 .cse22 .cse24 .cse26 .cse32) (and .cse29 .cse15 .cse16 .cse0 .cse4 .cse17 .cse5 .cse27 .cse30 (= ~data~0 (+ ~t_b~0 2)) .cse7 .cse18 .cse19 .cse20 .cse21 .cse25 .cse9 .cse24 .cse23 .cse10 .cse12 .cse13) (and .cse0 .cse2 .cse4 .cse3 .cse5 .cse27 .cse6 .cse28 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse31 .cse21 .cse25 .cse22 .cse24 .cse26 .cse32)))) [2021-01-06 19:30:29,229 INFO L189 CegarLoopUtils]: For program point L64(lines 64 68) no Hoare annotation was computed. [2021-01-06 19:30:29,230 INFO L189 CegarLoopUtils]: For program point L659(lines 659 675) no Hoare annotation was computed. [2021-01-06 19:30:29,230 INFO L189 CegarLoopUtils]: For program point L626-1(lines 537 677) no Hoare annotation was computed. [2021-01-06 19:30:29,230 INFO L189 CegarLoopUtils]: For program point L362(lines 362 369) no Hoare annotation was computed. [2021-01-06 19:30:29,230 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2021-01-06 19:30:29,230 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 15) no Hoare annotation was computed. [2021-01-06 19:30:29,230 INFO L189 CegarLoopUtils]: For program point L561-1(lines 537 677) no Hoare annotation was computed. [2021-01-06 19:30:29,230 INFO L189 CegarLoopUtils]: For program point L462(lines 462 466) no Hoare annotation was computed. [2021-01-06 19:30:29,231 INFO L185 CegarLoopUtils]: At program point L264(lines 257 274) the Hoare annotation is: (let ((.cse14 (not (= ~wb_st~0 0))) (.cse18 (not (= ~c2_st~0 0))) (.cse13 (= ~e_c~0 2)) (.cse20 (not (= ~c1_st~0 0))) (.cse12 (= ~c2_pc~0 1)) (.cse0 (= ~c1_i~0 1)) (.cse1 (not (= ~e_wl~0 1))) (.cse15 (= ~c1_pc~0 1)) (.cse2 (= ~c2_i~0 1)) (.cse17 (not (= ~r_st~0 0))) (.cse3 (not (= ~e_g~0 1))) (.cse4 (not (= ~r_i~0 1))) (.cse5 (not (= ~e_g~0 0))) (.cse19 (= ~wb_pc~0 1)) (.cse6 (not (= ~e_wl~0 0))) (.cse7 (not (= ~e_e~0 0))) (.cse8 (= ~wb_i~0 1)) (.cse9 (not (= ~e_c~0 0))) (.cse10 (not (= 0 ~wl_st~0))) (.cse11 (= ~e_f~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~wl_pc~0) .cse9 .cse10 .cse11) (let ((.cse16 (+ ~t_b~0 2))) (and .cse12 .cse0 .cse13 .cse14 .cse1 .cse15 (= ~c~0 .cse16) .cse2 (= ~d~0 .cse16) .cse17 (= ~data~0 .cse16) .cse18 (= ~c_t~0 .cse16) .cse3 .cse4 .cse5 .cse19 .cse6 .cse20 .cse7 .cse8 .cse10 .cse11)) (let ((.cse21 (+ ~t_b~0 1))) (and .cse12 .cse14 .cse1 .cse2 .cse18 (<= ~d~0 .cse21) (<= ~c_t~0 .cse21) (<= .cse21 ~c_t~0) .cse19 .cse8 .cse10 .cse11 .cse0 .cse13 .cse15 .cse17 (<= .cse21 ~c~0) (<= .cse21 ~d~0) .cse3 .cse4 .cse5 (<= ~c~0 .cse21) .cse6 .cse20 .cse7 (<= ~data~0 .cse21) (<= .cse21 ~data~0))) (and .cse12 .cse0 .cse1 .cse15 .cse2 .cse17 (not (= 2 ~wl_pc~0)) .cse3 .cse4 .cse5 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) [2021-01-06 19:30:29,231 INFO L189 CegarLoopUtils]: For program point L298(lines 298 310) no Hoare annotation was computed. [2021-01-06 19:30:29,231 INFO L189 CegarLoopUtils]: For program point L265(lines 257 274) no Hoare annotation was computed. [2021-01-06 19:30:29,231 INFO L189 CegarLoopUtils]: For program point L199(lines 199 207) no Hoare annotation was computed. [2021-01-06 19:30:29,231 INFO L189 CegarLoopUtils]: For program point L199-1(lines 199 207) no Hoare annotation was computed. [2021-01-06 19:30:29,231 INFO L189 CegarLoopUtils]: For program point L133(lines 133 141) no Hoare annotation was computed. [2021-01-06 19:30:29,231 INFO L189 CegarLoopUtils]: For program point L662(lines 662 674) no Hoare annotation was computed. [2021-01-06 19:30:29,231 INFO L189 CegarLoopUtils]: For program point L497(lines 398 682) no Hoare annotation was computed. [2021-01-06 19:30:29,231 INFO L189 CegarLoopUtils]: For program point L431-1(lines 398 682) no Hoare annotation was computed. [2021-01-06 19:30:29,232 INFO L189 CegarLoopUtils]: For program point L332(lines 332 339) no Hoare annotation was computed. [2021-01-06 19:30:29,232 INFO L189 CegarLoopUtils]: For program point L266(lines 266 270) no Hoare annotation was computed. [2021-01-06 19:30:29,232 INFO L189 CegarLoopUtils]: For program point L200(lines 200 204) no Hoare annotation was computed. [2021-01-06 19:30:29,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 07:30:29 BoogieIcfgContainer [2021-01-06 19:30:29,420 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 19:30:29,420 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 19:30:29,420 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 19:30:29,421 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 19:30:29,421 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:29:02" (3/4) ... [2021-01-06 19:30:29,425 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-01-06 19:30:29,452 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-01-06 19:30:29,453 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-01-06 19:30:29,454 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 19:30:29,454 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 19:30:29,634 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/systemc/toy.cil.c-witness.graphml [2021-01-06 19:30:29,634 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 19:30:29,636 INFO L168 Benchmark]: Toolchain (without parser) took 88386.14 ms. Allocated memory was 151.0 MB in the beginning and 1.5 GB in the end (delta: 1.4 GB). Free memory was 125.9 MB in the beginning and 593.6 MB in the end (delta: -467.7 MB). Peak memory consumption was 925.6 MB. Max. memory is 8.0 GB. [2021-01-06 19:30:29,636 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 151.0 MB. Free memory was 124.0 MB in the beginning and 123.9 MB in the end (delta: 111.8 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 19:30:29,637 INFO L168 Benchmark]: CACSL2BoogieTranslator took 428.13 ms. Allocated memory is still 151.0 MB. Free memory was 125.7 MB in the beginning and 111.4 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2021-01-06 19:30:29,637 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.07 ms. Allocated memory is still 151.0 MB. Free memory was 111.2 MB in the beginning and 109.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 19:30:29,637 INFO L168 Benchmark]: Boogie Preprocessor took 68.56 ms. Allocated memory is still 151.0 MB. Free memory was 109.0 MB in the beginning and 106.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 19:30:29,638 INFO L168 Benchmark]: RCFGBuilder took 788.11 ms. Allocated memory is still 151.0 MB. Free memory was 106.9 MB in the beginning and 97.9 MB in the end (delta: 9.0 MB). Peak memory consumption was 8.9 MB. Max. memory is 8.0 GB. [2021-01-06 19:30:29,638 INFO L168 Benchmark]: TraceAbstraction took 86816.48 ms. Allocated memory was 151.0 MB in the beginning and 1.5 GB in the end (delta: 1.4 GB). Free memory was 97.4 MB in the beginning and 618.3 MB in the end (delta: -520.9 MB). Peak memory consumption was 919.8 MB. Max. memory is 8.0 GB. [2021-01-06 19:30:29,638 INFO L168 Benchmark]: Witness Printer took 214.22 ms. Allocated memory is still 1.5 GB. Free memory was 618.3 MB in the beginning and 593.6 MB in the end (delta: 24.6 MB). Peak memory consumption was 24.1 MB. Max. memory is 8.0 GB. [2021-01-06 19:30:29,642 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 151.0 MB. Free memory was 124.0 MB in the beginning and 123.9 MB in the end (delta: 111.8 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 428.13 ms. Allocated memory is still 151.0 MB. Free memory was 125.7 MB in the beginning and 111.4 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 55.07 ms. Allocated memory is still 151.0 MB. Free memory was 111.2 MB in the beginning and 109.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 68.56 ms. Allocated memory is still 151.0 MB. Free memory was 109.0 MB in the beginning and 106.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 788.11 ms. Allocated memory is still 151.0 MB. Free memory was 106.9 MB in the beginning and 97.9 MB in the end (delta: 9.0 MB). Peak memory consumption was 8.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 86816.48 ms. Allocated memory was 151.0 MB in the beginning and 1.5 GB in the end (delta: 1.4 GB). Free memory was 97.4 MB in the beginning and 618.3 MB in the end (delta: -520.9 MB). Peak memory consumption was 919.8 MB. Max. memory is 8.0 GB. * Witness Printer took 214.22 ms. Allocated memory is still 1.5 GB. Free memory was 618.3 MB in the beginning and 593.6 MB in the end (delta: 24.6 MB). Peak memory consumption was 24.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((d <= 1 && c <= 1) && 1 <= d) && (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) || (((((((((((((((((((((data == t_b && c2_pc == 1) && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && t == data) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2))) && 1 <= c_t) && 1 <= c) && c_t <= 1) && t_b == 0) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && 0 == wl_pc) && c1_st == 0)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && c2_st == 0) && wb_i == 1) && data <= t_b + 1) && t_b + 1 <= data) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && c2_pc == 0) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0) && 0 == wl_pc)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && c1_st == 0)) || ((((((((((((((((((((((((c2_pc == 1 && !(wb_st == 0)) && !(e_wl == 1)) && c2_i == 1) && !(c2_st == 0)) && c_t <= t_b + 1) && t_b + 1 <= c_t) && wb_pc == 1) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) && c1_i == 1) && e_c == 2) && c1_pc == 1) && t_b + 1 <= c) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c <= t_b + 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && data <= t_b + 1) && t_b + 1 <= data)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0) && 0 == wl_pc)) || ((((((((((((((((c2_pc == 1 && c1_i == 1) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((data <= t_b && c2_pc == 1) && c1_i == 1) && e_c == 2) && t_b <= data) && processed == 0) && !(wb_st == 0)) && t == data) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && c2_st == 0) && wb_i == 1) && c1_st == 0) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && 0 == wl_pc)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((((c2_pc == 1 && !(wb_st == 0)) && !(e_wl == 1)) && c2_i == 1) && !(c2_st == 0)) && d <= t_b + 1) && c_t <= t_b + 1) && t_b + 1 <= c_t) && wb_pc == 1) && wb_i == 1) && e_f == 2) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(r_st == 0)) && t_b + 1 <= c) && t_b + 1 <= d) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && 2 == wl_pc) && !(e_g == 0)) && !(e_wl == 0)) && c <= t_b + 1) && !(e_e == 0)) && !(c1_st == 0)) && data <= t_b + 1) && t_b + 1 <= data)) || (((((((((((((c1_i == 1 && !(e_wl == 1)) && c2_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && 0 == wl_pc) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && c_t <= t_b + 1) && t_b + 1 <= c_t) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && data == t_b + 1) && wb_pc == 1) && !(e_e == 0)) && wb_i == 1) && c1_st == 0) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0))) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && c2_pc == 0) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0))) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && wb_i == 1) && data <= t_b + 1) && t_b + 1 <= data) && c1_st == 0) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && c1_st == 0)) || (((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && d == t_b + 2) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && 2 == wl_pc) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && e_f == 2)) || (((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && c_t <= t_b + 1) && t_b + 1 <= c_t) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0) && wb_i == 1) && data <= t_b + 1) && t_b + 1 <= data) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((((((((((((((((((((c1_i == 1 && e_c == 2) && c2_pc == 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) || ((((((((((((((((((c1_i == 1 && e_c == 2) && c2_pc == 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && data == t_b + 1) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((data == t_b && c1_i == 1) && e_c == 2) && c2_pc == 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) && 2 == wl_pc) || ((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && wb_pc == 1) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((d <= 1 && c <= 1) && 1 <= d) && (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) || (((((((((((((((((((((data == t_b && c2_pc == 1) && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && t == data) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2))) && 1 <= c_t) && 1 <= c) && c_t <= 1) && t_b == 0) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && 0 == wl_pc) && c1_st == 0)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && c2_st == 0) && wb_i == 1) && data <= t_b + 1) && t_b + 1 <= data) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && c2_pc == 0) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0) && 0 == wl_pc)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && c_t <= t_b + 1) && t_b + 1 <= c_t) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && data <= t_b + 1) && t_b + 1 <= data) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && c1_st == 0)) || ((((((((((((((((((((((((c2_pc == 1 && !(wb_st == 0)) && !(e_wl == 1)) && c2_i == 1) && !(c2_st == 0)) && c_t <= t_b + 1) && t_b + 1 <= c_t) && wb_pc == 1) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) && c1_i == 1) && e_c == 2) && c1_pc == 1) && t_b + 1 <= c) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c <= t_b + 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && data <= t_b + 1) && t_b + 1 <= data)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0) && 0 == wl_pc)) || ((((((((((((((((c2_pc == 1 && c1_i == 1) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((data <= t_b && c2_pc == 1) && c1_i == 1) && e_c == 2) && t_b <= data) && processed == 0) && !(wb_st == 0)) && t == data) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && c2_st == 0) && wb_i == 1) && c1_st == 0) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && 0 == wl_pc)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((((c2_pc == 1 && !(wb_st == 0)) && !(e_wl == 1)) && c2_i == 1) && !(c2_st == 0)) && d <= t_b + 1) && c_t <= t_b + 1) && t_b + 1 <= c_t) && wb_pc == 1) && wb_i == 1) && e_f == 2) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(r_st == 0)) && t_b + 1 <= c) && t_b + 1 <= d) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && 2 == wl_pc) && !(e_g == 0)) && !(e_wl == 0)) && c <= t_b + 1) && !(e_e == 0)) && !(c1_st == 0)) && data <= t_b + 1) && t_b + 1 <= data)) || (((((((((((((c1_i == 1 && !(e_wl == 1)) && c2_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && 0 == wl_pc) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0))) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && c2_pc == 0) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0))) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && wb_i == 1) && data <= t_b + 1) && t_b + 1 <= data) && c1_st == 0) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && c1_st == 0)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && c_t <= t_b + 1) && t_b + 1 <= c_t) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && data == t_b + 1) && wb_pc == 1) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && d == t_b + 2) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && 2 == wl_pc) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && e_f == 2)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c1_st == 0) || ((((((((((((((((((((((((processed == 0 && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && c1_st == 0)) || ((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && c1_st == 0)) || ((((((((((((((((((((((((processed == 0 && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0)) || ((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0)) || ((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0))) || ((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c1_st == 0)) || ((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) - InvariantResult [Line: 581]: Loop Invariant Derived loop invariant: ((((((((((((((((c1_i == 1 && !(e_wl == 1)) && c2_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && 0 == wl_pc) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((c2_pc == 1 && c1_i == 1) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((((c2_pc == 1 && !(wb_st == 0)) && !(e_wl == 1)) && c2_i == 1) && !(c2_st == 0)) && c_t <= t_b + 1) && t_b + 1 <= c_t) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && c1_i == 1) && c1_pc == 1) && !(r_st == 0)) && t_b + 1 <= c) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c <= t_b + 1) && !(e_wl == 0)) && data == t_b + 1) && !(c1_st == 0)) && !(e_e == 0))) || (((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: ((((((((((((((c1_i == 1 && !(e_wl == 1)) && c2_i == 1) && !(e_g == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && 0 == wl_pc) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && d == t_b + 2) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(e_g == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((((((c2_pc == 1 && !(wb_st == 0)) && !(e_wl == 1)) && c2_i == 1) && !(c2_st == 0)) && d <= t_b + 1) && c_t <= t_b + 1) && t_b + 1 <= c_t) && wb_pc == 1) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(r_st == 0)) && t_b + 1 <= c) && t_b + 1 <= d) && !(e_g == 1)) && !(r_i == 1)) && !(e_g == 0)) && c <= t_b + 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && data <= t_b + 1) && t_b + 1 <= data)) || ((((((((((((((((c2_pc == 1 && c1_i == 1) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(2 == wl_pc)) && !(e_g == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((c2_pc == 1 && !(wb_st == 0)) && !(e_wl == 1)) && c2_i == 1) && d <= t_b + 1) && c_t <= t_b + 1) && t_b + 1 <= c_t) && wb_pc == 1) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(r_st == 0)) && t_b + 1 <= c) && t_b + 1 <= d) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && 2 == wl_pc) && !(e_g == 0)) && c <= t_b + 1) && !(e_wl == 0)) && !(e_e == 0)) && data <= t_b + 1) && t_b + 1 <= data) || ((((((((((((((((((((((c1_i == 1 && e_c == 2) && c2_pc == 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && d == t_b + 2) && !(r_st == 0)) && data == t_b + 2) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && 2 == wl_pc) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((processed == 0 && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && 0 == wl_pc) && c1_st == 0) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && c2_st == 0) && wb_i == 1) && data <= t_b + 1) && t_b + 1 <= data) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && c2_pc == 0) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0) && 0 == wl_pc)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && c_t <= t_b + 1) && t_b + 1 <= c_t) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && data <= t_b + 1) && t_b + 1 <= data) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && c1_st == 0)) || ((((((((((((((((((((((((c2_pc == 1 && !(wb_st == 0)) && !(e_wl == 1)) && c2_i == 1) && !(c2_st == 0)) && c_t <= t_b + 1) && t_b + 1 <= c_t) && wb_pc == 1) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) && c1_i == 1) && e_c == 2) && c1_pc == 1) && t_b + 1 <= c) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c <= t_b + 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && data <= t_b + 1) && t_b + 1 <= data)) || (((((((d <= 1 && c <= 1) && 1 <= d) && ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) || (((((((((((((((((((((data == t_b && c2_pc == 1) && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && t == data) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && data == t_b + 1) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2))) && 1 <= c_t) && 1 <= c) && c_t <= 1) && t_b == 0)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0) && 0 == wl_pc)) || ((((((((((((((((c2_pc == 1 && c1_i == 1) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((data <= t_b && c2_pc == 1) && c1_i == 1) && e_c == 2) && t_b <= data) && processed == 0) && !(wb_st == 0)) && t == data) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && c2_st == 0) && wb_i == 1) && c1_st == 0) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && 0 == wl_pc)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((((c2_pc == 1 && !(wb_st == 0)) && !(e_wl == 1)) && c2_i == 1) && !(c2_st == 0)) && d <= t_b + 1) && c_t <= t_b + 1) && t_b + 1 <= c_t) && wb_pc == 1) && wb_i == 1) && e_f == 2) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(r_st == 0)) && t_b + 1 <= c) && t_b + 1 <= d) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && 2 == wl_pc) && !(e_g == 0)) && !(e_wl == 0)) && c <= t_b + 1) && !(e_e == 0)) && !(c1_st == 0)) && data <= t_b + 1) && t_b + 1 <= data)) || (((((((((((((c1_i == 1 && !(e_wl == 1)) && c2_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && 0 == wl_pc) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0))) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && c2_pc == 0) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0))) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && wb_i == 1) && data <= t_b + 1) && t_b + 1 <= data) && c1_st == 0) && !(0 == wl_st)) && e_f == 2)) || ((((((c <= 1 && ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) || (((((((((((((((((((((data == t_b && c2_pc == 1) && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && t == data) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && data == t_b + 1) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2))) && 1 <= c_t) && 1 <= c) && c_t <= 1) && t_b == 0) && d == 0)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && c1_st == 0)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && c_t <= t_b + 1) && t_b + 1 <= c_t) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && data == t_b + 1) && wb_pc == 1) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && d == t_b + 2) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && 2 == wl_pc) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && e_f == 2)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((((((((((((((((c1_i == 1 && !(e_wl == 1)) && c2_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && 0 == wl_pc) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && c_t <= t_b + 1) && t_b + 1 <= c_t) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && data == t_b + 1) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((c2_pc == 1 && c1_i == 1) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((data <= t_b && c2_pc == 1) && c1_i == 1) && e_c == 2) && t_b <= data) && processed == 0) && !(wb_st == 0)) && t == data) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && data == t_b + 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) - InvariantResult [Line: 222]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && c1_st == 0) || (((((((((((((c1_i == 1 && !(e_wl == 1)) && c2_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && 0 == wl_pc) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && c_t <= t_b + 1) && t_b + 1 <= c_t) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && data == t_b + 1) && wb_pc == 1) && !(e_e == 0)) && wb_i == 1) && c1_st == 0) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && 0 == wl_pc)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0))) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0) && 0 == wl_pc)) || ((((((((((((((((c2_pc == 1 && c1_i == 1) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && c_t <= t_b + 1) && t_b + 1 <= c_t) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0) && wb_i == 1) && data <= t_b + 1) && t_b + 1 <= data) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && 0 == wl_pc) && c1_st == 0) - InvariantResult [Line: 461]: Loop Invariant Derived loop invariant: ((((((((((((((e_c == 2 && c1_i == 1) && c2_i == 1) && wb_st == 0) && e_g == e_f) && !(r_i == 1)) && c_req_up == r_i) && c2_st == 0) && wb_i == 1) && 0 == wl_pc) && e_e == e_c) && c1_st == 0) && !(0 == wl_st)) && e_f == 2) && e_wl == e_c) || (((((((((((((((((((((e_c == 2 && c1_i == 1) && processed == 0) && r_st == e_f) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && e_g == e_f) && wb_pc == 0) && c2_pc == 0) && !(r_i == 1)) && c1_pc == 0) && c_req_up == r_i) && c2_st == 0) && wb_i == 1) && 0 == wl_pc) && e_e == e_c) && c1_st == 0) && e_f == 2) && d == 0) && e_wl == e_c) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((d <= 1 && c <= 1) && 1 <= d) && (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) || (((((((((((((((((((((data == t_b && c2_pc == 1) && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && t == data) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2))) && 1 <= c_t) && 1 <= c) && c_t <= 1) && t_b == 0) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && 0 == wl_pc) && c1_st == 0)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && c2_st == 0) && wb_i == 1) && data <= t_b + 1) && t_b + 1 <= data) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && c2_pc == 0) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0) && 0 == wl_pc)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && c_t <= t_b + 1) && t_b + 1 <= c_t) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && data <= t_b + 1) && t_b + 1 <= data) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && c1_st == 0)) || ((((((((((((((((((((((((c2_pc == 1 && !(wb_st == 0)) && !(e_wl == 1)) && c2_i == 1) && !(c2_st == 0)) && c_t <= t_b + 1) && t_b + 1 <= c_t) && wb_pc == 1) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) && c1_i == 1) && e_c == 2) && c1_pc == 1) && t_b + 1 <= c) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c <= t_b + 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && data <= t_b + 1) && t_b + 1 <= data)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0) && 0 == wl_pc)) || ((((((((((((((((c2_pc == 1 && c1_i == 1) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((data <= t_b && c2_pc == 1) && c1_i == 1) && e_c == 2) && t_b <= data) && processed == 0) && !(wb_st == 0)) && t == data) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && c2_st == 0) && wb_i == 1) && c1_st == 0) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && 0 == wl_pc)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((((c2_pc == 1 && !(wb_st == 0)) && !(e_wl == 1)) && c2_i == 1) && !(c2_st == 0)) && d <= t_b + 1) && c_t <= t_b + 1) && t_b + 1 <= c_t) && wb_pc == 1) && wb_i == 1) && e_f == 2) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(r_st == 0)) && t_b + 1 <= c) && t_b + 1 <= d) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && 2 == wl_pc) && !(e_g == 0)) && !(e_wl == 0)) && c <= t_b + 1) && !(e_e == 0)) && !(c1_st == 0)) && data <= t_b + 1) && t_b + 1 <= data)) || (((((((((((((c1_i == 1 && !(e_wl == 1)) && c2_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && 0 == wl_pc) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0))) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && c2_pc == 0) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0))) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && wb_i == 1) && data <= t_b + 1) && t_b + 1 <= data) && c1_st == 0) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && c1_st == 0)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && c_t <= t_b + 1) && t_b + 1 <= c_t) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && data == t_b + 1) && wb_pc == 1) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && d == t_b + 2) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && 2 == wl_pc) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && e_f == 2)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((processed == 0 && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(c1_st == 0)) && !(e_e == 0)) && c2_st == 0) || (((((((((((((c1_i == 1 && !(e_wl == 1)) && c2_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && 0 == wl_pc) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && c2_st == 0) && wb_i == 1) && data <= t_b + 1) && t_b + 1 <= data) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0) && 0 == wl_pc)) || ((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && 0 == wl_pc)) || ((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(c1_st == 0)) && !(e_e == 0))) || (((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && c_t <= t_b + 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && t_b + 1 <= c_t) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && data <= t_b + 1) && t_b + 1 <= data) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((c2_pc == 1 && c1_i == 1) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0)) || ((((((((((((((((((((((((c2_pc == 1 && processed == 0) && !(wb_st == 0)) && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(c1_st == 0)) && !(e_e == 0)) && 0 == wl_pc)) || ((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(c1_st == 0)) && !(e_e == 0))) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && c2_pc == 0) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(c1_st == 0)) && !(e_e == 0)) && c2_st == 0) && 0 == wl_pc) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: ((((((((((((((((c1_i == 1 && !(e_wl == 1)) && c2_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && 0 == wl_pc) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && c_t <= t_b + 1) && t_b + 1 <= c_t) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && data == t_b + 1) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((c2_pc == 1 && c1_i == 1) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && data == t_b + 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((data <= t_b && c2_pc == 1) && c1_i == 1) && e_c == 2) && t_b <= data) && processed == 0) && !(wb_st == 0)) && !(e_wl == 1)) && t == data) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && wb_i == 1) && c1_st == 0) && !(0 == wl_st)) && e_f == 2) - InvariantResult [Line: 395]: Loop Invariant Derived loop invariant: c2_i == 1 - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((d <= 1 && c <= 1) && 1 <= d) && (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) || (((((((((((((((((((((data == t_b && c2_pc == 1) && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && t == data) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2))) && 1 <= c_t) && 1 <= c) && c_t <= 1) && t_b == 0) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && 0 == wl_pc) && c1_st == 0)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && c2_st == 0) && wb_i == 1) && data <= t_b + 1) && t_b + 1 <= data) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && c2_pc == 0) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0) && 0 == wl_pc)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && c_t <= t_b + 1) && t_b + 1 <= c_t) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && data <= t_b + 1) && t_b + 1 <= data) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && c1_st == 0)) || ((((((((((((((((((((((((c2_pc == 1 && !(wb_st == 0)) && !(e_wl == 1)) && c2_i == 1) && !(c2_st == 0)) && c_t <= t_b + 1) && t_b + 1 <= c_t) && wb_pc == 1) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) && c1_i == 1) && e_c == 2) && c1_pc == 1) && t_b + 1 <= c) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c <= t_b + 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && data <= t_b + 1) && t_b + 1 <= data)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0) && 0 == wl_pc)) || ((((((((((((((((c2_pc == 1 && c1_i == 1) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((data <= t_b && c2_pc == 1) && c1_i == 1) && e_c == 2) && t_b <= data) && processed == 0) && !(wb_st == 0)) && t == data) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && c2_st == 0) && wb_i == 1) && c1_st == 0) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && 0 == wl_pc)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((((c2_pc == 1 && !(wb_st == 0)) && !(e_wl == 1)) && c2_i == 1) && !(c2_st == 0)) && d <= t_b + 1) && c_t <= t_b + 1) && t_b + 1 <= c_t) && wb_pc == 1) && wb_i == 1) && e_f == 2) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(r_st == 0)) && t_b + 1 <= c) && t_b + 1 <= d) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && 2 == wl_pc) && !(e_g == 0)) && !(e_wl == 0)) && c <= t_b + 1) && !(e_e == 0)) && !(c1_st == 0)) && data <= t_b + 1) && t_b + 1 <= data)) || (((((((((((((c1_i == 1 && !(e_wl == 1)) && c2_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && 0 == wl_pc) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0))) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && c2_pc == 0) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0))) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && wb_i == 1) && data <= t_b + 1) && t_b + 1 <= data) && c1_st == 0) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && c1_st == 0)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && c_t <= t_b + 1) && t_b + 1 <= c_t) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && data == t_b + 1) && wb_pc == 1) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && d == t_b + 2) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && 2 == wl_pc) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && e_f == 2)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((processed == 0 && !(wb_st == 0)) && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(c1_st == 0)) && !(e_e == 0)) || (((((((((((((c1_i == 1 && !(e_wl == 1)) && c2_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && 0 == wl_pc) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && 0 == wl_pc)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c1_st == 0)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && wb_i == 1) && data <= t_b + 1) && t_b + 1 <= data) && c1_st == 0) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && c_t <= t_b + 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && t_b + 1 <= c_t) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && data <= t_b + 1) && t_b + 1 <= data) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((((processed == 0 && !(wb_st == 0)) && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c1_st == 0)) || ((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0))) || ((((((((((((((((c2_pc == 1 && c1_i == 1) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((((processed == 0 && !(wb_st == 0)) && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(c1_st == 0)) && !(e_e == 0)) && 0 == wl_pc)) || ((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && 0 == wl_pc) && c1_st == 0) - InvariantResult [Line: 222]: Loop Invariant Derived loop invariant: ((((((((((((((((c1_i == 1 && !(e_wl == 1)) && c2_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && 0 == wl_pc) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) || ((((((((((((((((c2_pc == 1 && c1_i == 1) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && data <= t_b + 1) && t_b + 1 <= data) && c1_st == 0) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && c2_st == 0) && wb_i == 1) && data <= t_b + 1) && t_b + 1 <= data) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) - InvariantResult [Line: 684]: Loop Invariant Derived loop invariant: c2_i == 1 - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: (((((((((((((((((((c1_i == 1 && !(e_wl == 1)) && c2_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && 0 == wl_pc) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) || (((((((d <= 1 && c <= 1) && 1 <= d) && ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) || (((((((((((((((((((((data == t_b && c2_pc == 1) && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && t == data) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && data == t_b + 1) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2))) && 1 <= c_t) && 1 <= c) && c_t <= 1) && t_b == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0))) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((c2_pc == 1 && c1_i == 1) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || ((((((c <= 1 && ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) || (((((((((((((((((((((data == t_b && c2_pc == 1) && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && t == data) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && data == t_b + 1) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2))) && 1 <= c_t) && 1 <= c) && c_t <= 1) && t_b == 0) && d == 0)) || ((((c_t <= t_b + 1 && t_b + 1 <= c_t) && ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) || (((((((((((((((((((((data == t_b && c2_pc == 1) && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && t == data) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && data == t_b + 1) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2))) && data <= t_b + 1) && t_b + 1 <= data) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 126 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 24.9s, OverallIterations: 37, TraceHistogramMax: 10, AutomataDifference: 11.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 61.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7966 SDtfs, 11093 SDslu, 12861 SDs, 0 SdLazy, 1440 SolverSat, 306 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 906 GetRequests, 764 SyntacticMatches, 5 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5290occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.6s AutomataMinimizationTime, 37 MinimizatonAttempts, 7464 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 20 PreInvPairs, 867 NumberOfFragments, 21587 HoareAnnotationTreeSize, 20 FomulaSimplifications, 27280405 FormulaSimplificationTreeSizeReduction, 8.1s HoareSimplificationTime, 20 FomulaSimplificationsInter, 2895198 FormulaSimplificationTreeSizeReductionInter, 53.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 4397 NumberOfCodeBlocks, 4397 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 4357 ConstructedInterpolants, 0 QuantifiedInterpolants, 2127135 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1821 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 40 InterpolantComputations, 34 PerfectInterpolantSequences, 2353/2774 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...