/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--it87_wdt.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 01:58:32,143 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 01:58:32,146 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 01:58:32,185 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 01:58:32,185 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 01:58:32,187 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 01:58:32,189 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 01:58:32,192 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 01:58:32,194 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 01:58:32,196 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 01:58:32,198 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 01:58:32,199 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 01:58:32,200 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 01:58:32,201 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 01:58:32,203 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 01:58:32,204 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 01:58:32,207 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 01:58:32,208 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 01:58:32,226 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 01:58:32,231 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 01:58:32,237 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 01:58:32,241 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 01:58:32,246 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 01:58:32,248 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 01:58:32,255 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 01:58:32,256 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 01:58:32,256 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 01:58:32,260 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 01:58:32,261 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 01:58:32,264 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 01:58:32,265 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 01:58:32,266 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 01:58:32,270 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 01:58:32,272 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 01:58:32,274 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 01:58:32,275 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 01:58:32,276 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 01:58:32,277 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 01:58:32,281 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 01:58:32,286 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 01:58:32,287 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 01:58:32,288 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-07 01:58:32,332 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 01:58:32,333 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 01:58:32,334 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 01:58:32,335 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 01:58:32,335 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 01:58:32,335 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 01:58:32,335 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 01:58:32,336 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 01:58:32,336 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-07 01:58:32,336 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 01:58:32,336 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-07 01:58:32,336 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-07 01:58:32,337 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 01:58:32,337 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-07 01:58:32,337 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 01:58:32,337 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 01:58:32,337 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 01:58:32,338 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 01:58:32,338 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 01:58:32,338 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 01:58:32,338 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-07 01:58:32,339 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 01:58:32,339 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 01:58:32,339 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-07 01:58:32,339 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 01:58:32,339 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-07 01:58:32,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 01:58:32,815 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 01:58:32,820 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 01:58:32,821 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 01:58:32,822 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 01:58:32,823 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--it87_wdt.ko-entry_point.cil.out.i [2021-01-07 01:58:32,907 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/ae803a997/633139fa0ff6410c8c6f8b6f5d7cb8b1/FLAGe7fbeadf2 [2021-01-07 01:58:34,067 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 01:58:34,068 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--it87_wdt.ko-entry_point.cil.out.i [2021-01-07 01:58:34,117 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/ae803a997/633139fa0ff6410c8c6f8b6f5d7cb8b1/FLAGe7fbeadf2 [2021-01-07 01:58:34,522 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/ae803a997/633139fa0ff6410c8c6f8b6f5d7cb8b1 [2021-01-07 01:58:34,525 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 01:58:34,528 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 01:58:34,531 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 01:58:34,531 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 01:58:34,535 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 01:58:34,537 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 01:58:34" (1/1) ... [2021-01-07 01:58:34,539 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@392d4d3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:58:34, skipping insertion in model container [2021-01-07 01:58:34,540 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 01:58:34" (1/1) ... [2021-01-07 01:58:34,549 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 01:58:34,659 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[~tmp~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] left hand side expression in assignment: lhs: VariableLHS[~reg,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: lhs: VariableLHS[~val~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~val~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~reg,] left hand side expression in assignment: lhs: VariableLHS[~cfg~0,] left hand side expression in assignment: lhs: VariableLHS[~tm~0,] left hand side expression in assignment: lhs: VariableLHS[~cfg~0,] left hand side expression in assignment: lhs: VariableLHS[~cfg~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~tm~0,] left hand side expression in assignment: lhs: VariableLHS[~cfg~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~t,] left hand side expression in assignment: lhs: VariableLHS[~t,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] 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[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~13,] left hand side expression in assignment: lhs: VariableLHS[~ret~1,] left hand side expression in assignment: lhs: VariableLHS[~timeout~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~timeout~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~14,] left hand side expression in assignment: lhs: VariableLHS[~ret~2,] left hand side expression in assignment: address: IdentifierExpression[~status,] left hand side expression in assignment: lhs: VariableLHS[~tmp~15,] left hand side expression in assignment: lhs: VariableLHS[~ret~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~7,] left hand side expression in assignment: address: IdentifierExpression[~status,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~3,] left hand side expression in assignment: address: IdentifierExpression[~status,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: address: IdentifierExpression[~status,] left hand side expression in assignment: lhs: VariableLHS[~tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] left hand side expression in assignment: lhs: VariableLHS[~ret~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~9,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~ret~5,] left hand side expression in assignment: lhs: VariableLHS[~ofs~0,] left hand side expression in assignment: lhs: VariableLHS[~c~2,] left hand side expression in assignment: lhs: VariableLHS[~ofs~0,] left hand side expression in assignment: lhs: VariableLHS[~rc~0,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~uarg~0,],i] left hand side expression in assignment: lhs: VariableLHS[~tmp~18,] left hand side expression in assignment: lhs: VariableLHS[~rc~0,] 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[~new_options~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~10,] left hand side expression in assignment: lhs: VariableLHS[~rc~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~6,] left hand side expression in assignment: lhs: VariableLHS[~rc~0,] left hand side expression in assignment: lhs: VariableLHS[~new_timeout~0,] left hand side expression in assignment: lhs: VariableLHS[~rc~0,] left hand side expression in assignment: lhs: VariableLHS[~__pu_val___1~0,] left hand side expression in assignment: lhs: VariableLHS[~rc~1,] left hand side expression in assignment: lhs: VariableLHS[~try_gameport~0,] left hand side expression in assignment: lhs: VariableLHS[~gp_rreq_fail~0,] left hand side expression in assignment: lhs: VariableLHS[~wdt_status~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rc~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~19,] left hand side expression in assignment: lhs: VariableLHS[~chip_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~11,] left hand side expression in assignment: lhs: VariableLHS[~chip_rev~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~max_units~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max_units~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max_units~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max_units~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~try_gameport~0,] left hand side expression in assignment: lhs: VariableLHS[~rc~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~7,] left hand side expression in assignment: lhs: VariableLHS[~base~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~base~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~2,] left hand side expression in assignment: lhs: VariableLHS[~gpact~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~gp_rreq_fail~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~rc~1,] left hand side expression in assignment: lhs: VariableLHS[~base~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~ciract~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~timeout~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~timeout~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rc~1,] left hand side expression in assignment: lhs: VariableLHS[~rc~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~8,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~12,] left hand side expression in assignment: lhs: VariableLHS[~tmp~20,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~21,] left hand side expression in assignment: lhs: VariableLHS[~wdt_fops_group1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~13,] left hand side expression in assignment: lhs: VariableLHS[~wdt_fops_group2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~22,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~14,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~9,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~4,] 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~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~1,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~1,] 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~1,] 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~23,] 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~24,] 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] [2021-01-07 01:58:35,599 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--it87_wdt.ko-entry_point.cil.out.i[120162,120175] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~15,] left hand side expression in assignment: lhs: VariableLHS[~tmp~25,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~15,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~15,] 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] [2021-01-07 01:58:35,646 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 01:58:35,672 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[~tmp~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] left hand side expression in assignment: lhs: VariableLHS[~reg,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: lhs: VariableLHS[~val~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~val~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~reg,] left hand side expression in assignment: lhs: VariableLHS[~cfg~0,] left hand side expression in assignment: lhs: VariableLHS[~tm~0,] left hand side expression in assignment: lhs: VariableLHS[~cfg~0,] left hand side expression in assignment: lhs: VariableLHS[~cfg~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~tm~0,] left hand side expression in assignment: lhs: VariableLHS[~cfg~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~t,] left hand side expression in assignment: lhs: VariableLHS[~t,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] 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[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~13,] left hand side expression in assignment: lhs: VariableLHS[~ret~1,] left hand side expression in assignment: lhs: VariableLHS[~timeout~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~timeout~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~14,] left hand side expression in assignment: lhs: VariableLHS[~ret~2,] left hand side expression in assignment: address: IdentifierExpression[~status,] left hand side expression in assignment: lhs: VariableLHS[~tmp~15,] left hand side expression in assignment: lhs: VariableLHS[~ret~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~7,] left hand side expression in assignment: address: IdentifierExpression[~status,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~3,] left hand side expression in assignment: address: IdentifierExpression[~status,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: address: IdentifierExpression[~status,] left hand side expression in assignment: lhs: VariableLHS[~tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] left hand side expression in assignment: lhs: VariableLHS[~ret~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~9,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~ret~5,] left hand side expression in assignment: lhs: VariableLHS[~ofs~0,] left hand side expression in assignment: lhs: VariableLHS[~c~2,] left hand side expression in assignment: lhs: VariableLHS[~ofs~0,] left hand side expression in assignment: lhs: VariableLHS[~rc~0,] 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~18,] left hand side expression in assignment: lhs: VariableLHS[~rc~0,] 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[~new_options~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~10,] left hand side expression in assignment: lhs: VariableLHS[~rc~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~6,] left hand side expression in assignment: lhs: VariableLHS[~rc~0,] left hand side expression in assignment: lhs: VariableLHS[~new_timeout~0,] left hand side expression in assignment: lhs: VariableLHS[~rc~0,] left hand side expression in assignment: lhs: VariableLHS[~__pu_val___1~0,] left hand side expression in assignment: lhs: VariableLHS[~rc~1,] left hand side expression in assignment: lhs: VariableLHS[~try_gameport~0,] left hand side expression in assignment: lhs: VariableLHS[~gp_rreq_fail~0,] left hand side expression in assignment: address: IdentifierExpression[~#wdt_status~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rc~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~19,] left hand side expression in assignment: lhs: VariableLHS[~chip_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~11,] left hand side expression in assignment: lhs: VariableLHS[~chip_rev~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~max_units~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max_units~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max_units~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max_units~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~try_gameport~0,] left hand side expression in assignment: lhs: VariableLHS[~rc~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~7,] left hand side expression in assignment: lhs: VariableLHS[~base~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~base~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~2,] left hand side expression in assignment: lhs: VariableLHS[~gpact~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~gp_rreq_fail~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~rc~1,] left hand side expression in assignment: lhs: VariableLHS[~base~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~ciract~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~timeout~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~timeout~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rc~1,] left hand side expression in assignment: lhs: VariableLHS[~rc~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~8,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~12,] left hand side expression in assignment: lhs: VariableLHS[~tmp~20,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~21,] left hand side expression in assignment: lhs: VariableLHS[~wdt_fops_group1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~13,] left hand side expression in assignment: lhs: VariableLHS[~wdt_fops_group2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~22,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~14,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~9,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~4,] 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~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~1,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~1,] 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~1,] 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~23,] 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~24,] 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] [2021-01-07 01:58:35,943 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--it87_wdt.ko-entry_point.cil.out.i[120162,120175] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~15,] left hand side expression in assignment: lhs: VariableLHS[~tmp~25,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~15,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~15,] 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] [2021-01-07 01:58:35,950 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 01:58:36,019 INFO L208 MainTranslator]: Completed translation [2021-01-07 01:58:36,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:58:36 WrapperNode [2021-01-07 01:58:36,020 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 01:58:36,021 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 01:58:36,021 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 01:58:36,021 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 01:58:36,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:58:36" (1/1) ... [2021-01-07 01:58:36,069 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:58:36" (1/1) ... [2021-01-07 01:58:36,396 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 01:58:36,400 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 01:58:36,400 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 01:58:36,400 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 01:58:36,471 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:58:36" (1/1) ... [2021-01-07 01:58:36,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:58:36" (1/1) ... [2021-01-07 01:58:36,607 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:58:36" (1/1) ... [2021-01-07 01:58:36,608 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:58:36" (1/1) ... [2021-01-07 01:58:36,745 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:58:36" (1/1) ... [2021-01-07 01:58:36,791 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:58:36" (1/1) ... [2021-01-07 01:58:36,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:58:36" (1/1) ... [2021-01-07 01:58:36,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 01:58:36,864 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 01:58:36,864 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 01:58:36,865 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 01:58:36,865 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:58:36" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 01:58:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-01-07 01:58:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 01:58:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 01:58:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-07 01:58:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 01:58:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 01:58:36,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-01-07 01:58:36,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-07 01:58:36,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 01:58:36,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 01:58:36,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 01:58:36,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 01:58:41,021 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 01:58:41,022 INFO L299 CfgBuilder]: Removed 1215 assume(true) statements. [2021-01-07 01:58:41,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 01:58:41 BoogieIcfgContainer [2021-01-07 01:58:41,026 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 01:58:41,029 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 01:58:41,029 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 01:58:41,033 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 01:58:41,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 01:58:34" (1/3) ... [2021-01-07 01:58:41,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38f0a27c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 01:58:41, skipping insertion in model container [2021-01-07 01:58:41,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:58:36" (2/3) ... [2021-01-07 01:58:41,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38f0a27c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 01:58:41, skipping insertion in model container [2021-01-07 01:58:41,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 01:58:41" (3/3) ... [2021-01-07 01:58:41,036 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--watchdog--it87_wdt.ko-entry_point.cil.out.i [2021-01-07 01:58:41,044 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 01:58:41,051 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-07 01:58:41,072 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-07 01:58:41,107 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 01:58:41,107 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-07 01:58:41,107 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 01:58:41,107 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 01:58:41,107 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 01:58:41,107 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 01:58:41,108 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 01:58:41,108 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 01:58:41,140 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states. [2021-01-07 01:58:41,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-01-07 01:58:41,153 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:58:41,154 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, 1, 1] [2021-01-07 01:58:41,155 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:58:41,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:58:41,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1819865069, now seen corresponding path program 1 times [2021-01-07 01:58:41,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:58:41,173 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512208731] [2021-01-07 01:58:41,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:58:41,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:58:41,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:58:41,718 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512208731] [2021-01-07 01:58:41,719 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:58:41,719 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 01:58:41,721 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607171129] [2021-01-07 01:58:41,727 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-07 01:58:41,728 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:58:41,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-07 01:58:41,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-07 01:58:41,751 INFO L87 Difference]: Start difference. First operand 863 states. Second operand 2 states. [2021-01-07 01:58:41,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:58:41,905 INFO L93 Difference]: Finished difference Result 1722 states and 2379 transitions. [2021-01-07 01:58:41,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-07 01:58:41,907 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 55 [2021-01-07 01:58:41,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:58:41,941 INFO L225 Difference]: With dead ends: 1722 [2021-01-07 01:58:41,941 INFO L226 Difference]: Without dead ends: 855 [2021-01-07 01:58:41,953 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 [2021-01-07 01:58:41,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2021-01-07 01:58:42,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 855. [2021-01-07 01:58:42,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2021-01-07 01:58:42,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1089 transitions. [2021-01-07 01:58:42,113 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1089 transitions. Word has length 55 [2021-01-07 01:58:42,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:58:42,114 INFO L481 AbstractCegarLoop]: Abstraction has 855 states and 1089 transitions. [2021-01-07 01:58:42,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-07 01:58:42,114 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1089 transitions. [2021-01-07 01:58:42,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-01-07 01:58:42,125 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:58:42,125 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, 1, 1] [2021-01-07 01:58:42,126 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 01:58:42,126 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:58:42,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:58:42,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1763558133, now seen corresponding path program 1 times [2021-01-07 01:58:42,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:58:42,128 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723441942] [2021-01-07 01:58:42,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:58:42,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:58:42,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:58:42,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723441942] [2021-01-07 01:58:42,530 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:58:42,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:58:42,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44433419] [2021-01-07 01:58:42,533 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:58:42,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:58:42,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:58:42,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:58:42,535 INFO L87 Difference]: Start difference. First operand 855 states and 1089 transitions. Second operand 3 states. [2021-01-07 01:58:42,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:58:42,618 INFO L93 Difference]: Finished difference Result 862 states and 1095 transitions. [2021-01-07 01:58:42,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:58:42,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2021-01-07 01:58:42,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:58:42,625 INFO L225 Difference]: With dead ends: 862 [2021-01-07 01:58:42,626 INFO L226 Difference]: Without dead ends: 859 [2021-01-07 01:58:42,628 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:58:42,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2021-01-07 01:58:42,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 856. [2021-01-07 01:58:42,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2021-01-07 01:58:42,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1090 transitions. [2021-01-07 01:58:42,669 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1090 transitions. Word has length 55 [2021-01-07 01:58:42,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:58:42,670 INFO L481 AbstractCegarLoop]: Abstraction has 856 states and 1090 transitions. [2021-01-07 01:58:42,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:58:42,670 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1090 transitions. [2021-01-07 01:58:42,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-01-07 01:58:42,675 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:58:42,675 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, 1, 1] [2021-01-07 01:58:42,675 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 01:58:42,675 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:58:42,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:58:42,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1763498551, now seen corresponding path program 1 times [2021-01-07 01:58:42,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:58:42,680 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171158066] [2021-01-07 01:58:42,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:58:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:58:42,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:58:42,978 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171158066] [2021-01-07 01:58:42,978 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:58:42,979 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 01:58:42,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352109537] [2021-01-07 01:58:42,980 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:58:42,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:58:42,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:58:42,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:58:42,998 INFO L87 Difference]: Start difference. First operand 856 states and 1090 transitions. Second operand 3 states. [2021-01-07 01:58:43,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:58:43,096 INFO L93 Difference]: Finished difference Result 1675 states and 2137 transitions. [2021-01-07 01:58:43,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:58:43,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2021-01-07 01:58:43,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:58:43,111 INFO L225 Difference]: With dead ends: 1675 [2021-01-07 01:58:43,119 INFO L226 Difference]: Without dead ends: 1628 [2021-01-07 01:58:43,121 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 [2021-01-07 01:58:43,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2021-01-07 01:58:43,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 1627. [2021-01-07 01:58:43,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1627 states. [2021-01-07 01:58:43,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1627 states to 1627 states and 2080 transitions. [2021-01-07 01:58:43,200 INFO L78 Accepts]: Start accepts. Automaton has 1627 states and 2080 transitions. Word has length 55 [2021-01-07 01:58:43,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:58:43,203 INFO L481 AbstractCegarLoop]: Abstraction has 1627 states and 2080 transitions. [2021-01-07 01:58:43,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:58:43,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1627 states and 2080 transitions. [2021-01-07 01:58:43,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-01-07 01:58:43,207 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:58:43,208 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] [2021-01-07 01:58:43,208 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-07 01:58:43,208 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:58:43,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:58:43,211 INFO L82 PathProgramCache]: Analyzing trace with hash 517442566, now seen corresponding path program 1 times [2021-01-07 01:58:43,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:58:43,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311969260] [2021-01-07 01:58:43,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:58:43,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:58:43,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:58:43,432 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311969260] [2021-01-07 01:58:43,432 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:58:43,432 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:58:43,433 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259013344] [2021-01-07 01:58:43,433 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:58:43,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:58:43,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:58:43,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:58:43,436 INFO L87 Difference]: Start difference. First operand 1627 states and 2080 transitions. Second operand 3 states. [2021-01-07 01:58:43,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:58:43,598 INFO L93 Difference]: Finished difference Result 3664 states and 4693 transitions. [2021-01-07 01:58:43,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:58:43,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2021-01-07 01:58:43,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:58:43,611 INFO L225 Difference]: With dead ends: 3664 [2021-01-07 01:58:43,611 INFO L226 Difference]: Without dead ends: 2074 [2021-01-07 01:58:43,616 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:58:43,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states. [2021-01-07 01:58:43,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 2032. [2021-01-07 01:58:43,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2032 states. [2021-01-07 01:58:43,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2032 states to 2032 states and 2607 transitions. [2021-01-07 01:58:43,719 INFO L78 Accepts]: Start accepts. Automaton has 2032 states and 2607 transitions. Word has length 86 [2021-01-07 01:58:43,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:58:43,720 INFO L481 AbstractCegarLoop]: Abstraction has 2032 states and 2607 transitions. [2021-01-07 01:58:43,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:58:43,721 INFO L276 IsEmpty]: Start isEmpty. Operand 2032 states and 2607 transitions. [2021-01-07 01:58:43,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-01-07 01:58:43,733 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:58:43,733 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:58:43,734 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-07 01:58:43,734 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:58:43,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:58:43,735 INFO L82 PathProgramCache]: Analyzing trace with hash -2020462906, now seen corresponding path program 1 times [2021-01-07 01:58:43,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:58:43,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796818329] [2021-01-07 01:58:43,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:58:43,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:58:44,071 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-07 01:58:44,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796818329] [2021-01-07 01:58:44,072 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:58:44,072 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 01:58:44,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140548740] [2021-01-07 01:58:44,075 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 01:58:44,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:58:44,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 01:58:44,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 01:58:44,077 INFO L87 Difference]: Start difference. First operand 2032 states and 2607 transitions. Second operand 4 states. [2021-01-07 01:58:44,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:58:44,761 INFO L93 Difference]: Finished difference Result 7492 states and 9691 transitions. [2021-01-07 01:58:44,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 01:58:44,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2021-01-07 01:58:44,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:58:44,794 INFO L225 Difference]: With dead ends: 7492 [2021-01-07 01:58:44,795 INFO L226 Difference]: Without dead ends: 5497 [2021-01-07 01:58:44,801 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:58:44,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5497 states. [2021-01-07 01:58:44,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5497 to 2048. [2021-01-07 01:58:44,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2048 states. [2021-01-07 01:58:44,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 2623 transitions. [2021-01-07 01:58:44,966 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 2623 transitions. Word has length 155 [2021-01-07 01:58:44,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:58:44,967 INFO L481 AbstractCegarLoop]: Abstraction has 2048 states and 2623 transitions. [2021-01-07 01:58:44,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 01:58:44,967 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 2623 transitions. [2021-01-07 01:58:44,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-01-07 01:58:44,971 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:58:44,972 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:58:44,972 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-07 01:58:44,972 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:58:44,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:58:44,973 INFO L82 PathProgramCache]: Analyzing trace with hash 2134806022, now seen corresponding path program 1 times [2021-01-07 01:58:44,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:58:44,974 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315187105] [2021-01-07 01:58:44,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:58:45,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:58:45,570 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-07 01:58:45,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315187105] [2021-01-07 01:58:45,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:58:45,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:58:45,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929766366] [2021-01-07 01:58:45,572 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 01:58:45,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:58:45,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 01:58:45,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 01:58:45,578 INFO L87 Difference]: Start difference. First operand 2048 states and 2623 transitions. Second operand 4 states. [2021-01-07 01:58:46,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:58:46,351 INFO L93 Difference]: Finished difference Result 5850 states and 7479 transitions. [2021-01-07 01:58:46,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 01:58:46,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2021-01-07 01:58:46,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:58:46,377 INFO L225 Difference]: With dead ends: 5850 [2021-01-07 01:58:46,377 INFO L226 Difference]: Without dead ends: 3839 [2021-01-07 01:58:46,382 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 01:58:46,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3839 states. [2021-01-07 01:58:46,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3839 to 2440. [2021-01-07 01:58:46,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2440 states. [2021-01-07 01:58:46,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2440 states to 2440 states and 3101 transitions. [2021-01-07 01:58:46,586 INFO L78 Accepts]: Start accepts. Automaton has 2440 states and 3101 transitions. Word has length 163 [2021-01-07 01:58:46,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:58:46,588 INFO L481 AbstractCegarLoop]: Abstraction has 2440 states and 3101 transitions. [2021-01-07 01:58:46,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 01:58:46,592 INFO L276 IsEmpty]: Start isEmpty. Operand 2440 states and 3101 transitions. [2021-01-07 01:58:46,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-01-07 01:58:46,597 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:58:46,598 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:58:46,598 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-07 01:58:46,598 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:58:46,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:58:46,599 INFO L82 PathProgramCache]: Analyzing trace with hash 637280001, now seen corresponding path program 1 times [2021-01-07 01:58:46,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:58:46,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535040922] [2021-01-07 01:58:46,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:58:46,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:58:46,874 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-07 01:58:46,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535040922] [2021-01-07 01:58:46,874 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:58:46,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 01:58:46,875 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210220425] [2021-01-07 01:58:46,875 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:58:46,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:58:46,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:58:46,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:58:46,876 INFO L87 Difference]: Start difference. First operand 2440 states and 3101 transitions. Second operand 3 states. [2021-01-07 01:58:47,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:58:47,060 INFO L93 Difference]: Finished difference Result 4843 states and 6159 transitions. [2021-01-07 01:58:47,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:58:47,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2021-01-07 01:58:47,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:58:47,073 INFO L225 Difference]: With dead ends: 4843 [2021-01-07 01:58:47,074 INFO L226 Difference]: Without dead ends: 2440 [2021-01-07 01:58:47,079 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 [2021-01-07 01:58:47,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2440 states. [2021-01-07 01:58:47,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2440 to 2440. [2021-01-07 01:58:47,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2440 states. [2021-01-07 01:58:47,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2440 states to 2440 states and 3093 transitions. [2021-01-07 01:58:47,259 INFO L78 Accepts]: Start accepts. Automaton has 2440 states and 3093 transitions. Word has length 176 [2021-01-07 01:58:47,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:58:47,259 INFO L481 AbstractCegarLoop]: Abstraction has 2440 states and 3093 transitions. [2021-01-07 01:58:47,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:58:47,259 INFO L276 IsEmpty]: Start isEmpty. Operand 2440 states and 3093 transitions. [2021-01-07 01:58:47,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-01-07 01:58:47,264 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:58:47,265 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:58:47,265 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-07 01:58:47,265 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:58:47,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:58:47,266 INFO L82 PathProgramCache]: Analyzing trace with hash -367587898, now seen corresponding path program 1 times [2021-01-07 01:58:47,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:58:47,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40795154] [2021-01-07 01:58:47,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:58:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:58:47,474 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-07 01:58:47,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40795154] [2021-01-07 01:58:47,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:58:47,475 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:58:47,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935826980] [2021-01-07 01:58:47,476 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:58:47,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:58:47,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:58:47,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:58:47,477 INFO L87 Difference]: Start difference. First operand 2440 states and 3093 transitions. Second operand 3 states. [2021-01-07 01:58:47,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:58:47,894 INFO L93 Difference]: Finished difference Result 6218 states and 7927 transitions. [2021-01-07 01:58:47,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:58:47,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2021-01-07 01:58:47,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:58:47,914 INFO L225 Difference]: With dead ends: 6218 [2021-01-07 01:58:47,914 INFO L226 Difference]: Without dead ends: 3815 [2021-01-07 01:58:47,921 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:58:47,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3815 states. [2021-01-07 01:58:48,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3815 to 2476. [2021-01-07 01:58:48,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2476 states. [2021-01-07 01:58:48,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 3125 transitions. [2021-01-07 01:58:48,156 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 3125 transitions. Word has length 178 [2021-01-07 01:58:48,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:58:48,156 INFO L481 AbstractCegarLoop]: Abstraction has 2476 states and 3125 transitions. [2021-01-07 01:58:48,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:58:48,157 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 3125 transitions. [2021-01-07 01:58:48,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-01-07 01:58:48,162 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:58:48,163 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:58:48,163 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-07 01:58:48,163 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:58:48,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:58:48,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1785518920, now seen corresponding path program 1 times [2021-01-07 01:58:48,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:58:48,164 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048059498] [2021-01-07 01:58:48,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:58:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:58:48,428 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-07 01:58:48,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048059498] [2021-01-07 01:58:48,429 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:58:48,429 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 01:58:48,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414350927] [2021-01-07 01:58:48,430 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 01:58:48,430 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:58:48,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 01:58:48,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 01:58:48,431 INFO L87 Difference]: Start difference. First operand 2476 states and 3125 transitions. Second operand 6 states. [2021-01-07 01:58:49,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:58:49,812 INFO L93 Difference]: Finished difference Result 8477 states and 10749 transitions. [2021-01-07 01:58:49,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 01:58:49,813 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 178 [2021-01-07 01:58:49,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:58:49,862 INFO L225 Difference]: With dead ends: 8477 [2021-01-07 01:58:49,863 INFO L226 Difference]: Without dead ends: 6038 [2021-01-07 01:58:49,869 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-01-07 01:58:49,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6038 states. [2021-01-07 01:58:50,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6038 to 3811. [2021-01-07 01:58:50,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3811 states. [2021-01-07 01:58:50,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3811 states to 3811 states and 4802 transitions. [2021-01-07 01:58:50,197 INFO L78 Accepts]: Start accepts. Automaton has 3811 states and 4802 transitions. Word has length 178 [2021-01-07 01:58:50,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:58:50,198 INFO L481 AbstractCegarLoop]: Abstraction has 3811 states and 4802 transitions. [2021-01-07 01:58:50,198 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 01:58:50,198 INFO L276 IsEmpty]: Start isEmpty. Operand 3811 states and 4802 transitions. [2021-01-07 01:58:50,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-01-07 01:58:50,203 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:58:50,203 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:58:50,204 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-07 01:58:50,204 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:58:50,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:58:50,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1408911438, now seen corresponding path program 1 times [2021-01-07 01:58:50,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:58:50,205 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112760841] [2021-01-07 01:58:50,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:58:50,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:58:50,499 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:58:50,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112760841] [2021-01-07 01:58:50,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944086445] [2021-01-07 01:58:50,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:58:51,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:58:51,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 1829 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-07 01:58:51,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:58:51,778 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 01:58:51,778 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 01:58:51,779 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2021-01-07 01:58:51,779 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878973278] [2021-01-07 01:58:51,780 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:58:51,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:58:51,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:58:51,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-01-07 01:58:51,781 INFO L87 Difference]: Start difference. First operand 3811 states and 4802 transitions. Second operand 3 states. [2021-01-07 01:58:52,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:58:52,073 INFO L93 Difference]: Finished difference Result 7585 states and 9561 transitions. [2021-01-07 01:58:52,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:58:52,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 179 [2021-01-07 01:58:52,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:58:52,092 INFO L225 Difference]: With dead ends: 7585 [2021-01-07 01:58:52,093 INFO L226 Difference]: Without dead ends: 3811 [2021-01-07 01:58:52,106 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-01-07 01:58:52,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3811 states. [2021-01-07 01:58:52,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3811 to 3811. [2021-01-07 01:58:52,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3811 states. [2021-01-07 01:58:52,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3811 states to 3811 states and 4798 transitions. [2021-01-07 01:58:52,450 INFO L78 Accepts]: Start accepts. Automaton has 3811 states and 4798 transitions. Word has length 179 [2021-01-07 01:58:52,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:58:52,451 INFO L481 AbstractCegarLoop]: Abstraction has 3811 states and 4798 transitions. [2021-01-07 01:58:52,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:58:52,451 INFO L276 IsEmpty]: Start isEmpty. Operand 3811 states and 4798 transitions. [2021-01-07 01:58:52,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2021-01-07 01:58:52,457 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:58:52,457 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:58:52,670 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-01-07 01:58:52,671 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:58:52,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:58:52,672 INFO L82 PathProgramCache]: Analyzing trace with hash 2103031818, now seen corresponding path program 1 times [2021-01-07 01:58:52,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:58:52,673 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794692759] [2021-01-07 01:58:52,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:58:52,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:58:52,943 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 01:58:52,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794692759] [2021-01-07 01:58:52,944 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:58:52,944 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:58:52,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695619323] [2021-01-07 01:58:52,945 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:58:52,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:58:52,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:58:52,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:58:52,946 INFO L87 Difference]: Start difference. First operand 3811 states and 4798 transitions. Second operand 3 states. [2021-01-07 01:58:54,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:58:54,210 INFO L93 Difference]: Finished difference Result 10048 states and 12717 transitions. [2021-01-07 01:58:54,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:58:54,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2021-01-07 01:58:54,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:58:54,234 INFO L225 Difference]: With dead ends: 10048 [2021-01-07 01:58:54,235 INFO L226 Difference]: Without dead ends: 6225 [2021-01-07 01:58:54,244 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:58:54,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6225 states. [2021-01-07 01:58:54,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6225 to 6225. [2021-01-07 01:58:54,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6225 states. [2021-01-07 01:58:54,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6225 states to 6225 states and 7885 transitions. [2021-01-07 01:58:54,797 INFO L78 Accepts]: Start accepts. Automaton has 6225 states and 7885 transitions. Word has length 181 [2021-01-07 01:58:54,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:58:54,798 INFO L481 AbstractCegarLoop]: Abstraction has 6225 states and 7885 transitions. [2021-01-07 01:58:54,798 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:58:54,798 INFO L276 IsEmpty]: Start isEmpty. Operand 6225 states and 7885 transitions. [2021-01-07 01:58:54,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2021-01-07 01:58:54,806 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:58:54,806 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:58:54,807 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-07 01:58:54,807 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:58:54,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:58:54,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1748034804, now seen corresponding path program 1 times [2021-01-07 01:58:54,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:58:54,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361350365] [2021-01-07 01:58:54,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:58:54,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:58:55,131 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-07 01:58:55,131 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361350365] [2021-01-07 01:58:55,132 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:58:55,133 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 01:58:55,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604587551] [2021-01-07 01:58:55,134 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 01:58:55,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:58:55,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 01:58:55,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 01:58:55,135 INFO L87 Difference]: Start difference. First operand 6225 states and 7885 transitions. Second operand 4 states. [2021-01-07 01:58:55,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:58:55,828 INFO L93 Difference]: Finished difference Result 13699 states and 17373 transitions. [2021-01-07 01:58:55,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 01:58:55,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2021-01-07 01:58:55,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:58:55,849 INFO L225 Difference]: With dead ends: 13699 [2021-01-07 01:58:55,850 INFO L226 Difference]: Without dead ends: 7511 [2021-01-07 01:58:55,862 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:58:55,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7511 states. [2021-01-07 01:58:56,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7511 to 6229. [2021-01-07 01:58:56,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6229 states. [2021-01-07 01:58:56,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6229 states to 6229 states and 7889 transitions. [2021-01-07 01:58:56,404 INFO L78 Accepts]: Start accepts. Automaton has 6229 states and 7889 transitions. Word has length 181 [2021-01-07 01:58:56,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:58:56,404 INFO L481 AbstractCegarLoop]: Abstraction has 6229 states and 7889 transitions. [2021-01-07 01:58:56,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 01:58:56,405 INFO L276 IsEmpty]: Start isEmpty. Operand 6229 states and 7889 transitions. [2021-01-07 01:58:56,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-01-07 01:58:56,412 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:58:56,413 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:58:56,413 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-07 01:58:56,413 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:58:56,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:58:56,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1669980789, now seen corresponding path program 1 times [2021-01-07 01:58:56,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:58:56,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606076191] [2021-01-07 01:58:56,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:58:56,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:58:56,684 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 01:58:56,685 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606076191] [2021-01-07 01:58:56,685 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882693510] [2021-01-07 01:58:56,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:58:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:58:57,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 1908 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-07 01:58:57,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:58:57,721 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 01:58:57,722 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 01:58:57,722 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2021-01-07 01:58:57,722 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761062399] [2021-01-07 01:58:57,724 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 01:58:57,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:58:57,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 01:58:57,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-01-07 01:58:57,726 INFO L87 Difference]: Start difference. First operand 6229 states and 7889 transitions. Second operand 6 states. [2021-01-07 01:59:01,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:59:01,101 INFO L93 Difference]: Finished difference Result 42285 states and 54325 transitions. [2021-01-07 01:59:01,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-07 01:59:01,102 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 184 [2021-01-07 01:59:01,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:59:01,214 INFO L225 Difference]: With dead ends: 42285 [2021-01-07 01:59:01,214 INFO L226 Difference]: Without dead ends: 36093 [2021-01-07 01:59:01,237 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-01-07 01:59:01,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36093 states. [2021-01-07 01:59:02,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36093 to 6277. [2021-01-07 01:59:02,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6277 states. [2021-01-07 01:59:02,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6277 states to 6277 states and 7937 transitions. [2021-01-07 01:59:02,358 INFO L78 Accepts]: Start accepts. Automaton has 6277 states and 7937 transitions. Word has length 184 [2021-01-07 01:59:02,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:59:02,358 INFO L481 AbstractCegarLoop]: Abstraction has 6277 states and 7937 transitions. [2021-01-07 01:59:02,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 01:59:02,358 INFO L276 IsEmpty]: Start isEmpty. Operand 6277 states and 7937 transitions. [2021-01-07 01:59:02,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-01-07 01:59:02,365 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:59:02,366 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:59:02,580 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-01-07 01:59:02,581 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:59:02,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:59:02,583 INFO L82 PathProgramCache]: Analyzing trace with hash 480694049, now seen corresponding path program 1 times [2021-01-07 01:59:02,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:59:02,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457468132] [2021-01-07 01:59:02,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:59:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:59:02,849 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 01:59:02,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457468132] [2021-01-07 01:59:02,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987639585] [2021-01-07 01:59:02,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:59:03,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:59:03,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 1921 conjuncts, 8 conjunts are in the unsatisfiable core [2021-01-07 01:59:03,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:59:03,765 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 01:59:03,766 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 01:59:03,766 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4] total 10 [2021-01-07 01:59:03,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276609523] [2021-01-07 01:59:03,767 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 01:59:03,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:59:03,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 01:59:03,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-01-07 01:59:03,768 INFO L87 Difference]: Start difference. First operand 6277 states and 7937 transitions. Second operand 8 states. [2021-01-07 01:59:10,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:59:10,468 INFO L93 Difference]: Finished difference Result 60881 states and 78193 transitions. [2021-01-07 01:59:10,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-01-07 01:59:10,468 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 185 [2021-01-07 01:59:10,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:59:10,599 INFO L225 Difference]: With dead ends: 60881 [2021-01-07 01:59:10,599 INFO L226 Difference]: Without dead ends: 54641 [2021-01-07 01:59:10,623 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=251, Invalid=805, Unknown=0, NotChecked=0, Total=1056 [2021-01-07 01:59:10,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54641 states. [2021-01-07 01:59:11,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54641 to 6317. [2021-01-07 01:59:11,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6317 states. [2021-01-07 01:59:11,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6317 states to 6317 states and 7977 transitions. [2021-01-07 01:59:11,797 INFO L78 Accepts]: Start accepts. Automaton has 6317 states and 7977 transitions. Word has length 185 [2021-01-07 01:59:11,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:59:11,798 INFO L481 AbstractCegarLoop]: Abstraction has 6317 states and 7977 transitions. [2021-01-07 01:59:11,798 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 01:59:11,798 INFO L276 IsEmpty]: Start isEmpty. Operand 6317 states and 7977 transitions. [2021-01-07 01:59:11,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-01-07 01:59:11,805 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:59:11,805 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:59:12,018 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-01-07 01:59:12,019 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:59:12,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:59:12,019 INFO L82 PathProgramCache]: Analyzing trace with hash 699548767, now seen corresponding path program 1 times [2021-01-07 01:59:12,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:59:12,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729330354] [2021-01-07 01:59:12,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:59:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:59:12,349 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 01:59:12,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729330354] [2021-01-07 01:59:12,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:59:12,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 01:59:12,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100356003] [2021-01-07 01:59:12,351 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 01:59:12,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:59:12,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 01:59:12,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-01-07 01:59:12,352 INFO L87 Difference]: Start difference. First operand 6317 states and 7977 transitions. Second operand 7 states. [2021-01-07 01:59:15,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:59:15,946 INFO L93 Difference]: Finished difference Result 29795 states and 37637 transitions. [2021-01-07 01:59:15,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-07 01:59:15,946 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 185 [2021-01-07 01:59:15,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:59:15,989 INFO L225 Difference]: With dead ends: 29795 [2021-01-07 01:59:15,989 INFO L226 Difference]: Without dead ends: 23515 [2021-01-07 01:59:16,006 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-01-07 01:59:16,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23515 states. [2021-01-07 01:59:17,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23515 to 6393. [2021-01-07 01:59:17,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6393 states. [2021-01-07 01:59:17,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6393 states to 6393 states and 8073 transitions. [2021-01-07 01:59:17,064 INFO L78 Accepts]: Start accepts. Automaton has 6393 states and 8073 transitions. Word has length 185 [2021-01-07 01:59:17,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:59:17,065 INFO L481 AbstractCegarLoop]: Abstraction has 6393 states and 8073 transitions. [2021-01-07 01:59:17,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 01:59:17,065 INFO L276 IsEmpty]: Start isEmpty. Operand 6393 states and 8073 transitions. [2021-01-07 01:59:17,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-01-07 01:59:17,069 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:59:17,069 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:59:17,069 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-07 01:59:17,069 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:59:17,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:59:17,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1431801955, now seen corresponding path program 1 times [2021-01-07 01:59:17,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:59:17,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109803706] [2021-01-07 01:59:17,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:59:17,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:59:17,326 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 01:59:17,326 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109803706] [2021-01-07 01:59:17,326 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:59:17,326 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-07 01:59:17,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400947564] [2021-01-07 01:59:17,327 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 01:59:17,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:59:17,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 01:59:17,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-01-07 01:59:17,328 INFO L87 Difference]: Start difference. First operand 6393 states and 8073 transitions. Second operand 8 states. [2021-01-07 01:59:21,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:59:21,384 INFO L93 Difference]: Finished difference Result 29863 states and 37721 transitions. [2021-01-07 01:59:21,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-07 01:59:21,385 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 185 [2021-01-07 01:59:21,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:59:21,420 INFO L225 Difference]: With dead ends: 29863 [2021-01-07 01:59:21,420 INFO L226 Difference]: Without dead ends: 23507 [2021-01-07 01:59:21,433 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2021-01-07 01:59:21,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23507 states. [2021-01-07 01:59:22,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23507 to 6401. [2021-01-07 01:59:22,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6401 states. [2021-01-07 01:59:22,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6401 states to 6401 states and 8081 transitions. [2021-01-07 01:59:22,578 INFO L78 Accepts]: Start accepts. Automaton has 6401 states and 8081 transitions. Word has length 185 [2021-01-07 01:59:22,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:59:22,579 INFO L481 AbstractCegarLoop]: Abstraction has 6401 states and 8081 transitions. [2021-01-07 01:59:22,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 01:59:22,579 INFO L276 IsEmpty]: Start isEmpty. Operand 6401 states and 8081 transitions. [2021-01-07 01:59:22,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-01-07 01:59:22,583 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:59:22,584 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:59:22,584 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-07 01:59:22,584 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:59:22,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:59:22,584 INFO L82 PathProgramCache]: Analyzing trace with hash 889999963, now seen corresponding path program 1 times [2021-01-07 01:59:22,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:59:22,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415903935] [2021-01-07 01:59:22,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:59:22,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:59:22,838 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 01:59:22,838 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415903935] [2021-01-07 01:59:22,838 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:59:22,839 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-07 01:59:22,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250612538] [2021-01-07 01:59:22,842 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 01:59:22,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:59:22,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 01:59:22,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-01-07 01:59:22,843 INFO L87 Difference]: Start difference. First operand 6401 states and 8081 transitions. Second operand 8 states. [2021-01-07 01:59:27,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:59:27,682 INFO L93 Difference]: Finished difference Result 31499 states and 39979 transitions. [2021-01-07 01:59:27,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-07 01:59:27,682 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 185 [2021-01-07 01:59:27,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:59:27,716 INFO L225 Difference]: With dead ends: 31499 [2021-01-07 01:59:27,717 INFO L226 Difference]: Without dead ends: 25135 [2021-01-07 01:59:27,728 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2021-01-07 01:59:27,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25135 states. [2021-01-07 01:59:28,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25135 to 6409. [2021-01-07 01:59:28,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6409 states. [2021-01-07 01:59:28,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6409 states to 6409 states and 8089 transitions. [2021-01-07 01:59:28,748 INFO L78 Accepts]: Start accepts. Automaton has 6409 states and 8089 transitions. Word has length 185 [2021-01-07 01:59:28,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:59:28,748 INFO L481 AbstractCegarLoop]: Abstraction has 6409 states and 8089 transitions. [2021-01-07 01:59:28,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 01:59:28,748 INFO L276 IsEmpty]: Start isEmpty. Operand 6409 states and 8089 transitions. [2021-01-07 01:59:28,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-01-07 01:59:28,754 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:59:28,755 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:59:28,755 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-07 01:59:28,755 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:59:28,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:59:28,756 INFO L82 PathProgramCache]: Analyzing trace with hash 266718361, now seen corresponding path program 1 times [2021-01-07 01:59:28,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:59:28,756 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850298991] [2021-01-07 01:59:28,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:59:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:59:29,009 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 01:59:29,009 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850298991] [2021-01-07 01:59:29,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:59:29,009 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-07 01:59:29,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976289673] [2021-01-07 01:59:29,010 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 01:59:29,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:59:29,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 01:59:29,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-01-07 01:59:29,012 INFO L87 Difference]: Start difference. First operand 6409 states and 8089 transitions. Second operand 8 states. [2021-01-07 01:59:33,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:59:33,804 INFO L93 Difference]: Finished difference Result 29863 states and 37713 transitions. [2021-01-07 01:59:33,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-07 01:59:33,804 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 185 [2021-01-07 01:59:33,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:59:33,831 INFO L225 Difference]: With dead ends: 29863 [2021-01-07 01:59:33,831 INFO L226 Difference]: Without dead ends: 23491 [2021-01-07 01:59:33,844 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2021-01-07 01:59:33,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23491 states. [2021-01-07 01:59:35,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23491 to 6417. [2021-01-07 01:59:35,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6417 states. [2021-01-07 01:59:35,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6417 states to 6417 states and 8097 transitions. [2021-01-07 01:59:35,013 INFO L78 Accepts]: Start accepts. Automaton has 6417 states and 8097 transitions. Word has length 185 [2021-01-07 01:59:35,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:59:35,013 INFO L481 AbstractCegarLoop]: Abstraction has 6417 states and 8097 transitions. [2021-01-07 01:59:35,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 01:59:35,014 INFO L276 IsEmpty]: Start isEmpty. Operand 6417 states and 8097 transitions. [2021-01-07 01:59:35,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-01-07 01:59:35,020 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:59:35,020 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:59:35,020 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-07 01:59:35,021 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:59:35,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:59:35,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1656012375, now seen corresponding path program 1 times [2021-01-07 01:59:35,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:59:35,022 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384024919] [2021-01-07 01:59:35,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:59:35,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:59:35,280 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 01:59:35,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384024919] [2021-01-07 01:59:35,280 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:59:35,281 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-07 01:59:35,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866042797] [2021-01-07 01:59:35,283 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 01:59:35,283 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:59:35,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 01:59:35,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-01-07 01:59:35,284 INFO L87 Difference]: Start difference. First operand 6417 states and 8097 transitions. Second operand 8 states. [2021-01-07 01:59:40,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:59:40,853 INFO L93 Difference]: Finished difference Result 28927 states and 36567 transitions. [2021-01-07 01:59:40,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-07 01:59:40,854 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 185 [2021-01-07 01:59:40,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:59:40,881 INFO L225 Difference]: With dead ends: 28927 [2021-01-07 01:59:40,881 INFO L226 Difference]: Without dead ends: 22547 [2021-01-07 01:59:40,894 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2021-01-07 01:59:40,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22547 states. [2021-01-07 01:59:42,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22547 to 6425. [2021-01-07 01:59:42,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6425 states. [2021-01-07 01:59:42,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6425 states to 6425 states and 8105 transitions. [2021-01-07 01:59:42,109 INFO L78 Accepts]: Start accepts. Automaton has 6425 states and 8105 transitions. Word has length 185 [2021-01-07 01:59:42,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:59:42,109 INFO L481 AbstractCegarLoop]: Abstraction has 6425 states and 8105 transitions. [2021-01-07 01:59:42,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 01:59:42,110 INFO L276 IsEmpty]: Start isEmpty. Operand 6425 states and 8105 transitions. [2021-01-07 01:59:42,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2021-01-07 01:59:42,115 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:59:42,116 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:59:42,116 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-07 01:59:42,116 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:59:42,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:59:42,116 INFO L82 PathProgramCache]: Analyzing trace with hash -421455180, now seen corresponding path program 1 times [2021-01-07 01:59:42,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:59:42,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566771066] [2021-01-07 01:59:42,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:59:42,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:59:42,290 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 01:59:42,290 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566771066] [2021-01-07 01:59:42,290 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:59:42,291 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 01:59:42,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175054372] [2021-01-07 01:59:42,291 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 01:59:42,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:59:42,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 01:59:42,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 01:59:42,292 INFO L87 Difference]: Start difference. First operand 6425 states and 8105 transitions. Second operand 4 states. [2021-01-07 01:59:45,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:59:45,986 INFO L93 Difference]: Finished difference Result 23113 states and 29163 transitions. [2021-01-07 01:59:45,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 01:59:45,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2021-01-07 01:59:45,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:59:46,010 INFO L225 Difference]: With dead ends: 23113 [2021-01-07 01:59:46,010 INFO L226 Difference]: Without dead ends: 16725 [2021-01-07 01:59:46,018 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:59:46,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16725 states. [2021-01-07 01:59:47,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16725 to 6425. [2021-01-07 01:59:47,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6425 states. [2021-01-07 01:59:47,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6425 states to 6425 states and 8093 transitions. [2021-01-07 01:59:47,324 INFO L78 Accepts]: Start accepts. Automaton has 6425 states and 8093 transitions. Word has length 186 [2021-01-07 01:59:47,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:59:47,324 INFO L481 AbstractCegarLoop]: Abstraction has 6425 states and 8093 transitions. [2021-01-07 01:59:47,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 01:59:47,324 INFO L276 IsEmpty]: Start isEmpty. Operand 6425 states and 8093 transitions. [2021-01-07 01:59:47,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-01-07 01:59:47,328 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:59:47,328 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:59:47,328 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-07 01:59:47,328 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:59:47,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:59:47,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1886984934, now seen corresponding path program 1 times [2021-01-07 01:59:47,329 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:59:47,329 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055445267] [2021-01-07 01:59:47,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:59:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:59:47,573 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 01:59:47,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055445267] [2021-01-07 01:59:47,573 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:59:47,573 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 01:59:47,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609443621] [2021-01-07 01:59:47,574 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 01:59:47,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:59:47,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 01:59:47,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:59:47,575 INFO L87 Difference]: Start difference. First operand 6425 states and 8093 transitions. Second operand 5 states. [2021-01-07 01:59:50,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:59:50,640 INFO L93 Difference]: Finished difference Result 17941 states and 22943 transitions. [2021-01-07 01:59:50,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 01:59:50,641 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 187 [2021-01-07 01:59:50,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:59:50,652 INFO L225 Difference]: With dead ends: 17941 [2021-01-07 01:59:50,653 INFO L226 Difference]: Without dead ends: 11553 [2021-01-07 01:59:50,660 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-07 01:59:50,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11553 states. [2021-01-07 01:59:52,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11553 to 6755. [2021-01-07 01:59:52,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6755 states. [2021-01-07 01:59:52,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6755 states to 6755 states and 8423 transitions. [2021-01-07 01:59:52,025 INFO L78 Accepts]: Start accepts. Automaton has 6755 states and 8423 transitions. Word has length 187 [2021-01-07 01:59:52,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:59:52,026 INFO L481 AbstractCegarLoop]: Abstraction has 6755 states and 8423 transitions. [2021-01-07 01:59:52,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 01:59:52,026 INFO L276 IsEmpty]: Start isEmpty. Operand 6755 states and 8423 transitions. [2021-01-07 01:59:52,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2021-01-07 01:59:52,030 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:59:52,030 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:59:52,030 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-07 01:59:52,030 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:59:52,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:59:52,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1366108646, now seen corresponding path program 1 times [2021-01-07 01:59:52,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:59:52,031 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077160385] [2021-01-07 01:59:52,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:59:52,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:59:52,276 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 01:59:52,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077160385] [2021-01-07 01:59:52,276 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:59:52,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 01:59:52,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466598011] [2021-01-07 01:59:52,279 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 01:59:52,279 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:59:52,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 01:59:52,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 01:59:52,280 INFO L87 Difference]: Start difference. First operand 6755 states and 8423 transitions. Second operand 6 states. [2021-01-07 01:59:57,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:59:57,127 INFO L93 Difference]: Finished difference Result 24287 states and 30325 transitions. [2021-01-07 01:59:57,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 01:59:57,129 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 191 [2021-01-07 01:59:57,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:59:57,150 INFO L225 Difference]: With dead ends: 24287 [2021-01-07 01:59:57,150 INFO L226 Difference]: Without dead ends: 17569 [2021-01-07 01:59:57,159 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-01-07 01:59:57,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17569 states. [2021-01-07 01:59:58,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17569 to 6831. [2021-01-07 01:59:58,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6831 states. [2021-01-07 01:59:58,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6831 states to 6831 states and 8519 transitions. [2021-01-07 01:59:58,739 INFO L78 Accepts]: Start accepts. Automaton has 6831 states and 8519 transitions. Word has length 191 [2021-01-07 01:59:58,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:59:58,740 INFO L481 AbstractCegarLoop]: Abstraction has 6831 states and 8519 transitions. [2021-01-07 01:59:58,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 01:59:58,740 INFO L276 IsEmpty]: Start isEmpty. Operand 6831 states and 8519 transitions. [2021-01-07 01:59:58,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2021-01-07 01:59:58,743 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:59:58,744 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:59:58,744 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-07 01:59:58,744 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:59:58,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:59:58,744 INFO L82 PathProgramCache]: Analyzing trace with hash -894752296, now seen corresponding path program 1 times [2021-01-07 01:59:58,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:59:58,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273350334] [2021-01-07 01:59:58,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:59:58,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:59:59,005 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 01:59:59,005 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273350334] [2021-01-07 01:59:59,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:59:59,006 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 01:59:59,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485599163] [2021-01-07 01:59:59,006 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 01:59:59,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:59:59,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 01:59:59,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-01-07 01:59:59,008 INFO L87 Difference]: Start difference. First operand 6831 states and 8519 transitions. Second operand 7 states. [2021-01-07 02:00:04,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 02:00:04,892 INFO L93 Difference]: Finished difference Result 24355 states and 30409 transitions. [2021-01-07 02:00:04,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 02:00:04,892 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 191 [2021-01-07 02:00:04,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 02:00:04,911 INFO L225 Difference]: With dead ends: 24355 [2021-01-07 02:00:04,911 INFO L226 Difference]: Without dead ends: 17561 [2021-01-07 02:00:04,920 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-01-07 02:00:04,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17561 states. [2021-01-07 02:00:06,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17561 to 6839. [2021-01-07 02:00:06,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6839 states. [2021-01-07 02:00:06,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6839 states to 6839 states and 8527 transitions. [2021-01-07 02:00:06,552 INFO L78 Accepts]: Start accepts. Automaton has 6839 states and 8527 transitions. Word has length 191 [2021-01-07 02:00:06,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 02:00:06,552 INFO L481 AbstractCegarLoop]: Abstraction has 6839 states and 8527 transitions. [2021-01-07 02:00:06,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 02:00:06,552 INFO L276 IsEmpty]: Start isEmpty. Operand 6839 states and 8527 transitions. [2021-01-07 02:00:06,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2021-01-07 02:00:06,558 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 02:00:06,558 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 02:00:06,558 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-07 02:00:06,558 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 02:00:06,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 02:00:06,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1268864278, now seen corresponding path program 1 times [2021-01-07 02:00:06,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 02:00:06,559 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925656357] [2021-01-07 02:00:06,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 02:00:06,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 02:00:06,793 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 02:00:06,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925656357] [2021-01-07 02:00:06,793 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 02:00:06,793 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 02:00:06,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702253802] [2021-01-07 02:00:06,794 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 02:00:06,794 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 02:00:06,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 02:00:06,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-01-07 02:00:06,795 INFO L87 Difference]: Start difference. First operand 6839 states and 8527 transitions. Second operand 7 states. [2021-01-07 02:00:12,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 02:00:12,608 INFO L93 Difference]: Finished difference Result 24099 states and 30149 transitions. [2021-01-07 02:00:12,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 02:00:12,608 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 191 [2021-01-07 02:00:12,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 02:00:12,631 INFO L225 Difference]: With dead ends: 24099 [2021-01-07 02:00:12,631 INFO L226 Difference]: Without dead ends: 17297 [2021-01-07 02:00:12,641 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-01-07 02:00:12,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17297 states. [2021-01-07 02:00:14,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17297 to 6847. [2021-01-07 02:00:14,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6847 states. [2021-01-07 02:00:14,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6847 states to 6847 states and 8535 transitions. [2021-01-07 02:00:14,416 INFO L78 Accepts]: Start accepts. Automaton has 6847 states and 8535 transitions. Word has length 191 [2021-01-07 02:00:14,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 02:00:14,416 INFO L481 AbstractCegarLoop]: Abstraction has 6847 states and 8535 transitions. [2021-01-07 02:00:14,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 02:00:14,416 INFO L276 IsEmpty]: Start isEmpty. Operand 6847 states and 8535 transitions. [2021-01-07 02:00:14,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2021-01-07 02:00:14,421 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 02:00:14,421 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 02:00:14,421 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-07 02:00:14,421 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 02:00:14,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 02:00:14,422 INFO L82 PathProgramCache]: Analyzing trace with hash -704301100, now seen corresponding path program 1 times [2021-01-07 02:00:14,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 02:00:14,422 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444809084] [2021-01-07 02:00:14,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 02:00:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 02:00:14,662 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 02:00:14,662 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444809084] [2021-01-07 02:00:14,663 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 02:00:14,663 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 02:00:14,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006345546] [2021-01-07 02:00:14,663 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 02:00:14,663 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 02:00:14,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 02:00:14,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-01-07 02:00:14,664 INFO L87 Difference]: Start difference. First operand 6847 states and 8535 transitions. Second operand 7 states. [2021-01-07 02:00:20,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 02:00:20,883 INFO L93 Difference]: Finished difference Result 24355 states and 30401 transitions. [2021-01-07 02:00:20,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 02:00:20,883 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 191 [2021-01-07 02:00:20,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 02:00:20,901 INFO L225 Difference]: With dead ends: 24355 [2021-01-07 02:00:20,902 INFO L226 Difference]: Without dead ends: 17545 [2021-01-07 02:00:20,911 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-01-07 02:00:20,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17545 states. [2021-01-07 02:00:22,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17545 to 6855. [2021-01-07 02:00:22,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6855 states. [2021-01-07 02:00:22,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6855 states to 6855 states and 8543 transitions. [2021-01-07 02:00:22,732 INFO L78 Accepts]: Start accepts. Automaton has 6855 states and 8543 transitions. Word has length 191 [2021-01-07 02:00:22,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 02:00:22,732 INFO L481 AbstractCegarLoop]: Abstraction has 6855 states and 8543 transitions. [2021-01-07 02:00:22,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 02:00:22,732 INFO L276 IsEmpty]: Start isEmpty. Operand 6855 states and 8543 transitions. [2021-01-07 02:00:22,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2021-01-07 02:00:22,736 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 02:00:22,736 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 02:00:22,736 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-07 02:00:22,736 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 02:00:22,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 02:00:22,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1327582702, now seen corresponding path program 1 times [2021-01-07 02:00:22,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 02:00:22,737 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487412188] [2021-01-07 02:00:22,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 02:00:22,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 02:00:23,007 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 02:00:23,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487412188] [2021-01-07 02:00:23,008 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 02:00:23,008 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 02:00:23,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008257233] [2021-01-07 02:00:23,009 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 02:00:23,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 02:00:23,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 02:00:23,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-01-07 02:00:23,010 INFO L87 Difference]: Start difference. First operand 6855 states and 8543 transitions. Second operand 7 states. [2021-01-07 02:00:28,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 02:00:28,851 INFO L93 Difference]: Finished difference Result 23695 states and 29593 transitions. [2021-01-07 02:00:28,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 02:00:28,851 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 191 [2021-01-07 02:00:28,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 02:00:28,870 INFO L225 Difference]: With dead ends: 23695 [2021-01-07 02:00:28,870 INFO L226 Difference]: Without dead ends: 16877 [2021-01-07 02:00:28,878 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-01-07 02:00:28,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16877 states. [2021-01-07 02:00:30,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16877 to 6755. [2021-01-07 02:00:30,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6755 states. [2021-01-07 02:00:30,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6755 states to 6755 states and 8423 transitions. [2021-01-07 02:00:30,768 INFO L78 Accepts]: Start accepts. Automaton has 6755 states and 8423 transitions. Word has length 191 [2021-01-07 02:00:30,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 02:00:30,768 INFO L481 AbstractCegarLoop]: Abstraction has 6755 states and 8423 transitions. [2021-01-07 02:00:30,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 02:00:30,768 INFO L276 IsEmpty]: Start isEmpty. Operand 6755 states and 8423 transitions. [2021-01-07 02:00:30,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2021-01-07 02:00:30,774 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 02:00:30,774 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 02:00:30,774 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-07 02:00:30,774 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 02:00:30,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 02:00:30,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1950880296, now seen corresponding path program 1 times [2021-01-07 02:00:30,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 02:00:30,775 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385102095] [2021-01-07 02:00:30,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 02:00:30,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 02:00:30,963 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 02:00:30,964 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385102095] [2021-01-07 02:00:30,964 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 02:00:30,964 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 02:00:30,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959103377] [2021-01-07 02:00:30,964 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 02:00:30,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 02:00:30,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 02:00:30,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 02:00:30,965 INFO L87 Difference]: Start difference. First operand 6755 states and 8423 transitions. Second operand 3 states. [2021-01-07 02:00:32,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 02:00:32,976 INFO L93 Difference]: Finished difference Result 13012 states and 16234 transitions. [2021-01-07 02:00:32,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 02:00:32,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 191 [2021-01-07 02:00:32,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 02:00:32,985 INFO L225 Difference]: With dead ends: 13012 [2021-01-07 02:00:32,985 INFO L226 Difference]: Without dead ends: 6294 [2021-01-07 02:00:32,992 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 02:00:32,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6294 states. [2021-01-07 02:00:34,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6294 to 6223. [2021-01-07 02:00:34,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6223 states. [2021-01-07 02:00:34,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6223 states to 6223 states and 7757 transitions. [2021-01-07 02:00:34,598 INFO L78 Accepts]: Start accepts. Automaton has 6223 states and 7757 transitions. Word has length 191 [2021-01-07 02:00:34,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 02:00:34,599 INFO L481 AbstractCegarLoop]: Abstraction has 6223 states and 7757 transitions. [2021-01-07 02:00:34,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 02:00:34,599 INFO L276 IsEmpty]: Start isEmpty. Operand 6223 states and 7757 transitions. [2021-01-07 02:00:34,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2021-01-07 02:00:34,602 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 02:00:34,602 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 02:00:34,602 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-07 02:00:34,603 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 02:00:34,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 02:00:34,603 INFO L82 PathProgramCache]: Analyzing trace with hash 843935922, now seen corresponding path program 1 times [2021-01-07 02:00:34,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 02:00:34,603 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536389479] [2021-01-07 02:00:34,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 02:00:34,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 02:00:34,892 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 02:00:34,893 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536389479] [2021-01-07 02:00:34,893 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 02:00:34,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 02:00:34,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460623532] [2021-01-07 02:00:34,894 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 02:00:34,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 02:00:34,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 02:00:34,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-01-07 02:00:34,895 INFO L87 Difference]: Start difference. First operand 6223 states and 7757 transitions. Second operand 7 states. [2021-01-07 02:00:43,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 02:00:43,396 INFO L93 Difference]: Finished difference Result 28589 states and 35741 transitions. [2021-01-07 02:00:43,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-07 02:00:43,397 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 196 [2021-01-07 02:00:43,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 02:00:43,417 INFO L225 Difference]: With dead ends: 28589 [2021-01-07 02:00:43,417 INFO L226 Difference]: Without dead ends: 22403 [2021-01-07 02:00:43,424 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-01-07 02:00:43,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22403 states. [2021-01-07 02:00:45,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22403 to 6279. [2021-01-07 02:00:45,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6279 states. [2021-01-07 02:00:45,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6279 states to 6279 states and 7817 transitions. [2021-01-07 02:00:45,176 INFO L78 Accepts]: Start accepts. Automaton has 6279 states and 7817 transitions. Word has length 196 [2021-01-07 02:00:45,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 02:00:45,176 INFO L481 AbstractCegarLoop]: Abstraction has 6279 states and 7817 transitions. [2021-01-07 02:00:45,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 02:00:45,176 INFO L276 IsEmpty]: Start isEmpty. Operand 6279 states and 7817 transitions. [2021-01-07 02:00:45,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2021-01-07 02:00:45,180 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 02:00:45,180 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 02:00:45,180 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-07 02:00:45,180 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 02:00:45,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 02:00:45,181 INFO L82 PathProgramCache]: Analyzing trace with hash -136567977, now seen corresponding path program 1 times [2021-01-07 02:00:45,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 02:00:45,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443258133] [2021-01-07 02:00:45,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 02:00:45,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 02:00:45,420 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 02:00:45,420 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443258133] [2021-01-07 02:00:45,421 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 02:00:45,421 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 02:00:45,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439161346] [2021-01-07 02:00:45,422 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 02:00:45,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 02:00:45,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 02:00:45,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 02:00:45,423 INFO L87 Difference]: Start difference. First operand 6279 states and 7817 transitions. Second operand 6 states. [2021-01-07 02:00:47,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 02:00:47,526 INFO L93 Difference]: Finished difference Result 12592 states and 15680 transitions. [2021-01-07 02:00:47,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 02:00:47,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 198 [2021-01-07 02:00:47,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 02:00:47,534 INFO L225 Difference]: With dead ends: 12592 [2021-01-07 02:00:47,534 INFO L226 Difference]: Without dead ends: 6350 [2021-01-07 02:00:47,539 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-07 02:00:47,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6350 states. [2021-01-07 02:00:49,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6350 to 6223. [2021-01-07 02:00:49,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6223 states. [2021-01-07 02:00:49,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6223 states to 6223 states and 7753 transitions. [2021-01-07 02:00:49,306 INFO L78 Accepts]: Start accepts. Automaton has 6223 states and 7753 transitions. Word has length 198 [2021-01-07 02:00:49,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 02:00:49,306 INFO L481 AbstractCegarLoop]: Abstraction has 6223 states and 7753 transitions. [2021-01-07 02:00:49,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 02:00:49,306 INFO L276 IsEmpty]: Start isEmpty. Operand 6223 states and 7753 transitions. [2021-01-07 02:00:49,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2021-01-07 02:00:49,309 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 02:00:49,310 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 02:00:49,310 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-07 02:00:49,310 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 02:00:49,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 02:00:49,310 INFO L82 PathProgramCache]: Analyzing trace with hash -2475269, now seen corresponding path program 1 times [2021-01-07 02:00:49,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 02:00:49,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577068637] [2021-01-07 02:00:49,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 02:00:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 02:00:49,522 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 02:00:49,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577068637] [2021-01-07 02:00:49,526 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 02:00:49,526 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 02:00:49,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709049100] [2021-01-07 02:00:49,527 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 02:00:49,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 02:00:49,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 02:00:49,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-01-07 02:00:49,528 INFO L87 Difference]: Start difference. First operand 6223 states and 7753 transitions. Second operand 7 states. [2021-01-07 02:00:58,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 02:00:58,491 INFO L93 Difference]: Finished difference Result 28581 states and 35717 transitions. [2021-01-07 02:00:58,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-07 02:00:58,492 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 199 [2021-01-07 02:00:58,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 02:00:58,513 INFO L225 Difference]: With dead ends: 28581 [2021-01-07 02:00:58,513 INFO L226 Difference]: Without dead ends: 22395 [2021-01-07 02:00:58,522 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-01-07 02:00:58,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22395 states. [2021-01-07 02:01:00,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22395 to 6283. [2021-01-07 02:01:00,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6283 states. [2021-01-07 02:01:00,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6283 states to 6283 states and 7817 transitions. [2021-01-07 02:01:00,468 INFO L78 Accepts]: Start accepts. Automaton has 6283 states and 7817 transitions. Word has length 199 [2021-01-07 02:01:00,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 02:01:00,469 INFO L481 AbstractCegarLoop]: Abstraction has 6283 states and 7817 transitions. [2021-01-07 02:01:00,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 02:01:00,469 INFO L276 IsEmpty]: Start isEmpty. Operand 6283 states and 7817 transitions. [2021-01-07 02:01:00,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2021-01-07 02:01:00,473 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 02:01:00,473 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 02:01:00,473 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-07 02:01:00,473 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 02:01:00,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 02:01:00,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1362175114, now seen corresponding path program 1 times [2021-01-07 02:01:00,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 02:01:00,474 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675651907] [2021-01-07 02:01:00,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 02:01:00,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 02:01:00,679 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 02:01:00,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675651907] [2021-01-07 02:01:00,680 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 02:01:00,680 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 02:01:00,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092280883] [2021-01-07 02:01:00,681 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 02:01:00,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 02:01:00,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 02:01:00,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-01-07 02:01:00,683 INFO L87 Difference]: Start difference. First operand 6283 states and 7817 transitions. Second operand 7 states. [2021-01-07 02:01:10,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 02:01:10,062 INFO L93 Difference]: Finished difference Result 28633 states and 35769 transitions. [2021-01-07 02:01:10,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-07 02:01:10,063 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 200 [2021-01-07 02:01:10,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 02:01:10,087 INFO L225 Difference]: With dead ends: 28633 [2021-01-07 02:01:10,087 INFO L226 Difference]: Without dead ends: 22387 [2021-01-07 02:01:10,096 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-01-07 02:01:10,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22387 states. [2021-01-07 02:01:12,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22387 to 6287. [2021-01-07 02:01:12,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6287 states. [2021-01-07 02:01:12,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6287 states to 6287 states and 7821 transitions. [2021-01-07 02:01:12,112 INFO L78 Accepts]: Start accepts. Automaton has 6287 states and 7821 transitions. Word has length 200 [2021-01-07 02:01:12,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 02:01:12,112 INFO L481 AbstractCegarLoop]: Abstraction has 6287 states and 7821 transitions. [2021-01-07 02:01:12,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 02:01:12,112 INFO L276 IsEmpty]: Start isEmpty. Operand 6287 states and 7821 transitions. [2021-01-07 02:01:12,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2021-01-07 02:01:12,116 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 02:01:12,116 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 02:01:12,117 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-07 02:01:12,117 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 02:01:12,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 02:01:12,117 INFO L82 PathProgramCache]: Analyzing trace with hash 932516808, now seen corresponding path program 1 times [2021-01-07 02:01:12,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 02:01:12,118 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806930492] [2021-01-07 02:01:12,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 02:01:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 02:01:12,343 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 02:01:12,343 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806930492] [2021-01-07 02:01:12,343 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 02:01:12,343 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-07 02:01:12,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615113849] [2021-01-07 02:01:12,345 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 02:01:12,345 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 02:01:12,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 02:01:12,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-01-07 02:01:12,347 INFO L87 Difference]: Start difference. First operand 6287 states and 7821 transitions. Second operand 8 states. [2021-01-07 02:01:21,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 02:01:21,832 INFO L93 Difference]: Finished difference Result 27505 states and 34449 transitions. [2021-01-07 02:01:21,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-07 02:01:21,833 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 200 [2021-01-07 02:01:21,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 02:01:21,853 INFO L225 Difference]: With dead ends: 27505 [2021-01-07 02:01:21,854 INFO L226 Difference]: Without dead ends: 21255 [2021-01-07 02:01:21,860 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2021-01-07 02:01:21,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21255 states. [2021-01-07 02:01:23,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21255 to 6295. [2021-01-07 02:01:23,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6295 states. [2021-01-07 02:01:23,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6295 states to 6295 states and 7829 transitions. [2021-01-07 02:01:23,841 INFO L78 Accepts]: Start accepts. Automaton has 6295 states and 7829 transitions. Word has length 200 [2021-01-07 02:01:23,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 02:01:23,841 INFO L481 AbstractCegarLoop]: Abstraction has 6295 states and 7829 transitions. [2021-01-07 02:01:23,841 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 02:01:23,841 INFO L276 IsEmpty]: Start isEmpty. Operand 6295 states and 7829 transitions. [2021-01-07 02:01:23,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2021-01-07 02:01:23,845 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 02:01:23,845 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 02:01:23,845 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-07 02:01:23,845 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 02:01:23,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 02:01:23,845 INFO L82 PathProgramCache]: Analyzing trace with hash -121550282, now seen corresponding path program 1 times [2021-01-07 02:01:23,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 02:01:23,846 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316162445] [2021-01-07 02:01:23,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 02:01:23,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 02:01:24,068 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 02:01:24,070 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316162445] [2021-01-07 02:01:24,071 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 02:01:24,071 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 02:01:24,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724964395] [2021-01-07 02:01:24,072 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 02:01:24,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 02:01:24,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 02:01:24,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 02:01:24,073 INFO L87 Difference]: Start difference. First operand 6295 states and 7829 transitions. Second operand 6 states. [2021-01-07 02:01:26,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 02:01:26,894 INFO L93 Difference]: Finished difference Result 12616 states and 15692 transitions. [2021-01-07 02:01:26,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 02:01:26,894 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 201 [2021-01-07 02:01:26,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 02:01:26,901 INFO L225 Difference]: With dead ends: 12616 [2021-01-07 02:01:26,901 INFO L226 Difference]: Without dead ends: 6358 [2021-01-07 02:01:26,910 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-07 02:01:26,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6358 states. [2021-01-07 02:01:28,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6358 to 6287. [2021-01-07 02:01:28,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6287 states. [2021-01-07 02:01:28,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6287 states to 6287 states and 7813 transitions. [2021-01-07 02:01:28,877 INFO L78 Accepts]: Start accepts. Automaton has 6287 states and 7813 transitions. Word has length 201 [2021-01-07 02:01:28,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 02:01:28,877 INFO L481 AbstractCegarLoop]: Abstraction has 6287 states and 7813 transitions. [2021-01-07 02:01:28,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 02:01:28,877 INFO L276 IsEmpty]: Start isEmpty. Operand 6287 states and 7813 transitions. [2021-01-07 02:01:28,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2021-01-07 02:01:28,880 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 02:01:28,880 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 02:01:28,880 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-07 02:01:28,880 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 02:01:28,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 02:01:28,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1965817007, now seen corresponding path program 1 times [2021-01-07 02:01:28,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 02:01:28,881 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411969759] [2021-01-07 02:01:28,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 02:01:28,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 02:01:29,089 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 02:01:29,090 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411969759] [2021-01-07 02:01:29,090 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 02:01:29,090 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 02:01:29,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60776549] [2021-01-07 02:01:29,091 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 02:01:29,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 02:01:29,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 02:01:29,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 02:01:29,091 INFO L87 Difference]: Start difference. First operand 6287 states and 7813 transitions. Second operand 6 states. [2021-01-07 02:01:31,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 02:01:31,409 INFO L93 Difference]: Finished difference Result 12600 states and 15664 transitions. [2021-01-07 02:01:31,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 02:01:31,409 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 202 [2021-01-07 02:01:31,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 02:01:31,417 INFO L225 Difference]: With dead ends: 12600 [2021-01-07 02:01:31,417 INFO L226 Difference]: Without dead ends: 6350 [2021-01-07 02:01:31,422 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-07 02:01:31,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6350 states. [2021-01-07 02:01:33,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6350 to 6279. [2021-01-07 02:01:33,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6279 states. [2021-01-07 02:01:33,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6279 states to 6279 states and 7801 transitions. [2021-01-07 02:01:33,408 INFO L78 Accepts]: Start accepts. Automaton has 6279 states and 7801 transitions. Word has length 202 [2021-01-07 02:01:33,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 02:01:33,408 INFO L481 AbstractCegarLoop]: Abstraction has 6279 states and 7801 transitions. [2021-01-07 02:01:33,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 02:01:33,408 INFO L276 IsEmpty]: Start isEmpty. Operand 6279 states and 7801 transitions. [2021-01-07 02:01:33,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2021-01-07 02:01:33,411 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 02:01:33,411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 02:01:33,411 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-01-07 02:01:33,411 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 02:01:33,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 02:01:33,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1536158701, now seen corresponding path program 1 times [2021-01-07 02:01:33,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 02:01:33,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457838629] [2021-01-07 02:01:33,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 02:01:33,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 02:01:33,635 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 02:01:33,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457838629] [2021-01-07 02:01:33,635 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 02:01:33,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 02:01:33,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947832247] [2021-01-07 02:01:33,636 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 02:01:33,637 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 02:01:33,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 02:01:33,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-01-07 02:01:33,637 INFO L87 Difference]: Start difference. First operand 6279 states and 7801 transitions. Second operand 7 states. [2021-01-07 02:01:33,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 02:01:33,977 INFO L93 Difference]: Finished difference Result 6506 states and 8072 transitions. [2021-01-07 02:01:33,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 02:01:33,978 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 202 [2021-01-07 02:01:33,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 02:01:33,980 INFO L225 Difference]: With dead ends: 6506 [2021-01-07 02:01:33,980 INFO L226 Difference]: Without dead ends: 0 [2021-01-07 02:01:33,985 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-01-07 02:01:33,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-01-07 02:01:33,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-01-07 02:01:33,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-01-07 02:01:33,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-01-07 02:01:33,986 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 202 [2021-01-07 02:01:33,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 02:01:33,986 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-01-07 02:01:33,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 02:01:33,986 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-01-07 02:01:33,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-01-07 02:01:33,986 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-01-07 02:01:33,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-01-07 02:01:39,559 WARN L197 SmtUtils]: Spent 5.50 s on a formula simplification. DAG size of input: 339 DAG size of output: 305 [2021-01-07 02:01:44,597 WARN L197 SmtUtils]: Spent 5.03 s on a formula simplification. DAG size of input: 260 DAG size of output: 243 [2021-01-07 02:01:47,782 WARN L197 SmtUtils]: Spent 3.17 s on a formula simplification. DAG size of input: 293 DAG size of output: 261 [2021-01-07 02:01:52,940 WARN L197 SmtUtils]: Spent 5.15 s on a formula simplification. DAG size of input: 260 DAG size of output: 243 [2021-01-07 02:01:57,505 WARN L197 SmtUtils]: Spent 4.56 s on a formula simplification. DAG size of input: 260 DAG size of output: 243 [2021-01-07 02:02:02,012 WARN L197 SmtUtils]: Spent 4.50 s on a formula simplification. DAG size of input: 260 DAG size of output: 243 [2021-01-07 02:02:06,528 WARN L197 SmtUtils]: Spent 4.51 s on a formula simplification. DAG size of input: 260 DAG size of output: 243 [2021-01-07 02:02:11,156 WARN L197 SmtUtils]: Spent 4.62 s on a formula simplification. DAG size of input: 260 DAG size of output: 243 [2021-01-07 02:02:15,734 WARN L197 SmtUtils]: Spent 4.58 s on a formula simplification. DAG size of input: 260 DAG size of output: 243 [2021-01-07 02:02:20,245 WARN L197 SmtUtils]: Spent 4.51 s on a formula simplification. DAG size of input: 260 DAG size of output: 243 [2021-01-07 02:02:24,710 WARN L197 SmtUtils]: Spent 4.46 s on a formula simplification. DAG size of input: 260 DAG size of output: 243