java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--input--serio--serio_raw.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 12:22:20,578 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 12:22:20,581 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 12:22:20,595 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 12:22:20,596 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 12:22:20,597 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 12:22:20,599 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 12:22:20,601 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 12:22:20,603 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 12:22:20,604 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 12:22:20,606 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 12:22:20,607 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 12:22:20,608 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 12:22:20,609 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 12:22:20,610 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 12:22:20,612 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 12:22:20,613 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 12:22:20,614 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 12:22:20,616 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 12:22:20,619 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 12:22:20,620 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 12:22:20,622 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 12:22:20,623 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 12:22:20,624 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 12:22:20,627 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 12:22:20,628 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 12:22:20,628 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 12:22:20,629 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 12:22:20,630 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 12:22:20,632 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 12:22:20,633 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 12:22:20,635 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 12:22:20,636 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 12:22:20,638 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 12:22:20,643 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 12:22:20,643 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 12:22:20,644 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 12:22:20,644 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 12:22:20,645 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 12:22:20,649 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 12:22:20,650 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 12:22:20,651 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 12:22:20,684 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 12:22:20,684 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 12:22:20,685 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 12:22:20,686 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 12:22:20,686 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 12:22:20,687 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 12:22:20,687 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 12:22:20,687 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 12:22:20,687 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 12:22:20,688 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 12:22:20,690 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 12:22:20,691 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 12:22:20,691 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 12:22:20,692 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 12:22:20,692 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 12:22:20,692 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 12:22:20,692 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 12:22:20,692 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 12:22:20,693 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 12:22:20,693 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 12:22:20,694 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 12:22:20,694 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 12:22:20,694 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 12:22:20,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 12:22:20,695 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 12:22:20,695 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 12:22:20,695 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 12:22:20,695 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 12:22:20,695 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 12:22:20,696 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 12:22:20,735 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 12:22:20,750 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 12:22:20,754 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 12:22:20,756 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 12:22:20,756 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 12:22:20,757 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--input--serio--serio_raw.ko-entry_point.cil.out.i [2019-09-10 12:22:20,847 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a87c5ceb/57de2ee6823b4d7ea9dd51d5b9d0e329/FLAG3fd3daeb1 [2019-09-10 12:22:21,672 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 12:22:21,673 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--input--serio--serio_raw.ko-entry_point.cil.out.i [2019-09-10 12:22:21,709 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a87c5ceb/57de2ee6823b4d7ea9dd51d5b9d0e329/FLAG3fd3daeb1 [2019-09-10 12:22:22,183 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a87c5ceb/57de2ee6823b4d7ea9dd51d5b9d0e329 [2019-09-10 12:22:22,195 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 12:22:22,196 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 12:22:22,198 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 12:22:22,198 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 12:22:22,202 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 12:22:22,203 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 12:22:22" (1/1) ... [2019-09-10 12:22:22,207 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7268adb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:22:22, skipping insertion in model container [2019-09-10 12:22:22,207 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 12:22:22" (1/1) ... [2019-09-10 12:22:22,215 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 12:22:22,309 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 12:22:23,934 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 12:22:23,981 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 12:22:24,263 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 12:22:24,449 INFO L192 MainTranslator]: Completed translation [2019-09-10 12:22:24,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:22:24 WrapperNode [2019-09-10 12:22:24,450 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 12:22:24,451 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 12:22:24,451 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 12:22:24,451 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 12:22:24,468 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:22:24" (1/1) ... [2019-09-10 12:22:24,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:22:24" (1/1) ... [2019-09-10 12:22:24,516 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:22:24" (1/1) ... [2019-09-10 12:22:24,517 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:22:24" (1/1) ... [2019-09-10 12:22:24,609 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:22:24" (1/1) ... [2019-09-10 12:22:24,632 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:22:24" (1/1) ... [2019-09-10 12:22:24,652 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:22:24" (1/1) ... [2019-09-10 12:22:24,684 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 12:22:24,691 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 12:22:24,691 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 12:22:24,691 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 12:22:24,693 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:22:24" (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-09-10 12:22:24,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 12:22:24,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 12:22:24,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-09-10 12:22:24,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~$Pointer$~TO~VOID [2019-09-10 12:22:24,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~int [2019-09-10 12:22:24,757 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2019-09-10 12:22:24,757 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2019-09-10 12:22:24,757 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del_init [2019-09-10 12:22:24,757 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2019-09-10 12:22:24,757 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_sub_and_test [2019-09-10 12:22:24,758 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_add_return [2019-09-10 12:22:24,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-09-10 12:22:24,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-09-10 12:22:24,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2019-09-10 12:22:24,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2019-09-10 12:22:24,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2019-09-10 12:22:24,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ptr [2019-09-10 12:22:24,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2019-09-10 12:22:24,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2019-09-10 12:22:24,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-09-10 12:22:24,762 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_irq [2019-09-10 12:22:24,763 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irq [2019-09-10 12:22:24,763 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2019-09-10 12:22:24,763 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2019-09-10 12:22:24,763 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2019-09-10 12:22:24,764 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_init [2019-09-10 12:22:24,764 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_get [2019-09-10 12:22:24,764 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_sub [2019-09-10 12:22:24,765 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_put [2019-09-10 12:22:24,765 INFO L138 BoogieDeclarations]: Found implementation of procedure iminor [2019-09-10 12:22:24,765 INFO L138 BoogieDeclarations]: Found implementation of procedure poll_wait [2019-09-10 12:22:24,765 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2019-09-10 12:22:24,765 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2019-09-10 12:22:24,765 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_write [2019-09-10 12:22:24,766 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_get_drvdata [2019-09-10 12:22:24,766 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_set_drvdata [2019-09-10 12:22:24,766 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_pause_rx [2019-09-10 12:22:24,766 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_continue_rx [2019-09-10 12:22:24,766 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_raw_fasync [2019-09-10 12:22:24,767 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_raw_locate [2019-09-10 12:22:24,767 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_raw_open [2019-09-10 12:22:24,767 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_raw_free [2019-09-10 12:22:24,767 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_raw_release [2019-09-10 12:22:24,767 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_raw_fetch_byte [2019-09-10 12:22:24,767 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_raw_read [2019-09-10 12:22:24,768 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_raw_write [2019-09-10 12:22:24,768 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_raw_poll [2019-09-10 12:22:24,768 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_raw_interrupt [2019-09-10 12:22:24,768 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_raw_connect [2019-09-10 12:22:24,768 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_raw_reconnect [2019-09-10 12:22:24,769 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_raw_hangup [2019-09-10 12:22:24,769 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_raw_disconnect [2019-09-10 12:22:24,769 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_raw_drv_init [2019-09-10 12:22:24,769 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_raw_drv_exit [2019-09-10 12:22:24,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_serio_driver_1 [2019-09-10 12:22:24,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_file_operations_2 [2019-09-10 12:22:24,770 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 12:22:24,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_5 [2019-09-10 12:22:24,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_6 [2019-09-10 12:22:24,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_7 [2019-09-10 12:22:24,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_8 [2019-09-10 12:22:24,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_9 [2019-09-10 12:22:24,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_10 [2019-09-10 12:22:24,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_11 [2019-09-10 12:22:24,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_12 [2019-09-10 12:22:24,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_13 [2019-09-10 12:22:24,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_14 [2019-09-10 12:22:24,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_15 [2019-09-10 12:22:24,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_16 [2019-09-10 12:22:24,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_17 [2019-09-10 12:22:24,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_misc_register_18 [2019-09-10 12:22:24,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_misc_register_19 [2019-09-10 12:22:24,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_misc_deregister_20 [2019-09-10 12:22:24,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_21 [2019-09-10 12:22:24,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_22 [2019-09-10 12:22:24,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv___serio_register_driver_23 [2019-09-10 12:22:24,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_serio_unregister_driver_24 [2019-09-10 12:22:24,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-09-10 12:22:24,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_negative [2019-09-10 12:22:24,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2019-09-10 12:22:24,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_err_ptr [2019-09-10 12:22:24,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_ptr_err [2019-09-10 12:22:24,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err_or_null [2019-09-10 12:22:24,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_i_mutex_of_inode [2019-09-10 12:22:24,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_i_mutex_of_inode [2019-09-10 12:22:24,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_i_mutex_of_inode [2019-09-10 12:22:24,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_i_mutex_of_inode [2019-09-10 12:22:24,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_i_mutex_of_inode [2019-09-10 12:22:24,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_i_mutex_of_inode [2019-09-10 12:22:24,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_i_mutex_of_inode [2019-09-10 12:22:24,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_i_mutex_of_inode [2019-09-10 12:22:24,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_trylock_device_i_mutex_of_inode [2019-09-10 12:22:24,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_for_reset_i_mutex_of_inode [2019-09-10 12:22:24,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_unlock_device_i_mutex_of_inode [2019-09-10 12:22:24,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_lock [2019-09-10 12:22:24,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_lock [2019-09-10 12:22:24,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_lock [2019-09-10 12:22:24,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_lock [2019-09-10 12:22:24,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_lock [2019-09-10 12:22:24,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_lock [2019-09-10 12:22:24,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_lock [2019-09-10 12:22:24,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_lock [2019-09-10 12:22:24,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_trylock_device_lock [2019-09-10 12:22:24,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_for_reset_lock [2019-09-10 12:22:24,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_unlock_device_lock [2019-09-10 12:22:24,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_mutex_of_device [2019-09-10 12:22:24,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_mutex_of_device [2019-09-10 12:22:24,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mutex_of_device [2019-09-10 12:22:24,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_mutex_of_device [2019-09-10 12:22:24,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_mutex_of_device [2019-09-10 12:22:24,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_mutex_of_device [2019-09-10 12:22:24,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mutex_of_device [2019-09-10 12:22:24,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_mutex_of_device [2019-09-10 12:22:24,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_trylock_device_mutex_of_device [2019-09-10 12:22:24,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_for_reset_mutex_of_device [2019-09-10 12:22:24,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_unlock_device_mutex_of_device [2019-09-10 12:22:24,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_serio_raw_mutex [2019-09-10 12:22:24,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_serio_raw_mutex [2019-09-10 12:22:24,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_serio_raw_mutex [2019-09-10 12:22:24,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_serio_raw_mutex [2019-09-10 12:22:24,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_serio_raw_mutex [2019-09-10 12:22:24,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_serio_raw_mutex [2019-09-10 12:22:24,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_serio_raw_mutex [2019-09-10 12:22:24,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_serio_raw_mutex [2019-09-10 12:22:24,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_trylock_device_serio_raw_mutex [2019-09-10 12:22:24,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_for_reset_serio_raw_mutex [2019-09-10 12:22:24,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_unlock_device_serio_raw_mutex [2019-09-10 12:22:24,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-09-10 12:22:24,822 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_dev_dbg [2019-09-10 12:22:24,822 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2019-09-10 12:22:24,822 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2019-09-10 12:22:24,823 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_del_entry [2019-09-10 12:22:24,823 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_fault [2019-09-10 12:22:24,823 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_sleep [2019-09-10 12:22:24,823 INFO L138 BoogieDeclarations]: Found implementation of procedure __serio_register_driver [2019-09-10 12:22:24,823 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2019-09-10 12:22:24,823 INFO L138 BoogieDeclarations]: Found implementation of procedure _dev_info [2019-09-10 12:22:24,823 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irq [2019-09-10 12:22:24,824 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_unlock_irq [2019-09-10 12:22:24,824 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2019-09-10 12:22:24,826 INFO L138 BoogieDeclarations]: Found implementation of procedure fasync_helper [2019-09-10 12:22:24,826 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2019-09-10 12:22:24,826 INFO L138 BoogieDeclarations]: Found implementation of procedure get_device [2019-09-10 12:22:24,828 INFO L138 BoogieDeclarations]: Found implementation of procedure kill_fasync [2019-09-10 12:22:24,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-09-10 12:22:24,829 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2019-09-10 12:22:24,829 INFO L138 BoogieDeclarations]: Found implementation of procedure misc_deregister [2019-09-10 12:22:24,829 INFO L138 BoogieDeclarations]: Found implementation of procedure misc_register [2019-09-10 12:22:24,829 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2019-09-10 12:22:24,829 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_interruptible [2019-09-10 12:22:24,830 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_killable [2019-09-10 12:22:24,830 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_trylock [2019-09-10 12:22:24,830 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2019-09-10 12:22:24,830 INFO L138 BoogieDeclarations]: Found implementation of procedure noop_llseek [2019-09-10 12:22:24,836 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait_event [2019-09-10 12:22:24,838 INFO L138 BoogieDeclarations]: Found implementation of procedure put_device [2019-09-10 12:22:24,838 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule [2019-09-10 12:22:24,838 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_close [2019-09-10 12:22:24,838 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_open [2019-09-10 12:22:24,838 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_unregister_driver [2019-09-10 12:22:24,839 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2019-09-10 12:22:24,839 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-09-10 12:22:24,839 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-09-10 12:22:24,839 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-09-10 12:22:24,839 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-10 12:22:24,839 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 12:22:24,840 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-09-10 12:22:24,840 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_dev_dbg [2019-09-10 12:22:24,840 INFO L130 BoogieDeclarations]: Found specification of procedure __might_sleep [2019-09-10 12:22:24,840 INFO L130 BoogieDeclarations]: Found specification of procedure __might_fault [2019-09-10 12:22:24,840 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2019-09-10 12:22:24,840 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2019-09-10 12:22:24,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-10 12:22:24,841 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2019-09-10 12:22:24,841 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2019-09-10 12:22:24,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-10 12:22:24,841 INFO L130 BoogieDeclarations]: Found specification of procedure __list_del_entry [2019-09-10 12:22:24,842 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2019-09-10 12:22:24,842 INFO L130 BoogieDeclarations]: Found specification of procedure list_del_init [2019-09-10 12:22:24,842 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-09-10 12:22:24,843 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2019-09-10 12:22:24,843 INFO L130 BoogieDeclarations]: Found specification of procedure __xadd_wrong_size [2019-09-10 12:22:24,843 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2019-09-10 12:22:24,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 12:22:24,843 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_sub_and_test [2019-09-10 12:22:24,843 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_add_return [2019-09-10 12:22:24,843 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_trylock [2019-09-10 12:22:24,844 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_10 [2019-09-10 12:22:24,844 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2019-09-10 12:22:24,844 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_6 [2019-09-10 12:22:24,844 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_7 [2019-09-10 12:22:24,844 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_11 [2019-09-10 12:22:24,844 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_13 [2019-09-10 12:22:24,844 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_15 [2019-09-10 12:22:24,845 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_17 [2019-09-10 12:22:24,845 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_22 [2019-09-10 12:22:24,845 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-10 12:22:24,845 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-10 12:22:24,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 12:22:24,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-09-10 12:22:24,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-10 12:22:24,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 12:22:24,846 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-09-10 12:22:24,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-10 12:22:24,846 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-09-10 12:22:24,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-10 12:22:24,846 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2019-09-10 12:22:24,846 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2019-09-10 12:22:24,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-09-10 12:22:24,847 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2019-09-10 12:22:24,847 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ptr [2019-09-10 12:22:24,847 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2019-09-10 12:22:24,847 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2019-09-10 12:22:24,848 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_interruptible [2019-09-10 12:22:24,849 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_12 [2019-09-10 12:22:24,849 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_14 [2019-09-10 12:22:24,849 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_killable [2019-09-10 12:22:24,849 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_16 [2019-09-10 12:22:24,849 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2019-09-10 12:22:24,850 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_5 [2019-09-10 12:22:24,850 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_8 [2019-09-10 12:22:24,850 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_9 [2019-09-10 12:22:24,850 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_21 [2019-09-10 12:22:24,850 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_i_mutex_of_inode [2019-09-10 12:22:24,850 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_i_mutex_of_inode [2019-09-10 12:22:24,851 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_lock [2019-09-10 12:22:24,851 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_lock [2019-09-10 12:22:24,851 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mutex_of_device [2019-09-10 12:22:24,851 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_mutex_of_device [2019-09-10 12:22:24,851 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mutex_of_device [2019-09-10 12:22:24,851 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_serio_raw_mutex [2019-09-10 12:22:24,851 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_serio_raw_mutex [2019-09-10 12:22:24,852 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_serio_raw_mutex [2019-09-10 12:22:24,852 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_serio_raw_mutex [2019-09-10 12:22:24,852 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irq [2019-09-10 12:22:24,852 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_unlock_irq [2019-09-10 12:22:24,852 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_irq [2019-09-10 12:22:24,852 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irq [2019-09-10 12:22:24,852 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2019-09-10 12:22:24,853 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2019-09-10 12:22:24,853 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait_event [2019-09-10 12:22:24,853 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2019-09-10 12:22:24,853 INFO L130 BoogieDeclarations]: Found specification of procedure schedule [2019-09-10 12:22:24,853 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-09-10 12:22:24,853 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2019-09-10 12:22:24,854 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2019-09-10 12:22:24,856 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2019-09-10 12:22:24,856 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_serio_driver_1 [2019-09-10 12:22:24,856 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_file_operations_2 [2019-09-10 12:22:24,857 INFO L130 BoogieDeclarations]: Found specification of procedure kref_init [2019-09-10 12:22:24,857 INFO L130 BoogieDeclarations]: Found specification of procedure kref_get [2019-09-10 12:22:24,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 12:22:24,858 INFO L130 BoogieDeclarations]: Found specification of procedure kref_sub [2019-09-10 12:22:24,858 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-09-10 12:22:24,858 INFO L130 BoogieDeclarations]: Found specification of procedure kref_put [2019-09-10 12:22:24,858 INFO L130 BoogieDeclarations]: Found specification of procedure iminor [2019-09-10 12:22:24,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 12:22:24,859 INFO L130 BoogieDeclarations]: Found specification of procedure fasync_helper [2019-09-10 12:22:24,859 INFO L130 BoogieDeclarations]: Found specification of procedure kill_fasync [2019-09-10 12:22:24,859 INFO L130 BoogieDeclarations]: Found specification of procedure noop_llseek [2019-09-10 12:22:24,859 INFO L130 BoogieDeclarations]: Found specification of procedure poll_wait [2019-09-10 12:22:24,859 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~$Pointer$~TO~VOID [2019-09-10 12:22:24,859 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2019-09-10 12:22:24,859 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2019-09-10 12:22:24,860 INFO L130 BoogieDeclarations]: Found specification of procedure get_device [2019-09-10 12:22:24,860 INFO L130 BoogieDeclarations]: Found specification of procedure put_device [2019-09-10 12:22:24,861 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2019-09-10 12:22:24,865 INFO L130 BoogieDeclarations]: Found specification of procedure _dev_info [2019-09-10 12:22:24,866 INFO L130 BoogieDeclarations]: Found specification of procedure serio_open [2019-09-10 12:22:24,866 INFO L130 BoogieDeclarations]: Found specification of procedure serio_close [2019-09-10 12:22:24,866 INFO L130 BoogieDeclarations]: Found specification of procedure __serio_register_driver [2019-09-10 12:22:24,869 INFO L130 BoogieDeclarations]: Found specification of procedure ldv___serio_register_driver_23 [2019-09-10 12:22:24,869 INFO L130 BoogieDeclarations]: Found specification of procedure serio_unregister_driver [2019-09-10 12:22:24,870 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_serio_unregister_driver_24 [2019-09-10 12:22:24,870 INFO L130 BoogieDeclarations]: Found specification of procedure serio_write [2019-09-10 12:22:24,870 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~int [2019-09-10 12:22:24,872 INFO L130 BoogieDeclarations]: Found specification of procedure serio_get_drvdata [2019-09-10 12:22:24,872 INFO L130 BoogieDeclarations]: Found specification of procedure serio_set_drvdata [2019-09-10 12:22:24,873 INFO L130 BoogieDeclarations]: Found specification of procedure serio_pause_rx [2019-09-10 12:22:24,873 INFO L130 BoogieDeclarations]: Found specification of procedure serio_continue_rx [2019-09-10 12:22:24,873 INFO L130 BoogieDeclarations]: Found specification of procedure misc_register [2019-09-10 12:22:24,873 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_misc_register_18 [2019-09-10 12:22:24,873 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_misc_register_19 [2019-09-10 12:22:24,873 INFO L130 BoogieDeclarations]: Found specification of procedure misc_deregister [2019-09-10 12:22:24,873 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_misc_deregister_20 [2019-09-10 12:22:24,874 INFO L130 BoogieDeclarations]: Found specification of procedure serio_raw_fasync [2019-09-10 12:22:24,874 INFO L130 BoogieDeclarations]: Found specification of procedure serio_raw_locate [2019-09-10 12:22:24,874 INFO L130 BoogieDeclarations]: Found specification of procedure serio_raw_open [2019-09-10 12:22:24,874 INFO L130 BoogieDeclarations]: Found specification of procedure serio_raw_free [2019-09-10 12:22:24,874 INFO L130 BoogieDeclarations]: Found specification of procedure serio_raw_release [2019-09-10 12:22:24,874 INFO L130 BoogieDeclarations]: Found specification of procedure serio_raw_fetch_byte [2019-09-10 12:22:24,874 INFO L130 BoogieDeclarations]: Found specification of procedure serio_raw_read [2019-09-10 12:22:24,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 12:22:24,875 INFO L130 BoogieDeclarations]: Found specification of procedure serio_raw_write [2019-09-10 12:22:24,875 INFO L130 BoogieDeclarations]: Found specification of procedure serio_raw_poll [2019-09-10 12:22:24,875 INFO L130 BoogieDeclarations]: Found specification of procedure serio_raw_interrupt [2019-09-10 12:22:24,875 INFO L130 BoogieDeclarations]: Found specification of procedure serio_raw_connect [2019-09-10 12:22:24,875 INFO L130 BoogieDeclarations]: Found specification of procedure serio_raw_reconnect [2019-09-10 12:22:24,875 INFO L130 BoogieDeclarations]: Found specification of procedure serio_raw_hangup [2019-09-10 12:22:24,875 INFO L130 BoogieDeclarations]: Found specification of procedure serio_raw_disconnect [2019-09-10 12:22:24,875 INFO L130 BoogieDeclarations]: Found specification of procedure serio_raw_drv_init [2019-09-10 12:22:24,876 INFO L130 BoogieDeclarations]: Found specification of procedure serio_raw_drv_exit [2019-09-10 12:22:24,876 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-09-10 12:22:24,876 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-09-10 12:22:24,876 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 12:22:24,876 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-09-10 12:22:24,877 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_negative [2019-09-10 12:22:24,877 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2019-09-10 12:22:24,877 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_err_ptr [2019-09-10 12:22:24,878 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_ptr_err [2019-09-10 12:22:24,878 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err_or_null [2019-09-10 12:22:24,878 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_i_mutex_of_inode [2019-09-10 12:22:24,878 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_i_mutex_of_inode [2019-09-10 12:22:24,878 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_i_mutex_of_inode [2019-09-10 12:22:24,878 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_i_mutex_of_inode [2019-09-10 12:22:24,878 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_i_mutex_of_inode [2019-09-10 12:22:24,878 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_i_mutex_of_inode [2019-09-10 12:22:24,879 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_trylock_device_i_mutex_of_inode [2019-09-10 12:22:24,879 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_for_reset_i_mutex_of_inode [2019-09-10 12:22:24,879 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_unlock_device_i_mutex_of_inode [2019-09-10 12:22:24,879 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_lock [2019-09-10 12:22:24,879 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_lock [2019-09-10 12:22:24,879 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_lock [2019-09-10 12:22:24,879 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_lock [2019-09-10 12:22:24,879 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_lock [2019-09-10 12:22:24,879 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_lock [2019-09-10 12:22:24,880 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_trylock_device_lock [2019-09-10 12:22:24,880 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_for_reset_lock [2019-09-10 12:22:24,880 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_unlock_device_lock [2019-09-10 12:22:24,880 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_mutex_of_device [2019-09-10 12:22:24,880 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_mutex_of_device [2019-09-10 12:22:24,880 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_mutex_of_device [2019-09-10 12:22:24,880 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_mutex_of_device [2019-09-10 12:22:24,880 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_mutex_of_device [2019-09-10 12:22:24,881 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_trylock_device_mutex_of_device [2019-09-10 12:22:24,881 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_for_reset_mutex_of_device [2019-09-10 12:22:24,881 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_unlock_device_mutex_of_device [2019-09-10 12:22:24,881 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_serio_raw_mutex [2019-09-10 12:22:24,881 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_serio_raw_mutex [2019-09-10 12:22:24,881 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_serio_raw_mutex [2019-09-10 12:22:24,881 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_serio_raw_mutex [2019-09-10 12:22:24,881 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_trylock_device_serio_raw_mutex [2019-09-10 12:22:24,882 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_for_reset_serio_raw_mutex [2019-09-10 12:22:24,882 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_unlock_device_serio_raw_mutex [2019-09-10 12:22:24,882 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-09-10 12:22:24,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-10 12:22:24,882 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-10 12:22:24,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 12:22:24,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-10 12:22:24,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-10 12:22:24,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 12:22:25,631 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2019-09-10 12:22:27,318 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 12:22:27,318 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 12:22:27,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 12:22:27 BoogieIcfgContainer [2019-09-10 12:22:27,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 12:22:27,322 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 12:22:27,322 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 12:22:27,326 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 12:22:27,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 12:22:22" (1/3) ... [2019-09-10 12:22:27,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e9dc8dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 12:22:27, skipping insertion in model container [2019-09-10 12:22:27,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:22:24" (2/3) ... [2019-09-10 12:22:27,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e9dc8dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 12:22:27, skipping insertion in model container [2019-09-10 12:22:27,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 12:22:27" (3/3) ... [2019-09-10 12:22:27,330 INFO L109 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--input--serio--serio_raw.ko-entry_point.cil.out.i [2019-09-10 12:22:27,341 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 12:22:27,355 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 12:22:27,374 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 12:22:27,406 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 12:22:27,406 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 12:22:27,406 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 12:22:27,406 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 12:22:27,407 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 12:22:27,407 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 12:22:27,407 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 12:22:27,407 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 12:22:27,452 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states. [2019-09-10 12:22:27,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 12:22:27,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 12:22:27,478 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 12:22:27,481 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 12:22:27,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 12:22:27,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1733405938, now seen corresponding path program 1 times [2019-09-10 12:22:27,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 12:22:27,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 12:22:27,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 12:22:27,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 12:22:27,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 12:22:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 12:22:28,265 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2019-09-10 12:22:28,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 12:22:28,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 12:22:28,268 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 12:22:28,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 12:22:28,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 12:22:28,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 12:22:28,293 INFO L87 Difference]: Start difference. First operand 955 states. Second operand 3 states. [2019-09-10 12:22:28,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 12:22:28,495 INFO L93 Difference]: Finished difference Result 1122 states and 1362 transitions. [2019-09-10 12:22:28,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 12:22:28,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-09-10 12:22:28,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 12:22:28,522 INFO L225 Difference]: With dead ends: 1122 [2019-09-10 12:22:28,523 INFO L226 Difference]: Without dead ends: 1099 [2019-09-10 12:22:28,525 INFO L628 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-09-10 12:22:28,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2019-09-10 12:22:28,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1060. [2019-09-10 12:22:28,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1060 states. [2019-09-10 12:22:28,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1290 transitions. [2019-09-10 12:22:28,662 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1290 transitions. Word has length 184 [2019-09-10 12:22:28,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 12:22:28,664 INFO L475 AbstractCegarLoop]: Abstraction has 1060 states and 1290 transitions. [2019-09-10 12:22:28,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 12:22:28,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1290 transitions. [2019-09-10 12:22:28,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 12:22:28,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 12:22:28,668 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 12:22:28,669 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 12:22:28,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 12:22:28,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1940161896, now seen corresponding path program 1 times [2019-09-10 12:22:28,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 12:22:28,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 12:22:28,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 12:22:28,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 12:22:28,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 12:22:28,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 12:22:28,990 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2019-09-10 12:22:28,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 12:22:28,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 12:22:28,990 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 12:22:28,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 12:22:28,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 12:22:28,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 12:22:28,995 INFO L87 Difference]: Start difference. First operand 1060 states and 1290 transitions. Second operand 3 states. [2019-09-10 12:22:29,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 12:22:29,163 INFO L93 Difference]: Finished difference Result 2004 states and 2435 transitions. [2019-09-10 12:22:29,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 12:22:29,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-09-10 12:22:29,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 12:22:29,192 INFO L225 Difference]: With dead ends: 2004 [2019-09-10 12:22:29,192 INFO L226 Difference]: Without dead ends: 2004 [2019-09-10 12:22:29,193 INFO L628 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-09-10 12:22:29,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2004 states. [2019-09-10 12:22:29,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2004 to 1998. [2019-09-10 12:22:29,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1998 states. [2019-09-10 12:22:29,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 2430 transitions. [2019-09-10 12:22:29,305 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 2430 transitions. Word has length 186 [2019-09-10 12:22:29,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 12:22:29,309 INFO L475 AbstractCegarLoop]: Abstraction has 1998 states and 2430 transitions. [2019-09-10 12:22:29,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 12:22:29,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 2430 transitions. [2019-09-10 12:22:29,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 12:22:29,323 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 12:22:29,324 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 12:22:29,324 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 12:22:29,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 12:22:29,324 INFO L82 PathProgramCache]: Analyzing trace with hash -116844323, now seen corresponding path program 1 times [2019-09-10 12:22:29,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 12:22:29,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 12:22:29,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 12:22:29,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 12:22:29,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 12:22:29,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 12:22:29,653 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2019-09-10 12:22:29,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 12:22:29,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 12:22:29,655 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 12:22:29,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 12:22:29,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 12:22:29,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 12:22:29,657 INFO L87 Difference]: Start difference. First operand 1998 states and 2430 transitions. Second operand 3 states. [2019-09-10 12:22:29,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 12:22:29,714 INFO L93 Difference]: Finished difference Result 2009 states and 2441 transitions. [2019-09-10 12:22:29,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 12:22:29,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-09-10 12:22:29,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 12:22:29,726 INFO L225 Difference]: With dead ends: 2009 [2019-09-10 12:22:29,726 INFO L226 Difference]: Without dead ends: 2009 [2019-09-10 12:22:29,727 INFO L628 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-09-10 12:22:29,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2009 states. [2019-09-10 12:22:29,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2009 to 1998. [2019-09-10 12:22:29,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1998 states. [2019-09-10 12:22:29,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 2428 transitions. [2019-09-10 12:22:29,792 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 2428 transitions. Word has length 193 [2019-09-10 12:22:29,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 12:22:29,793 INFO L475 AbstractCegarLoop]: Abstraction has 1998 states and 2428 transitions. [2019-09-10 12:22:29,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 12:22:29,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 2428 transitions. [2019-09-10 12:22:29,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 12:22:29,796 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 12:22:29,796 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 12:22:29,796 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 12:22:29,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 12:22:29,797 INFO L82 PathProgramCache]: Analyzing trace with hash -59586021, now seen corresponding path program 1 times [2019-09-10 12:22:29,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 12:22:29,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 12:22:29,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 12:22:29,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 12:22:29,800 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 12:22:29,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 12:22:29,996 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2019-09-10 12:22:29,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 12:22:29,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 12:22:29,997 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 12:22:29,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 12:22:29,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 12:22:29,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 12:22:29,998 INFO L87 Difference]: Start difference. First operand 1998 states and 2428 transitions. Second operand 3 states. [2019-09-10 12:22:30,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 12:22:30,022 INFO L93 Difference]: Finished difference Result 1997 states and 2426 transitions. [2019-09-10 12:22:30,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 12:22:30,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-09-10 12:22:30,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 12:22:30,034 INFO L225 Difference]: With dead ends: 1997 [2019-09-10 12:22:30,034 INFO L226 Difference]: Without dead ends: 1997 [2019-09-10 12:22:30,035 INFO L628 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-09-10 12:22:30,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2019-09-10 12:22:30,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1997. [2019-09-10 12:22:30,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1997 states. [2019-09-10 12:22:30,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 2426 transitions. [2019-09-10 12:22:30,094 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 2426 transitions. Word has length 193 [2019-09-10 12:22:30,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 12:22:30,094 INFO L475 AbstractCegarLoop]: Abstraction has 1997 states and 2426 transitions. [2019-09-10 12:22:30,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 12:22:30,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 2426 transitions. [2019-09-10 12:22:30,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-10 12:22:30,097 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 12:22:30,097 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 12:22:30,098 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 12:22:30,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 12:22:30,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1847578983, now seen corresponding path program 1 times [2019-09-10 12:22:30,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 12:22:30,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 12:22:30,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 12:22:30,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 12:22:30,101 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 12:22:30,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 12:22:30,348 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2019-09-10 12:22:30,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 12:22:30,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 12:22:30,349 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 12:22:30,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 12:22:30,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 12:22:30,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 12:22:30,350 INFO L87 Difference]: Start difference. First operand 1997 states and 2426 transitions. Second operand 3 states. [2019-09-10 12:22:30,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 12:22:30,374 INFO L93 Difference]: Finished difference Result 1996 states and 2424 transitions. [2019-09-10 12:22:30,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 12:22:30,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2019-09-10 12:22:30,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 12:22:30,386 INFO L225 Difference]: With dead ends: 1996 [2019-09-10 12:22:30,386 INFO L226 Difference]: Without dead ends: 1996 [2019-09-10 12:22:30,386 INFO L628 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-09-10 12:22:30,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1996 states. [2019-09-10 12:22:30,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1996 to 1996. [2019-09-10 12:22:30,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1996 states. [2019-09-10 12:22:30,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1996 states to 1996 states and 2424 transitions. [2019-09-10 12:22:30,453 INFO L78 Accepts]: Start accepts. Automaton has 1996 states and 2424 transitions. Word has length 194 [2019-09-10 12:22:30,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 12:22:30,454 INFO L475 AbstractCegarLoop]: Abstraction has 1996 states and 2424 transitions. [2019-09-10 12:22:30,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 12:22:30,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1996 states and 2424 transitions. [2019-09-10 12:22:30,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-10 12:22:30,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 12:22:30,458 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 12:22:30,458 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 12:22:30,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 12:22:30,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1440781090, now seen corresponding path program 1 times [2019-09-10 12:22:30,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 12:22:30,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 12:22:30,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 12:22:30,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 12:22:30,462 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 12:22:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 12:22:30,674 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2019-09-10 12:22:30,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 12:22:30,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 12:22:30,675 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 12:22:30,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 12:22:30,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 12:22:30,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 12:22:30,676 INFO L87 Difference]: Start difference. First operand 1996 states and 2424 transitions. Second operand 3 states. [2019-09-10 12:22:30,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 12:22:30,704 INFO L93 Difference]: Finished difference Result 1995 states and 2422 transitions. [2019-09-10 12:22:30,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 12:22:30,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-09-10 12:22:30,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 12:22:30,716 INFO L225 Difference]: With dead ends: 1995 [2019-09-10 12:22:30,717 INFO L226 Difference]: Without dead ends: 1995 [2019-09-10 12:22:30,717 INFO L628 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-09-10 12:22:30,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2019-09-10 12:22:30,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1995. [2019-09-10 12:22:30,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1995 states. [2019-09-10 12:22:30,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1995 states to 1995 states and 2422 transitions. [2019-09-10 12:22:30,783 INFO L78 Accepts]: Start accepts. Automaton has 1995 states and 2422 transitions. Word has length 195 [2019-09-10 12:22:30,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 12:22:30,784 INFO L475 AbstractCegarLoop]: Abstraction has 1995 states and 2422 transitions. [2019-09-10 12:22:30,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 12:22:30,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 2422 transitions. [2019-09-10 12:22:30,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-10 12:22:30,787 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 12:22:30,787 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 12:22:30,788 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 12:22:30,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 12:22:30,788 INFO L82 PathProgramCache]: Analyzing trace with hash 239338668, now seen corresponding path program 1 times [2019-09-10 12:22:30,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 12:22:30,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 12:22:30,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 12:22:30,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 12:22:30,791 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 12:22:30,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 12:22:30,967 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2019-09-10 12:22:30,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 12:22:30,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 12:22:30,968 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 12:22:30,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 12:22:30,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 12:22:30,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 12:22:30,969 INFO L87 Difference]: Start difference. First operand 1995 states and 2422 transitions. Second operand 3 states. [2019-09-10 12:22:31,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 12:22:31,070 INFO L93 Difference]: Finished difference Result 3222 states and 3892 transitions. [2019-09-10 12:22:31,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 12:22:31,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2019-09-10 12:22:31,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 12:22:31,091 INFO L225 Difference]: With dead ends: 3222 [2019-09-10 12:22:31,091 INFO L226 Difference]: Without dead ends: 3222 [2019-09-10 12:22:31,091 INFO L628 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-09-10 12:22:31,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3222 states. [2019-09-10 12:22:31,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3222 to 3181. [2019-09-10 12:22:31,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3181 states. [2019-09-10 12:22:31,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3181 states to 3181 states and 3848 transitions. [2019-09-10 12:22:31,233 INFO L78 Accepts]: Start accepts. Automaton has 3181 states and 3848 transitions. Word has length 200 [2019-09-10 12:22:31,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 12:22:31,234 INFO L475 AbstractCegarLoop]: Abstraction has 3181 states and 3848 transitions. [2019-09-10 12:22:31,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 12:22:31,234 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 3848 transitions. [2019-09-10 12:22:31,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-10 12:22:31,238 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 12:22:31,238 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 12:22:31,239 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 12:22:31,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 12:22:31,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1714943428, now seen corresponding path program 1 times [2019-09-10 12:22:31,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 12:22:31,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 12:22:31,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 12:22:31,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 12:22:31,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 12:22:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 12:22:31,511 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2019-09-10 12:22:31,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 12:22:31,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 12:22:31,512 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 12:22:31,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 12:22:31,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 12:22:31,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 12:22:31,513 INFO L87 Difference]: Start difference. First operand 3181 states and 3848 transitions. Second operand 3 states. [2019-09-10 12:22:31,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 12:22:31,603 INFO L93 Difference]: Finished difference Result 5672 states and 7007 transitions. [2019-09-10 12:22:31,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 12:22:31,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-09-10 12:22:31,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 12:22:31,638 INFO L225 Difference]: With dead ends: 5672 [2019-09-10 12:22:31,639 INFO L226 Difference]: Without dead ends: 5654 [2019-09-10 12:22:31,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 12:22:31,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5654 states. [2019-09-10 12:22:31,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5654 to 5599. [2019-09-10 12:22:31,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5599 states. [2019-09-10 12:22:31,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5599 states to 5599 states and 6925 transitions. [2019-09-10 12:22:31,820 INFO L78 Accepts]: Start accepts. Automaton has 5599 states and 6925 transitions. Word has length 196 [2019-09-10 12:22:31,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 12:22:31,821 INFO L475 AbstractCegarLoop]: Abstraction has 5599 states and 6925 transitions. [2019-09-10 12:22:31,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 12:22:31,822 INFO L276 IsEmpty]: Start isEmpty. Operand 5599 states and 6925 transitions. [2019-09-10 12:22:31,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-10 12:22:31,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 12:22:31,827 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 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] [2019-09-10 12:22:31,828 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 12:22:31,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 12:22:31,828 INFO L82 PathProgramCache]: Analyzing trace with hash -129752437, now seen corresponding path program 1 times [2019-09-10 12:22:31,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 12:22:31,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 12:22:31,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 12:22:31,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 12:22:31,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 12:22:31,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 12:22:32,109 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-09-10 12:22:32,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 12:22:32,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 12:22:32,110 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 12:22:32,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 12:22:32,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 12:22:32,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 12:22:32,112 INFO L87 Difference]: Start difference. First operand 5599 states and 6925 transitions. Second operand 3 states. [2019-09-10 12:22:32,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 12:22:32,309 INFO L93 Difference]: Finished difference Result 7794 states and 9640 transitions. [2019-09-10 12:22:32,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 12:22:32,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 268 [2019-09-10 12:22:32,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 12:22:32,358 INFO L225 Difference]: With dead ends: 7794 [2019-09-10 12:22:32,359 INFO L226 Difference]: Without dead ends: 7794 [2019-09-10 12:22:32,359 INFO L628 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-09-10 12:22:32,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7794 states. [2019-09-10 12:22:32,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7794 to 7721. [2019-09-10 12:22:32,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7721 states. [2019-09-10 12:22:32,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7721 states to 7721 states and 9561 transitions. [2019-09-10 12:22:32,710 INFO L78 Accepts]: Start accepts. Automaton has 7721 states and 9561 transitions. Word has length 268 [2019-09-10 12:22:32,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 12:22:32,711 INFO L475 AbstractCegarLoop]: Abstraction has 7721 states and 9561 transitions. [2019-09-10 12:22:32,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 12:22:32,711 INFO L276 IsEmpty]: Start isEmpty. Operand 7721 states and 9561 transitions. [2019-09-10 12:22:32,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-10 12:22:32,721 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 12:22:32,722 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 12:22:32,723 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 12:22:32,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 12:22:32,724 INFO L82 PathProgramCache]: Analyzing trace with hash 508410820, now seen corresponding path program 1 times [2019-09-10 12:22:32,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 12:22:32,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 12:22:32,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 12:22:32,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 12:22:32,735 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 12:22:32,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 12:22:33,036 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 449 trivial. 0 not checked. [2019-09-10 12:22:33,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 12:22:33,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 12:22:33,037 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 12:22:33,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 12:22:33,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 12:22:33,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 12:22:33,039 INFO L87 Difference]: Start difference. First operand 7721 states and 9561 transitions. Second operand 3 states. [2019-09-10 12:22:33,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 12:22:33,199 INFO L93 Difference]: Finished difference Result 7723 states and 9372 transitions. [2019-09-10 12:22:33,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 12:22:33,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2019-09-10 12:22:33,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 12:22:33,255 INFO L225 Difference]: With dead ends: 7723 [2019-09-10 12:22:33,255 INFO L226 Difference]: Without dead ends: 7723 [2019-09-10 12:22:33,255 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-09-10 12:22:33,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7723 states. [2019-09-10 12:22:33,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7723 to 7478. [2019-09-10 12:22:33,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7478 states. [2019-09-10 12:22:33,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7478 states to 7478 states and 9123 transitions. [2019-09-10 12:22:33,458 INFO L78 Accepts]: Start accepts. Automaton has 7478 states and 9123 transitions. Word has length 308 [2019-09-10 12:22:33,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 12:22:33,459 INFO L475 AbstractCegarLoop]: Abstraction has 7478 states and 9123 transitions. [2019-09-10 12:22:33,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 12:22:33,459 INFO L276 IsEmpty]: Start isEmpty. Operand 7478 states and 9123 transitions. [2019-09-10 12:22:33,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-10 12:22:33,465 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 12:22:33,466 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 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] [2019-09-10 12:22:33,466 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 12:22:33,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 12:22:33,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1228208050, now seen corresponding path program 1 times [2019-09-10 12:22:33,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 12:22:33,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 12:22:33,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 12:22:33,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 12:22:33,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 12:22:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 12:22:33,897 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 443 trivial. 0 not checked. [2019-09-10 12:22:33,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 12:22:33,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 12:22:33,898 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 12:22:33,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 12:22:33,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 12:22:33,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 12:22:33,901 INFO L87 Difference]: Start difference. First operand 7478 states and 9123 transitions. Second operand 3 states. [2019-09-10 12:22:34,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 12:22:34,025 INFO L93 Difference]: Finished difference Result 7494 states and 9091 transitions. [2019-09-10 12:22:34,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 12:22:34,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-09-10 12:22:34,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 12:22:34,067 INFO L225 Difference]: With dead ends: 7494 [2019-09-10 12:22:34,068 INFO L226 Difference]: Without dead ends: 7494 [2019-09-10 12:22:34,071 INFO L628 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-09-10 12:22:34,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7494 states. [2019-09-10 12:22:34,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7494 to 7478. [2019-09-10 12:22:34,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7478 states. [2019-09-10 12:22:34,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7478 states to 7478 states and 9075 transitions. [2019-09-10 12:22:34,288 INFO L78 Accepts]: Start accepts. Automaton has 7478 states and 9075 transitions. Word has length 320 [2019-09-10 12:22:34,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 12:22:34,288 INFO L475 AbstractCegarLoop]: Abstraction has 7478 states and 9075 transitions. [2019-09-10 12:22:34,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 12:22:34,289 INFO L276 IsEmpty]: Start isEmpty. Operand 7478 states and 9075 transitions. [2019-09-10 12:22:34,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-10 12:22:34,296 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 12:22:34,296 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 12:22:34,297 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 12:22:34,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 12:22:34,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1400579147, now seen corresponding path program 1 times [2019-09-10 12:22:34,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 12:22:34,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 12:22:34,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 12:22:34,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 12:22:34,307 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 12:22:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 12:22:34,597 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-09-10 12:22:34,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 12:22:34,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 12:22:34,598 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 12:22:34,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 12:22:34,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 12:22:34,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 12:22:34,600 INFO L87 Difference]: Start difference. First operand 7478 states and 9075 transitions. Second operand 3 states. [2019-09-10 12:22:34,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 12:22:34,716 INFO L93 Difference]: Finished difference Result 3996 states and 4834 transitions. [2019-09-10 12:22:34,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 12:22:34,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 322 [2019-09-10 12:22:34,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 12:22:34,746 INFO L225 Difference]: With dead ends: 3996 [2019-09-10 12:22:34,746 INFO L226 Difference]: Without dead ends: 3990 [2019-09-10 12:22:34,746 INFO L628 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-09-10 12:22:34,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3990 states. [2019-09-10 12:22:34,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3990 to 3977. [2019-09-10 12:22:34,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3977 states. [2019-09-10 12:22:34,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3977 states to 3977 states and 4816 transitions. [2019-09-10 12:22:34,844 INFO L78 Accepts]: Start accepts. Automaton has 3977 states and 4816 transitions. Word has length 322 [2019-09-10 12:22:34,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 12:22:34,844 INFO L475 AbstractCegarLoop]: Abstraction has 3977 states and 4816 transitions. [2019-09-10 12:22:34,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 12:22:34,845 INFO L276 IsEmpty]: Start isEmpty. Operand 3977 states and 4816 transitions. [2019-09-10 12:22:34,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-10 12:22:34,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 12:22:34,851 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 12:22:34,852 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 12:22:34,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 12:22:34,852 INFO L82 PathProgramCache]: Analyzing trace with hash -307943945, now seen corresponding path program 1 times [2019-09-10 12:22:34,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 12:22:34,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 12:22:34,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 12:22:34,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 12:22:34,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 12:22:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 12:22:35,484 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 443 trivial. 0 not checked. [2019-09-10 12:22:35,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 12:22:35,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 12:22:35,485 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 12:22:35,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 12:22:35,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 12:22:35,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-10 12:22:35,487 INFO L87 Difference]: Start difference. First operand 3977 states and 4816 transitions. Second operand 11 states. [2019-09-10 12:22:35,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 12:22:35,836 INFO L93 Difference]: Finished difference Result 4097 states and 4946 transitions. [2019-09-10 12:22:35,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 12:22:35,837 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 322 [2019-09-10 12:22:35,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 12:22:35,854 INFO L225 Difference]: With dead ends: 4097 [2019-09-10 12:22:35,855 INFO L226 Difference]: Without dead ends: 4097 [2019-09-10 12:22:35,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-10 12:22:35,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4097 states. [2019-09-10 12:22:35,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4097 to 4053. [2019-09-10 12:22:35,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4053 states. [2019-09-10 12:22:35,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4053 states to 4053 states and 4902 transitions. [2019-09-10 12:22:35,967 INFO L78 Accepts]: Start accepts. Automaton has 4053 states and 4902 transitions. Word has length 322 [2019-09-10 12:22:35,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 12:22:35,968 INFO L475 AbstractCegarLoop]: Abstraction has 4053 states and 4902 transitions. [2019-09-10 12:22:35,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 12:22:35,968 INFO L276 IsEmpty]: Start isEmpty. Operand 4053 states and 4902 transitions. [2019-09-10 12:22:35,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-10 12:22:35,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 12:22:35,974 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 12:22:35,975 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 12:22:35,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 12:22:35,975 INFO L82 PathProgramCache]: Analyzing trace with hash 822842680, now seen corresponding path program 1 times [2019-09-10 12:22:35,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 12:22:35,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 12:22:35,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 12:22:35,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 12:22:35,979 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 12:22:36,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 12:22:36,353 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 443 trivial. 0 not checked. [2019-09-10 12:22:36,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 12:22:36,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 12:22:36,354 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 12:22:36,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 12:22:36,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 12:22:36,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 12:22:36,356 INFO L87 Difference]: Start difference. First operand 4053 states and 4902 transitions. Second operand 7 states. [2019-09-10 12:22:36,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 12:22:36,459 INFO L93 Difference]: Finished difference Result 4051 states and 4904 transitions. [2019-09-10 12:22:36,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 12:22:36,460 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 322 [2019-09-10 12:22:36,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 12:22:36,483 INFO L225 Difference]: With dead ends: 4051 [2019-09-10 12:22:36,484 INFO L226 Difference]: Without dead ends: 4051 [2019-09-10 12:22:36,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 12:22:36,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4051 states. [2019-09-10 12:22:36,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4051 to 4044. [2019-09-10 12:22:36,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4044 states. [2019-09-10 12:22:36,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4044 states to 4044 states and 4894 transitions. [2019-09-10 12:22:36,610 INFO L78 Accepts]: Start accepts. Automaton has 4044 states and 4894 transitions. Word has length 322 [2019-09-10 12:22:36,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 12:22:36,612 INFO L475 AbstractCegarLoop]: Abstraction has 4044 states and 4894 transitions. [2019-09-10 12:22:36,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 12:22:36,612 INFO L276 IsEmpty]: Start isEmpty. Operand 4044 states and 4894 transitions. [2019-09-10 12:22:36,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-09-10 12:22:36,628 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 12:22:36,628 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 12:22:36,629 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 12:22:36,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 12:22:36,630 INFO L82 PathProgramCache]: Analyzing trace with hash 684909006, now seen corresponding path program 1 times [2019-09-10 12:22:36,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 12:22:36,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 12:22:36,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 12:22:36,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 12:22:36,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 12:22:36,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 12:22:37,228 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2019-09-10 12:22:37,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 12:22:37,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 12:22:37,229 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 12:22:37,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 12:22:37,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 12:22:37,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 12:22:37,232 INFO L87 Difference]: Start difference. First operand 4044 states and 4894 transitions. Second operand 7 states. [2019-09-10 12:22:37,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 12:22:37,396 INFO L93 Difference]: Finished difference Result 4039 states and 4886 transitions. [2019-09-10 12:22:37,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 12:22:37,397 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 371 [2019-09-10 12:22:37,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 12:22:37,421 INFO L225 Difference]: With dead ends: 4039 [2019-09-10 12:22:37,421 INFO L226 Difference]: Without dead ends: 4039 [2019-09-10 12:22:37,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-10 12:22:37,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4039 states. [2019-09-10 12:22:37,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4039 to 4025. [2019-09-10 12:22:37,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4025 states. [2019-09-10 12:22:37,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4025 states to 4025 states and 4867 transitions. [2019-09-10 12:22:37,587 INFO L78 Accepts]: Start accepts. Automaton has 4025 states and 4867 transitions. Word has length 371 [2019-09-10 12:22:37,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 12:22:37,588 INFO L475 AbstractCegarLoop]: Abstraction has 4025 states and 4867 transitions. [2019-09-10 12:22:37,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 12:22:37,588 INFO L276 IsEmpty]: Start isEmpty. Operand 4025 states and 4867 transitions. [2019-09-10 12:22:37,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2019-09-10 12:22:37,601 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 12:22:37,602 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 12:22:37,602 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 12:22:37,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 12:22:37,603 INFO L82 PathProgramCache]: Analyzing trace with hash 2012953485, now seen corresponding path program 1 times [2019-09-10 12:22:37,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 12:22:37,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 12:22:37,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 12:22:37,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 12:22:37,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 12:22:37,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 12:22:37,964 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2019-09-10 12:22:37,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 12:22:37,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 12:22:37,966 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 12:22:37,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 12:22:37,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 12:22:37,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 12:22:37,969 INFO L87 Difference]: Start difference. First operand 4025 states and 4867 transitions. Second operand 3 states. [2019-09-10 12:22:38,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 12:22:38,202 INFO L93 Difference]: Finished difference Result 5557 states and 6627 transitions. [2019-09-10 12:22:38,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 12:22:38,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 414 [2019-09-10 12:22:38,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 12:22:38,224 INFO L225 Difference]: With dead ends: 5557 [2019-09-10 12:22:38,224 INFO L226 Difference]: Without dead ends: 5557 [2019-09-10 12:22:38,225 INFO L628 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-09-10 12:22:38,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5557 states. [2019-09-10 12:22:38,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5557 to 5329. [2019-09-10 12:22:38,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5329 states. [2019-09-10 12:22:38,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5329 states to 5329 states and 6377 transitions. [2019-09-10 12:22:38,336 INFO L78 Accepts]: Start accepts. Automaton has 5329 states and 6377 transitions. Word has length 414 [2019-09-10 12:22:38,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 12:22:38,337 INFO L475 AbstractCegarLoop]: Abstraction has 5329 states and 6377 transitions. [2019-09-10 12:22:38,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 12:22:38,337 INFO L276 IsEmpty]: Start isEmpty. Operand 5329 states and 6377 transitions. [2019-09-10 12:22:38,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2019-09-10 12:22:38,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 12:22:38,349 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 12:22:38,349 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 12:22:38,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 12:22:38,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1865066247, now seen corresponding path program 1 times [2019-09-10 12:22:38,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 12:22:38,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 12:22:38,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 12:22:38,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 12:22:38,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 12:22:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 12:22:38,880 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 586 trivial. 0 not checked. [2019-09-10 12:22:38,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 12:22:38,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 12:22:38,881 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 12:22:38,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 12:22:38,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 12:22:38,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 12:22:38,883 INFO L87 Difference]: Start difference. First operand 5329 states and 6377 transitions. Second operand 7 states. [2019-09-10 12:22:38,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 12:22:38,966 INFO L93 Difference]: Finished difference Result 5270 states and 6290 transitions. [2019-09-10 12:22:38,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 12:22:38,966 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 413 [2019-09-10 12:22:38,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 12:22:38,985 INFO L225 Difference]: With dead ends: 5270 [2019-09-10 12:22:38,985 INFO L226 Difference]: Without dead ends: 5270 [2019-09-10 12:22:38,986 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 12:22:38,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5270 states. [2019-09-10 12:22:39,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5270 to 5246. [2019-09-10 12:22:39,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5246 states. [2019-09-10 12:22:39,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5246 states to 5246 states and 6260 transitions. [2019-09-10 12:22:39,078 INFO L78 Accepts]: Start accepts. Automaton has 5246 states and 6260 transitions. Word has length 413 [2019-09-10 12:22:39,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 12:22:39,079 INFO L475 AbstractCegarLoop]: Abstraction has 5246 states and 6260 transitions. [2019-09-10 12:22:39,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 12:22:39,079 INFO L276 IsEmpty]: Start isEmpty. Operand 5246 states and 6260 transitions. [2019-09-10 12:22:39,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2019-09-10 12:22:39,091 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 12:22:39,092 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 12:22:39,092 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 12:22:39,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 12:22:39,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1345161617, now seen corresponding path program 1 times [2019-09-10 12:22:39,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 12:22:39,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 12:22:39,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 12:22:39,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 12:22:39,096 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 12:22:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 12:22:39,464 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 586 trivial. 0 not checked. [2019-09-10 12:22:39,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 12:22:39,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 12:22:39,465 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 12:22:39,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 12:22:39,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 12:22:39,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 12:22:39,466 INFO L87 Difference]: Start difference. First operand 5246 states and 6260 transitions. Second operand 7 states. [2019-09-10 12:22:39,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 12:22:39,540 INFO L93 Difference]: Finished difference Result 5040 states and 6009 transitions. [2019-09-10 12:22:39,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 12:22:39,540 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 430 [2019-09-10 12:22:39,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 12:22:39,558 INFO L225 Difference]: With dead ends: 5040 [2019-09-10 12:22:39,558 INFO L226 Difference]: Without dead ends: 5040 [2019-09-10 12:22:39,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 12:22:39,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5040 states. [2019-09-10 12:22:39,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5040 to 5028. [2019-09-10 12:22:39,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5028 states. [2019-09-10 12:22:39,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5028 states to 5028 states and 5994 transitions. [2019-09-10 12:22:39,646 INFO L78 Accepts]: Start accepts. Automaton has 5028 states and 5994 transitions. Word has length 430 [2019-09-10 12:22:39,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 12:22:39,647 INFO L475 AbstractCegarLoop]: Abstraction has 5028 states and 5994 transitions. [2019-09-10 12:22:39,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 12:22:39,647 INFO L276 IsEmpty]: Start isEmpty. Operand 5028 states and 5994 transitions. [2019-09-10 12:22:39,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2019-09-10 12:22:39,661 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 12:22:39,661 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 12:22:39,661 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 12:22:39,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 12:22:39,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1055733083, now seen corresponding path program 1 times [2019-09-10 12:22:39,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 12:22:39,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 12:22:39,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 12:22:39,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 12:22:39,665 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 12:22:39,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 12:22:40,056 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2019-09-10 12:22:40,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 12:22:40,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 12:22:40,057 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 12:22:40,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 12:22:40,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 12:22:40,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 12:22:40,058 INFO L87 Difference]: Start difference. First operand 5028 states and 5994 transitions. Second operand 7 states. [2019-09-10 12:22:40,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 12:22:40,149 INFO L93 Difference]: Finished difference Result 5085 states and 6081 transitions. [2019-09-10 12:22:40,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 12:22:40,150 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 430 [2019-09-10 12:22:40,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 12:22:40,165 INFO L225 Difference]: With dead ends: 5085 [2019-09-10 12:22:40,165 INFO L226 Difference]: Without dead ends: 5085 [2019-09-10 12:22:40,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-10 12:22:40,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5085 states. [2019-09-10 12:22:40,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5085 to 5061. [2019-09-10 12:22:40,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5061 states. [2019-09-10 12:22:40,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5061 states to 5061 states and 6051 transitions. [2019-09-10 12:22:40,275 INFO L78 Accepts]: Start accepts. Automaton has 5061 states and 6051 transitions. Word has length 430 [2019-09-10 12:22:40,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 12:22:40,276 INFO L475 AbstractCegarLoop]: Abstraction has 5061 states and 6051 transitions. [2019-09-10 12:22:40,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 12:22:40,276 INFO L276 IsEmpty]: Start isEmpty. Operand 5061 states and 6051 transitions. [2019-09-10 12:22:40,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2019-09-10 12:22:40,288 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 12:22:40,288 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 12:22:40,288 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 12:22:40,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 12:22:40,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1021087433, now seen corresponding path program 1 times [2019-09-10 12:22:40,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 12:22:40,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 12:22:40,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 12:22:40,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 12:22:40,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 12:22:40,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 12:22:40,815 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2019-09-10 12:22:40,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 12:22:40,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 12:22:40,817 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 12:22:40,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 12:22:40,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 12:22:40,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 12:22:40,819 INFO L87 Difference]: Start difference. First operand 5061 states and 6051 transitions. Second operand 7 states. [2019-09-10 12:22:40,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 12:22:40,884 INFO L93 Difference]: Finished difference Result 3329 states and 3923 transitions. [2019-09-10 12:22:40,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 12:22:40,884 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 436 [2019-09-10 12:22:40,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 12:22:40,886 INFO L225 Difference]: With dead ends: 3329 [2019-09-10 12:22:40,886 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 12:22:40,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 12:22:40,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 12:22:40,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 12:22:40,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 12:22:40,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 12:22:40,887 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 436 [2019-09-10 12:22:40,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 12:22:40,888 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 12:22:40,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 12:22:40,888 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 12:22:40,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 12:22:40,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 12:22:40 BoogieIcfgContainer [2019-09-10 12:22:40,895 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 12:22:40,898 INFO L168 Benchmark]: Toolchain (without parser) took 18700.52 ms. Allocated memory was 133.2 MB in the beginning and 951.1 MB in the end (delta: 817.9 MB). Free memory was 82.4 MB in the beginning and 614.7 MB in the end (delta: -532.3 MB). Peak memory consumption was 285.6 MB. Max. memory is 7.1 GB. [2019-09-10 12:22:40,899 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 133.2 MB. Free memory was 107.7 MB in the beginning and 107.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-09-10 12:22:40,900 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2252.63 ms. Allocated memory was 133.2 MB in the beginning and 222.8 MB in the end (delta: 89.7 MB). Free memory was 82.2 MB in the beginning and 98.5 MB in the end (delta: -16.2 MB). Peak memory consumption was 78.7 MB. Max. memory is 7.1 GB. [2019-09-10 12:22:40,900 INFO L168 Benchmark]: Boogie Preprocessor took 233.55 ms. Allocated memory is still 222.8 MB. Free memory was 98.5 MB in the beginning and 86.3 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 7.1 GB. [2019-09-10 12:22:40,901 INFO L168 Benchmark]: RCFGBuilder took 2630.33 ms. Allocated memory was 222.8 MB in the beginning and 273.2 MB in the end (delta: 50.3 MB). Free memory was 85.4 MB in the beginning and 101.7 MB in the end (delta: -16.3 MB). Peak memory consumption was 67.6 MB. Max. memory is 7.1 GB. [2019-09-10 12:22:40,902 INFO L168 Benchmark]: TraceAbstraction took 13572.73 ms. Allocated memory was 273.2 MB in the beginning and 951.1 MB in the end (delta: 677.9 MB). Free memory was 101.7 MB in the beginning and 614.7 MB in the end (delta: -513.0 MB). Peak memory consumption was 164.9 MB. Max. memory is 7.1 GB. [2019-09-10 12:22:40,913 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 133.2 MB. Free memory was 107.7 MB in the beginning and 107.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2252.63 ms. Allocated memory was 133.2 MB in the beginning and 222.8 MB in the end (delta: 89.7 MB). Free memory was 82.2 MB in the beginning and 98.5 MB in the end (delta: -16.2 MB). Peak memory consumption was 78.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 233.55 ms. Allocated memory is still 222.8 MB. Free memory was 98.5 MB in the beginning and 86.3 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2630.33 ms. Allocated memory was 222.8 MB in the beginning and 273.2 MB in the end (delta: 50.3 MB). Free memory was 85.4 MB in the beginning and 101.7 MB in the end (delta: -16.3 MB). Peak memory consumption was 67.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13572.73 ms. Allocated memory was 273.2 MB in the beginning and 951.1 MB in the end (delta: 677.9 MB). Free memory was 101.7 MB in the beginning and 614.7 MB in the end (delta: -513.0 MB). Peak memory consumption was 164.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4592]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 165 procedures, 1097 locations, 1 error locations. SAFE Result, 13.4s OverallTime, 20 OverallIterations, 9 TraceHistogramMax, 2.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 20527 SDtfs, 8550 SDslu, 42335 SDs, 0 SdLazy, 422 SolverSat, 69 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7721occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 852 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 5897 NumberOfCodeBlocks, 5897 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 5877 ConstructedInterpolants, 0 QuantifiedInterpolants, 2089898 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 9189/9189 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...