java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pt.ko-main.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 23:27:04,316 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 23:27:04,318 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 23:27:04,337 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 23:27:04,338 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 23:27:04,339 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 23:27:04,342 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 23:27:04,350 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 23:27:04,352 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 23:27:04,353 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 23:27:04,354 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 23:27:04,355 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 23:27:04,356 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 23:27:04,357 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 23:27:04,358 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 23:27:04,359 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 23:27:04,360 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 23:27:04,360 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 23:27:04,362 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 23:27:04,364 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 23:27:04,365 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 23:27:04,366 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 23:27:04,367 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 23:27:04,368 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 23:27:04,370 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 23:27:04,371 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 23:27:04,371 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 23:27:04,372 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 23:27:04,372 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 23:27:04,373 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 23:27:04,373 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 23:27:04,374 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 23:27:04,375 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 23:27:04,375 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 23:27:04,376 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 23:27:04,377 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 23:27:04,377 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 23:27:04,378 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 23:27:04,378 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 23:27:04,379 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 23:27:04,379 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 23:27:04,380 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-02 23:27:04,403 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 23:27:04,403 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 23:27:04,403 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-02 23:27:04,404 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-02 23:27:04,404 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-02 23:27:04,405 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-02 23:27:04,405 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-02 23:27:04,405 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-02 23:27:04,406 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-02 23:27:04,406 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-02 23:27:04,407 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 23:27:04,407 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 23:27:04,407 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 23:27:04,407 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 23:27:04,408 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 23:27:04,408 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 23:27:04,408 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 23:27:04,409 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 23:27:04,410 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 23:27:04,410 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 23:27:04,410 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 23:27:04,410 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-02 23:27:04,410 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 23:27:04,411 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 23:27:04,411 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 23:27:04,412 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 23:27:04,412 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-02 23:27:04,412 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 23:27:04,412 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 23:27:04,412 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-02 23:27:04,458 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 23:27:04,473 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 23:27:04,477 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 23:27:04,478 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 23:27:04,478 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 23:27:04,479 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pt.ko-main.cil.out.i [2019-10-02 23:27:04,545 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea4589bec/928017dd4ed04b2b8275e72de91cc7ad/FLAG7f8e2543f [2019-10-02 23:27:05,343 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 23:27:05,345 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pt.ko-main.cil.out.i [2019-10-02 23:27:05,394 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea4589bec/928017dd4ed04b2b8275e72de91cc7ad/FLAG7f8e2543f [2019-10-02 23:27:05,886 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea4589bec/928017dd4ed04b2b8275e72de91cc7ad [2019-10-02 23:27:05,898 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 23:27:05,900 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 23:27:05,901 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 23:27:05,902 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 23:27:05,906 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 23:27:05,907 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:27:05" (1/1) ... [2019-10-02 23:27:05,915 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19dca4fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:27:05, skipping insertion in model container [2019-10-02 23:27:05,915 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:27:05" (1/1) ... [2019-10-02 23:27:05,924 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 23:27:06,031 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 23:27:07,384 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 23:27:07,460 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 23:27:07,648 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 23:27:07,831 INFO L192 MainTranslator]: Completed translation [2019-10-02 23:27:07,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:27:07 WrapperNode [2019-10-02 23:27:07,832 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 23:27:07,833 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 23:27:07,833 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 23:27:07,833 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 23:27:07,849 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:27:07" (1/1) ... [2019-10-02 23:27:07,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:27:07" (1/1) ... [2019-10-02 23:27:07,936 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:27:07" (1/1) ... [2019-10-02 23:27:07,936 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:27:07" (1/1) ... [2019-10-02 23:27:08,095 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:27:07" (1/1) ... [2019-10-02 23:27:08,127 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:27:07" (1/1) ... [2019-10-02 23:27:08,149 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:27:07" (1/1) ... [2019-10-02 23:27:08,171 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 23:27:08,171 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 23:27:08,172 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 23:27:08,172 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 23:27:08,174 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:27:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/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 [2019-10-02 23:27:08,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 23:27:08,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 23:27:08,337 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2019-10-02 23:27:08,338 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2019-10-02 23:27:08,338 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2019-10-02 23:27:08,338 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2019-10-02 23:27:08,338 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_inc [2019-10-02 23:27:08,339 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec_and_test [2019-10-02 23:27:08,339 INFO L138 BoogieDeclarations]: Found implementation of procedure iminor [2019-10-02 23:27:08,339 INFO L138 BoogieDeclarations]: Found implementation of procedure register_chrdev [2019-10-02 23:27:08,340 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_chrdev [2019-10-02 23:27:08,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2019-10-02 23:27:08,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-10-02 23:27:08,341 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2019-10-02 23:27:08,341 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2019-10-02 23:27:08,342 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2019-10-02 23:27:08,342 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2019-10-02 23:27:08,343 INFO L138 BoogieDeclarations]: Found implementation of procedure status_reg [2019-10-02 23:27:08,343 INFO L138 BoogieDeclarations]: Found implementation of procedure read_reg [2019-10-02 23:27:08,344 INFO L138 BoogieDeclarations]: Found implementation of procedure write_reg [2019-10-02 23:27:08,344 INFO L138 BoogieDeclarations]: Found implementation of procedure DRIVE [2019-10-02 23:27:08,344 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_wait [2019-10-02 23:27:08,345 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_command [2019-10-02 23:27:08,345 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_completion [2019-10-02 23:27:08,346 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_req_sense [2019-10-02 23:27:08,346 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_atapi [2019-10-02 23:27:08,346 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_sleep [2019-10-02 23:27:08,347 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_poll_dsc [2019-10-02 23:27:08,347 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_media_access_cmd [2019-10-02 23:27:08,347 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_rewind [2019-10-02 23:27:08,347 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_write_fm [2019-10-02 23:27:08,348 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_reset [2019-10-02 23:27:08,349 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_ready_wait [2019-10-02 23:27:08,349 INFO L138 BoogieDeclarations]: Found implementation of procedure xs [2019-10-02 23:27:08,349 INFO L138 BoogieDeclarations]: Found implementation of procedure xn [2019-10-02 23:27:08,349 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_identify [2019-10-02 23:27:08,350 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_probe [2019-10-02 23:27:08,350 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_detect [2019-10-02 23:27:08,350 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_open [2019-10-02 23:27:08,350 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_ioctl [2019-10-02 23:27:08,350 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_release [2019-10-02 23:27:08,351 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_read [2019-10-02 23:27:08,351 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_write [2019-10-02 23:27:08,351 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_init [2019-10-02 23:27:08,351 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_exit [2019-10-02 23:27:08,353 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 23:27:08,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_1 [2019-10-02 23:27:08,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_2 [2019-10-02 23:27:08,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_3 [2019-10-02 23:27:08,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_4 [2019-10-02 23:27:08,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_5 [2019-10-02 23:27:08,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_6 [2019-10-02 23:27:08,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_7 [2019-10-02 23:27:08,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_8 [2019-10-02 23:27:08,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_9 [2019-10-02 23:27:08,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_10 [2019-10-02 23:27:08,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_11 [2019-10-02 23:27:08,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_12 [2019-10-02 23:27:08,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_13 [2019-10-02 23:27:08,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_14 [2019-10-02 23:27:08,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_15 [2019-10-02 23:27:08,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_register_chrdev_16 [2019-10-02 23:27:08,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_unregister_chrdev_17 [2019-10-02 23:27:08,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-10-02 23:27:08,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-10-02 23:27:08,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_trap [2019-10-02 23:27:08,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_cred_guard_mutex_of_signal_struct [2019-10-02 23:27:08,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_cred_guard_mutex_of_signal_struct [2019-10-02 23:27:08,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_cred_guard_mutex_of_signal_struct [2019-10-02 23:27:08,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_cred_guard_mutex_of_signal_struct [2019-10-02 23:27:08,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_cred_guard_mutex_of_signal_struct [2019-10-02 23:27:08,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_cred_guard_mutex_of_signal_struct [2019-10-02 23:27:08,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_cred_guard_mutex_of_signal_struct [2019-10-02 23:27:08,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_lock [2019-10-02 23:27:08,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_lock [2019-10-02 23:27:08,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_lock [2019-10-02 23:27:08,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_lock [2019-10-02 23:27:08,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_lock [2019-10-02 23:27:08,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_lock [2019-10-02 23:27:08,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_lock [2019-10-02 23:27:08,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_mutex_of_device [2019-10-02 23:27:08,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_mutex_of_device [2019-10-02 23:27:08,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mutex_of_device [2019-10-02 23:27:08,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_mutex_of_device [2019-10-02 23:27:08,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_mutex_of_device [2019-10-02 23:27:08,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_mutex_of_device [2019-10-02 23:27:08,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mutex_of_device [2019-10-02 23:27:08,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_pt_mutex [2019-10-02 23:27:08,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_pt_mutex [2019-10-02 23:27:08,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_pt_mutex [2019-10-02 23:27:08,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_pt_mutex [2019-10-02 23:27:08,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_pt_mutex [2019-10-02 23:27:08,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_pt_mutex [2019-10-02 23:27:08,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_pt_mutex [2019-10-02 23:27:08,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-10-02 23:27:08,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-10-02 23:27:08,375 INFO L138 BoogieDeclarations]: Found implementation of procedure __class_create [2019-10-02 23:27:08,375 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2019-10-02 23:27:08,376 INFO L138 BoogieDeclarations]: Found implementation of procedure __register_chrdev [2019-10-02 23:27:08,376 INFO L138 BoogieDeclarations]: Found implementation of procedure __unregister_chrdev [2019-10-02 23:27:08,376 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2019-10-02 23:27:08,376 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2019-10-02 23:27:08,377 INFO L138 BoogieDeclarations]: Found implementation of procedure class_destroy [2019-10-02 23:27:08,377 INFO L138 BoogieDeclarations]: Found implementation of procedure device_create [2019-10-02 23:27:08,377 INFO L138 BoogieDeclarations]: Found implementation of procedure device_destroy [2019-10-02 23:27:08,377 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2019-10-02 23:27:08,379 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2019-10-02 23:27:08,379 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_trylock [2019-10-02 23:27:08,379 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2019-10-02 23:27:08,380 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_connect [2019-10-02 23:27:08,380 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_disconnect [2019-10-02 23:27:08,380 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_init [2019-10-02 23:27:08,380 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_read_block [2019-10-02 23:27:08,382 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_read_regr [2019-10-02 23:27:08,382 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_release [2019-10-02 23:27:08,382 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_write_block [2019-10-02 23:27:08,383 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_write_regr [2019-10-02 23:27:08,384 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-10-02 23:27:08,384 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_timeout_interruptible [2019-10-02 23:27:08,385 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_fmt [2019-10-02 23:27:08,385 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-10-02 23:27:08,386 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-10-02 23:27:08,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 23:27:08,387 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 23:27:08,387 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-10-02 23:27:08,388 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-10-02 23:27:08,388 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2019-10-02 23:27:08,388 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2019-10-02 23:27:08,389 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_fmt [2019-10-02 23:27:08,389 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2019-10-02 23:27:08,390 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2019-10-02 23:27:08,390 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2019-10-02 23:27:08,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 23:27:08,390 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2019-10-02 23:27:08,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 23:27:08,391 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_inc [2019-10-02 23:27:08,391 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec_and_test [2019-10-02 23:27:08,391 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_trylock [2019-10-02 23:27:08,392 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_4 [2019-10-02 23:27:08,397 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2019-10-02 23:27:08,397 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_2 [2019-10-02 23:27:08,397 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_5 [2019-10-02 23:27:08,398 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_7 [2019-10-02 23:27:08,404 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_9 [2019-10-02 23:27:08,405 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_10 [2019-10-02 23:27:08,405 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_11 [2019-10-02 23:27:08,405 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_13 [2019-10-02 23:27:08,406 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_15 [2019-10-02 23:27:08,406 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2019-10-02 23:27:08,406 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_1 [2019-10-02 23:27:08,407 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_3 [2019-10-02 23:27:08,407 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_6 [2019-10-02 23:27:08,407 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_8 [2019-10-02 23:27:08,407 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_12 [2019-10-02 23:27:08,407 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_14 [2019-10-02 23:27:08,408 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_cred_guard_mutex_of_signal_struct [2019-10-02 23:27:08,408 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_cred_guard_mutex_of_signal_struct [2019-10-02 23:27:08,408 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_lock [2019-10-02 23:27:08,408 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_lock [2019-10-02 23:27:08,408 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mutex_of_device [2019-10-02 23:27:08,409 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_mutex_of_device [2019-10-02 23:27:08,409 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mutex_of_device [2019-10-02 23:27:08,409 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_pt_mutex [2019-10-02 23:27:08,409 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_pt_mutex [2019-10-02 23:27:08,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 23:27:08,410 INFO L130 BoogieDeclarations]: Found specification of procedure iminor [2019-10-02 23:27:08,410 INFO L130 BoogieDeclarations]: Found specification of procedure __register_chrdev [2019-10-02 23:27:08,410 INFO L130 BoogieDeclarations]: Found specification of procedure __unregister_chrdev [2019-10-02 23:27:08,410 INFO L130 BoogieDeclarations]: Found specification of procedure register_chrdev [2019-10-02 23:27:08,411 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_register_chrdev_16 [2019-10-02 23:27:08,411 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_chrdev [2019-10-02 23:27:08,411 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_unregister_chrdev_17 [2019-10-02 23:27:08,411 INFO L130 BoogieDeclarations]: Found specification of procedure noop_llseek [2019-10-02 23:27:08,412 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2019-10-02 23:27:08,412 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-10-02 23:27:08,412 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 23:27:08,412 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 23:27:08,412 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2019-10-02 23:27:08,413 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-10-02 23:27:08,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 23:27:08,413 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2019-10-02 23:27:08,413 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2019-10-02 23:27:08,413 INFO L130 BoogieDeclarations]: Found specification of procedure __class_create [2019-10-02 23:27:08,414 INFO L130 BoogieDeclarations]: Found specification of procedure class_destroy [2019-10-02 23:27:08,414 INFO L130 BoogieDeclarations]: Found specification of procedure device_create [2019-10-02 23:27:08,414 INFO L130 BoogieDeclarations]: Found specification of procedure device_destroy [2019-10-02 23:27:08,414 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_timeout_interruptible [2019-10-02 23:27:08,414 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2019-10-02 23:27:08,415 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2019-10-02 23:27:08,415 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2019-10-02 23:27:08,415 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2019-10-02 23:27:08,415 INFO L130 BoogieDeclarations]: Found specification of procedure pi_init [2019-10-02 23:27:08,416 INFO L130 BoogieDeclarations]: Found specification of procedure pi_release [2019-10-02 23:27:08,416 INFO L130 BoogieDeclarations]: Found specification of procedure pi_write_regr [2019-10-02 23:27:08,416 INFO L130 BoogieDeclarations]: Found specification of procedure pi_read_regr [2019-10-02 23:27:08,416 INFO L130 BoogieDeclarations]: Found specification of procedure pi_write_block [2019-10-02 23:27:08,416 INFO L130 BoogieDeclarations]: Found specification of procedure pi_read_block [2019-10-02 23:27:08,417 INFO L130 BoogieDeclarations]: Found specification of procedure pi_connect [2019-10-02 23:27:08,417 INFO L130 BoogieDeclarations]: Found specification of procedure pi_disconnect [2019-10-02 23:27:08,417 INFO L130 BoogieDeclarations]: Found specification of procedure pt_open [2019-10-02 23:27:08,417 INFO L130 BoogieDeclarations]: Found specification of procedure pt_ioctl [2019-10-02 23:27:08,417 INFO L130 BoogieDeclarations]: Found specification of procedure pt_release [2019-10-02 23:27:08,418 INFO L130 BoogieDeclarations]: Found specification of procedure pt_read [2019-10-02 23:27:08,418 INFO L130 BoogieDeclarations]: Found specification of procedure pt_write [2019-10-02 23:27:08,419 INFO L130 BoogieDeclarations]: Found specification of procedure pt_detect [2019-10-02 23:27:08,419 INFO L130 BoogieDeclarations]: Found specification of procedure pt_identify [2019-10-02 23:27:08,420 INFO L130 BoogieDeclarations]: Found specification of procedure status_reg [2019-10-02 23:27:08,422 INFO L130 BoogieDeclarations]: Found specification of procedure read_reg [2019-10-02 23:27:08,422 INFO L130 BoogieDeclarations]: Found specification of procedure write_reg [2019-10-02 23:27:08,422 INFO L130 BoogieDeclarations]: Found specification of procedure DRIVE [2019-10-02 23:27:08,422 INFO L130 BoogieDeclarations]: Found specification of procedure pt_wait [2019-10-02 23:27:08,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 23:27:08,423 INFO L130 BoogieDeclarations]: Found specification of procedure pt_command [2019-10-02 23:27:08,423 INFO L130 BoogieDeclarations]: Found specification of procedure pt_completion [2019-10-02 23:27:08,423 INFO L130 BoogieDeclarations]: Found specification of procedure pt_req_sense [2019-10-02 23:27:08,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 23:27:08,424 INFO L130 BoogieDeclarations]: Found specification of procedure pt_atapi [2019-10-02 23:27:08,424 INFO L130 BoogieDeclarations]: Found specification of procedure pt_sleep [2019-10-02 23:27:08,424 INFO L130 BoogieDeclarations]: Found specification of procedure pt_poll_dsc [2019-10-02 23:27:08,424 INFO L130 BoogieDeclarations]: Found specification of procedure pt_media_access_cmd [2019-10-02 23:27:08,424 INFO L130 BoogieDeclarations]: Found specification of procedure pt_rewind [2019-10-02 23:27:08,425 INFO L130 BoogieDeclarations]: Found specification of procedure pt_write_fm [2019-10-02 23:27:08,425 INFO L130 BoogieDeclarations]: Found specification of procedure pt_reset [2019-10-02 23:27:08,425 INFO L130 BoogieDeclarations]: Found specification of procedure pt_ready_wait [2019-10-02 23:27:08,425 INFO L130 BoogieDeclarations]: Found specification of procedure xs [2019-10-02 23:27:08,425 INFO L130 BoogieDeclarations]: Found specification of procedure xn [2019-10-02 23:27:08,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 23:27:08,426 INFO L130 BoogieDeclarations]: Found specification of procedure pt_probe [2019-10-02 23:27:08,426 INFO L130 BoogieDeclarations]: Found specification of procedure pt_init [2019-10-02 23:27:08,426 INFO L130 BoogieDeclarations]: Found specification of procedure pt_exit [2019-10-02 23:27:08,426 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-10-02 23:27:08,427 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-10-02 23:27:08,427 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 23:27:08,427 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-10-02 23:27:08,427 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_trap [2019-10-02 23:27:08,427 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_cred_guard_mutex_of_signal_struct [2019-10-02 23:27:08,427 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_cred_guard_mutex_of_signal_struct [2019-10-02 23:27:08,428 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_cred_guard_mutex_of_signal_struct [2019-10-02 23:27:08,428 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_cred_guard_mutex_of_signal_struct [2019-10-02 23:27:08,428 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_cred_guard_mutex_of_signal_struct [2019-10-02 23:27:08,428 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_lock [2019-10-02 23:27:08,428 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_lock [2019-10-02 23:27:08,428 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_lock [2019-10-02 23:27:08,429 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_lock [2019-10-02 23:27:08,429 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_lock [2019-10-02 23:27:08,429 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_mutex_of_device [2019-10-02 23:27:08,429 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_mutex_of_device [2019-10-02 23:27:08,429 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_mutex_of_device [2019-10-02 23:27:08,430 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_mutex_of_device [2019-10-02 23:27:08,430 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_pt_mutex [2019-10-02 23:27:08,430 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_pt_mutex [2019-10-02 23:27:08,430 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_pt_mutex [2019-10-02 23:27:08,430 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_pt_mutex [2019-10-02 23:27:08,431 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_pt_mutex [2019-10-02 23:27:08,431 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-10-02 23:27:08,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-10-02 23:27:08,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-02 23:27:08,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-02 23:27:08,432 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 23:27:08,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 23:27:08,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 23:27:08,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-02 23:27:08,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 23:27:17,700 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 23:27:17,701 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 23:27:17,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:27:17 BoogieIcfgContainer [2019-10-02 23:27:17,708 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 23:27:17,710 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 23:27:17,710 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 23:27:17,714 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 23:27:17,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:27:05" (1/3) ... [2019-10-02 23:27:17,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12e7bcfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:27:17, skipping insertion in model container [2019-10-02 23:27:17,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:27:07" (2/3) ... [2019-10-02 23:27:17,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12e7bcfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:27:17, skipping insertion in model container [2019-10-02 23:27:17,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:27:17" (3/3) ... [2019-10-02 23:27:17,723 INFO L109 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pt.ko-main.cil.out.i [2019-10-02 23:27:17,734 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 23:27:17,749 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 23:27:17,769 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 23:27:17,806 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 23:27:17,807 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-02 23:27:17,807 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 23:27:17,807 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 23:27:17,807 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 23:27:17,807 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 23:27:17,808 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 23:27:17,808 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 23:27:17,863 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states. [2019-10-02 23:27:17,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-02 23:27:17,889 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:27:17,891 INFO L411 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] [2019-10-02 23:27:17,895 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:27:17,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:27:17,903 INFO L82 PathProgramCache]: Analyzing trace with hash 272456639, now seen corresponding path program 1 times [2019-10-02 23:27:17,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:27:18,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:18,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:27:18,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:18,010 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:27:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:27:18,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 23:27:18,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:27:18,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:27:18,746 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:27:18,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:27:18,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:27:18,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:27:18,770 INFO L87 Difference]: Start difference. First operand 928 states. Second operand 3 states. [2019-10-02 23:27:19,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:27:19,221 INFO L93 Difference]: Finished difference Result 1167 states and 1557 transitions. [2019-10-02 23:27:19,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:27:19,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-02 23:27:19,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:27:19,253 INFO L225 Difference]: With dead ends: 1167 [2019-10-02 23:27:19,253 INFO L226 Difference]: Without dead ends: 1153 [2019-10-02 23:27:19,255 INFO L640 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 [2019-10-02 23:27:19,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2019-10-02 23:27:19,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1104. [2019-10-02 23:27:19,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1104 states. [2019-10-02 23:27:19,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1486 transitions. [2019-10-02 23:27:19,481 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1486 transitions. Word has length 31 [2019-10-02 23:27:19,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:27:19,482 INFO L475 AbstractCegarLoop]: Abstraction has 1104 states and 1486 transitions. [2019-10-02 23:27:19,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:27:19,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1486 transitions. [2019-10-02 23:27:19,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-02 23:27:19,492 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:27:19,492 INFO L411 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] [2019-10-02 23:27:19,492 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:27:19,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:27:19,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1762829340, now seen corresponding path program 1 times [2019-10-02 23:27:19,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:27:19,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:19,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:27:19,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:19,507 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:27:19,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:27:19,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 23:27:19,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:27:19,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 23:27:19,801 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:27:19,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 23:27:19,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 23:27:19,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 23:27:19,809 INFO L87 Difference]: Start difference. First operand 1104 states and 1486 transitions. Second operand 4 states. [2019-10-02 23:27:21,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:27:21,358 INFO L93 Difference]: Finished difference Result 1104 states and 1484 transitions. [2019-10-02 23:27:21,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:27:21,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-10-02 23:27:21,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:27:21,372 INFO L225 Difference]: With dead ends: 1104 [2019-10-02 23:27:21,372 INFO L226 Difference]: Without dead ends: 1104 [2019-10-02 23:27:21,376 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 23:27:21,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2019-10-02 23:27:21,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 1104. [2019-10-02 23:27:21,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1104 states. [2019-10-02 23:27:21,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1484 transitions. [2019-10-02 23:27:21,426 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1484 transitions. Word has length 31 [2019-10-02 23:27:21,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:27:21,427 INFO L475 AbstractCegarLoop]: Abstraction has 1104 states and 1484 transitions. [2019-10-02 23:27:21,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 23:27:21,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1484 transitions. [2019-10-02 23:27:21,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-02 23:27:21,429 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:27:21,429 INFO L411 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] [2019-10-02 23:27:21,429 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:27:21,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:27:21,429 INFO L82 PathProgramCache]: Analyzing trace with hash 958019960, now seen corresponding path program 1 times [2019-10-02 23:27:21,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:27:21,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:21,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:27:21,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:21,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:27:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:27:21,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 23:27:21,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:27:21,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:27:21,685 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:27:21,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:27:21,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:27:21,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:27:21,687 INFO L87 Difference]: Start difference. First operand 1104 states and 1484 transitions. Second operand 3 states. [2019-10-02 23:27:21,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:27:21,791 INFO L93 Difference]: Finished difference Result 1132 states and 1526 transitions. [2019-10-02 23:27:21,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:27:21,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-10-02 23:27:21,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:27:21,801 INFO L225 Difference]: With dead ends: 1132 [2019-10-02 23:27:21,801 INFO L226 Difference]: Without dead ends: 1132 [2019-10-02 23:27:21,801 INFO L640 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 [2019-10-02 23:27:21,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2019-10-02 23:27:21,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1106. [2019-10-02 23:27:21,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1106 states. [2019-10-02 23:27:21,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1486 transitions. [2019-10-02 23:27:21,845 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1486 transitions. Word has length 40 [2019-10-02 23:27:21,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:27:21,845 INFO L475 AbstractCegarLoop]: Abstraction has 1106 states and 1486 transitions. [2019-10-02 23:27:21,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:27:21,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1486 transitions. [2019-10-02 23:27:21,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-02 23:27:21,847 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:27:21,847 INFO L411 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] [2019-10-02 23:27:21,847 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:27:21,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:27:21,848 INFO L82 PathProgramCache]: Analyzing trace with hash -721419499, now seen corresponding path program 1 times [2019-10-02 23:27:21,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:27:21,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:21,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:27:21,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:21,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:27:21,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:27:22,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 23:27:22,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:27:22,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:27:22,039 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:27:22,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:27:22,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:27:22,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:27:22,040 INFO L87 Difference]: Start difference. First operand 1106 states and 1486 transitions. Second operand 3 states. [2019-10-02 23:27:22,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:27:22,605 INFO L93 Difference]: Finished difference Result 1734 states and 2333 transitions. [2019-10-02 23:27:22,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:27:22,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-10-02 23:27:22,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:27:22,618 INFO L225 Difference]: With dead ends: 1734 [2019-10-02 23:27:22,619 INFO L226 Difference]: Without dead ends: 1734 [2019-10-02 23:27:22,619 INFO L640 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 [2019-10-02 23:27:22,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-10-02 23:27:22,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1730. [2019-10-02 23:27:22,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1730 states. [2019-10-02 23:27:22,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1730 states to 1730 states and 2330 transitions. [2019-10-02 23:27:22,690 INFO L78 Accepts]: Start accepts. Automaton has 1730 states and 2330 transitions. Word has length 46 [2019-10-02 23:27:22,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:27:22,690 INFO L475 AbstractCegarLoop]: Abstraction has 1730 states and 2330 transitions. [2019-10-02 23:27:22,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:27:22,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1730 states and 2330 transitions. [2019-10-02 23:27:22,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-02 23:27:22,692 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:27:22,692 INFO L411 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] [2019-10-02 23:27:22,692 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:27:22,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:27:22,693 INFO L82 PathProgramCache]: Analyzing trace with hash -217122663, now seen corresponding path program 1 times [2019-10-02 23:27:22,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:27:22,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:22,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:27:22,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:22,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:27:22,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:27:22,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 23:27:22,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:27:22,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:27:22,978 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:27:22,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:27:22,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:27:22,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:27:22,980 INFO L87 Difference]: Start difference. First operand 1730 states and 2330 transitions. Second operand 3 states. [2019-10-02 23:27:23,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:27:23,029 INFO L93 Difference]: Finished difference Result 1750 states and 2358 transitions. [2019-10-02 23:27:23,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:27:23,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-10-02 23:27:23,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:27:23,098 INFO L225 Difference]: With dead ends: 1750 [2019-10-02 23:27:23,099 INFO L226 Difference]: Without dead ends: 1750 [2019-10-02 23:27:23,099 INFO L640 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 [2019-10-02 23:27:23,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1750 states. [2019-10-02 23:27:23,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1750 to 1744. [2019-10-02 23:27:23,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1744 states. [2019-10-02 23:27:23,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1744 states to 1744 states and 2350 transitions. [2019-10-02 23:27:23,173 INFO L78 Accepts]: Start accepts. Automaton has 1744 states and 2350 transitions. Word has length 49 [2019-10-02 23:27:23,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:27:23,174 INFO L475 AbstractCegarLoop]: Abstraction has 1744 states and 2350 transitions. [2019-10-02 23:27:23,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:27:23,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 2350 transitions. [2019-10-02 23:27:23,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-02 23:27:23,175 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:27:23,175 INFO L411 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] [2019-10-02 23:27:23,176 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:27:23,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:27:23,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1429347774, now seen corresponding path program 1 times [2019-10-02 23:27:23,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:27:23,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:23,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:27:23,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:23,189 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:27:23,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:27:23,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 23:27:23,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:27:23,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:27:23,433 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:27:23,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:27:23,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:27:23,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:27:23,434 INFO L87 Difference]: Start difference. First operand 1744 states and 2350 transitions. Second operand 3 states. [2019-10-02 23:27:23,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:27:23,478 INFO L93 Difference]: Finished difference Result 1796 states and 2430 transitions. [2019-10-02 23:27:23,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:27:23,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-10-02 23:27:23,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:27:23,492 INFO L225 Difference]: With dead ends: 1796 [2019-10-02 23:27:23,493 INFO L226 Difference]: Without dead ends: 1796 [2019-10-02 23:27:23,493 INFO L640 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 [2019-10-02 23:27:23,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1796 states. [2019-10-02 23:27:23,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1796 to 1792. [2019-10-02 23:27:23,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1792 states. [2019-10-02 23:27:23,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 2426 transitions. [2019-10-02 23:27:23,570 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 2426 transitions. Word has length 55 [2019-10-02 23:27:23,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:27:23,570 INFO L475 AbstractCegarLoop]: Abstraction has 1792 states and 2426 transitions. [2019-10-02 23:27:23,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:27:23,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 2426 transitions. [2019-10-02 23:27:23,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-02 23:27:23,574 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:27:23,574 INFO L411 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] [2019-10-02 23:27:23,574 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:27:23,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:27:23,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1358067713, now seen corresponding path program 1 times [2019-10-02 23:27:23,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:27:23,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:23,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:27:23,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:23,584 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:27:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:27:23,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 23:27:23,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:27:23,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:27:23,808 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:27:23,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:27:23,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:27:23,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:27:23,810 INFO L87 Difference]: Start difference. First operand 1792 states and 2426 transitions. Second operand 3 states. [2019-10-02 23:27:23,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:27:23,965 INFO L93 Difference]: Finished difference Result 1803 states and 2437 transitions. [2019-10-02 23:27:23,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:27:23,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-10-02 23:27:23,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:27:23,979 INFO L225 Difference]: With dead ends: 1803 [2019-10-02 23:27:23,980 INFO L226 Difference]: Without dead ends: 1803 [2019-10-02 23:27:23,980 INFO L640 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 [2019-10-02 23:27:23,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2019-10-02 23:27:24,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1792. [2019-10-02 23:27:24,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1792 states. [2019-10-02 23:27:24,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 2424 transitions. [2019-10-02 23:27:24,066 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 2424 transitions. Word has length 55 [2019-10-02 23:27:24,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:27:24,069 INFO L475 AbstractCegarLoop]: Abstraction has 1792 states and 2424 transitions. [2019-10-02 23:27:24,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:27:24,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 2424 transitions. [2019-10-02 23:27:24,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-02 23:27:24,070 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:27:24,070 INFO L411 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] [2019-10-02 23:27:24,070 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:27:24,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:27:24,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1300809411, now seen corresponding path program 1 times [2019-10-02 23:27:24,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:27:24,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:24,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:27:24,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:24,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:27:24,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:27:24,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 23:27:24,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:27:24,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:27:24,347 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:27:24,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:27:24,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:27:24,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:27:24,349 INFO L87 Difference]: Start difference. First operand 1792 states and 2424 transitions. Second operand 3 states. [2019-10-02 23:27:25,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:27:25,064 INFO L93 Difference]: Finished difference Result 1791 states and 2422 transitions. [2019-10-02 23:27:25,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:27:25,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-10-02 23:27:25,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:27:25,082 INFO L225 Difference]: With dead ends: 1791 [2019-10-02 23:27:25,083 INFO L226 Difference]: Without dead ends: 1791 [2019-10-02 23:27:25,083 INFO L640 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 [2019-10-02 23:27:25,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1791 states. [2019-10-02 23:27:25,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1791 to 1791. [2019-10-02 23:27:25,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1791 states. [2019-10-02 23:27:25,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 2422 transitions. [2019-10-02 23:27:25,168 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 2422 transitions. Word has length 55 [2019-10-02 23:27:25,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:27:25,168 INFO L475 AbstractCegarLoop]: Abstraction has 1791 states and 2422 transitions. [2019-10-02 23:27:25,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:27:25,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2422 transitions. [2019-10-02 23:27:25,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-02 23:27:25,170 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:27:25,170 INFO L411 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, 1] [2019-10-02 23:27:25,171 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:27:25,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:27:25,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1670943529, now seen corresponding path program 1 times [2019-10-02 23:27:25,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:27:25,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:25,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:27:25,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:25,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:27:25,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:27:25,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 23:27:25,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:27:25,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:27:25,414 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:27:25,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:27:25,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:27:25,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:27:25,416 INFO L87 Difference]: Start difference. First operand 1791 states and 2422 transitions. Second operand 3 states. [2019-10-02 23:27:26,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:27:26,452 INFO L93 Difference]: Finished difference Result 1790 states and 2420 transitions. [2019-10-02 23:27:26,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:27:26,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-10-02 23:27:26,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:27:26,470 INFO L225 Difference]: With dead ends: 1790 [2019-10-02 23:27:26,470 INFO L226 Difference]: Without dead ends: 1790 [2019-10-02 23:27:26,471 INFO L640 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 [2019-10-02 23:27:26,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-10-02 23:27:26,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1790. [2019-10-02 23:27:26,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1790 states. [2019-10-02 23:27:26,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1790 states to 1790 states and 2420 transitions. [2019-10-02 23:27:26,547 INFO L78 Accepts]: Start accepts. Automaton has 1790 states and 2420 transitions. Word has length 56 [2019-10-02 23:27:26,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:27:26,548 INFO L475 AbstractCegarLoop]: Abstraction has 1790 states and 2420 transitions. [2019-10-02 23:27:26,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:27:26,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1790 states and 2420 transitions. [2019-10-02 23:27:26,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-02 23:27:26,550 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:27:26,550 INFO L411 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, 1, 1] [2019-10-02 23:27:26,551 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:27:26,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:27:26,551 INFO L82 PathProgramCache]: Analyzing trace with hash -260194432, now seen corresponding path program 1 times [2019-10-02 23:27:26,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:27:26,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:26,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:27:26,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:26,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:27:26,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:27:26,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 23:27:26,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:27:26,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:27:26,740 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:27:26,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:27:26,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:27:26,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:27:26,741 INFO L87 Difference]: Start difference. First operand 1790 states and 2420 transitions. Second operand 3 states. [2019-10-02 23:27:27,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:27:27,344 INFO L93 Difference]: Finished difference Result 1789 states and 2418 transitions. [2019-10-02 23:27:27,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:27:27,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-10-02 23:27:27,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:27:27,357 INFO L225 Difference]: With dead ends: 1789 [2019-10-02 23:27:27,357 INFO L226 Difference]: Without dead ends: 1789 [2019-10-02 23:27:27,358 INFO L640 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 [2019-10-02 23:27:27,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2019-10-02 23:27:27,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1789. [2019-10-02 23:27:27,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1789 states. [2019-10-02 23:27:27,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1789 states and 2418 transitions. [2019-10-02 23:27:27,418 INFO L78 Accepts]: Start accepts. Automaton has 1789 states and 2418 transitions. Word has length 57 [2019-10-02 23:27:27,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:27:27,420 INFO L475 AbstractCegarLoop]: Abstraction has 1789 states and 2418 transitions. [2019-10-02 23:27:27,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:27:27,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 2418 transitions. [2019-10-02 23:27:27,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-02 23:27:27,422 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:27:27,422 INFO L411 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, 1, 1, 1] [2019-10-02 23:27:27,422 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:27:27,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:27:27,423 INFO L82 PathProgramCache]: Analyzing trace with hash 523359482, now seen corresponding path program 1 times [2019-10-02 23:27:27,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:27:27,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:27,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:27:27,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:27,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:27:27,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:27:27,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 23:27:27,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:27:27,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:27:27,616 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:27:27,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:27:27,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:27:27,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:27:27,617 INFO L87 Difference]: Start difference. First operand 1789 states and 2418 transitions. Second operand 3 states. [2019-10-02 23:27:28,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:27:28,401 INFO L93 Difference]: Finished difference Result 2220 states and 2970 transitions. [2019-10-02 23:27:28,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:27:28,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-02 23:27:28,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:27:28,417 INFO L225 Difference]: With dead ends: 2220 [2019-10-02 23:27:28,417 INFO L226 Difference]: Without dead ends: 2174 [2019-10-02 23:27:28,418 INFO L640 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 [2019-10-02 23:27:28,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2174 states. [2019-10-02 23:27:28,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2174 to 2174. [2019-10-02 23:27:28,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2174 states. [2019-10-02 23:27:28,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 2174 states and 2916 transitions. [2019-10-02 23:27:28,487 INFO L78 Accepts]: Start accepts. Automaton has 2174 states and 2916 transitions. Word has length 58 [2019-10-02 23:27:28,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:27:28,488 INFO L475 AbstractCegarLoop]: Abstraction has 2174 states and 2916 transitions. [2019-10-02 23:27:28,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:27:28,488 INFO L276 IsEmpty]: Start isEmpty. Operand 2174 states and 2916 transitions. [2019-10-02 23:27:28,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-02 23:27:28,492 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:27:28,492 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 23:27:28,493 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:27:28,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:27:28,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1210973165, now seen corresponding path program 1 times [2019-10-02 23:27:28,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:27:28,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:28,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:27:28,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:28,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:27:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:27:28,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 23:27:28,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:27:28,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 23:27:28,684 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:27:28,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 23:27:28,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 23:27:28,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 23:27:28,685 INFO L87 Difference]: Start difference. First operand 2174 states and 2916 transitions. Second operand 5 states. [2019-10-02 23:27:28,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:27:28,724 INFO L93 Difference]: Finished difference Result 2188 states and 2930 transitions. [2019-10-02 23:27:28,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 23:27:28,724 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-02 23:27:28,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:27:28,741 INFO L225 Difference]: With dead ends: 2188 [2019-10-02 23:27:28,742 INFO L226 Difference]: Without dead ends: 2188 [2019-10-02 23:27:28,742 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 23:27:28,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2188 states. [2019-10-02 23:27:28,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2188 to 2188. [2019-10-02 23:27:28,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2188 states. [2019-10-02 23:27:28,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2188 states to 2188 states and 2930 transitions. [2019-10-02 23:27:28,819 INFO L78 Accepts]: Start accepts. Automaton has 2188 states and 2930 transitions. Word has length 105 [2019-10-02 23:27:28,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:27:28,820 INFO L475 AbstractCegarLoop]: Abstraction has 2188 states and 2930 transitions. [2019-10-02 23:27:28,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 23:27:28,820 INFO L276 IsEmpty]: Start isEmpty. Operand 2188 states and 2930 transitions. [2019-10-02 23:27:28,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-02 23:27:28,823 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:27:28,824 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 23:27:28,824 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:27:28,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:27:28,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1551773475, now seen corresponding path program 1 times [2019-10-02 23:27:28,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:27:28,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:28,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:27:28,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:28,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:27:28,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:27:29,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 23:27:29,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:27:29,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 23:27:29,023 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:27:29,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 23:27:29,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 23:27:29,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 23:27:29,025 INFO L87 Difference]: Start difference. First operand 2188 states and 2930 transitions. Second operand 4 states. [2019-10-02 23:27:34,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:27:34,409 INFO L93 Difference]: Finished difference Result 2194 states and 2938 transitions. [2019-10-02 23:27:34,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 23:27:34,410 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-10-02 23:27:34,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:27:34,423 INFO L225 Difference]: With dead ends: 2194 [2019-10-02 23:27:34,423 INFO L226 Difference]: Without dead ends: 2194 [2019-10-02 23:27:34,424 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 23:27:34,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2194 states. [2019-10-02 23:27:34,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2194 to 2192. [2019-10-02 23:27:34,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2192 states. [2019-10-02 23:27:34,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 2192 states and 2934 transitions. [2019-10-02 23:27:34,496 INFO L78 Accepts]: Start accepts. Automaton has 2192 states and 2934 transitions. Word has length 115 [2019-10-02 23:27:34,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:27:34,496 INFO L475 AbstractCegarLoop]: Abstraction has 2192 states and 2934 transitions. [2019-10-02 23:27:34,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 23:27:34,497 INFO L276 IsEmpty]: Start isEmpty. Operand 2192 states and 2934 transitions. [2019-10-02 23:27:34,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-02 23:27:34,501 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:27:34,502 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 23:27:34,502 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:27:34,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:27:34,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1988568606, now seen corresponding path program 1 times [2019-10-02 23:27:34,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:27:34,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:34,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:27:34,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:34,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:27:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:27:34,708 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 23:27:34,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:27:34,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 23:27:34,709 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:27:34,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 23:27:34,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 23:27:34,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 23:27:34,711 INFO L87 Difference]: Start difference. First operand 2192 states and 2934 transitions. Second operand 4 states. [2019-10-02 23:27:34,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:27:34,783 INFO L93 Difference]: Finished difference Result 2234 states and 2998 transitions. [2019-10-02 23:27:34,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 23:27:34,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-10-02 23:27:34,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:27:34,800 INFO L225 Difference]: With dead ends: 2234 [2019-10-02 23:27:34,800 INFO L226 Difference]: Without dead ends: 2234 [2019-10-02 23:27:34,802 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 23:27:34,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2234 states. [2019-10-02 23:27:34,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2234 to 2196. [2019-10-02 23:27:34,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2196 states. [2019-10-02 23:27:34,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2196 states to 2196 states and 2938 transitions. [2019-10-02 23:27:34,911 INFO L78 Accepts]: Start accepts. Automaton has 2196 states and 2938 transitions. Word has length 164 [2019-10-02 23:27:34,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:27:34,912 INFO L475 AbstractCegarLoop]: Abstraction has 2196 states and 2938 transitions. [2019-10-02 23:27:34,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 23:27:34,912 INFO L276 IsEmpty]: Start isEmpty. Operand 2196 states and 2938 transitions. [2019-10-02 23:27:34,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-02 23:27:34,918 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:27:34,919 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:27:34,919 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:27:34,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:27:34,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1683911757, now seen corresponding path program 1 times [2019-10-02 23:27:34,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:27:34,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:34,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:27:34,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:34,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:27:35,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:27:35,292 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 23:27:35,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:27:35,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:27:35,293 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:27:35,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:27:35,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:27:35,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:27:35,295 INFO L87 Difference]: Start difference. First operand 2196 states and 2938 transitions. Second operand 3 states. [2019-10-02 23:27:35,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:27:35,345 INFO L93 Difference]: Finished difference Result 2208 states and 2954 transitions. [2019-10-02 23:27:35,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:27:35,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-10-02 23:27:35,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:27:35,368 INFO L225 Difference]: With dead ends: 2208 [2019-10-02 23:27:35,368 INFO L226 Difference]: Without dead ends: 2208 [2019-10-02 23:27:35,370 INFO L640 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 [2019-10-02 23:27:35,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2208 states. [2019-10-02 23:27:35,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2208 to 2200. [2019-10-02 23:27:35,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2200 states. [2019-10-02 23:27:35,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2200 states to 2200 states and 2942 transitions. [2019-10-02 23:27:35,431 INFO L78 Accepts]: Start accepts. Automaton has 2200 states and 2942 transitions. Word has length 175 [2019-10-02 23:27:35,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:27:35,432 INFO L475 AbstractCegarLoop]: Abstraction has 2200 states and 2942 transitions. [2019-10-02 23:27:35,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:27:35,432 INFO L276 IsEmpty]: Start isEmpty. Operand 2200 states and 2942 transitions. [2019-10-02 23:27:35,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-10-02 23:27:35,437 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:27:35,437 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:27:35,438 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:27:35,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:27:35,438 INFO L82 PathProgramCache]: Analyzing trace with hash -665722229, now seen corresponding path program 1 times [2019-10-02 23:27:35,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:27:35,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:35,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:27:35,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:35,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:27:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:27:35,716 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 23:27:35,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:27:35,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 23:27:35,720 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:27:35,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 23:27:35,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 23:27:35,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 23:27:35,723 INFO L87 Difference]: Start difference. First operand 2200 states and 2942 transitions. Second operand 5 states. [2019-10-02 23:27:35,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:27:35,778 INFO L93 Difference]: Finished difference Result 2232 states and 2986 transitions. [2019-10-02 23:27:35,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 23:27:35,779 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 186 [2019-10-02 23:27:35,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:27:35,792 INFO L225 Difference]: With dead ends: 2232 [2019-10-02 23:27:35,793 INFO L226 Difference]: Without dead ends: 2232 [2019-10-02 23:27:35,793 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 23:27:35,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2232 states. [2019-10-02 23:27:35,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2232 to 2212. [2019-10-02 23:27:35,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2212 states. [2019-10-02 23:27:35,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2212 states to 2212 states and 2960 transitions. [2019-10-02 23:27:35,873 INFO L78 Accepts]: Start accepts. Automaton has 2212 states and 2960 transitions. Word has length 186 [2019-10-02 23:27:35,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:27:35,874 INFO L475 AbstractCegarLoop]: Abstraction has 2212 states and 2960 transitions. [2019-10-02 23:27:35,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 23:27:35,874 INFO L276 IsEmpty]: Start isEmpty. Operand 2212 states and 2960 transitions. [2019-10-02 23:27:35,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-10-02 23:27:35,886 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:27:35,886 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:27:35,887 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:27:35,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:27:35,887 INFO L82 PathProgramCache]: Analyzing trace with hash 882115653, now seen corresponding path program 1 times [2019-10-02 23:27:35,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:27:35,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:35,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:27:35,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:35,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:27:36,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:27:36,260 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 23:27:36,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:27:36,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 23:27:36,261 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:27:36,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 23:27:36,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 23:27:36,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 23:27:36,264 INFO L87 Difference]: Start difference. First operand 2212 states and 2960 transitions. Second operand 5 states. [2019-10-02 23:27:36,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:27:36,334 INFO L93 Difference]: Finished difference Result 2332 states and 3142 transitions. [2019-10-02 23:27:36,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 23:27:36,335 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 186 [2019-10-02 23:27:36,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:27:36,351 INFO L225 Difference]: With dead ends: 2332 [2019-10-02 23:27:36,351 INFO L226 Difference]: Without dead ends: 2332 [2019-10-02 23:27:36,352 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 23:27:36,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2332 states. [2019-10-02 23:27:36,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2332 to 2220. [2019-10-02 23:27:36,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2220 states. [2019-10-02 23:27:36,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2220 states to 2220 states and 2968 transitions. [2019-10-02 23:27:36,427 INFO L78 Accepts]: Start accepts. Automaton has 2220 states and 2968 transitions. Word has length 186 [2019-10-02 23:27:36,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:27:36,428 INFO L475 AbstractCegarLoop]: Abstraction has 2220 states and 2968 transitions. [2019-10-02 23:27:36,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 23:27:36,428 INFO L276 IsEmpty]: Start isEmpty. Operand 2220 states and 2968 transitions. [2019-10-02 23:27:36,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-10-02 23:27:36,435 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:27:36,436 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:27:36,436 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:27:36,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:27:36,437 INFO L82 PathProgramCache]: Analyzing trace with hash -642019834, now seen corresponding path program 1 times [2019-10-02 23:27:36,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:27:36,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:36,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:27:36,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:36,444 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:27:36,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:27:36,798 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-02 23:27:36,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:27:36,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 23:27:36,799 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:27:36,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 23:27:36,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 23:27:36,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 23:27:36,801 INFO L87 Difference]: Start difference. First operand 2220 states and 2968 transitions. Second operand 5 states. [2019-10-02 23:27:36,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:27:36,847 INFO L93 Difference]: Finished difference Result 2250 states and 3030 transitions. [2019-10-02 23:27:36,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 23:27:36,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 248 [2019-10-02 23:27:36,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:27:36,869 INFO L225 Difference]: With dead ends: 2250 [2019-10-02 23:27:36,870 INFO L226 Difference]: Without dead ends: 2250 [2019-10-02 23:27:36,870 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 23:27:36,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2250 states. [2019-10-02 23:27:36,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2250 to 2240. [2019-10-02 23:27:36,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2240 states. [2019-10-02 23:27:36,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2240 states to 2240 states and 3007 transitions. [2019-10-02 23:27:36,932 INFO L78 Accepts]: Start accepts. Automaton has 2240 states and 3007 transitions. Word has length 248 [2019-10-02 23:27:36,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:27:36,935 INFO L475 AbstractCegarLoop]: Abstraction has 2240 states and 3007 transitions. [2019-10-02 23:27:36,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 23:27:36,935 INFO L276 IsEmpty]: Start isEmpty. Operand 2240 states and 3007 transitions. [2019-10-02 23:27:36,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-10-02 23:27:36,948 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:27:36,949 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:27:36,949 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:27:36,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:27:36,950 INFO L82 PathProgramCache]: Analyzing trace with hash 62314607, now seen corresponding path program 1 times [2019-10-02 23:27:36,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:27:36,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:36,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:27:36,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:36,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:27:37,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:27:37,410 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-10-02 23:27:37,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:27:37,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 23:27:37,411 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:27:37,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 23:27:37,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 23:27:37,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 23:27:37,412 INFO L87 Difference]: Start difference. First operand 2240 states and 3007 transitions. Second operand 5 states. [2019-10-02 23:27:37,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:27:37,453 INFO L93 Difference]: Finished difference Result 2260 states and 3040 transitions. [2019-10-02 23:27:37,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 23:27:37,454 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 290 [2019-10-02 23:27:37,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:27:37,463 INFO L225 Difference]: With dead ends: 2260 [2019-10-02 23:27:37,463 INFO L226 Difference]: Without dead ends: 2260 [2019-10-02 23:27:37,463 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 23:27:37,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2260 states. [2019-10-02 23:27:37,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2260 to 2250. [2019-10-02 23:27:37,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2250 states. [2019-10-02 23:27:37,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2250 states to 2250 states and 3017 transitions. [2019-10-02 23:27:37,519 INFO L78 Accepts]: Start accepts. Automaton has 2250 states and 3017 transitions. Word has length 290 [2019-10-02 23:27:37,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:27:37,519 INFO L475 AbstractCegarLoop]: Abstraction has 2250 states and 3017 transitions. [2019-10-02 23:27:37,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 23:27:37,520 INFO L276 IsEmpty]: Start isEmpty. Operand 2250 states and 3017 transitions. [2019-10-02 23:27:37,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-10-02 23:27:37,527 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:27:37,527 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:27:37,527 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:27:37,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:27:37,528 INFO L82 PathProgramCache]: Analyzing trace with hash 211763053, now seen corresponding path program 1 times [2019-10-02 23:27:37,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:27:37,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:37,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:27:37,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:37,534 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:27:37,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:27:37,869 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-02 23:27:37,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:27:37,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:27:37,870 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:27:37,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:27:37,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:27:37,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:27:37,872 INFO L87 Difference]: Start difference. First operand 2250 states and 3017 transitions. Second operand 3 states. [2019-10-02 23:27:37,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:27:37,909 INFO L93 Difference]: Finished difference Result 2335 states and 3175 transitions. [2019-10-02 23:27:37,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:27:37,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 283 [2019-10-02 23:27:37,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:27:37,923 INFO L225 Difference]: With dead ends: 2335 [2019-10-02 23:27:37,923 INFO L226 Difference]: Without dead ends: 2335 [2019-10-02 23:27:37,923 INFO L640 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 [2019-10-02 23:27:37,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2335 states. [2019-10-02 23:27:38,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2335 to 2305. [2019-10-02 23:27:38,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2305 states. [2019-10-02 23:27:38,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 2305 states and 3102 transitions. [2019-10-02 23:27:38,014 INFO L78 Accepts]: Start accepts. Automaton has 2305 states and 3102 transitions. Word has length 283 [2019-10-02 23:27:38,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:27:38,014 INFO L475 AbstractCegarLoop]: Abstraction has 2305 states and 3102 transitions. [2019-10-02 23:27:38,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:27:38,015 INFO L276 IsEmpty]: Start isEmpty. Operand 2305 states and 3102 transitions. [2019-10-02 23:27:38,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-10-02 23:27:38,025 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:27:38,025 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:27:38,026 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:27:38,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:27:38,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1694640213, now seen corresponding path program 1 times [2019-10-02 23:27:38,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:27:38,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:38,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:27:38,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:38,034 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:27:38,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:27:38,351 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-02 23:27:38,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:27:38,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:27:38,352 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:27:38,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:27:38,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:27:38,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:27:38,353 INFO L87 Difference]: Start difference. First operand 2305 states and 3102 transitions. Second operand 3 states. [2019-10-02 23:27:38,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:27:38,394 INFO L93 Difference]: Finished difference Result 2325 states and 3137 transitions. [2019-10-02 23:27:38,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:27:38,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 283 [2019-10-02 23:27:38,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:27:38,409 INFO L225 Difference]: With dead ends: 2325 [2019-10-02 23:27:38,410 INFO L226 Difference]: Without dead ends: 2325 [2019-10-02 23:27:38,410 INFO L640 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 [2019-10-02 23:27:38,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2325 states. [2019-10-02 23:27:38,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2325 to 2310. [2019-10-02 23:27:38,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2310 states. [2019-10-02 23:27:38,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2310 states to 2310 states and 3107 transitions. [2019-10-02 23:27:38,506 INFO L78 Accepts]: Start accepts. Automaton has 2310 states and 3107 transitions. Word has length 283 [2019-10-02 23:27:38,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:27:38,507 INFO L475 AbstractCegarLoop]: Abstraction has 2310 states and 3107 transitions. [2019-10-02 23:27:38,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:27:38,507 INFO L276 IsEmpty]: Start isEmpty. Operand 2310 states and 3107 transitions. [2019-10-02 23:27:38,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-10-02 23:27:38,524 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:27:38,525 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:27:38,525 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:27:38,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:27:38,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1885188867, now seen corresponding path program 1 times [2019-10-02 23:27:38,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:27:38,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:38,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:27:38,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:38,535 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:27:38,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:27:39,215 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2019-10-02 23:27:39,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 23:27:39,215 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 23:27:39,217 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 372 with the following transitions: [2019-10-02 23:27:39,219 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [6], [7], [8], [10], [15], [16], [17], [18], [19], [22], [27], [28], [29], [31], [32], [54], [55], [60], [62], [63], [119], [122], [126], [130], [133], [135], [140], [144], [147], [151], [153], [176], [179], [180], [222], [224], [227], [292], [305], [308], [311], [314], [316], [339], [517], [579], [580], [581], [582], [583], [585], [607], [611], [616], [617], [618], [623], [625], [630], [632], [635], [652], [686], [687], [726], [731], [736], [737], [738], [740], [741], [770], [772], [794], [796], [808], [810], [811], [903], [905], [907], [910], [913], [926], [929], [932], [1005], [1008], [1011], [1023], [1026], [1029], [1031], [1034], [1042], [1073], [1074], [1075], [1076], [1093], [1096], [1163], [1165], [1166], [1203], [1204], [1231], [1233], [1235], [1238], [1244], [1305], [1306], [1312], [1313], [1314], [1356], [1361], [1371], [1375], [1377], [1379], [1381], [1386], [1392], [1394], [1396], [1401], [1402], [1476], [1477], [1478], [1500], [1502], [1505], [1507], [1511], [1678], [1680], [1682], [1685], [1706], [1710], [1712], [1716], [1718], [1721], [1723], [1726], [1740], [1742], [1886], [1887], [1888], [1889], [1896], [1897], [1906], [1907], [1928], [1929], [1930], [1931], [1932], [1933], [1934], [1935], [1936], [1937], [1940], [1941], [1942], [1943], [1946], [1947], [1952], [1953], [1970], [1971], [1972], [1973], [1974], [1975], [1976], [1977], [1978], [1979], [2052], [2053], [2054], [2055], [2060], [2061], [2062], [2063], [2064], [2065], [2092], [2094], [2095], [2106], [2107], [2108], [2109], [2138], [2139], [2142], [2154], [2155], [2160], [2161], [2162], [2163], [2192], [2193], [2202], [2203], [2204], [2205], [2206], [2234], [2256], [2257], [2258], [2259], [2260], [2261], [2262], [2263], [2292], [2293], [2294], [2295], [2334], [2335], [2342], [2343], [2344], [2345], [2366], [2367], [2368] [2019-10-02 23:27:39,289 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 23:27:39,289 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 23:27:39,438 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 23:27:39,440 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 180 root evaluator evaluations with a maximum evaluation depth of 0. Performed 180 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 356 variables. [2019-10-02 23:27:39,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:27:39,445 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 23:27:39,619 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-02 23:27:39,619 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 23:27:39,634 INFO L420 sIntCurrentIteration]: We unified 370 AI predicates to 370 [2019-10-02 23:27:39,634 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 23:27:39,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 23:27:39,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [10] total 10 [2019-10-02 23:27:39,636 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:27:39,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 23:27:39,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 23:27:39,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 23:27:39,638 INFO L87 Difference]: Start difference. First operand 2310 states and 3107 transitions. Second operand 2 states. [2019-10-02 23:27:39,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:27:39,639 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-02 23:27:39,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 23:27:39,640 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 371 [2019-10-02 23:27:39,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:27:39,640 INFO L225 Difference]: With dead ends: 2 [2019-10-02 23:27:39,640 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 23:27:39,641 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 23:27:39,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 23:27:39,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 23:27:39,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 23:27:39,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 23:27:39,644 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 371 [2019-10-02 23:27:39,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:27:39,644 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 23:27:39,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 23:27:39,644 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 23:27:39,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 23:27:39,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:27:39 BoogieIcfgContainer [2019-10-02 23:27:39,652 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 23:27:39,663 INFO L168 Benchmark]: Toolchain (without parser) took 33753.62 ms. Allocated memory was 130.0 MB in the beginning and 768.6 MB in the end (delta: 638.6 MB). Free memory was 79.3 MB in the beginning and 460.9 MB in the end (delta: -381.6 MB). Peak memory consumption was 257.0 MB. Max. memory is 7.1 GB. [2019-10-02 23:27:39,664 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 130.0 MB. Free memory was 104.2 MB in the beginning and 104.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-10-02 23:27:39,666 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1931.01 ms. Allocated memory was 130.0 MB in the beginning and 209.7 MB in the end (delta: 79.7 MB). Free memory was 78.9 MB in the beginning and 91.3 MB in the end (delta: -12.4 MB). Peak memory consumption was 74.4 MB. Max. memory is 7.1 GB. [2019-10-02 23:27:39,667 INFO L168 Benchmark]: Boogie Preprocessor took 337.97 ms. Allocated memory is still 209.7 MB. Free memory was 91.3 MB in the beginning and 72.9 MB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. [2019-10-02 23:27:39,668 INFO L168 Benchmark]: RCFGBuilder took 9537.03 ms. Allocated memory was 209.7 MB in the beginning and 407.9 MB in the end (delta: 198.2 MB). Free memory was 72.9 MB in the beginning and 144.4 MB in the end (delta: -71.5 MB). Peak memory consumption was 224.0 MB. Max. memory is 7.1 GB. [2019-10-02 23:27:39,673 INFO L168 Benchmark]: TraceAbstraction took 21941.96 ms. Allocated memory was 407.9 MB in the beginning and 768.6 MB in the end (delta: 360.7 MB). Free memory was 144.4 MB in the beginning and 460.9 MB in the end (delta: -316.5 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. [2019-10-02 23:27:39,677 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 130.0 MB. Free memory was 104.2 MB in the beginning and 104.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1931.01 ms. Allocated memory was 130.0 MB in the beginning and 209.7 MB in the end (delta: 79.7 MB). Free memory was 78.9 MB in the beginning and 91.3 MB in the end (delta: -12.4 MB). Peak memory consumption was 74.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 337.97 ms. Allocated memory is still 209.7 MB. Free memory was 91.3 MB in the beginning and 72.9 MB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 9537.03 ms. Allocated memory was 209.7 MB in the beginning and 407.9 MB in the end (delta: 198.2 MB). Free memory was 72.9 MB in the beginning and 144.4 MB in the end (delta: -71.5 MB). Peak memory consumption was 224.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 21941.96 ms. Allocated memory was 407.9 MB in the beginning and 768.6 MB in the end (delta: 360.7 MB). Free memory was 144.4 MB in the beginning and 460.9 MB in the end (delta: -316.5 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4602]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 122 procedures, 1042 locations, 1 error locations. SAFE Result, 21.8s OverallTime, 22 OverallIterations, 10 TraceHistogramMax, 12.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 23224 SDtfs, 7800 SDslu, 28630 SDs, 0 SdLazy, 636 SolverSat, 20 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 10.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 448 GetRequests, 412 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2310occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 2.4594594594594597 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 22 MinimizatonAttempts, 345 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 2939 NumberOfCodeBlocks, 2939 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2917 ConstructedInterpolants, 0 QuantifiedInterpolants, 663485 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 21 PerfectInterpolantSequences, 852/854 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...