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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -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-13a467a-m [2019-10-15 00:19:04,651 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 00:19:04,655 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 00:19:04,671 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 00:19:04,671 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 00:19:04,673 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 00:19:04,675 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 00:19:04,685 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 00:19:04,688 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 00:19:04,689 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 00:19:04,692 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 00:19:04,694 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 00:19:04,695 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 00:19:04,698 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 00:19:04,702 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 00:19:04,704 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 00:19:04,705 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 00:19:04,707 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 00:19:04,709 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 00:19:04,715 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 00:19:04,719 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 00:19:04,720 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 00:19:04,721 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 00:19:04,722 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 00:19:04,725 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 00:19:04,725 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 00:19:04,725 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 00:19:04,727 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 00:19:04,729 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 00:19:04,730 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 00:19:04,730 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 00:19:04,732 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 00:19:04,733 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 00:19:04,733 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 00:19:04,735 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 00:19:04,735 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 00:19:04,736 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 00:19:04,736 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 00:19:04,736 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 00:19:04,738 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 00:19:04,741 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 00:19:04,742 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 00:19:04,780 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 00:19:04,780 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 00:19:04,783 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 00:19:04,784 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 00:19:04,784 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 00:19:04,784 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 00:19:04,784 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 00:19:04,784 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 00:19:04,785 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 00:19:04,785 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 00:19:04,785 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 00:19:04,785 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 00:19:04,785 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 00:19:04,786 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 00:19:04,786 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 00:19:04,786 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 00:19:04,789 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 00:19:04,789 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 00:19:04,789 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 00:19:04,789 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 00:19:04,790 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 00:19:04,790 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 00:19:04,790 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 00:19:04,790 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 00:19:04,791 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 00:19:04,791 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 00:19:04,791 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 00:19:04,791 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 00:19:04,791 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 00:19:05,100 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 00:19:05,115 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 00:19:05,121 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 00:19:05,122 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 00:19:05,123 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 00:19:05,123 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-15 00:19:05,201 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba6b29592/75d366ac0fde406b9c265e4cf8ef07c5/FLAG644b2e90a [2019-10-15 00:19:05,934 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 00:19:05,935 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-15 00:19:05,963 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba6b29592/75d366ac0fde406b9c265e4cf8ef07c5/FLAG644b2e90a [2019-10-15 00:19:06,044 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba6b29592/75d366ac0fde406b9c265e4cf8ef07c5 [2019-10-15 00:19:06,055 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 00:19:06,057 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 00:19:06,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 00:19:06,058 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 00:19:06,064 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 00:19:06,065 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:19:06" (1/1) ... [2019-10-15 00:19:06,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13592446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:06, skipping insertion in model container [2019-10-15 00:19:06,069 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:19:06" (1/1) ... [2019-10-15 00:19:06,078 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 00:19:06,190 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 00:19:07,348 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 00:19:07,399 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 00:19:07,676 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 00:19:07,867 INFO L192 MainTranslator]: Completed translation [2019-10-15 00:19:07,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:07 WrapperNode [2019-10-15 00:19:07,868 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 00:19:07,869 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 00:19:07,869 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 00:19:07,869 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 00:19:07,926 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:07" (1/1) ... [2019-10-15 00:19:07,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:07" (1/1) ... [2019-10-15 00:19:08,022 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:07" (1/1) ... [2019-10-15 00:19:08,023 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:07" (1/1) ... [2019-10-15 00:19:08,119 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:07" (1/1) ... [2019-10-15 00:19:08,140 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:07" (1/1) ... [2019-10-15 00:19:08,167 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:07" (1/1) ... [2019-10-15 00:19:08,201 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 00:19:08,202 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 00:19:08,202 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 00:19:08,202 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 00:19:08,203 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19: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-15 00:19:08,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 00:19:08,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 00:19:08,285 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2019-10-15 00:19:08,285 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2019-10-15 00:19:08,285 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2019-10-15 00:19:08,286 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2019-10-15 00:19:08,286 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_inc [2019-10-15 00:19:08,286 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec_and_test [2019-10-15 00:19:08,286 INFO L138 BoogieDeclarations]: Found implementation of procedure iminor [2019-10-15 00:19:08,286 INFO L138 BoogieDeclarations]: Found implementation of procedure register_chrdev [2019-10-15 00:19:08,287 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_chrdev [2019-10-15 00:19:08,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2019-10-15 00:19:08,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-10-15 00:19:08,287 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2019-10-15 00:19:08,287 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2019-10-15 00:19:08,288 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2019-10-15 00:19:08,288 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2019-10-15 00:19:08,288 INFO L138 BoogieDeclarations]: Found implementation of procedure status_reg [2019-10-15 00:19:08,288 INFO L138 BoogieDeclarations]: Found implementation of procedure read_reg [2019-10-15 00:19:08,291 INFO L138 BoogieDeclarations]: Found implementation of procedure write_reg [2019-10-15 00:19:08,291 INFO L138 BoogieDeclarations]: Found implementation of procedure DRIVE [2019-10-15 00:19:08,292 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_wait [2019-10-15 00:19:08,292 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_command [2019-10-15 00:19:08,292 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_completion [2019-10-15 00:19:08,292 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_req_sense [2019-10-15 00:19:08,292 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_atapi [2019-10-15 00:19:08,293 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_sleep [2019-10-15 00:19:08,293 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_poll_dsc [2019-10-15 00:19:08,293 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_media_access_cmd [2019-10-15 00:19:08,293 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_rewind [2019-10-15 00:19:08,293 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_write_fm [2019-10-15 00:19:08,293 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_reset [2019-10-15 00:19:08,293 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_ready_wait [2019-10-15 00:19:08,294 INFO L138 BoogieDeclarations]: Found implementation of procedure xs [2019-10-15 00:19:08,294 INFO L138 BoogieDeclarations]: Found implementation of procedure xn [2019-10-15 00:19:08,294 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_identify [2019-10-15 00:19:08,294 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_probe [2019-10-15 00:19:08,294 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_detect [2019-10-15 00:19:08,295 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_open [2019-10-15 00:19:08,295 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_ioctl [2019-10-15 00:19:08,295 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_release [2019-10-15 00:19:08,295 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_read [2019-10-15 00:19:08,296 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_write [2019-10-15 00:19:08,296 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_init [2019-10-15 00:19:08,296 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_exit [2019-10-15 00:19:08,296 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 00:19:08,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_1 [2019-10-15 00:19:08,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_2 [2019-10-15 00:19:08,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_3 [2019-10-15 00:19:08,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_4 [2019-10-15 00:19:08,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_5 [2019-10-15 00:19:08,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_6 [2019-10-15 00:19:08,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_7 [2019-10-15 00:19:08,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_8 [2019-10-15 00:19:08,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_9 [2019-10-15 00:19:08,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_10 [2019-10-15 00:19:08,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_11 [2019-10-15 00:19:08,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_12 [2019-10-15 00:19:08,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_13 [2019-10-15 00:19:08,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_14 [2019-10-15 00:19:08,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_15 [2019-10-15 00:19:08,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_register_chrdev_16 [2019-10-15 00:19:08,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_unregister_chrdev_17 [2019-10-15 00:19:08,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-10-15 00:19:08,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-10-15 00:19:08,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_trap [2019-10-15 00:19:08,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_cred_guard_mutex_of_signal_struct [2019-10-15 00:19:08,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_cred_guard_mutex_of_signal_struct [2019-10-15 00:19:08,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_cred_guard_mutex_of_signal_struct [2019-10-15 00:19:08,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_cred_guard_mutex_of_signal_struct [2019-10-15 00:19:08,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_cred_guard_mutex_of_signal_struct [2019-10-15 00:19:08,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_cred_guard_mutex_of_signal_struct [2019-10-15 00:19:08,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_cred_guard_mutex_of_signal_struct [2019-10-15 00:19:08,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_lock [2019-10-15 00:19:08,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_lock [2019-10-15 00:19:08,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_lock [2019-10-15 00:19:08,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_lock [2019-10-15 00:19:08,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_lock [2019-10-15 00:19:08,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_lock [2019-10-15 00:19:08,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_lock [2019-10-15 00:19:08,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_mutex_of_device [2019-10-15 00:19:08,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_mutex_of_device [2019-10-15 00:19:08,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mutex_of_device [2019-10-15 00:19:08,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_mutex_of_device [2019-10-15 00:19:08,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_mutex_of_device [2019-10-15 00:19:08,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_mutex_of_device [2019-10-15 00:19:08,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mutex_of_device [2019-10-15 00:19:08,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_pt_mutex [2019-10-15 00:19:08,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_pt_mutex [2019-10-15 00:19:08,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_pt_mutex [2019-10-15 00:19:08,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_pt_mutex [2019-10-15 00:19:08,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_pt_mutex [2019-10-15 00:19:08,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_pt_mutex [2019-10-15 00:19:08,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_pt_mutex [2019-10-15 00:19:08,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-10-15 00:19:08,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-10-15 00:19:08,305 INFO L138 BoogieDeclarations]: Found implementation of procedure __class_create [2019-10-15 00:19:08,305 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2019-10-15 00:19:08,306 INFO L138 BoogieDeclarations]: Found implementation of procedure __register_chrdev [2019-10-15 00:19:08,306 INFO L138 BoogieDeclarations]: Found implementation of procedure __unregister_chrdev [2019-10-15 00:19:08,306 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2019-10-15 00:19:08,306 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2019-10-15 00:19:08,306 INFO L138 BoogieDeclarations]: Found implementation of procedure class_destroy [2019-10-15 00:19:08,306 INFO L138 BoogieDeclarations]: Found implementation of procedure device_create [2019-10-15 00:19:08,307 INFO L138 BoogieDeclarations]: Found implementation of procedure device_destroy [2019-10-15 00:19:08,307 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2019-10-15 00:19:08,307 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2019-10-15 00:19:08,307 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_trylock [2019-10-15 00:19:08,307 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2019-10-15 00:19:08,307 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_connect [2019-10-15 00:19:08,307 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_disconnect [2019-10-15 00:19:08,308 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_init [2019-10-15 00:19:08,308 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_read_block [2019-10-15 00:19:08,308 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_read_regr [2019-10-15 00:19:08,308 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_release [2019-10-15 00:19:08,308 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_write_block [2019-10-15 00:19:08,308 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_write_regr [2019-10-15 00:19:08,309 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-10-15 00:19:08,309 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_timeout_interruptible [2019-10-15 00:19:08,309 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_fmt [2019-10-15 00:19:08,309 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-10-15 00:19:08,309 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-10-15 00:19:08,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 00:19:08,310 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 00:19:08,310 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-10-15 00:19:08,310 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-10-15 00:19:08,310 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2019-10-15 00:19:08,310 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2019-10-15 00:19:08,310 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_fmt [2019-10-15 00:19:08,310 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2019-10-15 00:19:08,311 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2019-10-15 00:19:08,311 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2019-10-15 00:19:08,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 00:19:08,311 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2019-10-15 00:19:08,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 00:19:08,311 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_inc [2019-10-15 00:19:08,312 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec_and_test [2019-10-15 00:19:08,312 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_trylock [2019-10-15 00:19:08,312 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_4 [2019-10-15 00:19:08,312 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2019-10-15 00:19:08,312 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_2 [2019-10-15 00:19:08,312 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_5 [2019-10-15 00:19:08,313 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_7 [2019-10-15 00:19:08,313 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_9 [2019-10-15 00:19:08,313 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_10 [2019-10-15 00:19:08,313 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_11 [2019-10-15 00:19:08,313 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_13 [2019-10-15 00:19:08,313 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_15 [2019-10-15 00:19:08,313 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2019-10-15 00:19:08,314 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_1 [2019-10-15 00:19:08,314 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_3 [2019-10-15 00:19:08,314 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_6 [2019-10-15 00:19:08,314 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_8 [2019-10-15 00:19:08,314 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_12 [2019-10-15 00:19:08,314 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_14 [2019-10-15 00:19:08,314 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_cred_guard_mutex_of_signal_struct [2019-10-15 00:19:08,315 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_cred_guard_mutex_of_signal_struct [2019-10-15 00:19:08,315 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_lock [2019-10-15 00:19:08,315 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_lock [2019-10-15 00:19:08,315 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mutex_of_device [2019-10-15 00:19:08,315 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_mutex_of_device [2019-10-15 00:19:08,316 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mutex_of_device [2019-10-15 00:19:08,316 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_pt_mutex [2019-10-15 00:19:08,316 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_pt_mutex [2019-10-15 00:19:08,316 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 00:19:08,316 INFO L130 BoogieDeclarations]: Found specification of procedure iminor [2019-10-15 00:19:08,317 INFO L130 BoogieDeclarations]: Found specification of procedure __register_chrdev [2019-10-15 00:19:08,317 INFO L130 BoogieDeclarations]: Found specification of procedure __unregister_chrdev [2019-10-15 00:19:08,317 INFO L130 BoogieDeclarations]: Found specification of procedure register_chrdev [2019-10-15 00:19:08,317 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_register_chrdev_16 [2019-10-15 00:19:08,317 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_chrdev [2019-10-15 00:19:08,318 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_unregister_chrdev_17 [2019-10-15 00:19:08,318 INFO L130 BoogieDeclarations]: Found specification of procedure noop_llseek [2019-10-15 00:19:08,318 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2019-10-15 00:19:08,318 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-10-15 00:19:08,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 00:19:08,319 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 00:19:08,319 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2019-10-15 00:19:08,319 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-10-15 00:19:08,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 00:19:08,319 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2019-10-15 00:19:08,320 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2019-10-15 00:19:08,320 INFO L130 BoogieDeclarations]: Found specification of procedure __class_create [2019-10-15 00:19:08,320 INFO L130 BoogieDeclarations]: Found specification of procedure class_destroy [2019-10-15 00:19:08,320 INFO L130 BoogieDeclarations]: Found specification of procedure device_create [2019-10-15 00:19:08,320 INFO L130 BoogieDeclarations]: Found specification of procedure device_destroy [2019-10-15 00:19:08,321 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_timeout_interruptible [2019-10-15 00:19:08,321 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2019-10-15 00:19:08,321 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2019-10-15 00:19:08,321 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2019-10-15 00:19:08,321 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2019-10-15 00:19:08,322 INFO L130 BoogieDeclarations]: Found specification of procedure pi_init [2019-10-15 00:19:08,322 INFO L130 BoogieDeclarations]: Found specification of procedure pi_release [2019-10-15 00:19:08,322 INFO L130 BoogieDeclarations]: Found specification of procedure pi_write_regr [2019-10-15 00:19:08,322 INFO L130 BoogieDeclarations]: Found specification of procedure pi_read_regr [2019-10-15 00:19:08,322 INFO L130 BoogieDeclarations]: Found specification of procedure pi_write_block [2019-10-15 00:19:08,322 INFO L130 BoogieDeclarations]: Found specification of procedure pi_read_block [2019-10-15 00:19:08,323 INFO L130 BoogieDeclarations]: Found specification of procedure pi_connect [2019-10-15 00:19:08,323 INFO L130 BoogieDeclarations]: Found specification of procedure pi_disconnect [2019-10-15 00:19:08,323 INFO L130 BoogieDeclarations]: Found specification of procedure pt_open [2019-10-15 00:19:08,323 INFO L130 BoogieDeclarations]: Found specification of procedure pt_ioctl [2019-10-15 00:19:08,323 INFO L130 BoogieDeclarations]: Found specification of procedure pt_release [2019-10-15 00:19:08,324 INFO L130 BoogieDeclarations]: Found specification of procedure pt_read [2019-10-15 00:19:08,324 INFO L130 BoogieDeclarations]: Found specification of procedure pt_write [2019-10-15 00:19:08,324 INFO L130 BoogieDeclarations]: Found specification of procedure pt_detect [2019-10-15 00:19:08,324 INFO L130 BoogieDeclarations]: Found specification of procedure pt_identify [2019-10-15 00:19:08,324 INFO L130 BoogieDeclarations]: Found specification of procedure status_reg [2019-10-15 00:19:08,325 INFO L130 BoogieDeclarations]: Found specification of procedure read_reg [2019-10-15 00:19:08,325 INFO L130 BoogieDeclarations]: Found specification of procedure write_reg [2019-10-15 00:19:08,325 INFO L130 BoogieDeclarations]: Found specification of procedure DRIVE [2019-10-15 00:19:08,325 INFO L130 BoogieDeclarations]: Found specification of procedure pt_wait [2019-10-15 00:19:08,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 00:19:08,325 INFO L130 BoogieDeclarations]: Found specification of procedure pt_command [2019-10-15 00:19:08,326 INFO L130 BoogieDeclarations]: Found specification of procedure pt_completion [2019-10-15 00:19:08,326 INFO L130 BoogieDeclarations]: Found specification of procedure pt_req_sense [2019-10-15 00:19:08,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 00:19:08,326 INFO L130 BoogieDeclarations]: Found specification of procedure pt_atapi [2019-10-15 00:19:08,326 INFO L130 BoogieDeclarations]: Found specification of procedure pt_sleep [2019-10-15 00:19:08,326 INFO L130 BoogieDeclarations]: Found specification of procedure pt_poll_dsc [2019-10-15 00:19:08,326 INFO L130 BoogieDeclarations]: Found specification of procedure pt_media_access_cmd [2019-10-15 00:19:08,327 INFO L130 BoogieDeclarations]: Found specification of procedure pt_rewind [2019-10-15 00:19:08,327 INFO L130 BoogieDeclarations]: Found specification of procedure pt_write_fm [2019-10-15 00:19:08,327 INFO L130 BoogieDeclarations]: Found specification of procedure pt_reset [2019-10-15 00:19:08,327 INFO L130 BoogieDeclarations]: Found specification of procedure pt_ready_wait [2019-10-15 00:19:08,327 INFO L130 BoogieDeclarations]: Found specification of procedure xs [2019-10-15 00:19:08,327 INFO L130 BoogieDeclarations]: Found specification of procedure xn [2019-10-15 00:19:08,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 00:19:08,328 INFO L130 BoogieDeclarations]: Found specification of procedure pt_probe [2019-10-15 00:19:08,328 INFO L130 BoogieDeclarations]: Found specification of procedure pt_init [2019-10-15 00:19:08,328 INFO L130 BoogieDeclarations]: Found specification of procedure pt_exit [2019-10-15 00:19:08,328 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-10-15 00:19:08,329 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-10-15 00:19:08,329 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 00:19:08,329 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-10-15 00:19:08,329 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_trap [2019-10-15 00:19:08,329 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_cred_guard_mutex_of_signal_struct [2019-10-15 00:19:08,329 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_cred_guard_mutex_of_signal_struct [2019-10-15 00:19:08,329 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_cred_guard_mutex_of_signal_struct [2019-10-15 00:19:08,329 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_cred_guard_mutex_of_signal_struct [2019-10-15 00:19:08,330 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_cred_guard_mutex_of_signal_struct [2019-10-15 00:19:08,330 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_lock [2019-10-15 00:19:08,330 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_lock [2019-10-15 00:19:08,330 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_lock [2019-10-15 00:19:08,330 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_lock [2019-10-15 00:19:08,330 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_lock [2019-10-15 00:19:08,330 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_mutex_of_device [2019-10-15 00:19:08,331 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_mutex_of_device [2019-10-15 00:19:08,331 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_mutex_of_device [2019-10-15 00:19:08,331 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_mutex_of_device [2019-10-15 00:19:08,331 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_pt_mutex [2019-10-15 00:19:08,331 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_pt_mutex [2019-10-15 00:19:08,331 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_pt_mutex [2019-10-15 00:19:08,331 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_pt_mutex [2019-10-15 00:19:08,332 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_pt_mutex [2019-10-15 00:19:08,332 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-10-15 00:19:08,332 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-10-15 00:19:08,332 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-15 00:19:08,332 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-15 00:19:08,332 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 00:19:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 00:19:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-15 00:19:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-15 00:19:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 00:19:16,667 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 00:19:16,668 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-15 00:19:16,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:19:16 BoogieIcfgContainer [2019-10-15 00:19:16,674 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 00:19:16,676 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 00:19:16,676 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 00:19:16,681 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 00:19:16,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 12:19:06" (1/3) ... [2019-10-15 00:19:16,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61ada41e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:19:16, skipping insertion in model container [2019-10-15 00:19:16,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:07" (2/3) ... [2019-10-15 00:19:16,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61ada41e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:19:16, skipping insertion in model container [2019-10-15 00:19:16,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:19:16" (3/3) ... [2019-10-15 00:19:16,694 INFO L109 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pt.ko-main.cil.out.i [2019-10-15 00:19:16,704 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 00:19:16,720 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 00:19:16,732 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 00:19:16,778 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 00:19:16,778 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 00:19:16,778 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 00:19:16,778 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 00:19:16,779 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 00:19:16,779 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 00:19:16,779 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 00:19:16,779 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 00:19:16,825 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states. [2019-10-15 00:19:16,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-15 00:19:16,839 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:19:16,840 INFO L380 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-15 00:19:16,844 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:19:16,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:19:16,850 INFO L82 PathProgramCache]: Analyzing trace with hash 272456639, now seen corresponding path program 1 times [2019-10-15 00:19:16,860 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:19:16,861 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238927053] [2019-10-15 00:19:16,861 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:19:16,861 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:19:16,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:19:17,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:19:17,544 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-15 00:19:17,545 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238927053] [2019-10-15 00:19:17,548 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:19:17,549 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 00:19:17,549 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244125206] [2019-10-15 00:19:17,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 00:19:17,555 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:19:17,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 00:19:17,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 00:19:17,574 INFO L87 Difference]: Start difference. First operand 928 states. Second operand 3 states. [2019-10-15 00:19:17,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:19:17,882 INFO L93 Difference]: Finished difference Result 1976 states and 2741 transitions. [2019-10-15 00:19:17,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 00:19:17,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-15 00:19:17,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:19:17,928 INFO L225 Difference]: With dead ends: 1976 [2019-10-15 00:19:17,929 INFO L226 Difference]: Without dead ends: 1153 [2019-10-15 00:19:17,943 INFO L600 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-15 00:19:17,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2019-10-15 00:19:18,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1104. [2019-10-15 00:19:18,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1104 states. [2019-10-15 00:19:18,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1486 transitions. [2019-10-15 00:19:18,103 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1486 transitions. Word has length 31 [2019-10-15 00:19:18,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:19:18,104 INFO L462 AbstractCegarLoop]: Abstraction has 1104 states and 1486 transitions. [2019-10-15 00:19:18,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 00:19:18,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1486 transitions. [2019-10-15 00:19:18,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-15 00:19:18,115 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:19:18,116 INFO L380 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-15 00:19:18,116 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:19:18,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:19:18,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1762829340, now seen corresponding path program 1 times [2019-10-15 00:19:18,117 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:19:18,118 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434988301] [2019-10-15 00:19:18,118 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:19:18,118 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:19:18,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:19:18,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:19:18,298 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-15 00:19:18,298 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434988301] [2019-10-15 00:19:18,298 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:19:18,298 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 00:19:18,299 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929461889] [2019-10-15 00:19:18,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 00:19:18,300 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:19:18,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 00:19:18,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 00:19:18,301 INFO L87 Difference]: Start difference. First operand 1104 states and 1486 transitions. Second operand 4 states. [2019-10-15 00:19:19,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:19:19,614 INFO L93 Difference]: Finished difference Result 2197 states and 2963 transitions. [2019-10-15 00:19:19,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 00:19:19,614 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-10-15 00:19:19,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:19:19,623 INFO L225 Difference]: With dead ends: 2197 [2019-10-15 00:19:19,623 INFO L226 Difference]: Without dead ends: 1104 [2019-10-15 00:19:19,629 INFO L600 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-15 00:19:19,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2019-10-15 00:19:19,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 1104. [2019-10-15 00:19:19,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1104 states. [2019-10-15 00:19:19,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1484 transitions. [2019-10-15 00:19:19,769 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1484 transitions. Word has length 31 [2019-10-15 00:19:19,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:19:19,770 INFO L462 AbstractCegarLoop]: Abstraction has 1104 states and 1484 transitions. [2019-10-15 00:19:19,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 00:19:19,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1484 transitions. [2019-10-15 00:19:19,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-15 00:19:19,773 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:19:19,773 INFO L380 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-15 00:19:19,773 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:19:19,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:19:19,773 INFO L82 PathProgramCache]: Analyzing trace with hash 958019960, now seen corresponding path program 1 times [2019-10-15 00:19:19,774 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:19:19,774 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518832837] [2019-10-15 00:19:19,774 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:19:19,774 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:19:19,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:19:19,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:19:19,954 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-15 00:19:19,955 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518832837] [2019-10-15 00:19:19,955 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:19:19,956 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 00:19:19,956 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761536278] [2019-10-15 00:19:19,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 00:19:19,956 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:19:19,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 00:19:19,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 00:19:19,958 INFO L87 Difference]: Start difference. First operand 1104 states and 1484 transitions. Second operand 3 states. [2019-10-15 00:19:20,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:19:20,099 INFO L93 Difference]: Finished difference Result 2225 states and 3007 transitions. [2019-10-15 00:19:20,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 00:19:20,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-10-15 00:19:20,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:19:20,111 INFO L225 Difference]: With dead ends: 2225 [2019-10-15 00:19:20,112 INFO L226 Difference]: Without dead ends: 1132 [2019-10-15 00:19:20,119 INFO L600 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-15 00:19:20,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2019-10-15 00:19:20,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1106. [2019-10-15 00:19:20,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1106 states. [2019-10-15 00:19:20,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1486 transitions. [2019-10-15 00:19:20,187 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1486 transitions. Word has length 40 [2019-10-15 00:19:20,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:19:20,187 INFO L462 AbstractCegarLoop]: Abstraction has 1106 states and 1486 transitions. [2019-10-15 00:19:20,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 00:19:20,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1486 transitions. [2019-10-15 00:19:20,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-15 00:19:20,189 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:19:20,190 INFO L380 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-15 00:19:20,190 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:19:20,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:19:20,190 INFO L82 PathProgramCache]: Analyzing trace with hash -721419499, now seen corresponding path program 1 times [2019-10-15 00:19:20,190 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:19:20,191 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909437108] [2019-10-15 00:19:20,191 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:19:20,191 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:19:20,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:19:20,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:19:20,308 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-15 00:19:20,309 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909437108] [2019-10-15 00:19:20,309 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:19:20,309 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 00:19:20,309 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575206925] [2019-10-15 00:19:20,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 00:19:20,310 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:19:20,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 00:19:20,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 00:19:20,311 INFO L87 Difference]: Start difference. First operand 1106 states and 1486 transitions. Second operand 3 states. [2019-10-15 00:19:20,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:19:20,847 INFO L93 Difference]: Finished difference Result 2829 states and 3814 transitions. [2019-10-15 00:19:20,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 00:19:20,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-10-15 00:19:20,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:19:20,859 INFO L225 Difference]: With dead ends: 2829 [2019-10-15 00:19:20,859 INFO L226 Difference]: Without dead ends: 1734 [2019-10-15 00:19:20,865 INFO L600 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-15 00:19:20,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-10-15 00:19:20,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1730. [2019-10-15 00:19:20,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1730 states. [2019-10-15 00:19:20,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1730 states to 1730 states and 2330 transitions. [2019-10-15 00:19:20,944 INFO L78 Accepts]: Start accepts. Automaton has 1730 states and 2330 transitions. Word has length 46 [2019-10-15 00:19:20,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:19:20,944 INFO L462 AbstractCegarLoop]: Abstraction has 1730 states and 2330 transitions. [2019-10-15 00:19:20,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 00:19:20,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1730 states and 2330 transitions. [2019-10-15 00:19:20,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-15 00:19:20,946 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:19:20,946 INFO L380 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-15 00:19:20,946 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:19:20,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:19:20,947 INFO L82 PathProgramCache]: Analyzing trace with hash -217122663, now seen corresponding path program 1 times [2019-10-15 00:19:20,947 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:19:20,947 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504966861] [2019-10-15 00:19:20,947 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:19:20,947 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:19:20,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:19:21,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:19:21,071 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-15 00:19:21,072 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504966861] [2019-10-15 00:19:21,072 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:19:21,072 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 00:19:21,072 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648749284] [2019-10-15 00:19:21,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 00:19:21,073 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:19:21,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 00:19:21,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 00:19:21,074 INFO L87 Difference]: Start difference. First operand 1730 states and 2330 transitions. Second operand 3 states. [2019-10-15 00:19:21,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:19:21,155 INFO L93 Difference]: Finished difference Result 3469 states and 4685 transitions. [2019-10-15 00:19:21,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 00:19:21,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-10-15 00:19:21,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:19:21,168 INFO L225 Difference]: With dead ends: 3469 [2019-10-15 00:19:21,168 INFO L226 Difference]: Without dead ends: 1750 [2019-10-15 00:19:21,176 INFO L600 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-15 00:19:21,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1750 states. [2019-10-15 00:19:21,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1750 to 1744. [2019-10-15 00:19:21,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1744 states. [2019-10-15 00:19:21,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1744 states to 1744 states and 2350 transitions. [2019-10-15 00:19:21,257 INFO L78 Accepts]: Start accepts. Automaton has 1744 states and 2350 transitions. Word has length 49 [2019-10-15 00:19:21,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:19:21,258 INFO L462 AbstractCegarLoop]: Abstraction has 1744 states and 2350 transitions. [2019-10-15 00:19:21,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 00:19:21,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 2350 transitions. [2019-10-15 00:19:21,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 00:19:21,259 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:19:21,259 INFO L380 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-15 00:19:21,260 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:19:21,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:19:21,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1429347774, now seen corresponding path program 1 times [2019-10-15 00:19:21,260 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:19:21,261 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360938339] [2019-10-15 00:19:21,261 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:19:21,261 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:19:21,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:19:21,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:19:21,454 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-15 00:19:21,454 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360938339] [2019-10-15 00:19:21,455 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:19:21,455 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 00:19:21,455 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002360309] [2019-10-15 00:19:21,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 00:19:21,456 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:19:21,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 00:19:21,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 00:19:21,457 INFO L87 Difference]: Start difference. First operand 1744 states and 2350 transitions. Second operand 3 states. [2019-10-15 00:19:21,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:19:21,535 INFO L93 Difference]: Finished difference Result 3529 states and 4777 transitions. [2019-10-15 00:19:21,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 00:19:21,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-10-15 00:19:21,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:19:21,548 INFO L225 Difference]: With dead ends: 3529 [2019-10-15 00:19:21,548 INFO L226 Difference]: Without dead ends: 1796 [2019-10-15 00:19:21,556 INFO L600 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-15 00:19:21,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1796 states. [2019-10-15 00:19:21,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1796 to 1792. [2019-10-15 00:19:21,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1792 states. [2019-10-15 00:19:21,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 2426 transitions. [2019-10-15 00:19:21,633 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 2426 transitions. Word has length 55 [2019-10-15 00:19:21,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:19:21,633 INFO L462 AbstractCegarLoop]: Abstraction has 1792 states and 2426 transitions. [2019-10-15 00:19:21,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 00:19:21,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 2426 transitions. [2019-10-15 00:19:21,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 00:19:21,634 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:19:21,634 INFO L380 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-15 00:19:21,635 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:19:21,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:19:21,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1358067713, now seen corresponding path program 1 times [2019-10-15 00:19:21,635 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:19:21,635 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625228038] [2019-10-15 00:19:21,636 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:19:21,636 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:19:21,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:19:21,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:19:21,765 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-15 00:19:21,766 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625228038] [2019-10-15 00:19:21,766 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:19:21,766 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 00:19:21,766 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040135017] [2019-10-15 00:19:21,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 00:19:21,767 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:19:21,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 00:19:21,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 00:19:21,768 INFO L87 Difference]: Start difference. First operand 1792 states and 2426 transitions. Second operand 3 states. [2019-10-15 00:19:21,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:19:21,880 INFO L93 Difference]: Finished difference Result 1814 states and 2452 transitions. [2019-10-15 00:19:21,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 00:19:21,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-10-15 00:19:21,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:19:21,892 INFO L225 Difference]: With dead ends: 1814 [2019-10-15 00:19:21,893 INFO L226 Difference]: Without dead ends: 1803 [2019-10-15 00:19:21,894 INFO L600 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-15 00:19:21,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2019-10-15 00:19:21,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1792. [2019-10-15 00:19:21,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1792 states. [2019-10-15 00:19:21,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 2424 transitions. [2019-10-15 00:19:21,974 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 2424 transitions. Word has length 55 [2019-10-15 00:19:21,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:19:21,975 INFO L462 AbstractCegarLoop]: Abstraction has 1792 states and 2424 transitions. [2019-10-15 00:19:21,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 00:19:21,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 2424 transitions. [2019-10-15 00:19:21,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 00:19:21,976 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:19:21,976 INFO L380 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-15 00:19:21,976 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:19:21,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:19:21,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1300809411, now seen corresponding path program 1 times [2019-10-15 00:19:21,977 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:19:21,977 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360746999] [2019-10-15 00:19:21,977 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:19:21,977 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:19:21,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:19:22,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:19:22,120 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-15 00:19:22,121 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360746999] [2019-10-15 00:19:22,121 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:19:22,121 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 00:19:22,121 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127766676] [2019-10-15 00:19:22,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 00:19:22,123 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:19:22,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 00:19:22,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 00:19:22,124 INFO L87 Difference]: Start difference. First operand 1792 states and 2424 transitions. Second operand 3 states. [2019-10-15 00:19:22,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:19:22,717 INFO L93 Difference]: Finished difference Result 1794 states and 2425 transitions. [2019-10-15 00:19:22,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 00:19:22,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-10-15 00:19:22,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:19:22,729 INFO L225 Difference]: With dead ends: 1794 [2019-10-15 00:19:22,729 INFO L226 Difference]: Without dead ends: 1791 [2019-10-15 00:19:22,731 INFO L600 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-15 00:19:22,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1791 states. [2019-10-15 00:19:22,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1791 to 1791. [2019-10-15 00:19:22,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1791 states. [2019-10-15 00:19:22,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 2422 transitions. [2019-10-15 00:19:22,810 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 2422 transitions. Word has length 55 [2019-10-15 00:19:22,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:19:22,810 INFO L462 AbstractCegarLoop]: Abstraction has 1791 states and 2422 transitions. [2019-10-15 00:19:22,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 00:19:22,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2422 transitions. [2019-10-15 00:19:22,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-15 00:19:22,811 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:19:22,812 INFO L380 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-15 00:19:22,812 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:19:22,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:19:22,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1670943529, now seen corresponding path program 1 times [2019-10-15 00:19:22,812 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:19:22,813 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816093052] [2019-10-15 00:19:22,813 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:19:22,813 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:19:22,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:19:22,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:19:22,968 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-15 00:19:23,040 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816093052] [2019-10-15 00:19:23,040 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:19:23,040 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 00:19:23,040 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929313680] [2019-10-15 00:19:23,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 00:19:23,041 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:19:23,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 00:19:23,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 00:19:23,044 INFO L87 Difference]: Start difference. First operand 1791 states and 2422 transitions. Second operand 3 states. [2019-10-15 00:19:23,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:19:23,912 INFO L93 Difference]: Finished difference Result 1793 states and 2423 transitions. [2019-10-15 00:19:23,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 00:19:23,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-10-15 00:19:23,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:19:23,923 INFO L225 Difference]: With dead ends: 1793 [2019-10-15 00:19:23,924 INFO L226 Difference]: Without dead ends: 1790 [2019-10-15 00:19:23,925 INFO L600 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-15 00:19:23,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-10-15 00:19:24,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1790. [2019-10-15 00:19:24,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1790 states. [2019-10-15 00:19:24,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1790 states to 1790 states and 2420 transitions. [2019-10-15 00:19:24,008 INFO L78 Accepts]: Start accepts. Automaton has 1790 states and 2420 transitions. Word has length 56 [2019-10-15 00:19:24,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:19:24,009 INFO L462 AbstractCegarLoop]: Abstraction has 1790 states and 2420 transitions. [2019-10-15 00:19:24,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 00:19:24,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1790 states and 2420 transitions. [2019-10-15 00:19:24,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-15 00:19:24,011 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:19:24,011 INFO L380 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-15 00:19:24,011 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:19:24,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:19:24,012 INFO L82 PathProgramCache]: Analyzing trace with hash -260194432, now seen corresponding path program 1 times [2019-10-15 00:19:24,012 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:19:24,012 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392992022] [2019-10-15 00:19:24,013 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:19:24,013 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:19:24,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:19:24,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:19:24,144 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-15 00:19:24,145 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392992022] [2019-10-15 00:19:24,145 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:19:24,145 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 00:19:24,145 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94697638] [2019-10-15 00:19:24,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 00:19:24,146 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:19:24,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 00:19:24,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 00:19:24,146 INFO L87 Difference]: Start difference. First operand 1790 states and 2420 transitions. Second operand 3 states. [2019-10-15 00:19:24,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:19:24,635 INFO L93 Difference]: Finished difference Result 1792 states and 2421 transitions. [2019-10-15 00:19:24,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 00:19:24,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-10-15 00:19:24,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:19:24,647 INFO L225 Difference]: With dead ends: 1792 [2019-10-15 00:19:24,648 INFO L226 Difference]: Without dead ends: 1789 [2019-10-15 00:19:24,649 INFO L600 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-15 00:19:24,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2019-10-15 00:19:24,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1789. [2019-10-15 00:19:24,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1789 states. [2019-10-15 00:19:24,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1789 states and 2418 transitions. [2019-10-15 00:19:24,749 INFO L78 Accepts]: Start accepts. Automaton has 1789 states and 2418 transitions. Word has length 57 [2019-10-15 00:19:24,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:19:24,749 INFO L462 AbstractCegarLoop]: Abstraction has 1789 states and 2418 transitions. [2019-10-15 00:19:24,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 00:19:24,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 2418 transitions. [2019-10-15 00:19:24,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 00:19:24,751 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:19:24,751 INFO L380 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-15 00:19:24,751 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:19:24,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:19:24,752 INFO L82 PathProgramCache]: Analyzing trace with hash 523359482, now seen corresponding path program 1 times [2019-10-15 00:19:24,752 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:19:24,753 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566070940] [2019-10-15 00:19:24,753 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:19:24,753 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:19:24,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:19:24,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:19:24,902 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-15 00:19:24,902 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566070940] [2019-10-15 00:19:24,903 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:19:24,903 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 00:19:24,903 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145117094] [2019-10-15 00:19:24,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 00:19:24,904 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:19:24,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 00:19:24,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 00:19:24,905 INFO L87 Difference]: Start difference. First operand 1789 states and 2418 transitions. Second operand 3 states. [2019-10-15 00:19:25,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:19:25,460 INFO L93 Difference]: Finished difference Result 2224 states and 2976 transitions. [2019-10-15 00:19:25,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 00:19:25,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-15 00:19:25,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:19:25,474 INFO L225 Difference]: With dead ends: 2224 [2019-10-15 00:19:25,475 INFO L226 Difference]: Without dead ends: 2174 [2019-10-15 00:19:25,477 INFO L600 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-15 00:19:25,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2174 states. [2019-10-15 00:19:25,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2174 to 2174. [2019-10-15 00:19:25,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2174 states. [2019-10-15 00:19:25,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 2174 states and 2916 transitions. [2019-10-15 00:19:25,586 INFO L78 Accepts]: Start accepts. Automaton has 2174 states and 2916 transitions. Word has length 58 [2019-10-15 00:19:25,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:19:25,587 INFO L462 AbstractCegarLoop]: Abstraction has 2174 states and 2916 transitions. [2019-10-15 00:19:25,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 00:19:25,587 INFO L276 IsEmpty]: Start isEmpty. Operand 2174 states and 2916 transitions. [2019-10-15 00:19:25,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 00:19:25,599 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:19:25,600 INFO L380 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-15 00:19:25,600 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:19:25,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:19:25,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1210973165, now seen corresponding path program 1 times [2019-10-15 00:19:25,601 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:19:25,601 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142413831] [2019-10-15 00:19:25,601 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:19:25,601 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:19:25,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:19:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:19:25,873 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-15 00:19:25,873 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142413831] [2019-10-15 00:19:25,874 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:19:25,874 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 00:19:25,874 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181181476] [2019-10-15 00:19:25,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 00:19:25,875 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:19:25,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 00:19:25,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 00:19:25,875 INFO L87 Difference]: Start difference. First operand 2174 states and 2916 transitions. Second operand 5 states. [2019-10-15 00:19:25,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:19:25,978 INFO L93 Difference]: Finished difference Result 4351 states and 5841 transitions. [2019-10-15 00:19:25,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 00:19:25,979 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-15 00:19:25,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:19:25,991 INFO L225 Difference]: With dead ends: 4351 [2019-10-15 00:19:25,992 INFO L226 Difference]: Without dead ends: 2188 [2019-10-15 00:19:26,001 INFO L600 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-15 00:19:26,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2188 states. [2019-10-15 00:19:26,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2188 to 2188. [2019-10-15 00:19:26,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2188 states. [2019-10-15 00:19:26,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2188 states to 2188 states and 2930 transitions. [2019-10-15 00:19:26,108 INFO L78 Accepts]: Start accepts. Automaton has 2188 states and 2930 transitions. Word has length 105 [2019-10-15 00:19:26,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:19:26,108 INFO L462 AbstractCegarLoop]: Abstraction has 2188 states and 2930 transitions. [2019-10-15 00:19:26,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 00:19:26,109 INFO L276 IsEmpty]: Start isEmpty. Operand 2188 states and 2930 transitions. [2019-10-15 00:19:26,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-15 00:19:26,113 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:19:26,113 INFO L380 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-15 00:19:26,113 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:19:26,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:19:26,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1551773475, now seen corresponding path program 1 times [2019-10-15 00:19:26,114 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:19:26,114 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907135386] [2019-10-15 00:19:26,115 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:19:26,115 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:19:26,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:19:26,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:19:26,288 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-15 00:19:26,289 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907135386] [2019-10-15 00:19:26,289 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:19:26,290 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 00:19:26,290 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685588154] [2019-10-15 00:19:26,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 00:19:26,291 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:19:26,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 00:19:26,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 00:19:26,292 INFO L87 Difference]: Start difference. First operand 2188 states and 2930 transitions. Second operand 4 states. [2019-10-15 00:19:30,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:19:30,615 INFO L93 Difference]: Finished difference Result 4371 states and 5877 transitions. [2019-10-15 00:19:30,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 00:19:30,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-10-15 00:19:30,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:19:30,629 INFO L225 Difference]: With dead ends: 4371 [2019-10-15 00:19:30,629 INFO L226 Difference]: Without dead ends: 2194 [2019-10-15 00:19:30,640 INFO L600 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-15 00:19:30,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2194 states. [2019-10-15 00:19:30,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2194 to 2192. [2019-10-15 00:19:30,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2192 states. [2019-10-15 00:19:30,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 2192 states and 2934 transitions. [2019-10-15 00:19:30,750 INFO L78 Accepts]: Start accepts. Automaton has 2192 states and 2934 transitions. Word has length 115 [2019-10-15 00:19:30,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:19:30,750 INFO L462 AbstractCegarLoop]: Abstraction has 2192 states and 2934 transitions. [2019-10-15 00:19:30,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 00:19:30,750 INFO L276 IsEmpty]: Start isEmpty. Operand 2192 states and 2934 transitions. [2019-10-15 00:19:30,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-15 00:19:30,758 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:19:30,758 INFO L380 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-15 00:19:30,759 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:19:30,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:19:30,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1988568606, now seen corresponding path program 1 times [2019-10-15 00:19:30,760 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:19:30,765 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998223118] [2019-10-15 00:19:30,765 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:19:30,765 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:19:30,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:19:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:19:30,986 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-15 00:19:30,987 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998223118] [2019-10-15 00:19:30,987 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:19:30,988 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 00:19:30,988 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841886015] [2019-10-15 00:19:30,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 00:19:30,989 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:19:30,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 00:19:30,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 00:19:30,990 INFO L87 Difference]: Start difference. First operand 2192 states and 2934 transitions. Second operand 4 states. [2019-10-15 00:19:31,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:19:31,235 INFO L93 Difference]: Finished difference Result 4415 states and 5945 transitions. [2019-10-15 00:19:31,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 00:19:31,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-10-15 00:19:31,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:19:31,253 INFO L225 Difference]: With dead ends: 4415 [2019-10-15 00:19:31,253 INFO L226 Difference]: Without dead ends: 2234 [2019-10-15 00:19:31,269 INFO L600 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-15 00:19:31,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2234 states. [2019-10-15 00:19:31,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2234 to 2196. [2019-10-15 00:19:31,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2196 states. [2019-10-15 00:19:31,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2196 states to 2196 states and 2938 transitions. [2019-10-15 00:19:31,420 INFO L78 Accepts]: Start accepts. Automaton has 2196 states and 2938 transitions. Word has length 164 [2019-10-15 00:19:31,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:19:31,421 INFO L462 AbstractCegarLoop]: Abstraction has 2196 states and 2938 transitions. [2019-10-15 00:19:31,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 00:19:31,421 INFO L276 IsEmpty]: Start isEmpty. Operand 2196 states and 2938 transitions. [2019-10-15 00:19:31,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-15 00:19:31,427 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:19:31,427 INFO L380 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-15 00:19:31,427 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:19:31,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:19:31,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1683911757, now seen corresponding path program 1 times [2019-10-15 00:19:31,428 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:19:31,428 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737704300] [2019-10-15 00:19:31,429 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:19:31,429 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:19:31,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:19:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:19:31,614 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-15 00:19:31,615 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737704300] [2019-10-15 00:19:31,615 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:19:31,615 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 00:19:31,615 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840806770] [2019-10-15 00:19:31,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 00:19:31,616 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:19:31,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 00:19:31,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 00:19:31,617 INFO L87 Difference]: Start difference. First operand 2196 states and 2938 transitions. Second operand 3 states. [2019-10-15 00:19:31,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:19:31,732 INFO L93 Difference]: Finished difference Result 4393 states and 5907 transitions. [2019-10-15 00:19:31,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 00:19:31,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-10-15 00:19:31,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:19:31,756 INFO L225 Difference]: With dead ends: 4393 [2019-10-15 00:19:31,756 INFO L226 Difference]: Without dead ends: 2208 [2019-10-15 00:19:31,768 INFO L600 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-15 00:19:31,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2208 states. [2019-10-15 00:19:31,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2208 to 2200. [2019-10-15 00:19:31,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2200 states. [2019-10-15 00:19:31,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2200 states to 2200 states and 2942 transitions. [2019-10-15 00:19:31,861 INFO L78 Accepts]: Start accepts. Automaton has 2200 states and 2942 transitions. Word has length 175 [2019-10-15 00:19:31,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:19:31,861 INFO L462 AbstractCegarLoop]: Abstraction has 2200 states and 2942 transitions. [2019-10-15 00:19:31,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 00:19:31,862 INFO L276 IsEmpty]: Start isEmpty. Operand 2200 states and 2942 transitions. [2019-10-15 00:19:31,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-10-15 00:19:31,866 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:19:31,867 INFO L380 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-15 00:19:31,867 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:19:31,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:19:31,868 INFO L82 PathProgramCache]: Analyzing trace with hash -665722229, now seen corresponding path program 1 times [2019-10-15 00:19:31,868 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:19:31,868 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677257341] [2019-10-15 00:19:31,868 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:19:31,868 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:19:31,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:19:31,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:19:32,066 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-15 00:19:32,066 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677257341] [2019-10-15 00:19:32,069 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:19:32,069 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 00:19:32,069 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849024808] [2019-10-15 00:19:32,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 00:19:32,070 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:19:32,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 00:19:32,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 00:19:32,071 INFO L87 Difference]: Start difference. First operand 2200 states and 2942 transitions. Second operand 5 states. [2019-10-15 00:19:32,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:19:32,169 INFO L93 Difference]: Finished difference Result 4421 states and 5931 transitions. [2019-10-15 00:19:32,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 00:19:32,169 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 186 [2019-10-15 00:19:32,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:19:32,181 INFO L225 Difference]: With dead ends: 4421 [2019-10-15 00:19:32,181 INFO L226 Difference]: Without dead ends: 2232 [2019-10-15 00:19:32,191 INFO L600 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-15 00:19:32,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2232 states. [2019-10-15 00:19:32,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2232 to 2212. [2019-10-15 00:19:32,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2212 states. [2019-10-15 00:19:32,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2212 states to 2212 states and 2960 transitions. [2019-10-15 00:19:32,345 INFO L78 Accepts]: Start accepts. Automaton has 2212 states and 2960 transitions. Word has length 186 [2019-10-15 00:19:32,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:19:32,346 INFO L462 AbstractCegarLoop]: Abstraction has 2212 states and 2960 transitions. [2019-10-15 00:19:32,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 00:19:32,346 INFO L276 IsEmpty]: Start isEmpty. Operand 2212 states and 2960 transitions. [2019-10-15 00:19:32,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-10-15 00:19:32,354 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:19:32,355 INFO L380 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-15 00:19:32,355 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:19:32,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:19:32,355 INFO L82 PathProgramCache]: Analyzing trace with hash 882115653, now seen corresponding path program 1 times [2019-10-15 00:19:32,356 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:19:32,356 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172356169] [2019-10-15 00:19:32,356 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:19:32,356 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:19:32,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:19:32,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:19:32,553 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-15 00:19:32,554 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172356169] [2019-10-15 00:19:32,554 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:19:32,554 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 00:19:32,554 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613687336] [2019-10-15 00:19:32,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 00:19:32,555 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:19:32,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 00:19:32,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 00:19:32,556 INFO L87 Difference]: Start difference. First operand 2212 states and 2960 transitions. Second operand 5 states. [2019-10-15 00:19:32,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:19:32,674 INFO L93 Difference]: Finished difference Result 4533 states and 6105 transitions. [2019-10-15 00:19:32,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 00:19:32,674 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 186 [2019-10-15 00:19:32,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:19:32,687 INFO L225 Difference]: With dead ends: 4533 [2019-10-15 00:19:32,688 INFO L226 Difference]: Without dead ends: 2332 [2019-10-15 00:19:32,698 INFO L600 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-15 00:19:32,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2332 states. [2019-10-15 00:19:32,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2332 to 2220. [2019-10-15 00:19:32,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2220 states. [2019-10-15 00:19:32,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2220 states to 2220 states and 2968 transitions. [2019-10-15 00:19:32,790 INFO L78 Accepts]: Start accepts. Automaton has 2220 states and 2968 transitions. Word has length 186 [2019-10-15 00:19:32,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:19:32,791 INFO L462 AbstractCegarLoop]: Abstraction has 2220 states and 2968 transitions. [2019-10-15 00:19:32,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 00:19:32,791 INFO L276 IsEmpty]: Start isEmpty. Operand 2220 states and 2968 transitions. [2019-10-15 00:19:32,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-10-15 00:19:32,797 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:19:32,798 INFO L380 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, 1, 1] [2019-10-15 00:19:32,798 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:19:32,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:19:32,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1409017056, now seen corresponding path program 1 times [2019-10-15 00:19:32,799 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:19:32,799 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637572956] [2019-10-15 00:19:32,799 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:19:32,799 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:19:32,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:19:32,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:19:33,054 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-15 00:19:33,055 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637572956] [2019-10-15 00:19:33,055 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:19:33,055 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 00:19:33,055 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796445148] [2019-10-15 00:19:33,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 00:19:33,056 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:19:33,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 00:19:33,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 00:19:33,057 INFO L87 Difference]: Start difference. First operand 2220 states and 2968 transitions. Second operand 5 states. [2019-10-15 00:19:33,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:19:33,185 INFO L93 Difference]: Finished difference Result 4459 states and 6115 transitions. [2019-10-15 00:19:33,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 00:19:33,186 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 250 [2019-10-15 00:19:33,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:19:33,216 INFO L225 Difference]: With dead ends: 4459 [2019-10-15 00:19:33,216 INFO L226 Difference]: Without dead ends: 2250 [2019-10-15 00:19:33,228 INFO L600 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-15 00:19:33,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2250 states. [2019-10-15 00:19:33,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2250 to 2240. [2019-10-15 00:19:33,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2240 states. [2019-10-15 00:19:33,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2240 states to 2240 states and 3007 transitions. [2019-10-15 00:19:33,369 INFO L78 Accepts]: Start accepts. Automaton has 2240 states and 3007 transitions. Word has length 250 [2019-10-15 00:19:33,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:19:33,372 INFO L462 AbstractCegarLoop]: Abstraction has 2240 states and 3007 transitions. [2019-10-15 00:19:33,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 00:19:33,372 INFO L276 IsEmpty]: Start isEmpty. Operand 2240 states and 3007 transitions. [2019-10-15 00:19:33,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-10-15 00:19:33,383 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:19:33,384 INFO L380 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, 1, 1] [2019-10-15 00:19:33,384 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:19:33,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:19:33,384 INFO L82 PathProgramCache]: Analyzing trace with hash 216925833, now seen corresponding path program 1 times [2019-10-15 00:19:33,385 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:19:33,385 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128941849] [2019-10-15 00:19:33,385 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:19:33,385 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:19:33,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:19:33,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:19:33,794 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-15 00:19:33,794 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128941849] [2019-10-15 00:19:33,794 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:19:33,794 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 00:19:33,804 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254430164] [2019-10-15 00:19:33,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 00:19:33,805 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:19:33,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 00:19:33,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 00:19:33,806 INFO L87 Difference]: Start difference. First operand 2240 states and 3007 transitions. Second operand 5 states. [2019-10-15 00:19:33,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:19:33,907 INFO L93 Difference]: Finished difference Result 4489 states and 6164 transitions. [2019-10-15 00:19:33,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 00:19:33,907 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 292 [2019-10-15 00:19:33,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:19:33,917 INFO L225 Difference]: With dead ends: 4489 [2019-10-15 00:19:33,918 INFO L226 Difference]: Without dead ends: 2260 [2019-10-15 00:19:33,931 INFO L600 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-15 00:19:33,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2260 states. [2019-10-15 00:19:34,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2260 to 2250. [2019-10-15 00:19:34,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2250 states. [2019-10-15 00:19:34,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2250 states to 2250 states and 3017 transitions. [2019-10-15 00:19:34,025 INFO L78 Accepts]: Start accepts. Automaton has 2250 states and 3017 transitions. Word has length 292 [2019-10-15 00:19:34,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:19:34,026 INFO L462 AbstractCegarLoop]: Abstraction has 2250 states and 3017 transitions. [2019-10-15 00:19:34,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 00:19:34,026 INFO L276 IsEmpty]: Start isEmpty. Operand 2250 states and 3017 transitions. [2019-10-15 00:19:34,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-10-15 00:19:34,035 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:19:34,035 INFO L380 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-15 00:19:34,036 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:19:34,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:19:34,036 INFO L82 PathProgramCache]: Analyzing trace with hash 211763053, now seen corresponding path program 1 times [2019-10-15 00:19:34,036 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:19:34,036 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921111252] [2019-10-15 00:19:34,037 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:19:34,037 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:19:34,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:19:34,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:19:34,278 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-15 00:19:34,278 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921111252] [2019-10-15 00:19:34,278 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:19:34,278 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 00:19:34,279 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132391527] [2019-10-15 00:19:34,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 00:19:34,280 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:19:34,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 00:19:34,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 00:19:34,281 INFO L87 Difference]: Start difference. First operand 2250 states and 3017 transitions. Second operand 3 states. [2019-10-15 00:19:34,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:19:34,374 INFO L93 Difference]: Finished difference Result 4574 states and 6343 transitions. [2019-10-15 00:19:34,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 00:19:34,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 283 [2019-10-15 00:19:34,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:19:34,386 INFO L225 Difference]: With dead ends: 4574 [2019-10-15 00:19:34,387 INFO L226 Difference]: Without dead ends: 2335 [2019-10-15 00:19:34,397 INFO L600 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-15 00:19:34,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2335 states. [2019-10-15 00:19:34,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2335 to 2305. [2019-10-15 00:19:34,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2305 states. [2019-10-15 00:19:34,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 2305 states and 3102 transitions. [2019-10-15 00:19:34,494 INFO L78 Accepts]: Start accepts. Automaton has 2305 states and 3102 transitions. Word has length 283 [2019-10-15 00:19:34,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:19:34,495 INFO L462 AbstractCegarLoop]: Abstraction has 2305 states and 3102 transitions. [2019-10-15 00:19:34,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 00:19:34,495 INFO L276 IsEmpty]: Start isEmpty. Operand 2305 states and 3102 transitions. [2019-10-15 00:19:34,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-10-15 00:19:34,502 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:19:34,503 INFO L380 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-15 00:19:34,503 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:19:34,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:19:34,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1694640213, now seen corresponding path program 1 times [2019-10-15 00:19:34,504 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:19:34,504 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659912507] [2019-10-15 00:19:34,504 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:19:34,504 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:19:34,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:19:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:19:34,861 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-15 00:19:34,862 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659912507] [2019-10-15 00:19:34,862 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:19:34,862 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 00:19:34,862 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990199104] [2019-10-15 00:19:34,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 00:19:34,864 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:19:34,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 00:19:34,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 00:19:34,866 INFO L87 Difference]: Start difference. First operand 2305 states and 3102 transitions. Second operand 3 states. [2019-10-15 00:19:35,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:19:35,007 INFO L93 Difference]: Finished difference Result 4619 states and 6289 transitions. [2019-10-15 00:19:35,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 00:19:35,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 283 [2019-10-15 00:19:35,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:19:35,019 INFO L225 Difference]: With dead ends: 4619 [2019-10-15 00:19:35,020 INFO L226 Difference]: Without dead ends: 2325 [2019-10-15 00:19:35,028 INFO L600 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-15 00:19:35,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2325 states. [2019-10-15 00:19:35,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2325 to 2310. [2019-10-15 00:19:35,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2310 states. [2019-10-15 00:19:35,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2310 states to 2310 states and 3107 transitions. [2019-10-15 00:19:35,172 INFO L78 Accepts]: Start accepts. Automaton has 2310 states and 3107 transitions. Word has length 283 [2019-10-15 00:19:35,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:19:35,173 INFO L462 AbstractCegarLoop]: Abstraction has 2310 states and 3107 transitions. [2019-10-15 00:19:35,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 00:19:35,174 INFO L276 IsEmpty]: Start isEmpty. Operand 2310 states and 3107 transitions. [2019-10-15 00:19:35,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-10-15 00:19:35,189 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:19:35,190 INFO L380 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, 1, 1] [2019-10-15 00:19:35,190 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:19:35,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:19:35,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1350276613, now seen corresponding path program 1 times [2019-10-15 00:19:35,191 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:19:35,192 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404891640] [2019-10-15 00:19:35,192 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:19:35,192 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:19:35,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:19:35,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:19:35,607 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-15 00:19:35,607 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404891640] [2019-10-15 00:19:35,607 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297298574] [2019-10-15 00:19:35,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 00:19:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:19:36,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 3532 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 00:19:36,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 00:19:36,708 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2019-10-15 00:19:36,708 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 00:19:37,738 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2019-10-15 00:19:37,738 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 00:19:37,739 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [10] total 12 [2019-10-15 00:19:37,739 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827515063] [2019-10-15 00:19:37,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 00:19:37,740 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:19:37,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 00:19:37,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-15 00:19:37,741 INFO L87 Difference]: Start difference. First operand 2310 states and 3107 transitions. Second operand 4 states. [2019-10-15 00:19:37,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:19:37,886 INFO L93 Difference]: Finished difference Result 4621 states and 6224 transitions. [2019-10-15 00:19:37,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 00:19:37,886 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 373 [2019-10-15 00:19:37,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:19:37,902 INFO L225 Difference]: With dead ends: 4621 [2019-10-15 00:19:37,902 INFO L226 Difference]: Without dead ends: 2322 [2019-10-15 00:19:37,913 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 756 GetRequests, 746 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-15 00:19:37,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2322 states. [2019-10-15 00:19:38,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2322 to 2322. [2019-10-15 00:19:38,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2322 states. [2019-10-15 00:19:38,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2322 states to 2322 states and 3122 transitions. [2019-10-15 00:19:38,047 INFO L78 Accepts]: Start accepts. Automaton has 2322 states and 3122 transitions. Word has length 373 [2019-10-15 00:19:38,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:19:38,047 INFO L462 AbstractCegarLoop]: Abstraction has 2322 states and 3122 transitions. [2019-10-15 00:19:38,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 00:19:38,048 INFO L276 IsEmpty]: Start isEmpty. Operand 2322 states and 3122 transitions. [2019-10-15 00:19:38,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2019-10-15 00:19:38,058 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:19:38,058 INFO L380 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, 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-15 00:19:38,271 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 00:19:38,272 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:19:38,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:19:38,273 INFO L82 PathProgramCache]: Analyzing trace with hash 595303021, now seen corresponding path program 1 times [2019-10-15 00:19:38,273 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:19:38,273 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446286766] [2019-10-15 00:19:38,274 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:19:38,274 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:19:38,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:19:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat