/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/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--watchdog--pc87413_wdt.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 15:19:04,372 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 15:19:04,377 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 15:19:04,438 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 15:19:04,438 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 15:19:04,443 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 15:19:04,447 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 15:19:04,453 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 15:19:04,458 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 15:19:04,466 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 15:19:04,468 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 15:19:04,474 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 15:19:04,475 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 15:19:04,476 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 15:19:04,478 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 15:19:04,479 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 15:19:04,480 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 15:19:04,481 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 15:19:04,484 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 15:19:04,501 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 15:19:04,506 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 15:19:04,510 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 15:19:04,512 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 15:19:04,515 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 15:19:04,529 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 15:19:04,530 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 15:19:04,532 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 15:19:04,533 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 15:19:04,534 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 15:19:04,536 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 15:19:04,537 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 15:19:04,538 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 15:19:04,539 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 15:19:04,540 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 15:19:04,542 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 15:19:04,542 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 15:19:04,544 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 15:19:04,544 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 15:19:04,544 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 15:19:04,545 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 15:19:04,546 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 15:19:04,548 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 15:19:04,602 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 15:19:04,603 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 15:19:04,609 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 15:19:04,609 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 15:19:04,610 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 15:19:04,610 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 15:19:04,610 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 15:19:04,610 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 15:19:04,610 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 15:19:04,611 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 15:19:04,612 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 15:19:04,612 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 15:19:04,613 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 15:19:04,613 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 15:19:04,613 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 15:19:04,613 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 15:19:04,614 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 15:19:04,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 15:19:04,614 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 15:19:04,614 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 15:19:04,614 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 15:19:04,615 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 15:19:04,615 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 15:19:04,615 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 15:19:04,615 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 15:19:04,615 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 15:19:05,089 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 15:19:05,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 15:19:05,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 15:19:05,128 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 15:19:05,129 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 15:19:05,131 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--watchdog--pc87413_wdt.ko-entry_point.cil.out.i [2020-12-23 15:19:05,228 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/af4bcd96a/53efae19818f49d7a196b8e5e46b17b4/FLAG2a06ef3a5 [2020-12-23 15:19:06,230 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 15:19:06,231 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--watchdog--pc87413_wdt.ko-entry_point.cil.out.i [2020-12-23 15:19:06,272 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/af4bcd96a/53efae19818f49d7a196b8e5e46b17b4/FLAG2a06ef3a5 [2020-12-23 15:19:06,783 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/af4bcd96a/53efae19818f49d7a196b8e5e46b17b4 [2020-12-23 15:19:06,786 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 15:19:06,789 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 15:19:06,791 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 15:19:06,791 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 15:19:06,796 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 15:19:06,797 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 03:19:06" (1/1) ... [2020-12-23 15:19:06,798 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c22d171 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:19:06, skipping insertion in model container [2020-12-23 15:19:06,798 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 03:19:06" (1/1) ... [2020-12-23 15:19:06,808 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 15:19:06,892 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~p~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~p~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~p~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~sz~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,] left hand side expression in assignment: lhs: VariableLHS[~n,] left hand side expression in assignment: lhs: VariableLHS[~cr_data~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] left hand side expression in assignment: lhs: VariableLHS[~cr_data~0,] left hand side expression in assignment: lhs: VariableLHS[~cr_data~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~cr_data~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] left hand side expression in assignment: lhs: VariableLHS[~cr_data~1,] left hand side expression in assignment: lhs: VariableLHS[~cr_data~1,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~addr_h~0,] left hand side expression in assignment: lhs: VariableLHS[~addr_h~0,] left hand side expression in assignment: lhs: VariableLHS[~addr_l~0,] left hand side expression in assignment: lhs: VariableLHS[~swc_base_addr~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~tmp~12,] left hand side expression in assignment: lhs: VariableLHS[~tmp~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp~14,] left hand side expression in assignment: lhs: VariableLHS[~tmp~15,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: lhs: VariableLHS[~expect_close~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~expect_close~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~c~1,] left hand side expression in assignment: lhs: VariableLHS[~expect_close~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~ident~0,],options] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~ident~0,],firmware_version] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~ident~0,],identity],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~ident~0,],identity],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~ident~0,],identity],[IntegerLiteral[2]]] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~ident~0,],identity],[IntegerLiteral[3]]] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~ident~0,],identity],[IntegerLiteral[4]]] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~ident~0,],identity],[IntegerLiteral[5]]] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~ident~0,],identity],[IntegerLiteral[6]]] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~ident~0,],identity],[IntegerLiteral[7]]] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~ident~0,],identity],[IntegerLiteral[8]]] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~ident~0,],identity],[IntegerLiteral[9]]] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~ident~0,],identity],[IntegerLiteral[10]]] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~ident~0,],identity],[IntegerLiteral[11]]] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~ident~0,],identity],[IntegerLiteral[12]]] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~ident~0,],identity],[IntegerLiteral[13]]] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~ident~0,],identity],[IntegerLiteral[14]]] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~ident~0,],identity],[IntegerLiteral[15]]] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~ident~0,],identity],[IntegerLiteral[16]]] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~ident~0,],identity],[IntegerLiteral[17]]] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~ident~0,],identity],[IntegerLiteral[18]]] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~ident~0,],identity],[IntegerLiteral[19]]] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~ident~0,],identity],[IntegerLiteral[20]]] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~ident~0,],identity],[IntegerLiteral[21]]] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~ident~0,],identity],[IntegerLiteral[22]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~16,] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~ident~0,],identity],[BinaryExpression[ARITHMOD,IdentifierExpression[~tmp~16,],IntegerLiteral[4294967296]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~16,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~uarg~0,],i] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] left hand side expression in assignment: lhs: VariableLHS[~__pu_val~0,] left hand side expression in assignment: lhs: VariableLHS[~__pu_val___0~0,] left hand side expression in assignment: lhs: VariableLHS[~retval~0,] left hand side expression in assignment: lhs: VariableLHS[~options~0,] left hand side expression in assignment: lhs: VariableLHS[~retval~0,] left hand side expression in assignment: lhs: VariableLHS[~retval~0,] left hand side expression in assignment: lhs: VariableLHS[~new_timeout~0,] left hand side expression in assignment: lhs: VariableLHS[~new_timeout~0,] left hand side expression in assignment: lhs: VariableLHS[~timeout~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~new_timeout~0,] left hand side expression in assignment: lhs: VariableLHS[~__pu_val___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~5,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~18,] left hand side expression in assignment: lhs: VariableLHS[~pc87413_fops_group1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~6,] left hand side expression in assignment: lhs: VariableLHS[~pc87413_fops_group2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~19,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~7,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg9~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~20,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~21,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~1,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~22,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~2,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] [2020-12-23 15:19:07,830 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/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--watchdog--pc87413_wdt.ko-entry_point.cil.out.i[115866,115879] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] left hand side expression in assignment: lhs: VariableLHS[~tmp~23,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] left hand side expression in assignment: lhs: VariableLHS[~ldv_module_refcounter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~module_get_succeeded~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_module_refcounter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_module_refcounter~0,GLOBAL] [2020-12-23 15:19:07,887 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 15:19:07,912 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~p~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~p~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~p~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~sz~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,] left hand side expression in assignment: lhs: VariableLHS[~n,] left hand side expression in assignment: lhs: VariableLHS[~cr_data~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] left hand side expression in assignment: lhs: VariableLHS[~cr_data~0,] left hand side expression in assignment: lhs: VariableLHS[~cr_data~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~cr_data~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] left hand side expression in assignment: lhs: VariableLHS[~cr_data~1,] left hand side expression in assignment: lhs: VariableLHS[~cr_data~1,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~addr_h~0,] left hand side expression in assignment: lhs: VariableLHS[~addr_h~0,] left hand side expression in assignment: lhs: VariableLHS[~addr_l~0,] left hand side expression in assignment: lhs: VariableLHS[~swc_base_addr~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~tmp~12,] left hand side expression in assignment: lhs: VariableLHS[~tmp~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp~14,] left hand side expression in assignment: lhs: VariableLHS[~tmp~15,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: lhs: VariableLHS[~expect_close~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~expect_close~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~c~1,] left hand side expression in assignment: lhs: VariableLHS[~expect_close~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[9],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[10],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[13],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[14],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[15],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[17],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[18],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[19],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[21],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[22],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[23],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[25],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[26],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[27],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[29],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[30],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~16,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]],BinaryExpression[ARITHMOD,IdentifierExpression[~tmp~16,],IntegerLiteral[4294967296]]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~16,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#uarg~0,],base],StructAccessExpression[IdentifierExpression[~#uarg~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] left hand side expression in assignment: lhs: VariableLHS[~__pu_val~0,] left hand side expression in assignment: lhs: VariableLHS[~__pu_val___0~0,] left hand side expression in assignment: lhs: VariableLHS[~retval~0,] left hand side expression in assignment: lhs: VariableLHS[~options~0,] left hand side expression in assignment: lhs: VariableLHS[~retval~0,] left hand side expression in assignment: lhs: VariableLHS[~retval~0,] left hand side expression in assignment: lhs: VariableLHS[~new_timeout~0,] left hand side expression in assignment: lhs: VariableLHS[~new_timeout~0,] left hand side expression in assignment: lhs: VariableLHS[~timeout~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~new_timeout~0,] left hand side expression in assignment: lhs: VariableLHS[~__pu_val___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~5,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~18,] left hand side expression in assignment: lhs: VariableLHS[~pc87413_fops_group1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~6,] left hand side expression in assignment: lhs: VariableLHS[~pc87413_fops_group2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~19,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~7,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg9~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~20,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~21,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~1,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~22,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~2,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] [2020-12-23 15:19:08,186 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/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--watchdog--pc87413_wdt.ko-entry_point.cil.out.i[115866,115879] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] left hand side expression in assignment: lhs: VariableLHS[~tmp~23,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] left hand side expression in assignment: lhs: VariableLHS[~ldv_module_refcounter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~module_get_succeeded~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_module_refcounter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_module_refcounter~0,GLOBAL] [2020-12-23 15:19:08,201 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 15:19:08,318 INFO L208 MainTranslator]: Completed translation [2020-12-23 15:19:08,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:19:08 WrapperNode [2020-12-23 15:19:08,319 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 15:19:08,321 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 15:19:08,322 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 15:19:08,322 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 15:19:08,332 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:19:08" (1/1) ... [2020-12-23 15:19:08,403 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:19:08" (1/1) ... [2020-12-23 15:19:08,589 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 15:19:08,590 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 15:19:08,590 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 15:19:08,591 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 15:19:08,601 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:19:08" (1/1) ... [2020-12-23 15:19:08,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:19:08" (1/1) ... [2020-12-23 15:19:08,625 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:19:08" (1/1) ... [2020-12-23 15:19:08,626 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:19:08" (1/1) ... [2020-12-23 15:19:08,715 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:19:08" (1/1) ... [2020-12-23 15:19:08,755 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:19:08" (1/1) ... [2020-12-23 15:19:08,783 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:19:08" (1/1) ... [2020-12-23 15:19:08,811 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 15:19:08,813 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 15:19:08,813 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 15:19:08,813 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 15:19:08,814 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:19:08" (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 15:19:08,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 15:19:08,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 15:19:08,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-23 15:19:08,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 15:19:08,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 15:19:08,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 15:19:08,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 15:19:08,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-12-23 15:19:08,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 15:19:08,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 15:19:08,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 15:19:14,686 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 15:19:14,686 INFO L299 CfgBuilder]: Removed 1175 assume(true) statements. [2020-12-23 15:19:14,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 03:19:14 BoogieIcfgContainer [2020-12-23 15:19:14,689 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 15:19:14,691 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 15:19:14,691 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 15:19:14,695 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 15:19:14,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 03:19:06" (1/3) ... [2020-12-23 15:19:14,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@669e8662 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 03:19:14, skipping insertion in model container [2020-12-23 15:19:14,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:19:08" (2/3) ... [2020-12-23 15:19:14,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@669e8662 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 03:19:14, skipping insertion in model container [2020-12-23 15:19:14,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 03:19:14" (3/3) ... [2020-12-23 15:19:14,699 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--watchdog--pc87413_wdt.ko-entry_point.cil.out.i [2020-12-23 15:19:14,707 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 15:19:14,713 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 15:19:14,735 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 15:19:14,770 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 15:19:14,770 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 15:19:14,770 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 15:19:14,770 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 15:19:14,771 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 15:19:14,771 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 15:19:14,771 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 15:19:14,771 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 15:19:14,799 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states. [2020-12-23 15:19:14,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-12-23 15:19:14,811 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:19:14,812 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:19:14,813 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:19:14,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:19:14,820 INFO L82 PathProgramCache]: Analyzing trace with hash -292239849, now seen corresponding path program 1 times [2020-12-23 15:19:14,831 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:19:14,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255926388] [2020-12-23 15:19:14,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:19:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:19:15,300 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 15:19:15,301 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255926388] [2020-12-23 15:19:15,304 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:19:15,304 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 15:19:15,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998776029] [2020-12-23 15:19:15,311 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-23 15:19:15,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:19:15,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-23 15:19:15,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 15:19:15,336 INFO L87 Difference]: Start difference. First operand 541 states. Second operand 2 states. [2020-12-23 15:19:15,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:19:15,440 INFO L93 Difference]: Finished difference Result 1078 states and 1291 transitions. [2020-12-23 15:19:15,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-23 15:19:15,442 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 52 [2020-12-23 15:19:15,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:19:15,464 INFO L225 Difference]: With dead ends: 1078 [2020-12-23 15:19:15,464 INFO L226 Difference]: Without dead ends: 533 [2020-12-23 15:19:15,471 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 15:19:15,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-12-23 15:19:15,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 533. [2020-12-23 15:19:15,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2020-12-23 15:19:15,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 621 transitions. [2020-12-23 15:19:15,592 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 621 transitions. Word has length 52 [2020-12-23 15:19:15,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:19:15,593 INFO L481 AbstractCegarLoop]: Abstraction has 533 states and 621 transitions. [2020-12-23 15:19:15,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-23 15:19:15,593 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 621 transitions. [2020-12-23 15:19:15,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-12-23 15:19:15,596 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:19:15,597 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:19:15,597 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 15:19:15,597 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:19:15,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:19:15,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1668906015, now seen corresponding path program 1 times [2020-12-23 15:19:15,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:19:15,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596761234] [2020-12-23 15:19:15,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:19:15,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:19:15,896 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 15:19:15,897 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596761234] [2020-12-23 15:19:15,898 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:19:15,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:19:15,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910594912] [2020-12-23 15:19:15,901 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:19:15,903 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:19:15,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:19:15,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:19:15,905 INFO L87 Difference]: Start difference. First operand 533 states and 621 transitions. Second operand 3 states. [2020-12-23 15:19:16,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:19:16,128 INFO L93 Difference]: Finished difference Result 1396 states and 1637 transitions. [2020-12-23 15:19:16,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:19:16,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-12-23 15:19:16,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:19:16,141 INFO L225 Difference]: With dead ends: 1396 [2020-12-23 15:19:16,141 INFO L226 Difference]: Without dead ends: 900 [2020-12-23 15:19:16,148 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 15:19:16,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2020-12-23 15:19:16,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 900. [2020-12-23 15:19:16,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2020-12-23 15:19:16,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1056 transitions. [2020-12-23 15:19:16,217 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1056 transitions. Word has length 52 [2020-12-23 15:19:16,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:19:16,218 INFO L481 AbstractCegarLoop]: Abstraction has 900 states and 1056 transitions. [2020-12-23 15:19:16,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:19:16,219 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1056 transitions. [2020-12-23 15:19:16,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-12-23 15:19:16,230 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:19:16,231 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:19:16,231 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 15:19:16,231 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:19:16,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:19:16,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1921366172, now seen corresponding path program 1 times [2020-12-23 15:19:16,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:19:16,236 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778312388] [2020-12-23 15:19:16,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:19:16,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:19:16,442 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 15:19:16,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778312388] [2020-12-23 15:19:16,443 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:19:16,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:19:16,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117665340] [2020-12-23 15:19:16,444 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:19:16,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:19:16,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:19:16,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:19:16,445 INFO L87 Difference]: Start difference. First operand 900 states and 1056 transitions. Second operand 3 states. [2020-12-23 15:19:16,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:19:16,512 INFO L93 Difference]: Finished difference Result 906 states and 1060 transitions. [2020-12-23 15:19:16,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:19:16,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-12-23 15:19:16,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:19:16,518 INFO L225 Difference]: With dead ends: 906 [2020-12-23 15:19:16,519 INFO L226 Difference]: Without dead ends: 903 [2020-12-23 15:19:16,520 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 15:19:16,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2020-12-23 15:19:16,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 900. [2020-12-23 15:19:16,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2020-12-23 15:19:16,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1055 transitions. [2020-12-23 15:19:16,559 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1055 transitions. Word has length 53 [2020-12-23 15:19:16,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:19:16,560 INFO L481 AbstractCegarLoop]: Abstraction has 900 states and 1055 transitions. [2020-12-23 15:19:16,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:19:16,560 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1055 transitions. [2020-12-23 15:19:16,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-12-23 15:19:16,561 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:19:16,562 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:19:16,562 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 15:19:16,562 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:19:16,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:19:16,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1921425754, now seen corresponding path program 1 times [2020-12-23 15:19:16,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:19:16,564 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371229922] [2020-12-23 15:19:16,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:19:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:19:16,717 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 15:19:16,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371229922] [2020-12-23 15:19:16,717 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:19:16,718 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 15:19:16,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495753988] [2020-12-23 15:19:16,718 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:19:16,719 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:19:16,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:19:16,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:19:16,722 INFO L87 Difference]: Start difference. First operand 900 states and 1055 transitions. Second operand 3 states. [2020-12-23 15:19:16,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:19:16,863 INFO L93 Difference]: Finished difference Result 1763 states and 2067 transitions. [2020-12-23 15:19:16,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:19:16,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-12-23 15:19:16,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:19:16,874 INFO L225 Difference]: With dead ends: 1763 [2020-12-23 15:19:16,874 INFO L226 Difference]: Without dead ends: 1736 [2020-12-23 15:19:16,875 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 15:19:16,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1736 states. [2020-12-23 15:19:16,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1736 to 1736. [2020-12-23 15:19:16,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1736 states. [2020-12-23 15:19:16,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1736 states and 2038 transitions. [2020-12-23 15:19:16,956 INFO L78 Accepts]: Start accepts. Automaton has 1736 states and 2038 transitions. Word has length 53 [2020-12-23 15:19:16,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:19:16,957 INFO L481 AbstractCegarLoop]: Abstraction has 1736 states and 2038 transitions. [2020-12-23 15:19:16,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:19:16,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1736 states and 2038 transitions. [2020-12-23 15:19:16,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-12-23 15:19:16,961 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:19:16,961 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 15:19:16,961 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 15:19:16,962 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:19:16,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:19:16,962 INFO L82 PathProgramCache]: Analyzing trace with hash 68796127, now seen corresponding path program 1 times [2020-12-23 15:19:16,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:19:16,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294535617] [2020-12-23 15:19:16,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:19:17,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:19:17,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 15:19:17,099 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294535617] [2020-12-23 15:19:17,099 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:19:17,099 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:19:17,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333251169] [2020-12-23 15:19:17,100 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:19:17,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:19:17,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:19:17,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:19:17,106 INFO L87 Difference]: Start difference. First operand 1736 states and 2038 transitions. Second operand 3 states. [2020-12-23 15:19:19,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:19:19,314 INFO L93 Difference]: Finished difference Result 3644 states and 4296 transitions. [2020-12-23 15:19:19,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:19:19,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2020-12-23 15:19:19,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:19:19,327 INFO L225 Difference]: With dead ends: 3644 [2020-12-23 15:19:19,327 INFO L226 Difference]: Without dead ends: 1945 [2020-12-23 15:19:19,330 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 15:19:19,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1945 states. [2020-12-23 15:19:19,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1945 to 1914. [2020-12-23 15:19:19,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1914 states. [2020-12-23 15:19:19,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2264 transitions. [2020-12-23 15:19:19,416 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2264 transitions. Word has length 100 [2020-12-23 15:19:19,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:19:19,417 INFO L481 AbstractCegarLoop]: Abstraction has 1914 states and 2264 transitions. [2020-12-23 15:19:19,417 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:19:19,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2264 transitions. [2020-12-23 15:19:19,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2020-12-23 15:19:19,421 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:19:19,422 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:19:19,422 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 15:19:19,422 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:19:19,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:19:19,423 INFO L82 PathProgramCache]: Analyzing trace with hash -305541512, now seen corresponding path program 1 times [2020-12-23 15:19:19,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:19:19,423 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907402889] [2020-12-23 15:19:19,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:19:19,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:19:19,745 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 15:19:19,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907402889] [2020-12-23 15:19:19,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646384040] [2020-12-23 15:19:19,747 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 15:19:20,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:19:20,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 1585 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 15:19:20,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:19:20,824 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 15:19:20,824 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:19:20,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2020-12-23 15:19:20,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111247176] [2020-12-23 15:19:20,826 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 15:19:20,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:19:20,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 15:19:20,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 15:19:20,827 INFO L87 Difference]: Start difference. First operand 1914 states and 2264 transitions. Second operand 4 states. [2020-12-23 15:19:21,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:19:21,442 INFO L93 Difference]: Finished difference Result 5647 states and 6683 transitions. [2020-12-23 15:19:21,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 15:19:21,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2020-12-23 15:19:21,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:19:21,476 INFO L225 Difference]: With dead ends: 5647 [2020-12-23 15:19:21,476 INFO L226 Difference]: Without dead ends: 5620 [2020-12-23 15:19:21,482 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 131 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 15:19:21,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5620 states. [2020-12-23 15:19:21,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5620 to 5418. [2020-12-23 15:19:21,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5418 states. [2020-12-23 15:19:21,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5418 states to 5418 states and 6450 transitions. [2020-12-23 15:19:21,762 INFO L78 Accepts]: Start accepts. Automaton has 5418 states and 6450 transitions. Word has length 131 [2020-12-23 15:19:21,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:19:21,763 INFO L481 AbstractCegarLoop]: Abstraction has 5418 states and 6450 transitions. [2020-12-23 15:19:21,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 15:19:21,763 INFO L276 IsEmpty]: Start isEmpty. Operand 5418 states and 6450 transitions. [2020-12-23 15:19:21,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2020-12-23 15:19:21,772 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:19:21,772 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:19:21,987 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-12-23 15:19:21,988 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:19:21,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:19:21,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1326609866, now seen corresponding path program 1 times [2020-12-23 15:19:21,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:19:21,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813775045] [2020-12-23 15:19:21,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:19:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:19:22,175 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 15:19:22,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813775045] [2020-12-23 15:19:22,176 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:19:22,176 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 15:19:22,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153777653] [2020-12-23 15:19:22,177 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 15:19:22,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:19:22,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 15:19:22,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 15:19:22,178 INFO L87 Difference]: Start difference. First operand 5418 states and 6450 transitions. Second operand 5 states. [2020-12-23 15:19:23,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:19:23,401 INFO L93 Difference]: Finished difference Result 26837 states and 31909 transitions. [2020-12-23 15:19:23,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 15:19:23,401 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 131 [2020-12-23 15:19:23,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:19:23,507 INFO L225 Difference]: With dead ends: 26837 [2020-12-23 15:19:23,507 INFO L226 Difference]: Without dead ends: 21456 [2020-12-23 15:19:23,524 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-23 15:19:23,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21456 states. [2020-12-23 15:19:24,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21456 to 5302. [2020-12-23 15:19:24,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5302 states. [2020-12-23 15:19:24,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5302 states to 5302 states and 6326 transitions. [2020-12-23 15:19:24,149 INFO L78 Accepts]: Start accepts. Automaton has 5302 states and 6326 transitions. Word has length 131 [2020-12-23 15:19:24,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:19:24,149 INFO L481 AbstractCegarLoop]: Abstraction has 5302 states and 6326 transitions. [2020-12-23 15:19:24,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 15:19:24,150 INFO L276 IsEmpty]: Start isEmpty. Operand 5302 states and 6326 transitions. [2020-12-23 15:19:24,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-12-23 15:19:24,161 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:19:24,161 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:19:24,161 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 15:19:24,161 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:19:24,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:19:24,162 INFO L82 PathProgramCache]: Analyzing trace with hash 843094561, now seen corresponding path program 1 times [2020-12-23 15:19:24,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:19:24,163 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067398700] [2020-12-23 15:19:24,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:19:24,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:19:24,381 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 15:19:24,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067398700] [2020-12-23 15:19:24,382 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:19:24,382 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:19:24,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301982166] [2020-12-23 15:19:24,383 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:19:24,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:19:24,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:19:24,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:19:24,384 INFO L87 Difference]: Start difference. First operand 5302 states and 6326 transitions. Second operand 3 states. [2020-12-23 15:19:25,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:19:25,048 INFO L93 Difference]: Finished difference Result 10567 states and 12609 transitions. [2020-12-23 15:19:25,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:19:25,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2020-12-23 15:19:25,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:19:25,075 INFO L225 Difference]: With dead ends: 10567 [2020-12-23 15:19:25,075 INFO L226 Difference]: Without dead ends: 5146 [2020-12-23 15:19:25,086 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 15:19:25,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5146 states. [2020-12-23 15:19:25,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5146 to 5107. [2020-12-23 15:19:25,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5107 states. [2020-12-23 15:19:25,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5107 states to 5107 states and 6053 transitions. [2020-12-23 15:19:25,505 INFO L78 Accepts]: Start accepts. Automaton has 5107 states and 6053 transitions. Word has length 132 [2020-12-23 15:19:25,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:19:25,506 INFO L481 AbstractCegarLoop]: Abstraction has 5107 states and 6053 transitions. [2020-12-23 15:19:25,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:19:25,506 INFO L276 IsEmpty]: Start isEmpty. Operand 5107 states and 6053 transitions. [2020-12-23 15:19:25,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-12-23 15:19:25,514 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:19:25,514 INFO L422 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:19:25,514 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 15:19:25,515 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:19:25,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:19:25,515 INFO L82 PathProgramCache]: Analyzing trace with hash -843085277, now seen corresponding path program 1 times [2020-12-23 15:19:25,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:19:25,516 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853967350] [2020-12-23 15:19:25,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:19:25,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:19:25,756 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 15:19:25,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853967350] [2020-12-23 15:19:25,757 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:19:25,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:19:25,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546972432] [2020-12-23 15:19:25,758 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:19:25,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:19:25,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:19:25,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:19:25,759 INFO L87 Difference]: Start difference. First operand 5107 states and 6053 transitions. Second operand 3 states. [2020-12-23 15:19:26,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:19:26,228 INFO L93 Difference]: Finished difference Result 7360 states and 8730 transitions. [2020-12-23 15:19:26,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:19:26,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2020-12-23 15:19:26,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:19:26,236 INFO L225 Difference]: With dead ends: 7360 [2020-12-23 15:19:26,236 INFO L226 Difference]: Without dead ends: 2280 [2020-12-23 15:19:26,245 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 15:19:26,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2280 states. [2020-12-23 15:19:26,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2280 to 2280. [2020-12-23 15:19:26,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2280 states. [2020-12-23 15:19:26,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 2707 transitions. [2020-12-23 15:19:26,434 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 2707 transitions. Word has length 132 [2020-12-23 15:19:26,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:19:26,434 INFO L481 AbstractCegarLoop]: Abstraction has 2280 states and 2707 transitions. [2020-12-23 15:19:26,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:19:26,435 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 2707 transitions. [2020-12-23 15:19:26,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2020-12-23 15:19:26,443 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:19:26,444 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:19:26,444 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 15:19:26,447 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:19:26,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:19:26,448 INFO L82 PathProgramCache]: Analyzing trace with hash -934164480, now seen corresponding path program 1 times [2020-12-23 15:19:26,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:19:26,449 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776681806] [2020-12-23 15:19:26,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:19:26,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:19:26,731 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-12-23 15:19:26,734 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776681806] [2020-12-23 15:19:26,734 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:19:26,735 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 15:19:26,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128725201] [2020-12-23 15:19:26,736 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:19:26,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:19:26,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:19:26,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:19:26,737 INFO L87 Difference]: Start difference. First operand 2280 states and 2707 transitions. Second operand 3 states. [2020-12-23 15:19:27,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:19:27,123 INFO L93 Difference]: Finished difference Result 6418 states and 7653 transitions. [2020-12-23 15:19:27,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:19:27,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2020-12-23 15:19:27,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:19:27,134 INFO L225 Difference]: With dead ends: 6418 [2020-12-23 15:19:27,135 INFO L226 Difference]: Without dead ends: 4313 [2020-12-23 15:19:27,141 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 15:19:27,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4313 states. [2020-12-23 15:19:27,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4313 to 4128. [2020-12-23 15:19:27,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4128 states. [2020-12-23 15:19:27,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4128 states to 4128 states and 4945 transitions. [2020-12-23 15:19:27,444 INFO L78 Accepts]: Start accepts. Automaton has 4128 states and 4945 transitions. Word has length 160 [2020-12-23 15:19:27,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:19:27,444 INFO L481 AbstractCegarLoop]: Abstraction has 4128 states and 4945 transitions. [2020-12-23 15:19:27,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:19:27,445 INFO L276 IsEmpty]: Start isEmpty. Operand 4128 states and 4945 transitions. [2020-12-23 15:19:27,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 15:19:27,454 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:19:27,454 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:19:27,455 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 15:19:27,455 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:19:27,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:19:27,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1093367299, now seen corresponding path program 1 times [2020-12-23 15:19:27,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:19:27,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357807898] [2020-12-23 15:19:27,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:19:27,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:19:27,754 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-12-23 15:19:27,759 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357807898] [2020-12-23 15:19:27,760 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:19:27,760 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 15:19:27,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550206222] [2020-12-23 15:19:27,761 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 15:19:27,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:19:27,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 15:19:27,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 15:19:27,768 INFO L87 Difference]: Start difference. First operand 4128 states and 4945 transitions. Second operand 5 states. [2020-12-23 15:19:28,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:19:28,469 INFO L93 Difference]: Finished difference Result 12159 states and 14571 transitions. [2020-12-23 15:19:28,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 15:19:28,470 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 171 [2020-12-23 15:19:28,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:19:28,490 INFO L225 Difference]: With dead ends: 12159 [2020-12-23 15:19:28,491 INFO L226 Difference]: Without dead ends: 8109 [2020-12-23 15:19:28,502 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 15:19:28,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8109 states. [2020-12-23 15:19:28,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8109 to 4128. [2020-12-23 15:19:28,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4128 states. [2020-12-23 15:19:28,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4128 states to 4128 states and 4944 transitions. [2020-12-23 15:19:28,991 INFO L78 Accepts]: Start accepts. Automaton has 4128 states and 4944 transitions. Word has length 171 [2020-12-23 15:19:28,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:19:28,992 INFO L481 AbstractCegarLoop]: Abstraction has 4128 states and 4944 transitions. [2020-12-23 15:19:28,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 15:19:28,992 INFO L276 IsEmpty]: Start isEmpty. Operand 4128 states and 4944 transitions. [2020-12-23 15:19:29,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2020-12-23 15:19:29,003 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:19:29,003 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:19:29,003 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 15:19:29,004 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:19:29,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:19:29,004 INFO L82 PathProgramCache]: Analyzing trace with hash 967425927, now seen corresponding path program 1 times [2020-12-23 15:19:29,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:19:29,005 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761576699] [2020-12-23 15:19:29,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:19:29,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:19:29,504 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-12-23 15:19:29,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761576699] [2020-12-23 15:19:29,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:19:29,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:19:29,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828931100] [2020-12-23 15:19:29,506 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:19:29,507 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:19:29,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:19:29,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:19:29,508 INFO L87 Difference]: Start difference. First operand 4128 states and 4944 transitions. Second operand 3 states. [2020-12-23 15:19:29,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:19:29,896 INFO L93 Difference]: Finished difference Result 8240 states and 9875 transitions. [2020-12-23 15:19:29,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:19:29,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2020-12-23 15:19:29,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:19:29,908 INFO L225 Difference]: With dead ends: 8240 [2020-12-23 15:19:29,908 INFO L226 Difference]: Without dead ends: 4132 [2020-12-23 15:19:29,918 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 15:19:29,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4132 states. [2020-12-23 15:19:30,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4132 to 4132. [2020-12-23 15:19:30,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4132 states. [2020-12-23 15:19:30,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4132 states to 4132 states and 4948 transitions. [2020-12-23 15:19:30,317 INFO L78 Accepts]: Start accepts. Automaton has 4132 states and 4948 transitions. Word has length 173 [2020-12-23 15:19:30,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:19:30,317 INFO L481 AbstractCegarLoop]: Abstraction has 4132 states and 4948 transitions. [2020-12-23 15:19:30,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:19:30,317 INFO L276 IsEmpty]: Start isEmpty. Operand 4132 states and 4948 transitions. [2020-12-23 15:19:30,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-12-23 15:19:30,326 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:19:30,326 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:19:30,327 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 15:19:30,327 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:19:30,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:19:30,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1124659397, now seen corresponding path program 1 times [2020-12-23 15:19:30,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:19:30,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662271987] [2020-12-23 15:19:30,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:19:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:19:30,785 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-12-23 15:19:30,786 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662271987] [2020-12-23 15:19:30,786 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312999664] [2020-12-23 15:19:30,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:19:31,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:19:31,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 1950 conjuncts, 15 conjunts are in the unsatisfiable core [2020-12-23 15:19:31,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:19:31,612 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-12-23 15:19:31,613 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:19:31,613 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2020-12-23 15:19:31,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510947909] [2020-12-23 15:19:31,614 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 15:19:31,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:19:31,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 15:19:31,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-23 15:19:31,615 INFO L87 Difference]: Start difference. First operand 4132 states and 4948 transitions. Second operand 5 states. [2020-12-23 15:19:32,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:19:32,352 INFO L93 Difference]: Finished difference Result 8100 states and 9710 transitions. [2020-12-23 15:19:32,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 15:19:32,352 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 177 [2020-12-23 15:19:32,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:19:32,363 INFO L225 Difference]: With dead ends: 8100 [2020-12-23 15:19:32,364 INFO L226 Difference]: Without dead ends: 4141 [2020-12-23 15:19:32,371 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-12-23 15:19:32,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4141 states. [2020-12-23 15:19:32,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4141 to 4129. [2020-12-23 15:19:32,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4129 states. [2020-12-23 15:19:32,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4129 states to 4129 states and 4944 transitions. [2020-12-23 15:19:32,688 INFO L78 Accepts]: Start accepts. Automaton has 4129 states and 4944 transitions. Word has length 177 [2020-12-23 15:19:32,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:19:32,689 INFO L481 AbstractCegarLoop]: Abstraction has 4129 states and 4944 transitions. [2020-12-23 15:19:32,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 15:19:32,689 INFO L276 IsEmpty]: Start isEmpty. Operand 4129 states and 4944 transitions. [2020-12-23 15:19:32,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2020-12-23 15:19:32,699 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:19:32,699 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:19:32,913 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-12-23 15:19:32,914 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:19:32,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:19:32,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1537860610, now seen corresponding path program 1 times [2020-12-23 15:19:32,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:19:32,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2961468] [2020-12-23 15:19:32,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:19:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:19:33,287 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-12-23 15:19:33,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2961468] [2020-12-23 15:19:33,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:19:33,288 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 15:19:33,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827246797] [2020-12-23 15:19:33,292 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 15:19:33,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:19:33,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 15:19:33,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 15:19:33,295 INFO L87 Difference]: Start difference. First operand 4129 states and 4944 transitions. Second operand 5 states. [2020-12-23 15:19:33,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:19:33,706 INFO L93 Difference]: Finished difference Result 8110 states and 9719 transitions. [2020-12-23 15:19:33,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 15:19:33,707 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 239 [2020-12-23 15:19:33,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:19:33,718 INFO L225 Difference]: With dead ends: 8110 [2020-12-23 15:19:33,718 INFO L226 Difference]: Without dead ends: 4129 [2020-12-23 15:19:33,728 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 15:19:33,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4129 states. [2020-12-23 15:19:34,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4129 to 4129. [2020-12-23 15:19:34,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4129 states. [2020-12-23 15:19:34,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4129 states to 4129 states and 4943 transitions. [2020-12-23 15:19:34,051 INFO L78 Accepts]: Start accepts. Automaton has 4129 states and 4943 transitions. Word has length 239 [2020-12-23 15:19:34,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:19:34,052 INFO L481 AbstractCegarLoop]: Abstraction has 4129 states and 4943 transitions. [2020-12-23 15:19:34,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 15:19:34,052 INFO L276 IsEmpty]: Start isEmpty. Operand 4129 states and 4943 transitions. [2020-12-23 15:19:34,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2020-12-23 15:19:34,061 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:19:34,062 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:19:34,062 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 15:19:34,062 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:19:34,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:19:34,063 INFO L82 PathProgramCache]: Analyzing trace with hash 2042021090, now seen corresponding path program 1 times [2020-12-23 15:19:34,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:19:34,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985195066] [2020-12-23 15:19:34,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:19:34,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:19:34,771 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-12-23 15:19:34,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985195066] [2020-12-23 15:19:34,778 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599081770] [2020-12-23 15:19:34,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:19:36,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:19:36,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 2504 conjuncts, 15 conjunts are in the unsatisfiable core [2020-12-23 15:19:36,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:19:36,891 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-12-23 15:19:36,891 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 15:19:36,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2020-12-23 15:19:36,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436780069] [2020-12-23 15:19:36,894 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 15:19:36,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:19:36,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 15:19:36,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-23 15:19:36,895 INFO L87 Difference]: Start difference. First operand 4129 states and 4943 transitions. Second operand 6 states. [2020-12-23 15:19:37,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:19:37,333 INFO L93 Difference]: Finished difference Result 8241 states and 9872 transitions. [2020-12-23 15:19:37,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 15:19:37,334 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 241 [2020-12-23 15:19:37,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:19:37,344 INFO L225 Difference]: With dead ends: 8241 [2020-12-23 15:19:37,344 INFO L226 Difference]: Without dead ends: 4133 [2020-12-23 15:19:37,353 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-23 15:19:37,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4133 states. [2020-12-23 15:19:37,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4133 to 4133. [2020-12-23 15:19:37,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4133 states. [2020-12-23 15:19:37,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4133 states to 4133 states and 4947 transitions. [2020-12-23 15:19:37,782 INFO L78 Accepts]: Start accepts. Automaton has 4133 states and 4947 transitions. Word has length 241 [2020-12-23 15:19:37,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:19:37,782 INFO L481 AbstractCegarLoop]: Abstraction has 4133 states and 4947 transitions. [2020-12-23 15:19:37,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 15:19:37,782 INFO L276 IsEmpty]: Start isEmpty. Operand 4133 states and 4947 transitions. [2020-12-23 15:19:37,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2020-12-23 15:19:37,794 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:19:37,794 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:19:38,007 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-12-23 15:19:38,008 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:19:38,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:19:38,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1171438564, now seen corresponding path program 2 times [2020-12-23 15:19:38,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:19:38,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340578337] [2020-12-23 15:19:38,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:19:38,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:19:38,476 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-12-23 15:19:38,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340578337] [2020-12-23 15:19:38,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262012128] [2020-12-23 15:19:38,477 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:19:39,367 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-12-23 15:19:39,367 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:19:39,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 958 conjuncts, 15 conjunts are in the unsatisfiable core [2020-12-23 15:19:39,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:19:39,719 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-12-23 15:19:39,720 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:19:39,720 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2020-12-23 15:19:39,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866018250] [2020-12-23 15:19:39,721 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:19:39,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:19:39,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:19:39,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 15:19:39,722 INFO L87 Difference]: Start difference. First operand 4133 states and 4947 transitions. Second operand 3 states. [2020-12-23 15:19:40,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:19:40,227 INFO L93 Difference]: Finished difference Result 8238 states and 9865 transitions. [2020-12-23 15:19:40,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:19:40,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2020-12-23 15:19:40,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:19:40,236 INFO L225 Difference]: With dead ends: 8238 [2020-12-23 15:19:40,237 INFO L226 Difference]: Without dead ends: 4135 [2020-12-23 15:19:40,243 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 15:19:40,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4135 states. [2020-12-23 15:19:40,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4135 to 4135. [2020-12-23 15:19:40,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4135 states. [2020-12-23 15:19:40,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4135 states to 4135 states and 4949 transitions. [2020-12-23 15:19:40,586 INFO L78 Accepts]: Start accepts. Automaton has 4135 states and 4949 transitions. Word has length 245 [2020-12-23 15:19:40,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:19:40,586 INFO L481 AbstractCegarLoop]: Abstraction has 4135 states and 4949 transitions. [2020-12-23 15:19:40,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:19:40,587 INFO L276 IsEmpty]: Start isEmpty. Operand 4135 states and 4949 transitions. [2020-12-23 15:19:40,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2020-12-23 15:19:40,596 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:19:40,597 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:19:40,810 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:19:40,810 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:19:40,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:19:40,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1440378012, now seen corresponding path program 1 times [2020-12-23 15:19:40,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:19:40,812 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571574279] [2020-12-23 15:19:40,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:19:41,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:19:41,274 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2020-12-23 15:19:41,275 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571574279] [2020-12-23 15:19:41,277 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408347744] [2020-12-23 15:19:41,277 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:19:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:19:43,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 2540 conjuncts, 18 conjunts are in the unsatisfiable core [2020-12-23 15:19:43,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:19:43,320 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2020-12-23 15:19:43,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 15:19:43,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2020-12-23 15:19:43,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273795277] [2020-12-23 15:19:43,321 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 15:19:43,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:19:43,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 15:19:43,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-12-23 15:19:43,322 INFO L87 Difference]: Start difference. First operand 4135 states and 4949 transitions. Second operand 8 states. [2020-12-23 15:19:43,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:19:43,822 INFO L93 Difference]: Finished difference Result 8252 states and 9883 transitions. [2020-12-23 15:19:43,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 15:19:43,822 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 247 [2020-12-23 15:19:43,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:19:43,835 INFO L225 Difference]: With dead ends: 8252 [2020-12-23 15:19:43,835 INFO L226 Difference]: Without dead ends: 4139 [2020-12-23 15:19:43,844 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-12-23 15:19:43,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4139 states. [2020-12-23 15:19:44,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4139 to 4139. [2020-12-23 15:19:44,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4139 states. [2020-12-23 15:19:44,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4139 states to 4139 states and 4953 transitions. [2020-12-23 15:19:44,148 INFO L78 Accepts]: Start accepts. Automaton has 4139 states and 4953 transitions. Word has length 247 [2020-12-23 15:19:44,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:19:44,149 INFO L481 AbstractCegarLoop]: Abstraction has 4139 states and 4953 transitions. [2020-12-23 15:19:44,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 15:19:44,149 INFO L276 IsEmpty]: Start isEmpty. Operand 4139 states and 4953 transitions. [2020-12-23 15:19:44,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2020-12-23 15:19:44,156 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:19:44,156 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:19:44,370 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-12-23 15:19:44,371 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:19:44,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:19:44,372 INFO L82 PathProgramCache]: Analyzing trace with hash 83514974, now seen corresponding path program 2 times [2020-12-23 15:19:44,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:19:44,372 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075854581] [2020-12-23 15:19:44,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:19:44,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:19:44,854 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2020-12-23 15:19:44,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075854581] [2020-12-23 15:19:44,858 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930645725] [2020-12-23 15:19:44,858 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:19:46,576 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 15:19:46,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:19:46,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 2564 conjuncts, 17 conjunts are in the unsatisfiable core [2020-12-23 15:19:46,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:19:46,896 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2020-12-23 15:19:46,897 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 15:19:46,897 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2020-12-23 15:19:46,897 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437368004] [2020-12-23 15:19:46,898 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 15:19:46,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:19:46,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 15:19:46,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-12-23 15:19:46,899 INFO L87 Difference]: Start difference. First operand 4139 states and 4953 transitions. Second operand 10 states. [2020-12-23 15:19:47,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:19:47,355 INFO L93 Difference]: Finished difference Result 8259 states and 9890 transitions. [2020-12-23 15:19:47,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 15:19:47,356 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 251 [2020-12-23 15:19:47,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:19:47,367 INFO L225 Difference]: With dead ends: 8259 [2020-12-23 15:19:47,367 INFO L226 Difference]: Without dead ends: 4143 [2020-12-23 15:19:47,375 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-12-23 15:19:47,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4143 states. [2020-12-23 15:19:47,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4143 to 4143. [2020-12-23 15:19:47,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4143 states. [2020-12-23 15:19:47,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4143 states to 4143 states and 4957 transitions. [2020-12-23 15:19:47,675 INFO L78 Accepts]: Start accepts. Automaton has 4143 states and 4957 transitions. Word has length 251 [2020-12-23 15:19:47,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:19:47,675 INFO L481 AbstractCegarLoop]: Abstraction has 4143 states and 4957 transitions. [2020-12-23 15:19:47,675 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 15:19:47,675 INFO L276 IsEmpty]: Start isEmpty. Operand 4143 states and 4957 transitions. [2020-12-23 15:19:47,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2020-12-23 15:19:47,682 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:19:47,682 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:19:47,891 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-12-23 15:19:47,892 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:19:47,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:19:47,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1327266780, now seen corresponding path program 3 times [2020-12-23 15:19:47,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:19:47,894 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147380194] [2020-12-23 15:19:47,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:19:48,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:19:48,386 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2020-12-23 15:19:48,386 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147380194] [2020-12-23 15:19:48,386 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845395353] [2020-12-23 15:19:48,387 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:19:50,081 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-23 15:19:50,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:19:50,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 1337 conjuncts, 15 conjunts are in the unsatisfiable core [2020-12-23 15:19:50,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:19:50,328 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2020-12-23 15:19:50,328 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 15:19:50,328 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2020-12-23 15:19:50,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457240374] [2020-12-23 15:19:50,329 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 15:19:50,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:19:50,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 15:19:50,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-12-23 15:19:50,330 INFO L87 Difference]: Start difference. First operand 4143 states and 4957 transitions. Second operand 9 states. [2020-12-23 15:19:50,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:19:50,911 INFO L93 Difference]: Finished difference Result 8268 states and 9901 transitions. [2020-12-23 15:19:50,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 15:19:50,912 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 255 [2020-12-23 15:19:50,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:19:50,924 INFO L225 Difference]: With dead ends: 8268 [2020-12-23 15:19:50,925 INFO L226 Difference]: Without dead ends: 4149 [2020-12-23 15:19:50,932 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2020-12-23 15:19:50,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4149 states. [2020-12-23 15:19:51,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4149 to 4149. [2020-12-23 15:19:51,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4149 states. [2020-12-23 15:19:51,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4149 states to 4149 states and 4963 transitions. [2020-12-23 15:19:51,222 INFO L78 Accepts]: Start accepts. Automaton has 4149 states and 4963 transitions. Word has length 255 [2020-12-23 15:19:51,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:19:51,222 INFO L481 AbstractCegarLoop]: Abstraction has 4149 states and 4963 transitions. [2020-12-23 15:19:51,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 15:19:51,223 INFO L276 IsEmpty]: Start isEmpty. Operand 4149 states and 4963 transitions. [2020-12-23 15:19:51,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2020-12-23 15:19:51,228 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:19:51,228 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:19:51,428 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:19:51,429 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:19:51,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:19:51,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1301867166, now seen corresponding path program 4 times [2020-12-23 15:19:51,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:19:51,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275729204] [2020-12-23 15:19:51,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:19:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:19:52,037 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-12-23 15:19:52,038 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275729204] [2020-12-23 15:19:52,038 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210340940] [2020-12-23 15:19:52,038 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:19:53,560 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-23 15:19:53,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:19:53,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 2624 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-23 15:19:53,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:19:53,936 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-12-23 15:19:53,936 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 15:19:53,936 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2020-12-23 15:19:53,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940607108] [2020-12-23 15:19:53,938 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-23 15:19:53,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:19:53,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-23 15:19:53,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-12-23 15:19:53,939 INFO L87 Difference]: Start difference. First operand 4149 states and 4963 transitions. Second operand 14 states. [2020-12-23 15:19:54,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:19:54,646 INFO L93 Difference]: Finished difference Result 8277 states and 9908 transitions. [2020-12-23 15:19:54,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 15:19:54,647 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 261 [2020-12-23 15:19:54,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:19:54,655 INFO L225 Difference]: With dead ends: 8277 [2020-12-23 15:19:54,656 INFO L226 Difference]: Without dead ends: 4153 [2020-12-23 15:19:54,662 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2020-12-23 15:19:54,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4153 states. [2020-12-23 15:19:54,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4153 to 4153. [2020-12-23 15:19:54,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4153 states. [2020-12-23 15:19:54,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4153 states to 4153 states and 4967 transitions. [2020-12-23 15:19:54,971 INFO L78 Accepts]: Start accepts. Automaton has 4153 states and 4967 transitions. Word has length 261 [2020-12-23 15:19:54,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:19:54,971 INFO L481 AbstractCegarLoop]: Abstraction has 4153 states and 4967 transitions. [2020-12-23 15:19:54,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-23 15:19:54,971 INFO L276 IsEmpty]: Start isEmpty. Operand 4153 states and 4967 transitions. [2020-12-23 15:19:54,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2020-12-23 15:19:54,979 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:19:54,979 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:19:55,192 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:19:55,193 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:19:55,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:19:55,194 INFO L82 PathProgramCache]: Analyzing trace with hash 306348260, now seen corresponding path program 5 times [2020-12-23 15:19:55,194 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:19:55,195 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116342655] [2020-12-23 15:19:55,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:19:55,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:19:55,892 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2020-12-23 15:19:55,893 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116342655] [2020-12-23 15:19:55,893 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080569486] [2020-12-23 15:19:55,893 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true