/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/toy1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 09:35:48,349 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 09:35:48,352 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 09:35:48,389 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 09:35:48,389 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 09:35:48,391 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 09:35:48,393 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 09:35:48,395 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 09:35:48,397 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 09:35:48,399 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 09:35:48,400 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 09:35:48,401 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 09:35:48,402 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 09:35:48,403 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 09:35:48,404 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 09:35:48,406 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 09:35:48,407 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 09:35:48,408 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 09:35:48,410 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 09:35:48,413 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 09:35:48,418 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 09:35:48,420 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 09:35:48,422 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 09:35:48,425 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 09:35:48,448 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 09:35:48,449 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 09:35:48,451 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 09:35:48,453 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 09:35:48,456 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 09:35:48,458 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 09:35:48,458 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 09:35:48,461 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 09:35:48,464 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 09:35:48,466 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 09:35:48,468 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 09:35:48,470 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 09:35:48,471 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 09:35:48,471 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 09:35:48,471 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 09:35:48,477 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 09:35:48,478 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 09:35:48,480 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 09:35:48,535 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 09:35:48,535 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 09:35:48,537 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 09:35:48,537 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 09:35:48,538 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 09:35:48,538 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 09:35:48,538 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 09:35:48,539 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 09:35:48,540 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 09:35:48,541 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 09:35:48,542 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 09:35:48,542 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 09:35:48,542 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 09:35:48,543 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 09:35:48,543 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 09:35:48,543 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 09:35:48,543 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 09:35:48,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 09:35:48,544 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 09:35:48,544 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 09:35:48,544 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 09:35:48,544 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 09:35:48,545 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 09:35:48,545 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 09:35:48,545 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 09:35:48,545 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 [2020-12-23 09:35:48,993 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 09:35:49,022 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 09:35:49,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 09:35:49,027 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 09:35:49,028 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 09:35:49,029 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/toy1.cil.c [2020-12-23 09:35:49,109 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/3eac0cc84/5615d85ef1f6487287c8bb1ef54af4e0/FLAG849382201 [2020-12-23 09:35:49,688 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 09:35:49,688 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/toy1.cil.c [2020-12-23 09:35:49,711 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/3eac0cc84/5615d85ef1f6487287c8bb1ef54af4e0/FLAG849382201 [2020-12-23 09:35:50,032 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/3eac0cc84/5615d85ef1f6487287c8bb1ef54af4e0 [2020-12-23 09:35:50,037 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 09:35:50,039 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 09:35:50,042 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 09:35:50,042 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 09:35:50,046 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 09:35:50,048 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:35:50" (1/1) ... [2020-12-23 09:35:50,050 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16bcf767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:35:50, skipping insertion in model container [2020-12-23 09:35:50,050 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:35:50" (1/1) ... [2020-12-23 09:35:50,065 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 09:35:50,147 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 09:35:50,366 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/toy1.cil.c[393,406] 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,] [2020-12-23 09:35:50,508 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:35:50,519 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 09:35:50,533 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/toy1.cil.c[393,406] 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,] [2020-12-23 09:35:50,575 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:35:50,599 INFO L208 MainTranslator]: Completed translation [2020-12-23 09:35:50,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:35:50 WrapperNode [2020-12-23 09:35:50,600 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 09:35:50,601 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 09:35:50,601 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 09:35:50,602 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 09:35:50,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:35:50" (1/1) ... [2020-12-23 09:35:50,620 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:35:50" (1/1) ... [2020-12-23 09:35:50,653 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 09:35:50,654 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 09:35:50,654 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 09:35:50,654 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 09:35:50,663 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:35:50" (1/1) ... [2020-12-23 09:35:50,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:35:50" (1/1) ... [2020-12-23 09:35:50,666 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:35:50" (1/1) ... [2020-12-23 09:35:50,667 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:35:50" (1/1) ... [2020-12-23 09:35:50,673 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:35:50" (1/1) ... [2020-12-23 09:35:50,691 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:35:50" (1/1) ... [2020-12-23 09:35:50,695 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:35:50" (1/1) ... [2020-12-23 09:35:50,703 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 09:35:50,704 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 09:35:50,704 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 09:35:50,704 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 09:35:50,711 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:35:50" (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 [2020-12-23 09:35:50,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 09:35:50,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 09:35:50,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 09:35:50,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 09:35:51,845 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 09:35:51,845 INFO L299 CfgBuilder]: Removed 28 assume(true) statements. [2020-12-23 09:35:51,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:35:51 BoogieIcfgContainer [2020-12-23 09:35:51,851 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 09:35:51,856 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 09:35:51,856 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 09:35:51,867 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 09:35:51,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 09:35:50" (1/3) ... [2020-12-23 09:35:51,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3001bd30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:35:51, skipping insertion in model container [2020-12-23 09:35:51,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:35:50" (2/3) ... [2020-12-23 09:35:51,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3001bd30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:35:51, skipping insertion in model container [2020-12-23 09:35:51,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:35:51" (3/3) ... [2020-12-23 09:35:51,875 INFO L111 eAbstractionObserver]: Analyzing ICFG toy1.cil.c [2020-12-23 09:35:51,880 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 09:35:51,886 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-23 09:35:51,905 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-12-23 09:35:51,932 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 09:35:51,932 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 09:35:51,933 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 09:35:51,933 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 09:35:51,933 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 09:35:51,933 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 09:35:51,933 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 09:35:51,934 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 09:35:51,952 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2020-12-23 09:35:51,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-23 09:35:51,961 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:51,962 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] [2020-12-23 09:35:51,962 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:51,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:51,968 INFO L82 PathProgramCache]: Analyzing trace with hash -895778166, now seen corresponding path program 1 times [2020-12-23 09:35:51,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:51,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448222880] [2020-12-23 09:35:51,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:52,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:52,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:35:52,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448222880] [2020-12-23 09:35:52,205 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:52,205 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:52,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731565046] [2020-12-23 09:35:52,211 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:52,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:52,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:52,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:52,230 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 3 states. [2020-12-23 09:35:52,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:52,284 INFO L93 Difference]: Finished difference Result 250 states and 461 transitions. [2020-12-23 09:35:52,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:52,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2020-12-23 09:35:52,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:52,299 INFO L225 Difference]: With dead ends: 250 [2020-12-23 09:35:52,299 INFO L226 Difference]: Without dead ends: 125 [2020-12-23 09:35:52,303 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 [2020-12-23 09:35:52,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-12-23 09:35:52,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2020-12-23 09:35:52,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-12-23 09:35:52,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 218 transitions. [2020-12-23 09:35:52,356 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 218 transitions. Word has length 36 [2020-12-23 09:35:52,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:52,357 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 218 transitions. [2020-12-23 09:35:52,357 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:52,357 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 218 transitions. [2020-12-23 09:35:52,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-23 09:35:52,359 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:52,360 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] [2020-12-23 09:35:52,360 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 09:35:52,360 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:52,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:52,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1597378040, now seen corresponding path program 1 times [2020-12-23 09:35:52,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:52,362 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197057586] [2020-12-23 09:35:52,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:52,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:35:52,439 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197057586] [2020-12-23 09:35:52,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:52,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:35:52,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178582298] [2020-12-23 09:35:52,442 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:52,442 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:52,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:52,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:52,443 INFO L87 Difference]: Start difference. First operand 125 states and 218 transitions. Second operand 4 states. [2020-12-23 09:35:52,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:52,553 INFO L93 Difference]: Finished difference Result 337 states and 586 transitions. [2020-12-23 09:35:52,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:35:52,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-12-23 09:35:52,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:52,560 INFO L225 Difference]: With dead ends: 337 [2020-12-23 09:35:52,560 INFO L226 Difference]: Without dead ends: 215 [2020-12-23 09:35:52,565 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 [2020-12-23 09:35:52,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2020-12-23 09:35:52,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 210. [2020-12-23 09:35:52,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-12-23 09:35:52,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 366 transitions. [2020-12-23 09:35:52,621 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 366 transitions. Word has length 36 [2020-12-23 09:35:52,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:52,622 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 366 transitions. [2020-12-23 09:35:52,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:52,622 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 366 transitions. [2020-12-23 09:35:52,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-23 09:35:52,624 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:52,624 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] [2020-12-23 09:35:52,625 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 09:35:52,625 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:52,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:52,626 INFO L82 PathProgramCache]: Analyzing trace with hash -211174646, now seen corresponding path program 1 times [2020-12-23 09:35:52,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:52,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808033920] [2020-12-23 09:35:52,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:52,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:52,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:35:52,716 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808033920] [2020-12-23 09:35:52,717 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:52,717 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:52,717 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756293334] [2020-12-23 09:35:52,718 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:52,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:52,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:52,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:52,719 INFO L87 Difference]: Start difference. First operand 210 states and 366 transitions. Second operand 3 states. [2020-12-23 09:35:52,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:52,820 INFO L93 Difference]: Finished difference Result 411 states and 719 transitions. [2020-12-23 09:35:52,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:52,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2020-12-23 09:35:52,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:52,824 INFO L225 Difference]: With dead ends: 411 [2020-12-23 09:35:52,824 INFO L226 Difference]: Without dead ends: 210 [2020-12-23 09:35:52,825 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 [2020-12-23 09:35:52,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-12-23 09:35:52,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2020-12-23 09:35:52,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-12-23 09:35:52,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 354 transitions. [2020-12-23 09:35:52,846 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 354 transitions. Word has length 36 [2020-12-23 09:35:52,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:52,846 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 354 transitions. [2020-12-23 09:35:52,846 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:52,846 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 354 transitions. [2020-12-23 09:35:52,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-23 09:35:52,848 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:52,848 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] [2020-12-23 09:35:52,848 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 09:35:52,848 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:52,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:52,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1741716090, now seen corresponding path program 1 times [2020-12-23 09:35:52,849 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:52,850 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620527192] [2020-12-23 09:35:52,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:52,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:52,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:35:52,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620527192] [2020-12-23 09:35:52,905 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:52,905 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:35:52,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441754951] [2020-12-23 09:35:52,906 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:52,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:52,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:52,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:52,907 INFO L87 Difference]: Start difference. First operand 210 states and 354 transitions. Second operand 4 states. [2020-12-23 09:35:53,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:53,072 INFO L93 Difference]: Finished difference Result 571 states and 965 transitions. [2020-12-23 09:35:53,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:35:53,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-12-23 09:35:53,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:53,076 INFO L225 Difference]: With dead ends: 571 [2020-12-23 09:35:53,076 INFO L226 Difference]: Without dead ends: 371 [2020-12-23 09:35:53,078 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 [2020-12-23 09:35:53,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2020-12-23 09:35:53,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 210. [2020-12-23 09:35:53,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-12-23 09:35:53,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 351 transitions. [2020-12-23 09:35:53,099 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 351 transitions. Word has length 36 [2020-12-23 09:35:53,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:53,099 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 351 transitions. [2020-12-23 09:35:53,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:53,099 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 351 transitions. [2020-12-23 09:35:53,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-23 09:35:53,101 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:53,101 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] [2020-12-23 09:35:53,101 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 09:35:53,101 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:53,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:53,102 INFO L82 PathProgramCache]: Analyzing trace with hash 181511944, now seen corresponding path program 1 times [2020-12-23 09:35:53,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:53,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373781507] [2020-12-23 09:35:53,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:53,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:53,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:35:53,156 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373781507] [2020-12-23 09:35:53,156 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:53,157 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:35:53,157 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859018278] [2020-12-23 09:35:53,157 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:53,157 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:53,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:53,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:53,159 INFO L87 Difference]: Start difference. First operand 210 states and 351 transitions. Second operand 4 states. [2020-12-23 09:35:53,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:53,303 INFO L93 Difference]: Finished difference Result 574 states and 961 transitions. [2020-12-23 09:35:53,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:35:53,307 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-12-23 09:35:53,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:53,310 INFO L225 Difference]: With dead ends: 574 [2020-12-23 09:35:53,310 INFO L226 Difference]: Without dead ends: 375 [2020-12-23 09:35:53,311 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 [2020-12-23 09:35:53,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2020-12-23 09:35:53,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 210. [2020-12-23 09:35:53,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-12-23 09:35:53,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 348 transitions. [2020-12-23 09:35:53,339 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 348 transitions. Word has length 36 [2020-12-23 09:35:53,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:53,339 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 348 transitions. [2020-12-23 09:35:53,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:53,339 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 348 transitions. [2020-12-23 09:35:53,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-23 09:35:53,345 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:53,346 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] [2020-12-23 09:35:53,346 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 09:35:53,346 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:53,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:53,347 INFO L82 PathProgramCache]: Analyzing trace with hash 243551558, now seen corresponding path program 1 times [2020-12-23 09:35:53,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:53,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724389208] [2020-12-23 09:35:53,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:53,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:35:53,420 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724389208] [2020-12-23 09:35:53,420 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:53,420 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:35:53,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297024961] [2020-12-23 09:35:53,421 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:53,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:53,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:53,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:53,422 INFO L87 Difference]: Start difference. First operand 210 states and 348 transitions. Second operand 4 states. [2020-12-23 09:35:53,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:53,557 INFO L93 Difference]: Finished difference Result 586 states and 972 transitions. [2020-12-23 09:35:53,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:35:53,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-12-23 09:35:53,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:53,561 INFO L225 Difference]: With dead ends: 586 [2020-12-23 09:35:53,562 INFO L226 Difference]: Without dead ends: 388 [2020-12-23 09:35:53,562 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 [2020-12-23 09:35:53,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2020-12-23 09:35:53,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 216. [2020-12-23 09:35:53,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-12-23 09:35:53,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 352 transitions. [2020-12-23 09:35:53,577 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 352 transitions. Word has length 36 [2020-12-23 09:35:53,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:53,577 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 352 transitions. [2020-12-23 09:35:53,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:53,577 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 352 transitions. [2020-12-23 09:35:53,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-23 09:35:53,578 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:53,579 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] [2020-12-23 09:35:53,579 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 09:35:53,579 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:53,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:53,602 INFO L82 PathProgramCache]: Analyzing trace with hash 384100168, now seen corresponding path program 1 times [2020-12-23 09:35:53,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:53,606 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001187761] [2020-12-23 09:35:53,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:53,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:53,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:35:53,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001187761] [2020-12-23 09:35:53,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:53,674 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:35:53,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867231558] [2020-12-23 09:35:53,674 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:53,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:53,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:53,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:53,676 INFO L87 Difference]: Start difference. First operand 216 states and 352 transitions. Second operand 4 states. [2020-12-23 09:35:53,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:53,846 INFO L93 Difference]: Finished difference Result 737 states and 1201 transitions. [2020-12-23 09:35:53,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:35:53,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-12-23 09:35:53,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:53,851 INFO L225 Difference]: With dead ends: 737 [2020-12-23 09:35:53,851 INFO L226 Difference]: Without dead ends: 534 [2020-12-23 09:35:53,852 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 [2020-12-23 09:35:53,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-12-23 09:35:53,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 351. [2020-12-23 09:35:53,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2020-12-23 09:35:53,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 571 transitions. [2020-12-23 09:35:53,880 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 571 transitions. Word has length 36 [2020-12-23 09:35:53,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:53,880 INFO L481 AbstractCegarLoop]: Abstraction has 351 states and 571 transitions. [2020-12-23 09:35:53,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:53,881 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 571 transitions. [2020-12-23 09:35:53,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-23 09:35:53,882 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:53,882 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] [2020-12-23 09:35:53,882 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 09:35:53,882 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:53,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:53,883 INFO L82 PathProgramCache]: Analyzing trace with hash 250086662, now seen corresponding path program 1 times [2020-12-23 09:35:53,883 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:53,884 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48440231] [2020-12-23 09:35:53,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:53,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:53,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:35:53,924 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48440231] [2020-12-23 09:35:53,924 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:53,924 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:53,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922720732] [2020-12-23 09:35:53,925 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:53,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:53,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:53,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:53,926 INFO L87 Difference]: Start difference. First operand 351 states and 571 transitions. Second operand 3 states. [2020-12-23 09:35:54,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:54,003 INFO L93 Difference]: Finished difference Result 838 states and 1368 transitions. [2020-12-23 09:35:54,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:54,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2020-12-23 09:35:54,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:54,008 INFO L225 Difference]: With dead ends: 838 [2020-12-23 09:35:54,008 INFO L226 Difference]: Without dead ends: 511 [2020-12-23 09:35:54,009 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 [2020-12-23 09:35:54,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2020-12-23 09:35:54,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 507. [2020-12-23 09:35:54,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2020-12-23 09:35:54,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 825 transitions. [2020-12-23 09:35:54,039 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 825 transitions. Word has length 36 [2020-12-23 09:35:54,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:54,039 INFO L481 AbstractCegarLoop]: Abstraction has 507 states and 825 transitions. [2020-12-23 09:35:54,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:54,039 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 825 transitions. [2020-12-23 09:35:54,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-23 09:35:54,040 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:54,040 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] [2020-12-23 09:35:54,040 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 09:35:54,041 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:54,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:54,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1539792002, now seen corresponding path program 1 times [2020-12-23 09:35:54,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:54,042 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44019997] [2020-12-23 09:35:54,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:54,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:54,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:35:54,090 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44019997] [2020-12-23 09:35:54,090 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:54,091 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:35:54,091 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052383541] [2020-12-23 09:35:54,091 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:54,092 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:54,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:54,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:54,093 INFO L87 Difference]: Start difference. First operand 507 states and 825 transitions. Second operand 4 states. [2020-12-23 09:35:54,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:54,231 INFO L93 Difference]: Finished difference Result 1293 states and 2104 transitions. [2020-12-23 09:35:54,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:35:54,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-12-23 09:35:54,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:54,236 INFO L225 Difference]: With dead ends: 1293 [2020-12-23 09:35:54,237 INFO L226 Difference]: Without dead ends: 803 [2020-12-23 09:35:54,238 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 [2020-12-23 09:35:54,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2020-12-23 09:35:54,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 507. [2020-12-23 09:35:54,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2020-12-23 09:35:54,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 817 transitions. [2020-12-23 09:35:54,286 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 817 transitions. Word has length 36 [2020-12-23 09:35:54,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:54,286 INFO L481 AbstractCegarLoop]: Abstraction has 507 states and 817 transitions. [2020-12-23 09:35:54,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:54,287 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 817 transitions. [2020-12-23 09:35:54,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-23 09:35:54,287 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:54,287 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] [2020-12-23 09:35:54,288 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 09:35:54,288 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:54,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:54,288 INFO L82 PathProgramCache]: Analyzing trace with hash -48555900, now seen corresponding path program 1 times [2020-12-23 09:35:54,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:54,289 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835045224] [2020-12-23 09:35:54,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:54,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:54,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:35:54,328 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835045224] [2020-12-23 09:35:54,328 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:54,328 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:35:54,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457944655] [2020-12-23 09:35:54,329 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:54,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:54,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:54,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:54,330 INFO L87 Difference]: Start difference. First operand 507 states and 817 transitions. Second operand 4 states. [2020-12-23 09:35:54,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:54,482 INFO L93 Difference]: Finished difference Result 1289 states and 2077 transitions. [2020-12-23 09:35:54,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:35:54,483 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-12-23 09:35:54,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:54,487 INFO L225 Difference]: With dead ends: 1289 [2020-12-23 09:35:54,488 INFO L226 Difference]: Without dead ends: 805 [2020-12-23 09:35:54,489 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 [2020-12-23 09:35:54,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2020-12-23 09:35:54,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 507. [2020-12-23 09:35:54,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2020-12-23 09:35:54,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 809 transitions. [2020-12-23 09:35:54,525 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 809 transitions. Word has length 36 [2020-12-23 09:35:54,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:54,525 INFO L481 AbstractCegarLoop]: Abstraction has 507 states and 809 transitions. [2020-12-23 09:35:54,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:54,525 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 809 transitions. [2020-12-23 09:35:54,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-23 09:35:54,526 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:54,526 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] [2020-12-23 09:35:54,526 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 09:35:54,526 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:54,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:54,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1328419578, now seen corresponding path program 1 times [2020-12-23 09:35:54,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:54,527 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146906973] [2020-12-23 09:35:54,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:54,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:54,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:35:54,567 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146906973] [2020-12-23 09:35:54,567 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:54,567 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:35:54,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172033770] [2020-12-23 09:35:54,568 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:54,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:54,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:54,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:54,569 INFO L87 Difference]: Start difference. First operand 507 states and 809 transitions. Second operand 4 states. [2020-12-23 09:35:54,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:54,729 INFO L93 Difference]: Finished difference Result 1226 states and 1951 transitions. [2020-12-23 09:35:54,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:35:54,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-12-23 09:35:54,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:54,735 INFO L225 Difference]: With dead ends: 1226 [2020-12-23 09:35:54,735 INFO L226 Difference]: Without dead ends: 736 [2020-12-23 09:35:54,738 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 [2020-12-23 09:35:54,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2020-12-23 09:35:54,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 555. [2020-12-23 09:35:54,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2020-12-23 09:35:54,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 866 transitions. [2020-12-23 09:35:54,782 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 866 transitions. Word has length 36 [2020-12-23 09:35:54,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:54,782 INFO L481 AbstractCegarLoop]: Abstraction has 555 states and 866 transitions. [2020-12-23 09:35:54,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:54,782 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 866 transitions. [2020-12-23 09:35:54,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-23 09:35:54,783 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:54,783 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] [2020-12-23 09:35:54,783 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 09:35:54,783 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:54,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:54,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1915225592, now seen corresponding path program 1 times [2020-12-23 09:35:54,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:54,785 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104323791] [2020-12-23 09:35:54,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:54,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:54,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:35:54,857 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104323791] [2020-12-23 09:35:54,857 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:54,857 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:54,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430510556] [2020-12-23 09:35:54,858 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:54,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:54,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:54,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:54,859 INFO L87 Difference]: Start difference. First operand 555 states and 866 transitions. Second operand 3 states. [2020-12-23 09:35:54,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:54,976 INFO L93 Difference]: Finished difference Result 1316 states and 2058 transitions. [2020-12-23 09:35:54,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:54,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2020-12-23 09:35:54,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:54,981 INFO L225 Difference]: With dead ends: 1316 [2020-12-23 09:35:54,981 INFO L226 Difference]: Without dead ends: 775 [2020-12-23 09:35:54,982 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 [2020-12-23 09:35:54,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2020-12-23 09:35:55,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 772. [2020-12-23 09:35:55,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2020-12-23 09:35:55,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1190 transitions. [2020-12-23 09:35:55,029 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1190 transitions. Word has length 36 [2020-12-23 09:35:55,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:55,030 INFO L481 AbstractCegarLoop]: Abstraction has 772 states and 1190 transitions. [2020-12-23 09:35:55,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:55,030 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1190 transitions. [2020-12-23 09:35:55,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-12-23 09:35:55,031 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:55,031 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] [2020-12-23 09:35:55,031 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 09:35:55,031 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:55,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:55,032 INFO L82 PathProgramCache]: Analyzing trace with hash -547155332, now seen corresponding path program 1 times [2020-12-23 09:35:55,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:55,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586190561] [2020-12-23 09:35:55,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:55,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:55,062 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:35:55,062 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586190561] [2020-12-23 09:35:55,062 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:55,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:55,063 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862320904] [2020-12-23 09:35:55,063 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:55,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:55,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:55,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:55,064 INFO L87 Difference]: Start difference. First operand 772 states and 1190 transitions. Second operand 3 states. [2020-12-23 09:35:55,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:55,165 INFO L93 Difference]: Finished difference Result 1906 states and 2978 transitions. [2020-12-23 09:35:55,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:55,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-12-23 09:35:55,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:55,172 INFO L225 Difference]: With dead ends: 1906 [2020-12-23 09:35:55,172 INFO L226 Difference]: Without dead ends: 1161 [2020-12-23 09:35:55,177 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 [2020-12-23 09:35:55,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2020-12-23 09:35:55,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1157. [2020-12-23 09:35:55,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1157 states. [2020-12-23 09:35:55,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1801 transitions. [2020-12-23 09:35:55,255 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1801 transitions. Word has length 46 [2020-12-23 09:35:55,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:55,256 INFO L481 AbstractCegarLoop]: Abstraction has 1157 states and 1801 transitions. [2020-12-23 09:35:55,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:55,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1801 transitions. [2020-12-23 09:35:55,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-12-23 09:35:55,258 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:55,259 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] [2020-12-23 09:35:55,260 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 09:35:55,260 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:55,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:55,260 INFO L82 PathProgramCache]: Analyzing trace with hash -299008838, now seen corresponding path program 1 times [2020-12-23 09:35:55,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:55,261 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58765615] [2020-12-23 09:35:55,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:55,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:55,297 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-23 09:35:55,298 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58765615] [2020-12-23 09:35:55,298 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:55,298 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:55,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396551428] [2020-12-23 09:35:55,299 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:55,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:55,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:55,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:55,300 INFO L87 Difference]: Start difference. First operand 1157 states and 1801 transitions. Second operand 3 states. [2020-12-23 09:35:55,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:55,395 INFO L93 Difference]: Finished difference Result 2265 states and 3543 transitions. [2020-12-23 09:35:55,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:55,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-12-23 09:35:55,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:55,403 INFO L225 Difference]: With dead ends: 2265 [2020-12-23 09:35:55,403 INFO L226 Difference]: Without dead ends: 1135 [2020-12-23 09:35:55,409 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 [2020-12-23 09:35:55,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2020-12-23 09:35:55,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 1135. [2020-12-23 09:35:55,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1135 states. [2020-12-23 09:35:55,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1774 transitions. [2020-12-23 09:35:55,492 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1774 transitions. Word has length 46 [2020-12-23 09:35:55,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:55,493 INFO L481 AbstractCegarLoop]: Abstraction has 1135 states and 1774 transitions. [2020-12-23 09:35:55,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:55,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1774 transitions. [2020-12-23 09:35:55,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-12-23 09:35:55,494 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:55,494 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] [2020-12-23 09:35:55,495 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 09:35:55,495 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:55,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:55,495 INFO L82 PathProgramCache]: Analyzing trace with hash -336670593, now seen corresponding path program 1 times [2020-12-23 09:35:55,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:55,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593715801] [2020-12-23 09:35:55,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:55,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:55,540 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:35:55,541 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593715801] [2020-12-23 09:35:55,541 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:55,541 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:55,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937158335] [2020-12-23 09:35:55,542 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:55,542 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:55,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:55,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:55,543 INFO L87 Difference]: Start difference. First operand 1135 states and 1774 transitions. Second operand 3 states. [2020-12-23 09:35:55,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:55,736 INFO L93 Difference]: Finished difference Result 2891 states and 4579 transitions. [2020-12-23 09:35:55,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:55,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2020-12-23 09:35:55,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:55,748 INFO L225 Difference]: With dead ends: 2891 [2020-12-23 09:35:55,749 INFO L226 Difference]: Without dead ends: 1783 [2020-12-23 09:35:55,753 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 [2020-12-23 09:35:55,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2020-12-23 09:35:55,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1779. [2020-12-23 09:35:55,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1779 states. [2020-12-23 09:35:55,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2808 transitions. [2020-12-23 09:35:55,914 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2808 transitions. Word has length 47 [2020-12-23 09:35:55,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:55,916 INFO L481 AbstractCegarLoop]: Abstraction has 1779 states and 2808 transitions. [2020-12-23 09:35:55,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:55,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2808 transitions. [2020-12-23 09:35:55,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-12-23 09:35:55,917 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:55,917 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] [2020-12-23 09:35:55,918 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 09:35:55,918 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:55,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:55,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1825522215, now seen corresponding path program 1 times [2020-12-23 09:35:55,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:55,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941058002] [2020-12-23 09:35:55,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:55,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:55,974 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:35:55,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941058002] [2020-12-23 09:35:55,976 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:55,977 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:55,977 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704786919] [2020-12-23 09:35:55,977 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:55,977 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:55,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:55,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:55,978 INFO L87 Difference]: Start difference. First operand 1779 states and 2808 transitions. Second operand 3 states. [2020-12-23 09:35:56,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:56,238 INFO L93 Difference]: Finished difference Result 4794 states and 7664 transitions. [2020-12-23 09:35:56,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:56,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2020-12-23 09:35:56,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:56,255 INFO L225 Difference]: With dead ends: 4794 [2020-12-23 09:35:56,255 INFO L226 Difference]: Without dead ends: 3044 [2020-12-23 09:35:56,258 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 [2020-12-23 09:35:56,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3044 states. [2020-12-23 09:35:56,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3044 to 3040. [2020-12-23 09:35:56,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3040 states. [2020-12-23 09:35:56,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3040 states to 3040 states and 4843 transitions. [2020-12-23 09:35:56,467 INFO L78 Accepts]: Start accepts. Automaton has 3040 states and 4843 transitions. Word has length 48 [2020-12-23 09:35:56,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:56,468 INFO L481 AbstractCegarLoop]: Abstraction has 3040 states and 4843 transitions. [2020-12-23 09:35:56,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:56,468 INFO L276 IsEmpty]: Start isEmpty. Operand 3040 states and 4843 transitions. [2020-12-23 09:35:56,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-12-23 09:35:56,470 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:56,470 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] [2020-12-23 09:35:56,470 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 09:35:56,470 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:56,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:56,471 INFO L82 PathProgramCache]: Analyzing trace with hash 2073668709, now seen corresponding path program 1 times [2020-12-23 09:35:56,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:56,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146617549] [2020-12-23 09:35:56,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:56,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:56,514 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-23 09:35:56,515 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146617549] [2020-12-23 09:35:56,515 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:56,515 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:56,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438941695] [2020-12-23 09:35:56,516 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:56,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:56,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:56,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:56,517 INFO L87 Difference]: Start difference. First operand 3040 states and 4843 transitions. Second operand 3 states. [2020-12-23 09:35:56,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:56,700 INFO L93 Difference]: Finished difference Result 6029 states and 9627 transitions. [2020-12-23 09:35:56,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:56,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2020-12-23 09:35:56,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:56,718 INFO L225 Difference]: With dead ends: 6029 [2020-12-23 09:35:56,718 INFO L226 Difference]: Without dead ends: 3018 [2020-12-23 09:35:56,723 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 [2020-12-23 09:35:56,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2020-12-23 09:35:56,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 3018. [2020-12-23 09:35:56,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3018 states. [2020-12-23 09:35:56,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 4817 transitions. [2020-12-23 09:35:56,958 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 4817 transitions. Word has length 48 [2020-12-23 09:35:56,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:56,958 INFO L481 AbstractCegarLoop]: Abstraction has 3018 states and 4817 transitions. [2020-12-23 09:35:56,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:56,958 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 4817 transitions. [2020-12-23 09:35:56,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-12-23 09:35:56,960 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:56,960 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] [2020-12-23 09:35:56,961 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 09:35:56,961 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:56,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:56,961 INFO L82 PathProgramCache]: Analyzing trace with hash 963117268, now seen corresponding path program 1 times [2020-12-23 09:35:56,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:56,962 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254260969] [2020-12-23 09:35:56,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:56,997 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:35:56,997 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254260969] [2020-12-23 09:35:56,997 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:56,997 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:35:56,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085252823] [2020-12-23 09:35:56,998 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:56,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:56,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:56,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:56,999 INFO L87 Difference]: Start difference. First operand 3018 states and 4817 transitions. Second operand 4 states. [2020-12-23 09:35:57,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:57,437 INFO L93 Difference]: Finished difference Result 7617 states and 12199 transitions. [2020-12-23 09:35:57,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:35:57,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2020-12-23 09:35:57,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:57,459 INFO L225 Difference]: With dead ends: 7617 [2020-12-23 09:35:57,459 INFO L226 Difference]: Without dead ends: 3895 [2020-12-23 09:35:57,467 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 [2020-12-23 09:35:57,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3895 states. [2020-12-23 09:35:57,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3895 to 3895. [2020-12-23 09:35:57,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3895 states. [2020-12-23 09:35:57,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3895 states to 3895 states and 6183 transitions. [2020-12-23 09:35:57,802 INFO L78 Accepts]: Start accepts. Automaton has 3895 states and 6183 transitions. Word has length 49 [2020-12-23 09:35:57,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:57,803 INFO L481 AbstractCegarLoop]: Abstraction has 3895 states and 6183 transitions. [2020-12-23 09:35:57,803 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:57,803 INFO L276 IsEmpty]: Start isEmpty. Operand 3895 states and 6183 transitions. [2020-12-23 09:35:57,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-12-23 09:35:57,805 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:57,806 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] [2020-12-23 09:35:57,806 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 09:35:57,806 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:57,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:57,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1671888881, now seen corresponding path program 1 times [2020-12-23 09:35:57,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:57,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936669910] [2020-12-23 09:35:57,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:57,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:57,888 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:35:57,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936669910] [2020-12-23 09:35:57,888 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:57,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:35:57,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103818114] [2020-12-23 09:35:57,890 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:35:57,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:57,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:35:57,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:35:57,893 INFO L87 Difference]: Start difference. First operand 3895 states and 6183 transitions. Second operand 5 states. [2020-12-23 09:35:58,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:58,498 INFO L93 Difference]: Finished difference Result 9940 states and 15662 transitions. [2020-12-23 09:35:58,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 09:35:58,499 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2020-12-23 09:35:58,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:58,552 INFO L225 Difference]: With dead ends: 9940 [2020-12-23 09:35:58,552 INFO L226 Difference]: Without dead ends: 6068 [2020-12-23 09:35:58,557 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 [2020-12-23 09:35:58,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6068 states. [2020-12-23 09:35:58,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6068 to 4554. [2020-12-23 09:35:58,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4554 states. [2020-12-23 09:35:59,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4554 states to 4554 states and 7072 transitions. [2020-12-23 09:35:59,004 INFO L78 Accepts]: Start accepts. Automaton has 4554 states and 7072 transitions. Word has length 54 [2020-12-23 09:35:59,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:59,004 INFO L481 AbstractCegarLoop]: Abstraction has 4554 states and 7072 transitions. [2020-12-23 09:35:59,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:35:59,005 INFO L276 IsEmpty]: Start isEmpty. Operand 4554 states and 7072 transitions. [2020-12-23 09:35:59,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-12-23 09:35:59,016 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:59,016 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] [2020-12-23 09:35:59,016 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 09:35:59,017 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:59,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:59,017 INFO L82 PathProgramCache]: Analyzing trace with hash -2128152978, now seen corresponding path program 1 times [2020-12-23 09:35:59,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:59,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139976695] [2020-12-23 09:35:59,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:59,078 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:35:59,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139976695] [2020-12-23 09:35:59,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:59,078 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:59,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120800316] [2020-12-23 09:35:59,079 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:59,079 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:59,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:59,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:59,080 INFO L87 Difference]: Start difference. First operand 4554 states and 7072 transitions. Second operand 3 states. [2020-12-23 09:35:59,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:59,466 INFO L93 Difference]: Finished difference Result 9431 states and 14610 transitions. [2020-12-23 09:35:59,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:59,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2020-12-23 09:35:59,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:59,478 INFO L225 Difference]: With dead ends: 9431 [2020-12-23 09:35:59,478 INFO L226 Difference]: Without dead ends: 4906 [2020-12-23 09:35:59,484 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 [2020-12-23 09:35:59,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4906 states. [2020-12-23 09:35:59,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4906 to 4874. [2020-12-23 09:35:59,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4874 states. [2020-12-23 09:35:59,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4874 states to 4874 states and 7321 transitions. [2020-12-23 09:35:59,954 INFO L78 Accepts]: Start accepts. Automaton has 4874 states and 7321 transitions. Word has length 86 [2020-12-23 09:35:59,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:59,954 INFO L481 AbstractCegarLoop]: Abstraction has 4874 states and 7321 transitions. [2020-12-23 09:35:59,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:59,954 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states and 7321 transitions. [2020-12-23 09:35:59,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-12-23 09:35:59,958 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:59,958 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] [2020-12-23 09:35:59,959 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 09:35:59,959 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:59,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:59,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1520792899, now seen corresponding path program 1 times [2020-12-23 09:35:59,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:59,960 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312412528] [2020-12-23 09:35:59,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:59,996 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:35:59,996 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312412528] [2020-12-23 09:35:59,996 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:59,997 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:59,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898664014] [2020-12-23 09:35:59,997 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:59,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:59,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:59,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:59,998 INFO L87 Difference]: Start difference. First operand 4874 states and 7321 transitions. Second operand 3 states. [2020-12-23 09:36:00,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:00,370 INFO L93 Difference]: Finished difference Result 10229 states and 15320 transitions. [2020-12-23 09:36:00,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:36:00,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2020-12-23 09:36:00,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:00,380 INFO L225 Difference]: With dead ends: 10229 [2020-12-23 09:36:00,380 INFO L226 Difference]: Without dead ends: 5396 [2020-12-23 09:36:00,386 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 [2020-12-23 09:36:00,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5396 states. [2020-12-23 09:36:00,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5396 to 5348. [2020-12-23 09:36:00,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5348 states. [2020-12-23 09:36:00,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5348 states to 5348 states and 7764 transitions. [2020-12-23 09:36:00,940 INFO L78 Accepts]: Start accepts. Automaton has 5348 states and 7764 transitions. Word has length 87 [2020-12-23 09:36:00,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:00,940 INFO L481 AbstractCegarLoop]: Abstraction has 5348 states and 7764 transitions. [2020-12-23 09:36:00,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:36:00,940 INFO L276 IsEmpty]: Start isEmpty. Operand 5348 states and 7764 transitions. [2020-12-23 09:36:00,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-12-23 09:36:00,947 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:00,947 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] [2020-12-23 09:36:00,947 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 09:36:00,947 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:00,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:00,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1973365524, now seen corresponding path program 1 times [2020-12-23 09:36:00,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:00,950 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794831878] [2020-12-23 09:36:00,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:00,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:01,002 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:36:01,002 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794831878] [2020-12-23 09:36:01,002 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:01,003 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:36:01,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691805085] [2020-12-23 09:36:01,003 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:36:01,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:01,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:36:01,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:36:01,006 INFO L87 Difference]: Start difference. First operand 5348 states and 7764 transitions. Second operand 3 states. [2020-12-23 09:36:01,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:01,447 INFO L93 Difference]: Finished difference Result 11003 states and 15979 transitions. [2020-12-23 09:36:01,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:36:01,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2020-12-23 09:36:01,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:01,462 INFO L225 Difference]: With dead ends: 11003 [2020-12-23 09:36:01,462 INFO L226 Difference]: Without dead ends: 5716 [2020-12-23 09:36:01,472 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 [2020-12-23 09:36:01,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5716 states. [2020-12-23 09:36:01,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5716 to 5130. [2020-12-23 09:36:01,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5130 states. [2020-12-23 09:36:01,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5130 states to 5130 states and 7126 transitions. [2020-12-23 09:36:01,895 INFO L78 Accepts]: Start accepts. Automaton has 5130 states and 7126 transitions. Word has length 88 [2020-12-23 09:36:01,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:01,895 INFO L481 AbstractCegarLoop]: Abstraction has 5130 states and 7126 transitions. [2020-12-23 09:36:01,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:36:01,896 INFO L276 IsEmpty]: Start isEmpty. Operand 5130 states and 7126 transitions. [2020-12-23 09:36:01,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-12-23 09:36:01,901 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:01,901 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] [2020-12-23 09:36:01,901 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 09:36:01,901 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:01,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:01,902 INFO L82 PathProgramCache]: Analyzing trace with hash 663253701, now seen corresponding path program 1 times [2020-12-23 09:36:01,902 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:01,902 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302050962] [2020-12-23 09:36:01,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:01,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:01,951 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 09:36:01,951 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302050962] [2020-12-23 09:36:01,951 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:01,952 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:36:01,952 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070421023] [2020-12-23 09:36:01,952 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:36:01,952 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:01,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:36:01,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:36:01,953 INFO L87 Difference]: Start difference. First operand 5130 states and 7126 transitions. Second operand 4 states. [2020-12-23 09:36:02,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:02,557 INFO L93 Difference]: Finished difference Result 9554 states and 13184 transitions. [2020-12-23 09:36:02,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:36:02,557 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2020-12-23 09:36:02,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:02,567 INFO L225 Difference]: With dead ends: 9554 [2020-12-23 09:36:02,568 INFO L226 Difference]: Without dead ends: 4875 [2020-12-23 09:36:02,575 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 [2020-12-23 09:36:02,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2020-12-23 09:36:02,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 4759. [2020-12-23 09:36:02,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4759 states. [2020-12-23 09:36:02,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4759 states to 4759 states and 6364 transitions. [2020-12-23 09:36:02,920 INFO L78 Accepts]: Start accepts. Automaton has 4759 states and 6364 transitions. Word has length 89 [2020-12-23 09:36:02,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:02,921 INFO L481 AbstractCegarLoop]: Abstraction has 4759 states and 6364 transitions. [2020-12-23 09:36:02,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:36:02,921 INFO L276 IsEmpty]: Start isEmpty. Operand 4759 states and 6364 transitions. [2020-12-23 09:36:02,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-12-23 09:36:02,931 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:02,932 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] [2020-12-23 09:36:02,932 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-23 09:36:02,932 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:02,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:02,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1690650567, now seen corresponding path program 1 times [2020-12-23 09:36:02,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:02,933 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186158554] [2020-12-23 09:36:02,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:02,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:02,975 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 09:36:02,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186158554] [2020-12-23 09:36:02,975 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:02,975 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:36:02,976 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656357508] [2020-12-23 09:36:02,976 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:36:02,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:02,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:36:02,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:36:02,977 INFO L87 Difference]: Start difference. First operand 4759 states and 6364 transitions. Second operand 3 states. [2020-12-23 09:36:03,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:03,497 INFO L93 Difference]: Finished difference Result 9073 states and 12125 transitions. [2020-12-23 09:36:03,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:36:03,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2020-12-23 09:36:03,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:03,508 INFO L225 Difference]: With dead ends: 9073 [2020-12-23 09:36:03,508 INFO L226 Difference]: Without dead ends: 4705 [2020-12-23 09:36:03,515 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 [2020-12-23 09:36:03,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4705 states. [2020-12-23 09:36:03,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4705 to 4705. [2020-12-23 09:36:03,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4705 states. [2020-12-23 09:36:04,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4705 states to 4705 states and 6258 transitions. [2020-12-23 09:36:04,008 INFO L78 Accepts]: Start accepts. Automaton has 4705 states and 6258 transitions. Word has length 116 [2020-12-23 09:36:04,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:04,008 INFO L481 AbstractCegarLoop]: Abstraction has 4705 states and 6258 transitions. [2020-12-23 09:36:04,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:36:04,008 INFO L276 IsEmpty]: Start isEmpty. Operand 4705 states and 6258 transitions. [2020-12-23 09:36:04,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-12-23 09:36:04,019 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:04,019 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] [2020-12-23 09:36:04,020 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-23 09:36:04,020 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:04,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:04,020 INFO L82 PathProgramCache]: Analyzing trace with hash 762576065, now seen corresponding path program 1 times [2020-12-23 09:36:04,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:04,021 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081555113] [2020-12-23 09:36:04,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:04,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:04,091 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 09:36:04,091 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081555113] [2020-12-23 09:36:04,091 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:04,091 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:36:04,091 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488605519] [2020-12-23 09:36:04,092 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:36:04,092 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:04,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:36:04,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:36:04,093 INFO L87 Difference]: Start difference. First operand 4705 states and 6258 transitions. Second operand 4 states. [2020-12-23 09:36:04,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:04,444 INFO L93 Difference]: Finished difference Result 8363 states and 11148 transitions. [2020-12-23 09:36:04,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:36:04,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2020-12-23 09:36:04,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:04,455 INFO L225 Difference]: With dead ends: 8363 [2020-12-23 09:36:04,456 INFO L226 Difference]: Without dead ends: 4627 [2020-12-23 09:36:04,462 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 [2020-12-23 09:36:04,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4627 states. [2020-12-23 09:36:04,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4627 to 4623. [2020-12-23 09:36:04,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4623 states. [2020-12-23 09:36:05,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4623 states to 4623 states and 6037 transitions. [2020-12-23 09:36:05,006 INFO L78 Accepts]: Start accepts. Automaton has 4623 states and 6037 transitions. Word has length 128 [2020-12-23 09:36:05,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:05,006 INFO L481 AbstractCegarLoop]: Abstraction has 4623 states and 6037 transitions. [2020-12-23 09:36:05,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:36:05,006 INFO L276 IsEmpty]: Start isEmpty. Operand 4623 states and 6037 transitions. [2020-12-23 09:36:05,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-12-23 09:36:05,019 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:05,019 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] [2020-12-23 09:36:05,019 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-23 09:36:05,019 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:05,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:05,020 INFO L82 PathProgramCache]: Analyzing trace with hash 843157933, now seen corresponding path program 1 times [2020-12-23 09:36:05,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:05,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026476748] [2020-12-23 09:36:05,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:05,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:05,097 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-12-23 09:36:05,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026476748] [2020-12-23 09:36:05,098 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:05,098 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:36:05,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486736914] [2020-12-23 09:36:05,098 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:36:05,099 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:05,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:36:05,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:36:05,099 INFO L87 Difference]: Start difference. First operand 4623 states and 6037 transitions. Second operand 3 states. [2020-12-23 09:36:05,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:05,511 INFO L93 Difference]: Finished difference Result 8859 states and 11562 transitions. [2020-12-23 09:36:05,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:36:05,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2020-12-23 09:36:05,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:05,522 INFO L225 Difference]: With dead ends: 8859 [2020-12-23 09:36:05,523 INFO L226 Difference]: Without dead ends: 4622 [2020-12-23 09:36:05,532 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 [2020-12-23 09:36:05,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2020-12-23 09:36:05,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 4582. [2020-12-23 09:36:05,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4582 states. [2020-12-23 09:36:05,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4582 states to 4582 states and 5954 transitions. [2020-12-23 09:36:05,965 INFO L78 Accepts]: Start accepts. Automaton has 4582 states and 5954 transitions. Word has length 134 [2020-12-23 09:36:05,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:05,965 INFO L481 AbstractCegarLoop]: Abstraction has 4582 states and 5954 transitions. [2020-12-23 09:36:05,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:36:05,965 INFO L276 IsEmpty]: Start isEmpty. Operand 4582 states and 5954 transitions. [2020-12-23 09:36:05,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-12-23 09:36:05,975 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:05,976 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] [2020-12-23 09:36:05,976 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-23 09:36:05,976 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:05,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:05,977 INFO L82 PathProgramCache]: Analyzing trace with hash 713131341, now seen corresponding path program 1 times [2020-12-23 09:36:05,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:05,977 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280508519] [2020-12-23 09:36:05,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:05,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:06,037 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-12-23 09:36:06,037 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280508519] [2020-12-23 09:36:06,037 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:06,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:36:06,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368943688] [2020-12-23 09:36:06,038 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:36:06,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:06,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:36:06,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:36:06,039 INFO L87 Difference]: Start difference. First operand 4582 states and 5954 transitions. Second operand 3 states. [2020-12-23 09:36:06,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:06,439 INFO L93 Difference]: Finished difference Result 8798 states and 11423 transitions. [2020-12-23 09:36:06,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:36:06,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2020-12-23 09:36:06,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:06,444 INFO L225 Difference]: With dead ends: 8798 [2020-12-23 09:36:06,444 INFO L226 Difference]: Without dead ends: 4592 [2020-12-23 09:36:06,447 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 [2020-12-23 09:36:06,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4592 states. [2020-12-23 09:36:06,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4592 to 4552. [2020-12-23 09:36:06,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4552 states. [2020-12-23 09:36:06,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4552 states to 4552 states and 5883 transitions. [2020-12-23 09:36:06,897 INFO L78 Accepts]: Start accepts. Automaton has 4552 states and 5883 transitions. Word has length 134 [2020-12-23 09:36:06,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:06,897 INFO L481 AbstractCegarLoop]: Abstraction has 4552 states and 5883 transitions. [2020-12-23 09:36:06,897 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:36:06,898 INFO L276 IsEmpty]: Start isEmpty. Operand 4552 states and 5883 transitions. [2020-12-23 09:36:06,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-12-23 09:36:06,906 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:06,907 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] [2020-12-23 09:36:06,907 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-23 09:36:06,907 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:06,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:06,908 INFO L82 PathProgramCache]: Analyzing trace with hash -57826629, now seen corresponding path program 1 times [2020-12-23 09:36:06,908 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:06,908 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958041817] [2020-12-23 09:36:06,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:06,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:06,961 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-23 09:36:06,961 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958041817] [2020-12-23 09:36:06,961 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:06,962 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:36:06,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109240535] [2020-12-23 09:36:06,962 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:36:06,962 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:06,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:36:06,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:36:06,963 INFO L87 Difference]: Start difference. First operand 4552 states and 5883 transitions. Second operand 4 states. [2020-12-23 09:36:07,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:07,290 INFO L93 Difference]: Finished difference Result 7397 states and 9599 transitions. [2020-12-23 09:36:07,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:36:07,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2020-12-23 09:36:07,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:07,295 INFO L225 Difference]: With dead ends: 7397 [2020-12-23 09:36:07,295 INFO L226 Difference]: Without dead ends: 3218 [2020-12-23 09:36:07,300 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 [2020-12-23 09:36:07,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3218 states. [2020-12-23 09:36:07,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3218 to 3214. [2020-12-23 09:36:07,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3214 states. [2020-12-23 09:36:07,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 3214 states and 4065 transitions. [2020-12-23 09:36:07,606 INFO L78 Accepts]: Start accepts. Automaton has 3214 states and 4065 transitions. Word has length 137 [2020-12-23 09:36:07,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:07,606 INFO L481 AbstractCegarLoop]: Abstraction has 3214 states and 4065 transitions. [2020-12-23 09:36:07,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:36:07,607 INFO L276 IsEmpty]: Start isEmpty. Operand 3214 states and 4065 transitions. [2020-12-23 09:36:07,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-12-23 09:36:07,612 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:07,612 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] [2020-12-23 09:36:07,613 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-23 09:36:07,613 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:07,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:07,613 INFO L82 PathProgramCache]: Analyzing trace with hash -76782736, now seen corresponding path program 1 times [2020-12-23 09:36:07,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:07,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899947627] [2020-12-23 09:36:07,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:07,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:07,667 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-12-23 09:36:07,667 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899947627] [2020-12-23 09:36:07,667 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:07,667 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:36:07,667 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638456872] [2020-12-23 09:36:07,668 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:36:07,668 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:07,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:36:07,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:36:07,669 INFO L87 Difference]: Start difference. First operand 3214 states and 4065 transitions. Second operand 4 states. [2020-12-23 09:36:07,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:07,858 INFO L93 Difference]: Finished difference Result 5216 states and 6609 transitions. [2020-12-23 09:36:07,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:36:07,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2020-12-23 09:36:07,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:07,860 INFO L225 Difference]: With dead ends: 5216 [2020-12-23 09:36:07,860 INFO L226 Difference]: Without dead ends: 2075 [2020-12-23 09:36:07,864 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 [2020-12-23 09:36:07,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2075 states. [2020-12-23 09:36:08,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2075 to 2071. [2020-12-23 09:36:08,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2071 states. [2020-12-23 09:36:08,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 2543 transitions. [2020-12-23 09:36:08,005 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 2543 transitions. Word has length 137 [2020-12-23 09:36:08,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:08,005 INFO L481 AbstractCegarLoop]: Abstraction has 2071 states and 2543 transitions. [2020-12-23 09:36:08,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:36:08,005 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 2543 transitions. [2020-12-23 09:36:08,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-12-23 09:36:08,008 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:08,008 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] [2020-12-23 09:36:08,008 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-23 09:36:08,008 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:08,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:08,009 INFO L82 PathProgramCache]: Analyzing trace with hash 373327418, now seen corresponding path program 1 times [2020-12-23 09:36:08,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:08,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773801612] [2020-12-23 09:36:08,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:08,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:08,065 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-12-23 09:36:08,065 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773801612] [2020-12-23 09:36:08,065 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:08,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:36:08,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791509284] [2020-12-23 09:36:08,066 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:36:08,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:08,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:36:08,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:36:08,067 INFO L87 Difference]: Start difference. First operand 2071 states and 2543 transitions. Second operand 3 states. [2020-12-23 09:36:08,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:08,222 INFO L93 Difference]: Finished difference Result 3759 states and 4649 transitions. [2020-12-23 09:36:08,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:36:08,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2020-12-23 09:36:08,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:08,224 INFO L225 Difference]: With dead ends: 3759 [2020-12-23 09:36:08,224 INFO L226 Difference]: Without dead ends: 2029 [2020-12-23 09:36:08,226 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 [2020-12-23 09:36:08,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2029 states. [2020-12-23 09:36:08,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2029 to 1941. [2020-12-23 09:36:08,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1941 states. [2020-12-23 09:36:08,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 2345 transitions. [2020-12-23 09:36:08,376 INFO L78 Accepts]: Start accepts. Automaton has 1941 states and 2345 transitions. Word has length 176 [2020-12-23 09:36:08,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:08,377 INFO L481 AbstractCegarLoop]: Abstraction has 1941 states and 2345 transitions. [2020-12-23 09:36:08,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:36:08,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 2345 transitions. [2020-12-23 09:36:08,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2020-12-23 09:36:08,379 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:08,380 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] [2020-12-23 09:36:08,380 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-23 09:36:08,380 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:08,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:08,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1072981429, now seen corresponding path program 1 times [2020-12-23 09:36:08,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:08,381 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428860291] [2020-12-23 09:36:08,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:08,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:08,436 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-12-23 09:36:08,437 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428860291] [2020-12-23 09:36:08,437 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:08,437 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:36:08,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87931588] [2020-12-23 09:36:08,437 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:36:08,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:08,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:36:08,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:36:08,438 INFO L87 Difference]: Start difference. First operand 1941 states and 2345 transitions. Second operand 3 states. [2020-12-23 09:36:08,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:08,661 INFO L93 Difference]: Finished difference Result 4180 states and 5086 transitions. [2020-12-23 09:36:08,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:36:08,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2020-12-23 09:36:08,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:08,665 INFO L225 Difference]: With dead ends: 4180 [2020-12-23 09:36:08,665 INFO L226 Difference]: Without dead ends: 2576 [2020-12-23 09:36:08,666 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 [2020-12-23 09:36:08,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2576 states. [2020-12-23 09:36:08,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2576 to 2219. [2020-12-23 09:36:08,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2219 states. [2020-12-23 09:36:08,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2219 states to 2219 states and 2645 transitions. [2020-12-23 09:36:08,801 INFO L78 Accepts]: Start accepts. Automaton has 2219 states and 2645 transitions. Word has length 182 [2020-12-23 09:36:08,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:08,801 INFO L481 AbstractCegarLoop]: Abstraction has 2219 states and 2645 transitions. [2020-12-23 09:36:08,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:36:08,801 INFO L276 IsEmpty]: Start isEmpty. Operand 2219 states and 2645 transitions. [2020-12-23 09:36:08,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-12-23 09:36:08,804 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:08,804 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] [2020-12-23 09:36:08,804 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-23 09:36:08,805 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:08,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:08,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1005799718, now seen corresponding path program 1 times [2020-12-23 09:36:08,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:08,805 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864622873] [2020-12-23 09:36:08,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:08,861 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-12-23 09:36:08,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864622873] [2020-12-23 09:36:08,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:08,862 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:36:08,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76681212] [2020-12-23 09:36:08,862 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:36:08,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:08,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:36:08,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:36:08,863 INFO L87 Difference]: Start difference. First operand 2219 states and 2645 transitions. Second operand 3 states. [2020-12-23 09:36:09,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:09,010 INFO L93 Difference]: Finished difference Result 3766 states and 4524 transitions. [2020-12-23 09:36:09,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:36:09,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2020-12-23 09:36:09,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:09,013 INFO L225 Difference]: With dead ends: 3766 [2020-12-23 09:36:09,013 INFO L226 Difference]: Without dead ends: 1882 [2020-12-23 09:36:09,015 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 [2020-12-23 09:36:09,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2020-12-23 09:36:09,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1803. [2020-12-23 09:36:09,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1803 states. [2020-12-23 09:36:09,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2119 transitions. [2020-12-23 09:36:09,134 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2119 transitions. Word has length 185 [2020-12-23 09:36:09,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:09,135 INFO L481 AbstractCegarLoop]: Abstraction has 1803 states and 2119 transitions. [2020-12-23 09:36:09,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:36:09,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2119 transitions. [2020-12-23 09:36:09,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-12-23 09:36:09,136 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:09,136 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] [2020-12-23 09:36:09,137 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-23 09:36:09,137 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:09,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:09,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1330592792, now seen corresponding path program 1 times [2020-12-23 09:36:09,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:09,138 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557054169] [2020-12-23 09:36:09,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:09,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:09,209 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2020-12-23 09:36:09,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557054169] [2020-12-23 09:36:09,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:09,210 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:36:09,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944895375] [2020-12-23 09:36:09,210 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:36:09,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:09,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:36:09,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:36:09,211 INFO L87 Difference]: Start difference. First operand 1803 states and 2119 transitions. Second operand 3 states. [2020-12-23 09:36:09,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:09,454 INFO L93 Difference]: Finished difference Result 1817 states and 2136 transitions. [2020-12-23 09:36:09,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:36:09,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2020-12-23 09:36:09,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:09,457 INFO L225 Difference]: With dead ends: 1817 [2020-12-23 09:36:09,457 INFO L226 Difference]: Without dead ends: 1815 [2020-12-23 09:36:09,458 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 [2020-12-23 09:36:09,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2020-12-23 09:36:09,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 1807. [2020-12-23 09:36:09,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1807 states. [2020-12-23 09:36:09,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1807 states to 1807 states and 2123 transitions. [2020-12-23 09:36:09,663 INFO L78 Accepts]: Start accepts. Automaton has 1807 states and 2123 transitions. Word has length 185 [2020-12-23 09:36:09,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:09,664 INFO L481 AbstractCegarLoop]: Abstraction has 1807 states and 2123 transitions. [2020-12-23 09:36:09,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:36:09,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1807 states and 2123 transitions. [2020-12-23 09:36:09,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-12-23 09:36:09,665 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:09,666 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] [2020-12-23 09:36:09,666 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-12-23 09:36:09,666 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:09,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:09,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1330591190, now seen corresponding path program 1 times [2020-12-23 09:36:09,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:09,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674762510] [2020-12-23 09:36:09,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:09,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:10,019 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 09:36:10,019 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674762510] [2020-12-23 09:36:10,022 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401576866] [2020-12-23 09:36:10,022 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 [2020-12-23 09:36:10,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:10,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 20 conjunts are in the unsatisfiable core [2020-12-23 09:36:10,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:36:10,674 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 81 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 09:36:10,674 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:36:10,674 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2020-12-23 09:36:10,675 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268171482] [2020-12-23 09:36:10,676 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-12-23 09:36:10,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:10,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-12-23 09:36:10,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2020-12-23 09:36:10,677 INFO L87 Difference]: Start difference. First operand 1807 states and 2123 transitions. Second operand 19 states. [2020-12-23 09:36:12,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:12,054 INFO L93 Difference]: Finished difference Result 5673 states and 6674 transitions. [2020-12-23 09:36:12,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-12-23 09:36:12,055 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 185 [2020-12-23 09:36:12,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:12,063 INFO L225 Difference]: With dead ends: 5673 [2020-12-23 09:36:12,063 INFO L226 Difference]: Without dead ends: 4128 [2020-12-23 09:36:12,066 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=223, Invalid=1417, Unknown=0, NotChecked=0, Total=1640 [2020-12-23 09:36:12,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4128 states. [2020-12-23 09:36:12,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4128 to 2487. [2020-12-23 09:36:12,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2487 states. [2020-12-23 09:36:12,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2487 states to 2487 states and 2916 transitions. [2020-12-23 09:36:12,356 INFO L78 Accepts]: Start accepts. Automaton has 2487 states and 2916 transitions. Word has length 185 [2020-12-23 09:36:12,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:12,356 INFO L481 AbstractCegarLoop]: Abstraction has 2487 states and 2916 transitions. [2020-12-23 09:36:12,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-12-23 09:36:12,356 INFO L276 IsEmpty]: Start isEmpty. Operand 2487 states and 2916 transitions. [2020-12-23 09:36:12,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2020-12-23 09:36:12,359 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:12,359 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, 1] [2020-12-23 09:36:12,573 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2020-12-23 09:36:12,574 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:12,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:12,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1701344696, now seen corresponding path program 1 times [2020-12-23 09:36:12,575 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:12,575 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73212409] [2020-12-23 09:36:12,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 09:36:12,601 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 09:36:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 09:36:12,622 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 09:36:12,699 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-23 09:36:12,700 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-23 09:36:12,700 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-12-23 09:36:12,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 09:36:12 BoogieIcfgContainer [2020-12-23 09:36:12,970 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-23 09:36:12,971 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-23 09:36:12,971 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-23 09:36:12,971 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-23 09:36:12,972 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:35:51" (3/4) ... [2020-12-23 09:36:12,976 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-23 09:36:13,198 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/systemc/toy1.cil.c-witness.graphml [2020-12-23 09:36:13,198 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-23 09:36:13,200 INFO L168 Benchmark]: Toolchain (without parser) took 23160.00 ms. Allocated memory was 151.0 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 125.9 MB in the beginning and 700.4 MB in the end (delta: -574.6 MB). Peak memory consumption was 843.4 MB. Max. memory is 8.0 GB. [2020-12-23 09:36:13,200 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 151.0 MB. Free memory is still 124.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 09:36:13,201 INFO L168 Benchmark]: CACSL2BoogieTranslator took 558.90 ms. Allocated memory is still 151.0 MB. Free memory was 125.6 MB in the beginning and 111.0 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2020-12-23 09:36:13,201 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.76 ms. Allocated memory is still 151.0 MB. Free memory was 111.0 MB in the beginning and 108.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-23 09:36:13,201 INFO L168 Benchmark]: Boogie Preprocessor took 49.61 ms. Allocated memory is still 151.0 MB. Free memory was 108.7 MB in the beginning and 106.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-23 09:36:13,201 INFO L168 Benchmark]: RCFGBuilder took 1147.49 ms. Allocated memory is still 151.0 MB. Free memory was 106.6 MB in the beginning and 97.0 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.2 MB. Max. memory is 8.0 GB. [2020-12-23 09:36:13,202 INFO L168 Benchmark]: TraceAbstraction took 21114.83 ms. Allocated memory was 151.0 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 96.5 MB in the beginning and 737.7 MB in the end (delta: -641.2 MB). Peak memory consumption was 777.6 MB. Max. memory is 8.0 GB. [2020-12-23 09:36:13,202 INFO L168 Benchmark]: Witness Printer took 226.96 ms. Allocated memory is still 1.6 GB. Free memory was 737.7 MB in the beginning and 700.4 MB in the end (delta: 37.2 MB). Peak memory consumption was 36.7 MB. Max. memory is 8.0 GB. [2020-12-23 09:36:13,204 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 151.0 MB. Free memory is still 124.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 558.90 ms. Allocated memory is still 151.0 MB. Free memory was 125.6 MB in the beginning and 111.0 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 51.76 ms. Allocated memory is still 151.0 MB. Free memory was 111.0 MB in the beginning and 108.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 49.61 ms. Allocated memory is still 151.0 MB. Free memory was 108.7 MB in the beginning and 106.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1147.49 ms. Allocated memory is still 151.0 MB. Free memory was 106.6 MB in the beginning and 97.0 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 21114.83 ms. Allocated memory was 151.0 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 96.5 MB in the beginning and 737.7 MB in the end (delta: -641.2 MB). Peak memory consumption was 777.6 MB. Max. memory is 8.0 GB. * Witness Printer took 226.96 ms. Allocated memory is still 1.6 GB. Free memory was 737.7 MB in the beginning and 700.4 MB in the end (delta: 37.2 MB). Peak memory consumption was 36.7 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L20] int c ; [L21] int c_t ; [L22] int c_req_up ; [L23] int p_in ; [L24] int p_out ; [L25] int wl_st ; [L26] int c1_st ; [L27] int c2_st ; [L28] int wb_st ; [L29] int r_st ; [L30] int wl_i ; [L31] int c1_i ; [L32] int c2_i ; [L33] int wb_i ; [L34] int r_i ; [L35] int wl_pc ; [L36] int c1_pc ; [L37] int c2_pc ; [L38] int wb_pc ; [L39] int e_e ; [L40] int e_f ; [L41] int e_g ; [L42] int e_c ; [L43] int e_p_in ; [L44] int e_wl ; [L50] int d ; [L51] int data ; [L52] int processed ; [L53] static int t_b ; VAL [c=0, c1_i=0, c1_pc=0, c1_st=0, c2_i=0, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=0, e_e=0, e_f=0, e_g=0, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=0, wb_pc=0, wb_st=0, wl_i=0, wl_pc=0, wl_st=0] [L693] int __retres1 ; [L697] e_wl = 2 [L698] e_c = e_wl [L699] e_g = e_c [L700] e_f = e_g [L701] e_e = e_f [L702] wl_pc = 0 [L703] c1_pc = 0 [L704] c2_pc = 0 [L705] wb_pc = 0 [L706] wb_i = 1 [L707] c2_i = wb_i [L708] c1_i = c2_i [L709] wl_i = c1_i [L710] r_i = 0 [L711] c_req_up = 0 [L712] d = 0 [L713] c = 0 [L404] int kernel_st ; [L407] kernel_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L408] COND FALSE !((int )c_req_up == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L419] COND TRUE (int )wl_i == 1 [L420] wl_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L424] COND TRUE (int )c1_i == 1 [L425] c1_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L429] COND TRUE (int )c2_i == 1 [L430] c2_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L434] COND TRUE (int )wb_i == 1 [L435] wb_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L439] COND FALSE !((int )r_i == 1) [L442] r_st = 2 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L444] COND FALSE !((int )e_f == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L449] COND FALSE !((int )e_g == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L454] COND FALSE !((int )e_e == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L459] COND FALSE !((int )e_c == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L464] COND FALSE !((int )e_wl == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L469] COND FALSE !((int )wl_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L477] COND FALSE !((int )wl_pc == 2) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L487] COND FALSE !((int )c1_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L496] COND FALSE !((int )c2_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L505] COND FALSE !((int )wb_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L514] COND FALSE !((int )e_c == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L519] COND FALSE !((int )e_e == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L524] COND FALSE !((int )e_f == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L529] COND FALSE !((int )e_g == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L534] COND FALSE !((int )e_c == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L539] COND FALSE !((int )e_wl == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L545] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L548] kernel_st = 1 [L290] int tmp ; [L291] int tmp___0 ; [L292] int tmp___1 ; [L293] int tmp___2 ; [L294] int tmp___3 ; VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L298] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L300] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L321] COND TRUE (int )wl_st == 0 [L323] tmp = __VERIFIER_nondet_int() [L325] COND TRUE \read(tmp) [L327] wl_st = 1 [L55] int t ; VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=1] [L58] COND TRUE (int )wl_pc == 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=1] [L72] wl_st = 2 [L73] wl_pc = 1 [L74] e_wl = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L336] COND TRUE (int )c1_st == 0 [L338] tmp___0 = __VERIFIER_nondet_int() [L340] COND TRUE \read(tmp___0) [L342] c1_st = 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=1, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L141] COND TRUE (int )c1_pc == 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=1, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L152] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=1, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L154] c1_st = 2 [L155] c1_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L351] COND TRUE (int )c2_st == 0 [L353] tmp___1 = __VERIFIER_nondet_int() [L355] COND TRUE \read(tmp___1) [L357] c2_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=0, c2_st=1, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L186] COND TRUE (int )c2_pc == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=0, c2_st=1, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L197] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=0, c2_st=1, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L199] c2_st = 2 [L200] c2_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L366] COND TRUE (int )wb_st == 0 [L368] tmp___2 = __VERIFIER_nondet_int() [L370] COND TRUE \read(tmp___2) [L372] wb_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=1, wl_i=1, wl_pc=1, wl_st=2] [L231] COND TRUE (int )wb_pc == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=1, wl_i=1, wl_pc=1, wl_st=2] [L242] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=1, wl_i=1, wl_pc=1, wl_st=2] [L244] wb_st = 2 [L245] wb_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L381] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L298] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L300] COND FALSE !((int )wl_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L303] COND FALSE !((int )c1_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L306] COND FALSE !((int )c2_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L309] COND FALSE !((int )wb_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L312] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L551] kernel_st = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L552] COND FALSE !((int )c_req_up == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L563] kernel_st = 3 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L564] COND FALSE !((int )e_f == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L569] COND FALSE !((int )e_g == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L574] COND FALSE !((int )e_e == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L579] COND FALSE !((int )e_c == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L584] COND TRUE (int )e_wl == 0 [L585] e_wl = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L589] COND TRUE (int )wl_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L590] COND TRUE (int )e_wl == 1 [L591] wl_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L607] COND TRUE (int )c1_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L608] COND FALSE !((int )e_f == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L616] COND TRUE (int )c2_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L617] COND FALSE !((int )e_f == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L625] COND TRUE (int )wb_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L626] COND FALSE !((int )e_g == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L634] COND FALSE !((int )e_c == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L639] COND FALSE !((int )e_e == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L644] COND FALSE !((int )e_f == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L649] COND FALSE !((int )e_g == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L654] COND FALSE !((int )e_c == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L659] COND TRUE (int )e_wl == 1 [L660] e_wl = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L664] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L545] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L548] kernel_st = 1 [L290] int tmp ; [L291] int tmp___0 ; [L292] int tmp___1 ; [L293] int tmp___2 ; [L294] int tmp___3 ; VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L298] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L300] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L321] COND TRUE (int )wl_st == 0 [L323] tmp = __VERIFIER_nondet_int() [L325] COND TRUE \read(tmp) [L327] wl_st = 1 [L55] int t ; VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L58] COND FALSE !((int )wl_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L61] COND FALSE !((int )wl_pc == 2) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L64] COND TRUE (int )wl_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L79] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L81] t = d [L82] data = d [L83] processed = 0 [L84] e_f = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L85] COND TRUE (int )c1_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L86] COND TRUE (int )e_f == 1 [L87] c1_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L94] COND TRUE (int )c2_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L95] COND TRUE (int )e_f == 1 [L96] c2_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L103] e_f = 2 [L104] wl_st = 2 [L105] wl_pc = 2 [L106] t_b = t VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L336] COND TRUE (int )c1_st == 0 [L338] tmp___0 = __VERIFIER_nondet_int() [L340] COND TRUE \read(tmp___0) [L342] c1_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L141] COND FALSE !((int )c1_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L144] COND TRUE (int )c1_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L159] COND TRUE ! processed [L160] data += 1 [L161] e_g = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L162] COND TRUE (int )wb_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L163] COND TRUE (int )e_g == 1 [L164] wb_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L171] e_g = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L152] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L154] c1_st = 2 [L155] c1_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L351] COND TRUE (int )c2_st == 0 [L353] tmp___1 = __VERIFIER_nondet_int() [L355] COND TRUE \read(tmp___1) [L357] c2_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L186] COND FALSE !((int )c2_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L189] COND TRUE (int )c2_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L204] COND TRUE ! processed [L205] data += 1 [L206] e_g = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L207] COND TRUE (int )wb_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L208] COND TRUE (int )e_g == 1 [L209] wb_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L216] e_g = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L197] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L199] c2_st = 2 [L200] c2_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L366] COND TRUE (int )wb_st == 0 [L368] tmp___2 = __VERIFIER_nondet_int() [L370] COND TRUE \read(tmp___2) [L372] wb_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L231] COND FALSE !((int )wb_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L234] COND TRUE (int )wb_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L249] c_t = data [L250] c_req_up = 1 [L251] processed = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L242] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L244] wb_st = 2 [L245] wb_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L381] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L298] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L300] COND FALSE !((int )wl_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L303] COND FALSE !((int )c1_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L306] COND FALSE !((int )c2_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L309] COND FALSE !((int )wb_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L312] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L551] kernel_st = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L552] COND TRUE (int )c_req_up == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L553] COND TRUE c != c_t [L554] c = c_t [L555] e_c = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L559] c_req_up = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L563] kernel_st = 3 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L564] COND FALSE !((int )e_f == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L569] COND FALSE !((int )e_g == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L574] COND FALSE !((int )e_e == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L579] COND TRUE (int )e_c == 0 [L580] e_c = 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L584] COND FALSE !((int )e_wl == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L589] COND FALSE !((int )wl_pc == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L597] COND TRUE (int )wl_pc == 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L598] COND FALSE !((int )e_e == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L607] COND TRUE (int )c1_pc == 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L608] COND FALSE !((int )e_f == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L616] COND TRUE (int )c2_pc == 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L617] COND FALSE !((int )e_f == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L625] COND TRUE (int )wb_pc == 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L626] COND FALSE !((int )e_g == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L634] COND TRUE (int )e_c == 1 [L635] r_st = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L639] COND FALSE !((int )e_e == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L644] COND FALSE !((int )e_f == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L649] COND FALSE !((int )e_g == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L654] COND TRUE (int )e_c == 1 [L655] e_c = 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L659] COND FALSE !((int )e_wl == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L664] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L667] COND FALSE !((int )c1_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L670] COND FALSE !((int )c2_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L673] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L676] COND TRUE (int )r_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L545] COND TRUE 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L548] kernel_st = 1 [L290] int tmp ; [L291] int tmp___0 ; [L292] int tmp___1 ; [L293] int tmp___2 ; [L294] int tmp___3 ; VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L298] COND TRUE 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L300] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L303] COND FALSE !((int )c1_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L306] COND FALSE !((int )c2_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L309] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L312] COND TRUE (int )r_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L321] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L336] COND FALSE !((int )c1_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L351] COND FALSE !((int )c2_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L366] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L381] COND TRUE (int )r_st == 0 [L383] tmp___3 = __VERIFIER_nondet_int() [L385] COND TRUE \read(tmp___3) [L387] r_st = 1 [L263] d = c [L264] e_e = 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L265] COND FALSE !((int )wl_pc == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L273] COND TRUE (int )wl_pc == 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L274] COND TRUE (int )e_e == 1 [L275] wl_st = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L283] e_e = 2 [L284] r_st = 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L298] COND TRUE 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L300] COND TRUE (int )wl_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L321] COND TRUE (int )wl_st == 0 [L323] tmp = __VERIFIER_nondet_int() [L325] COND TRUE \read(tmp) [L327] wl_st = 1 [L55] int t ; VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L58] COND FALSE !((int )wl_pc == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L61] COND TRUE (int )wl_pc == 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L110] t = t_b VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L111] COND FALSE !(d == t + 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L114] COND TRUE d == t + 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L122] COND FALSE !(d == t + 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L15] reach_error() VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 129 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 20.7s, OverallIterations: 35, TraceHistogramMax: 6, AutomataDifference: 10.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7212 SDtfs, 9836 SDslu, 8474 SDs, 0 SdLazy, 1107 SolverSat, 265 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 371 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5348occurred 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.0s AutomataMinimizationTime, 34 MinimizatonAttempts, 6041 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 3190 NumberOfCodeBlocks, 3190 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2969 ConstructedInterpolants, 0 QuantifiedInterpolants, 737591 SizeOfPredicates, 6 NumberOfNonLiveVariables, 528 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 35 InterpolantComputations, 33 PerfectInterpolantSequences, 914/1025 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 incorrect! Received shutdown request...