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-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 10:52:01,504 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 10:52:01,507 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 10:52:01,519 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 10:52:01,519 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 10:52:01,521 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 10:52:01,522 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 10:52:01,524 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 10:52:01,525 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 10:52:01,526 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 10:52:01,527 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 10:52:01,528 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 10:52:01,529 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 10:52:01,530 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 10:52:01,531 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 10:52:01,532 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 10:52:01,532 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 10:52:01,533 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 10:52:01,535 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 10:52:01,537 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 10:52:01,538 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 10:52:01,539 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 10:52:01,540 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 10:52:01,541 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 10:52:01,543 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 10:52:01,543 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 10:52:01,543 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 10:52:01,544 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 10:52:01,544 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 10:52:01,545 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 10:52:01,545 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 10:52:01,546 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 10:52:01,547 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 10:52:01,548 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 10:52:01,549 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 10:52:01,549 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 10:52:01,550 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 10:52:01,550 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 10:52:01,550 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 10:52:01,551 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 10:52:01,552 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 10:52:01,552 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 10:52:01,569 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 10:52:01,569 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 10:52:01,570 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 10:52:01,570 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 10:52:01,571 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 10:52:01,571 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 10:52:01,572 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 10:52:01,572 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 10:52:01,572 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 10:52:01,572 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 10:52:01,574 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 10:52:01,574 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 10:52:01,575 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 10:52:01,575 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 10:52:01,575 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 10:52:01,575 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 10:52:01,576 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 10:52:01,576 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 10:52:01,576 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 10:52:01,576 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 10:52:01,577 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 10:52:01,577 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 10:52:01,577 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 10:52:01,577 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 10:52:01,578 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 10:52:01,578 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 10:52:01,578 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 10:52:01,578 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 10:52:01,578 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 10:52:01,578 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 10:52:01,633 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 10:52:01,647 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 10:52:01,651 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 10:52:01,653 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 10:52:01,653 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 10:52:01,654 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i [2019-09-10 10:52:01,727 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e6891aea/1c7b82cb4d1048899eed48f47cbc899f/FLAGaf742ffb9 [2019-09-10 10:52:02,567 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 10:52:02,568 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i [2019-09-10 10:52:02,620 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e6891aea/1c7b82cb4d1048899eed48f47cbc899f/FLAGaf742ffb9 [2019-09-10 10:52:03,065 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e6891aea/1c7b82cb4d1048899eed48f47cbc899f [2019-09-10 10:52:03,076 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 10:52:03,077 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 10:52:03,078 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 10:52:03,079 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 10:52:03,082 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 10:52:03,083 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:52:03" (1/1) ... [2019-09-10 10:52:03,086 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e6ede1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:52:03, skipping insertion in model container [2019-09-10 10:52:03,086 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:52:03" (1/1) ... [2019-09-10 10:52:03,094 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 10:52:03,224 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 10:52:04,740 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 10:52:04,786 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 10:52:05,162 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 10:52:05,439 INFO L192 MainTranslator]: Completed translation [2019-09-10 10:52:05,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:52:05 WrapperNode [2019-09-10 10:52:05,440 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 10:52:05,441 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 10:52:05,441 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 10:52:05,442 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 10:52:05,456 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:52:05" (1/1) ... [2019-09-10 10:52:05,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:52:05" (1/1) ... [2019-09-10 10:52:05,554 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:52:05" (1/1) ... [2019-09-10 10:52:05,555 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:52:05" (1/1) ... [2019-09-10 10:52:05,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:52:05" (1/1) ... [2019-09-10 10:52:05,660 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:52:05" (1/1) ... [2019-09-10 10:52:05,677 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:52:05" (1/1) ... [2019-09-10 10:52:05,701 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 10:52:05,701 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 10:52:05,702 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 10:52:05,702 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 10:52:05,704 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:52:05" (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 10:52:05,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 10:52:05,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 10:52:05,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-09-10 10:52:05,770 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_in [2019-09-10 10:52:05,770 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_out [2019-09-10 10:52:05,770 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_bulk [2019-09-10 10:52:05,770 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_is_bulk_in [2019-09-10 10:52:05,770 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_is_bulk_out [2019-09-10 10:52:05,770 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2019-09-10 10:52:05,770 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2019-09-10 10:52:05,770 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2019-09-10 10:52:05,771 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2019-09-10 10:52:05,771 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2019-09-10 10:52:05,771 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_delayed_work [2019-09-10 10:52:05,771 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_delayed_work [2019-09-10 10:52:05,772 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2019-09-10 10:52:05,772 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2019-09-10 10:52:05,772 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2019-09-10 10:52:05,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-09-10 10:52:05,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-09-10 10:52:05,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2019-09-10 10:52:05,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ptr [2019-09-10 10:52:05,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2019-09-10 10:52:05,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-09-10 10:52:05,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2019-09-10 10:52:05,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-09-10 10:52:05,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_trap [2019-09-10 10:52:05,774 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_alloc_skb [2019-09-10 10:52:05,774 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_alloc_skb [2019-09-10 10:52:05,774 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2019-09-10 10:52:05,774 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2019-09-10 10:52:05,775 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2019-09-10 10:52:05,775 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_start_queue [2019-09-10 10:52:05,775 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_wake_queue [2019-09-10 10:52:05,775 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2019-09-10 10:52:05,775 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_stop_queue [2019-09-10 10:52:05,775 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2019-09-10 10:52:05,775 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_ok [2019-09-10 10:52:05,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_alloc_urbs [2019-09-10 10:52:05,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_free_urbs [2019-09-10 10:52:05,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_kill_urbs [2019-09-10 10:52:05,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_rcvbulk_callback [2019-09-10 10:52:05,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_sndbulk_callback [2019-09-10 10:52:05,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_carrier_set [2019-09-10 10:52:05,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_carrier_check_work [2019-09-10 10:52:05,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_get_macaddr [2019-09-10 10:52:05,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_rx_submit [2019-09-10 10:52:05,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_open [2019-09-10 10:52:05,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_close [2019-09-10 10:52:05,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_tx [2019-09-10 10:52:05,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_tx_timeout [2019-09-10 10:52:05,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_ethtool_op_get_link [2019-09-10 10:52:05,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_probe [2019-09-10 10:52:05,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_disconnect [2019-09-10 10:52:05,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_driver_init [2019-09-10 10:52:05,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_driver_exit [2019-09-10 10:52:05,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_driver_1 [2019-09-10 10:52:05,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_net_device_ops_2 [2019-09-10 10:52:05,779 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 10:52:05,779 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2019-09-10 10:52:05,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_alloc_urb_2 [2019-09-10 10:52:05,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_alloc_urb_3 [2019-09-10 10:52:05,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_free_urb_4 [2019-09-10 10:52:05,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_free_urb_5 [2019-09-10 10:52:05,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_free_urb_6 [2019-09-10 10:52:05,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_free_urb_7 [2019-09-10 10:52:05,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_bulk_urb_8 [2019-09-10 10:52:05,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_9 [2019-09-10 10:52:05,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_11 [2019-09-10 10:52:05,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_12 [2019-09-10 10:52:05,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_register_netdev_13 [2019-09-10 10:52:05,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_netdev_14 [2019-09-10 10:52:05,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata_15 [2019-09-10 10:52:05,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_unregister_netdev_16 [2019-09-10 10:52:05,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_netdev_17 [2019-09-10 10:52:05,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_register_driver_19 [2019-09-10 10:52:05,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_deregister_20 [2019-09-10 10:52:05,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2019-09-10 10:52:05,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata [2019-09-10 10:52:05,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata [2019-09-10 10:52:05,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_put_intf [2019-09-10 10:52:05,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2019-09-10 10:52:05,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2019-09-10 10:52:05,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_fill_int_urb [2019-09-10 10:52:05,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_fill_bulk_urb [2019-09-10 10:52:05,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2019-09-10 10:52:05,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_interface_to_usbdev [2019-09-10 10:52:05,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_get_dev [2019-09-10 10:52:05,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_put_dev [2019-09-10 10:52:05,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_get_interface [2019-09-10 10:52:05,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_put_interface [2019-09-10 10:52:05,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_serial_register [2019-09-10 10:52:05,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_serial_deregister [2019-09-10 10:52:05,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-09-10 10:52:05,784 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_work [2019-09-10 10:52:05,785 INFO L138 BoogieDeclarations]: Found implementation of procedure __netdev_alloc_skb [2019-09-10 10:52:05,785 INFO L138 BoogieDeclarations]: Found implementation of procedure __netif_schedule [2019-09-10 10:52:05,785 INFO L138 BoogieDeclarations]: Found implementation of procedure _dev_info [2019-09-10 10:52:05,785 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_etherdev_mqs [2019-09-10 10:52:05,785 INFO L138 BoogieDeclarations]: Found implementation of procedure cancel_delayed_work_sync [2019-09-10 10:52:05,785 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2019-09-10 10:52:05,785 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_irq [2019-09-10 10:52:05,786 INFO L138 BoogieDeclarations]: Found implementation of procedure eth_type_trans [2019-09-10 10:52:05,786 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2019-09-10 10:52:05,786 INFO L138 BoogieDeclarations]: Found implementation of procedure init_timer_key [2019-09-10 10:52:05,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-09-10 10:52:05,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_ndo_init_2 [2019-09-10 10:52:05,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_ndo_uninit_2 [2019-09-10 10:52:05,787 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_init_map [2019-09-10 10:52:05,787 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_off [2019-09-10 10:52:05,787 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_on [2019-09-10 10:52:05,787 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_rx [2019-09-10 10:52:05,787 INFO L138 BoogieDeclarations]: Found implementation of procedure netpoll_trap [2019-09-10 10:52:05,787 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-09-10 10:52:05,788 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_delayed_work_on [2019-09-10 10:52:05,788 INFO L138 BoogieDeclarations]: Found implementation of procedure register_netdev [2019-09-10 10:52:05,788 INFO L138 BoogieDeclarations]: Found implementation of procedure round_jiffies_relative [2019-09-10 10:52:05,788 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2019-09-10 10:52:05,788 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2019-09-10 10:52:05,788 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2019-09-10 10:52:05,789 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_altnum_to_altsetting [2019-09-10 10:52:05,789 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_control_msg [2019-09-10 10:52:05,789 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_deregister [2019-09-10 10:52:05,789 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2019-09-10 10:52:05,789 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2019-09-10 10:52:05,789 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register_driver [2019-09-10 10:52:05,789 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_interface [2019-09-10 10:52:05,790 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unlink_urb [2019-09-10 10:52:05,790 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_fmt [2019-09-10 10:52:05,790 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2019-09-10 10:52:05,790 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-09-10 10:52:05,790 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-09-10 10:52:05,790 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-09-10 10:52:05,791 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-10 10:52:05,791 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-10 10:52:05,791 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2019-09-10 10:52:05,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 10:52:05,791 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-09-10 10:52:05,791 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-10 10:52:05,792 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-09-10 10:52:05,792 INFO L130 BoogieDeclarations]: Found specification of procedure strcpy [2019-09-10 10:52:05,792 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_in [2019-09-10 10:52:05,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 10:52:05,792 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_out [2019-09-10 10:52:05,792 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_bulk [2019-09-10 10:52:05,793 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_is_bulk_in [2019-09-10 10:52:05,793 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_is_bulk_out [2019-09-10 10:52:05,793 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2019-09-10 10:52:05,793 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2019-09-10 10:52:05,793 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2019-09-10 10:52:05,793 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2019-09-10 10:52:05,793 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-09-10 10:52:05,794 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_fmt [2019-09-10 10:52:05,794 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2019-09-10 10:52:05,794 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2019-09-10 10:52:05,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-10 10:52:05,794 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_init_map [2019-09-10 10:52:05,794 INFO L130 BoogieDeclarations]: Found specification of procedure init_timer_key [2019-09-10 10:52:05,794 INFO L130 BoogieDeclarations]: Found specification of procedure round_jiffies_relative [2019-09-10 10:52:05,795 INFO L130 BoogieDeclarations]: Found specification of procedure delayed_work_timer_fn [2019-09-10 10:52:05,795 INFO L130 BoogieDeclarations]: Found specification of procedure __init_work [2019-09-10 10:52:05,795 INFO L130 BoogieDeclarations]: Found specification of procedure queue_delayed_work_on [2019-09-10 10:52:05,795 INFO L130 BoogieDeclarations]: Found specification of procedure cancel_delayed_work_sync [2019-09-10 10:52:05,795 INFO L130 BoogieDeclarations]: Found specification of procedure queue_delayed_work [2019-09-10 10:52:05,795 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_delayed_work [2019-09-10 10:52:05,796 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2019-09-10 10:52:05,796 INFO L130 BoogieDeclarations]: Found specification of procedure _dev_info [2019-09-10 10:52:05,796 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata_15 [2019-09-10 10:52:05,796 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_12 [2019-09-10 10:52:05,796 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2019-09-10 10:52:05,796 INFO L130 BoogieDeclarations]: Found specification of procedure usb_altnum_to_altsetting [2019-09-10 10:52:05,797 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register_driver [2019-09-10 10:52:05,797 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_register_driver_19 [2019-09-10 10:52:05,797 INFO L130 BoogieDeclarations]: Found specification of procedure usb_deregister [2019-09-10 10:52:05,797 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_deregister_20 [2019-09-10 10:52:05,797 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_bulk_urb_8 [2019-09-10 10:52:05,797 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_alloc_urb_2 [2019-09-10 10:52:05,797 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_alloc_urb_3 [2019-09-10 10:52:05,798 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_free_urb_4 [2019-09-10 10:52:05,798 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_free_urb_5 [2019-09-10 10:52:05,798 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_free_urb_6 [2019-09-10 10:52:05,798 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_free_urb_7 [2019-09-10 10:52:05,798 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_9 [2019-09-10 10:52:05,798 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_11 [2019-09-10 10:52:05,799 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unlink_urb [2019-09-10 10:52:05,799 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2019-09-10 10:52:05,799 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2019-09-10 10:52:05,799 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2019-09-10 10:52:05,799 INFO L130 BoogieDeclarations]: Found specification of procedure usb_control_msg [2019-09-10 10:52:05,799 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_interface [2019-09-10 10:52:05,799 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2019-09-10 10:52:05,800 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2019-09-10 10:52:05,800 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2019-09-10 10:52:05,800 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_fill_bulk_urb [2019-09-10 10:52:05,800 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2019-09-10 10:52:05,800 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_interface_to_usbdev [2019-09-10 10:52:05,800 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata [2019-09-10 10:52:05,800 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata [2019-09-10 10:52:05,801 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-09-10 10:52:05,801 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-09-10 10:52:05,801 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2019-09-10 10:52:05,801 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2019-09-10 10:52:05,801 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-10 10:52:05,801 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-10 10:52:05,802 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 10:52:05,802 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-09-10 10:52:05,802 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-10 10:52:05,802 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 10:52:05,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-10 10:52:05,802 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-09-10 10:52:05,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-10 10:52:05,803 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2019-09-10 10:52:05,803 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ptr [2019-09-10 10:52:05,803 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2019-09-10 10:52:05,803 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-09-10 10:52:05,803 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2019-09-10 10:52:05,803 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_trap [2019-09-10 10:52:05,804 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_driver_1 [2019-09-10 10:52:05,804 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_net_device_ops_2 [2019-09-10 10:52:05,804 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2019-09-10 10:52:05,804 INFO L130 BoogieDeclarations]: Found specification of procedure __netdev_alloc_skb [2019-09-10 10:52:05,804 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_alloc_skb [2019-09-10 10:52:05,804 INFO L130 BoogieDeclarations]: Found specification of procedure dev_alloc_skb [2019-09-10 10:52:05,804 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2019-09-10 10:52:05,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-10 10:52:05,805 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2019-09-10 10:52:05,805 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2019-09-10 10:52:05,805 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_netdev_14 [2019-09-10 10:52:05,805 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_netdev_17 [2019-09-10 10:52:05,805 INFO L130 BoogieDeclarations]: Found specification of procedure netpoll_trap [2019-09-10 10:52:05,806 INFO L130 BoogieDeclarations]: Found specification of procedure __netif_schedule [2019-09-10 10:52:05,806 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2019-09-10 10:52:05,806 INFO L130 BoogieDeclarations]: Found specification of procedure netif_start_queue [2019-09-10 10:52:05,806 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_wake_queue [2019-09-10 10:52:05,806 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2019-09-10 10:52:05,806 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_stop_queue [2019-09-10 10:52:05,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 10:52:05,807 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2019-09-10 10:52:05,807 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_irq [2019-09-10 10:52:05,807 INFO L130 BoogieDeclarations]: Found specification of procedure netif_rx [2019-09-10 10:52:05,807 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_ok [2019-09-10 10:52:05,807 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_on [2019-09-10 10:52:05,807 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_off [2019-09-10 10:52:05,808 INFO L130 BoogieDeclarations]: Found specification of procedure register_netdev [2019-09-10 10:52:05,808 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_register_netdev_13 [2019-09-10 10:52:05,808 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2019-09-10 10:52:05,808 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_unregister_netdev_16 [2019-09-10 10:52:05,808 INFO L130 BoogieDeclarations]: Found specification of procedure eth_type_trans [2019-09-10 10:52:05,808 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_etherdev_mqs [2019-09-10 10:52:05,808 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_rx_submit [2019-09-10 10:52:05,809 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_alloc_urbs [2019-09-10 10:52:05,809 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_free_urbs [2019-09-10 10:52:05,809 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_kill_urbs [2019-09-10 10:52:05,809 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_rcvbulk_callback [2019-09-10 10:52:05,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-10 10:52:05,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 10:52:05,809 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_sndbulk_callback [2019-09-10 10:52:05,810 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_carrier_set [2019-09-10 10:52:05,810 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_carrier_check_work [2019-09-10 10:52:05,810 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_get_macaddr [2019-09-10 10:52:05,810 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_open [2019-09-10 10:52:05,810 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_close [2019-09-10 10:52:05,810 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_tx [2019-09-10 10:52:05,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-09-10 10:52:05,811 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_tx_timeout [2019-09-10 10:52:05,811 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_ethtool_op_get_link [2019-09-10 10:52:05,811 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_probe [2019-09-10 10:52:05,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2019-09-10 10:52:05,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 10:52:05,811 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_disconnect [2019-09-10 10:52:05,812 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_driver_init [2019-09-10 10:52:05,812 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_driver_exit [2019-09-10 10:52:05,812 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_ndo_init_2 [2019-09-10 10:52:05,812 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_ndo_uninit_2 [2019-09-10 10:52:05,812 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-09-10 10:52:05,812 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-09-10 10:52:05,813 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 10:52:05,813 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2019-09-10 10:52:05,813 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_put_intf [2019-09-10 10:52:05,813 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_fill_int_urb [2019-09-10 10:52:05,813 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-09-10 10:52:05,813 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_get_dev [2019-09-10 10:52:05,813 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_put_dev [2019-09-10 10:52:05,814 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_get_interface [2019-09-10 10:52:05,814 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_put_interface [2019-09-10 10:52:05,814 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_serial_register [2019-09-10 10:52:05,814 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_serial_deregister [2019-09-10 10:52:05,814 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-09-10 10:52:05,814 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 10:52:05,815 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2019-09-10 10:52:05,815 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-10 10:52:05,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 10:52:05,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-10 10:52:05,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-10 10:52:05,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 10:52:05,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-10 10:52:05,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-10 10:52:05,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-10 10:52:05,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-10 10:52:06,573 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2019-09-10 10:52:07,852 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2019-09-10 10:52:08,528 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 10:52:08,528 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 10:52:08,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:52:08 BoogieIcfgContainer [2019-09-10 10:52:08,531 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 10:52:08,532 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 10:52:08,532 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 10:52:08,535 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 10:52:08,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 10:52:03" (1/3) ... [2019-09-10 10:52:08,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e90942 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:52:08, skipping insertion in model container [2019-09-10 10:52:08,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:52:05" (2/3) ... [2019-09-10 10:52:08,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e90942 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:52:08, skipping insertion in model container [2019-09-10 10:52:08,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:52:08" (3/3) ... [2019-09-10 10:52:08,539 INFO L109 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i [2019-09-10 10:52:08,549 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 10:52:08,559 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 10:52:08,576 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 10:52:08,603 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 10:52:08,603 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 10:52:08,604 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 10:52:08,604 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 10:52:08,604 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 10:52:08,604 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 10:52:08,604 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 10:52:08,604 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 10:52:08,636 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states. [2019-09-10 10:52:08,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-10 10:52:08,653 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 10:52:08,654 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:52:08,656 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 10:52:08,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 10:52:08,662 INFO L82 PathProgramCache]: Analyzing trace with hash -983968687, now seen corresponding path program 1 times [2019-09-10 10:52:08,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 10:52:08,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 10:52:08,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 10:52:08,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 10:52:08,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 10:52:08,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 10:52:09,243 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 10:52:09,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 10:52:09,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 10:52:09,247 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 10:52:09,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 10:52:09,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 10:52:09,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 10:52:09,269 INFO L87 Difference]: Start difference. First operand 859 states. Second operand 3 states. [2019-09-10 10:52:09,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 10:52:09,607 INFO L93 Difference]: Finished difference Result 1588 states and 1911 transitions. [2019-09-10 10:52:09,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 10:52:09,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-09-10 10:52:09,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 10:52:09,643 INFO L225 Difference]: With dead ends: 1588 [2019-09-10 10:52:09,644 INFO L226 Difference]: Without dead ends: 1563 [2019-09-10 10:52:09,646 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 10:52:09,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2019-09-10 10:52:09,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1563. [2019-09-10 10:52:09,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2019-09-10 10:52:09,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 1872 transitions. [2019-09-10 10:52:09,822 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 1872 transitions. Word has length 51 [2019-09-10 10:52:09,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 10:52:09,822 INFO L475 AbstractCegarLoop]: Abstraction has 1563 states and 1872 transitions. [2019-09-10 10:52:09,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 10:52:09,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 1872 transitions. [2019-09-10 10:52:09,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 10:52:09,829 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 10:52:09,829 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:52:09,830 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 10:52:09,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 10:52:09,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1692160595, now seen corresponding path program 1 times [2019-09-10 10:52:09,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 10:52:09,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 10:52:09,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 10:52:09,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 10:52:09,836 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 10:52:09,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 10:52:10,088 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 10:52:10,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 10:52:10,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 10:52:10,089 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 10:52:10,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 10:52:10,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 10:52:10,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 10:52:10,093 INFO L87 Difference]: Start difference. First operand 1563 states and 1872 transitions. Second operand 3 states. [2019-09-10 10:52:10,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 10:52:10,176 INFO L93 Difference]: Finished difference Result 1576 states and 1887 transitions. [2019-09-10 10:52:10,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 10:52:10,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-10 10:52:10,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 10:52:10,188 INFO L225 Difference]: With dead ends: 1576 [2019-09-10 10:52:10,188 INFO L226 Difference]: Without dead ends: 1576 [2019-09-10 10:52:10,189 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 10:52:10,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2019-09-10 10:52:10,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1563. [2019-09-10 10:52:10,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2019-09-10 10:52:10,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 1871 transitions. [2019-09-10 10:52:10,258 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 1871 transitions. Word has length 67 [2019-09-10 10:52:10,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 10:52:10,259 INFO L475 AbstractCegarLoop]: Abstraction has 1563 states and 1871 transitions. [2019-09-10 10:52:10,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 10:52:10,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 1871 transitions. [2019-09-10 10:52:10,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 10:52:10,264 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 10:52:10,264 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:52:10,264 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 10:52:10,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 10:52:10,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1749418897, now seen corresponding path program 1 times [2019-09-10 10:52:10,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 10:52:10,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 10:52:10,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 10:52:10,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 10:52:10,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 10:52:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 10:52:10,462 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 10:52:10,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 10:52:10,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 10:52:10,462 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 10:52:10,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 10:52:10,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 10:52:10,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 10:52:10,464 INFO L87 Difference]: Start difference. First operand 1563 states and 1871 transitions. Second operand 3 states. [2019-09-10 10:52:10,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 10:52:10,570 INFO L93 Difference]: Finished difference Result 3109 states and 3781 transitions. [2019-09-10 10:52:10,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 10:52:10,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-10 10:52:10,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 10:52:10,597 INFO L225 Difference]: With dead ends: 3109 [2019-09-10 10:52:10,597 INFO L226 Difference]: Without dead ends: 3109 [2019-09-10 10:52:10,598 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 10:52:10,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3109 states. [2019-09-10 10:52:10,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3109 to 3099. [2019-09-10 10:52:10,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3099 states. [2019-09-10 10:52:10,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3099 states to 3099 states and 3769 transitions. [2019-09-10 10:52:10,757 INFO L78 Accepts]: Start accepts. Automaton has 3099 states and 3769 transitions. Word has length 67 [2019-09-10 10:52:10,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 10:52:10,758 INFO L475 AbstractCegarLoop]: Abstraction has 3099 states and 3769 transitions. [2019-09-10 10:52:10,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 10:52:10,759 INFO L276 IsEmpty]: Start isEmpty. Operand 3099 states and 3769 transitions. [2019-09-10 10:52:10,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 10:52:10,765 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 10:52:10,765 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:52:10,765 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 10:52:10,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 10:52:10,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1603016112, now seen corresponding path program 1 times [2019-09-10 10:52:10,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 10:52:10,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 10:52:10,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 10:52:10,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 10:52:10,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 10:52:10,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 10:52:11,149 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 10:52:11,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 10:52:11,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 10:52:11,150 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 10:52:11,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 10:52:11,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 10:52:11,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 10:52:11,151 INFO L87 Difference]: Start difference. First operand 3099 states and 3769 transitions. Second operand 3 states. [2019-09-10 10:52:11,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 10:52:11,189 INFO L93 Difference]: Finished difference Result 3098 states and 3767 transitions. [2019-09-10 10:52:11,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 10:52:11,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-10 10:52:11,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 10:52:11,209 INFO L225 Difference]: With dead ends: 3098 [2019-09-10 10:52:11,210 INFO L226 Difference]: Without dead ends: 3098 [2019-09-10 10:52:11,210 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 10:52:11,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3098 states. [2019-09-10 10:52:11,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3098 to 3098. [2019-09-10 10:52:11,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3098 states. [2019-09-10 10:52:11,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 3767 transitions. [2019-09-10 10:52:11,321 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 3767 transitions. Word has length 68 [2019-09-10 10:52:11,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 10:52:11,323 INFO L475 AbstractCegarLoop]: Abstraction has 3098 states and 3767 transitions. [2019-09-10 10:52:11,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 10:52:11,323 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 3767 transitions. [2019-09-10 10:52:11,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 10:52:11,326 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 10:52:11,327 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:52:11,327 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 10:52:11,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 10:52:11,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1845685876, now seen corresponding path program 1 times [2019-09-10 10:52:11,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 10:52:11,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 10:52:11,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 10:52:11,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 10:52:11,331 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 10:52:11,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 10:52:11,493 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 10:52:11,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 10:52:11,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 10:52:11,494 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 10:52:11,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 10:52:11,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 10:52:11,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 10:52:11,495 INFO L87 Difference]: Start difference. First operand 3098 states and 3767 transitions. Second operand 3 states. [2019-09-10 10:52:11,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 10:52:11,534 INFO L93 Difference]: Finished difference Result 3097 states and 3765 transitions. [2019-09-10 10:52:11,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 10:52:11,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-10 10:52:11,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 10:52:11,556 INFO L225 Difference]: With dead ends: 3097 [2019-09-10 10:52:11,556 INFO L226 Difference]: Without dead ends: 3097 [2019-09-10 10:52:11,557 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 10:52:11,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3097 states. [2019-09-10 10:52:11,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3097 to 3097. [2019-09-10 10:52:11,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3097 states. [2019-09-10 10:52:11,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3097 states to 3097 states and 3765 transitions. [2019-09-10 10:52:11,684 INFO L78 Accepts]: Start accepts. Automaton has 3097 states and 3765 transitions. Word has length 69 [2019-09-10 10:52:11,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 10:52:11,685 INFO L475 AbstractCegarLoop]: Abstraction has 3097 states and 3765 transitions. [2019-09-10 10:52:11,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 10:52:11,685 INFO L276 IsEmpty]: Start isEmpty. Operand 3097 states and 3765 transitions. [2019-09-10 10:52:11,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 10:52:11,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 10:52:11,691 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:52:11,691 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 10:52:11,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 10:52:11,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1381269971, now seen corresponding path program 1 times [2019-09-10 10:52:11,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 10:52:11,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 10:52:11,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 10:52:11,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 10:52:11,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 10:52:11,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 10:52:11,840 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 10:52:11,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 10:52:11,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 10:52:11,841 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 10:52:11,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 10:52:11,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 10:52:11,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 10:52:11,846 INFO L87 Difference]: Start difference. First operand 3097 states and 3765 transitions. Second operand 3 states. [2019-09-10 10:52:11,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 10:52:11,880 INFO L93 Difference]: Finished difference Result 3096 states and 3763 transitions. [2019-09-10 10:52:11,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 10:52:11,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-09-10 10:52:11,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 10:52:11,897 INFO L225 Difference]: With dead ends: 3096 [2019-09-10 10:52:11,897 INFO L226 Difference]: Without dead ends: 3096 [2019-09-10 10:52:11,897 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 10:52:11,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3096 states. [2019-09-10 10:52:11,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3096 to 3096. [2019-09-10 10:52:11,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3096 states. [2019-09-10 10:52:11,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3096 states to 3096 states and 3763 transitions. [2019-09-10 10:52:11,992 INFO L78 Accepts]: Start accepts. Automaton has 3096 states and 3763 transitions. Word has length 70 [2019-09-10 10:52:11,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 10:52:11,993 INFO L475 AbstractCegarLoop]: Abstraction has 3096 states and 3763 transitions. [2019-09-10 10:52:11,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 10:52:11,993 INFO L276 IsEmpty]: Start isEmpty. Operand 3096 states and 3763 transitions. [2019-09-10 10:52:11,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 10:52:11,995 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 10:52:11,995 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:52:11,996 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 10:52:11,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 10:52:11,996 INFO L82 PathProgramCache]: Analyzing trace with hash -130716329, now seen corresponding path program 1 times [2019-09-10 10:52:11,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 10:52:12,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 10:52:12,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 10:52:12,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 10:52:12,000 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 10:52:12,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 10:52:12,315 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 10:52:12,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 10:52:12,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 10:52:12,316 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 10:52:12,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 10:52:12,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 10:52:12,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 10:52:12,320 INFO L87 Difference]: Start difference. First operand 3096 states and 3763 transitions. Second operand 3 states. [2019-09-10 10:52:12,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 10:52:12,356 INFO L93 Difference]: Finished difference Result 3095 states and 3761 transitions. [2019-09-10 10:52:12,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 10:52:12,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-09-10 10:52:12,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 10:52:12,377 INFO L225 Difference]: With dead ends: 3095 [2019-09-10 10:52:12,377 INFO L226 Difference]: Without dead ends: 3076 [2019-09-10 10:52:12,378 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 10:52:12,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3076 states. [2019-09-10 10:52:12,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3076 to 3076. [2019-09-10 10:52:12,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3076 states. [2019-09-10 10:52:12,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3076 states to 3076 states and 3740 transitions. [2019-09-10 10:52:12,472 INFO L78 Accepts]: Start accepts. Automaton has 3076 states and 3740 transitions. Word has length 71 [2019-09-10 10:52:12,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 10:52:12,475 INFO L475 AbstractCegarLoop]: Abstraction has 3076 states and 3740 transitions. [2019-09-10 10:52:12,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 10:52:12,475 INFO L276 IsEmpty]: Start isEmpty. Operand 3076 states and 3740 transitions. [2019-09-10 10:52:12,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-09-10 10:52:12,493 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 10:52:12,493 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2019-09-10 10:52:12,494 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 10:52:12,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 10:52:12,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1221910458, now seen corresponding path program 1 times [2019-09-10 10:52:12,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 10:52:12,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 10:52:12,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 10:52:12,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 10:52:12,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 10:52:12,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 10:52:12,693 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-10 10:52:12,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 10:52:12,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 10:52:12,694 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 10:52:12,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 10:52:12,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 10:52:12,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 10:52:12,696 INFO L87 Difference]: Start difference. First operand 3076 states and 3740 transitions. Second operand 3 states. [2019-09-10 10:52:12,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 10:52:12,807 INFO L93 Difference]: Finished difference Result 5109 states and 6188 transitions. [2019-09-10 10:52:12,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 10:52:12,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 234 [2019-09-10 10:52:12,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 10:52:12,839 INFO L225 Difference]: With dead ends: 5109 [2019-09-10 10:52:12,839 INFO L226 Difference]: Without dead ends: 5109 [2019-09-10 10:52:12,840 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 10:52:12,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5109 states. [2019-09-10 10:52:13,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5109 to 5076. [2019-09-10 10:52:13,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5076 states. [2019-09-10 10:52:13,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5076 states to 5076 states and 6150 transitions. [2019-09-10 10:52:13,063 INFO L78 Accepts]: Start accepts. Automaton has 5076 states and 6150 transitions. Word has length 234 [2019-09-10 10:52:13,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 10:52:13,064 INFO L475 AbstractCegarLoop]: Abstraction has 5076 states and 6150 transitions. [2019-09-10 10:52:13,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 10:52:13,064 INFO L276 IsEmpty]: Start isEmpty. Operand 5076 states and 6150 transitions. [2019-09-10 10:52:13,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-10 10:52:13,087 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 10:52:13,087 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 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] [2019-09-10 10:52:13,088 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 10:52:13,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 10:52:13,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1252478566, now seen corresponding path program 1 times [2019-09-10 10:52:13,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 10:52:13,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 10:52:13,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 10:52:13,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 10:52:13,097 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 10:52:13,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 10:52:13,466 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-10 10:52:13,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 10:52:13,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 10:52:13,467 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 10:52:13,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 10:52:13,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 10:52:13,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 10:52:13,469 INFO L87 Difference]: Start difference. First operand 5076 states and 6150 transitions. Second operand 3 states. [2019-09-10 10:52:13,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 10:52:13,522 INFO L93 Difference]: Finished difference Result 5080 states and 6154 transitions. [2019-09-10 10:52:13,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 10:52:13,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2019-09-10 10:52:13,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 10:52:13,563 INFO L225 Difference]: With dead ends: 5080 [2019-09-10 10:52:13,564 INFO L226 Difference]: Without dead ends: 5080 [2019-09-10 10:52:13,565 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 10:52:13,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5080 states. [2019-09-10 10:52:13,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5080 to 5080. [2019-09-10 10:52:13,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5080 states. [2019-09-10 10:52:13,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5080 states to 5080 states and 6154 transitions. [2019-09-10 10:52:13,721 INFO L78 Accepts]: Start accepts. Automaton has 5080 states and 6154 transitions. Word has length 253 [2019-09-10 10:52:13,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 10:52:13,723 INFO L475 AbstractCegarLoop]: Abstraction has 5080 states and 6154 transitions. [2019-09-10 10:52:13,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 10:52:13,724 INFO L276 IsEmpty]: Start isEmpty. Operand 5080 states and 6154 transitions. [2019-09-10 10:52:13,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-10 10:52:13,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 10:52:13,742 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 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] [2019-09-10 10:52:13,742 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 10:52:13,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 10:52:13,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1927638692, now seen corresponding path program 1 times [2019-09-10 10:52:13,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 10:52:13,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 10:52:13,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 10:52:13,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 10:52:13,748 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 10:52:13,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 10:52:14,018 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-10 10:52:14,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 10:52:14,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 10:52:14,019 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 10:52:14,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 10:52:14,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 10:52:14,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 10:52:14,022 INFO L87 Difference]: Start difference. First operand 5080 states and 6154 transitions. Second operand 6 states. [2019-09-10 10:52:14,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 10:52:14,146 INFO L93 Difference]: Finished difference Result 5108 states and 6186 transitions. [2019-09-10 10:52:14,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 10:52:14,147 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 253 [2019-09-10 10:52:14,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 10:52:14,171 INFO L225 Difference]: With dead ends: 5108 [2019-09-10 10:52:14,171 INFO L226 Difference]: Without dead ends: 5108 [2019-09-10 10:52:14,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 10:52:14,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5108 states. [2019-09-10 10:52:14,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5108 to 5100. [2019-09-10 10:52:14,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5100 states. [2019-09-10 10:52:14,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5100 states to 5100 states and 6174 transitions. [2019-09-10 10:52:14,322 INFO L78 Accepts]: Start accepts. Automaton has 5100 states and 6174 transitions. Word has length 253 [2019-09-10 10:52:14,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 10:52:14,323 INFO L475 AbstractCegarLoop]: Abstraction has 5100 states and 6174 transitions. [2019-09-10 10:52:14,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 10:52:14,323 INFO L276 IsEmpty]: Start isEmpty. Operand 5100 states and 6174 transitions. [2019-09-10 10:52:14,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-09-10 10:52:14,342 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 10:52:14,342 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 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] [2019-09-10 10:52:14,343 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 10:52:14,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 10:52:14,343 INFO L82 PathProgramCache]: Analyzing trace with hash 757500745, now seen corresponding path program 1 times [2019-09-10 10:52:14,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 10:52:14,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 10:52:14,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 10:52:14,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 10:52:14,350 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 10:52:14,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 10:52:14,802 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-10 10:52:14,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 10:52:14,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 10:52:14,803 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 10:52:14,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 10:52:14,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 10:52:14,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 10:52:14,804 INFO L87 Difference]: Start difference. First operand 5100 states and 6174 transitions. Second operand 9 states. [2019-09-10 10:52:14,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 10:52:14,897 INFO L93 Difference]: Finished difference Result 5140 states and 6214 transitions. [2019-09-10 10:52:14,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 10:52:14,898 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 263 [2019-09-10 10:52:14,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 10:52:14,923 INFO L225 Difference]: With dead ends: 5140 [2019-09-10 10:52:14,924 INFO L226 Difference]: Without dead ends: 5140 [2019-09-10 10:52:14,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 10:52:14,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5140 states. [2019-09-10 10:52:15,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5140 to 5140. [2019-09-10 10:52:15,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5140 states. [2019-09-10 10:52:15,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5140 states to 5140 states and 6214 transitions. [2019-09-10 10:52:15,085 INFO L78 Accepts]: Start accepts. Automaton has 5140 states and 6214 transitions. Word has length 263 [2019-09-10 10:52:15,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 10:52:15,088 INFO L475 AbstractCegarLoop]: Abstraction has 5140 states and 6214 transitions. [2019-09-10 10:52:15,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 10:52:15,088 INFO L276 IsEmpty]: Start isEmpty. Operand 5140 states and 6214 transitions. [2019-09-10 10:52:15,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-09-10 10:52:15,110 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 10:52:15,110 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 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] [2019-09-10 10:52:15,111 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 10:52:15,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 10:52:15,111 INFO L82 PathProgramCache]: Analyzing trace with hash 901910440, now seen corresponding path program 1 times [2019-09-10 10:52:15,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 10:52:15,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 10:52:15,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 10:52:15,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 10:52:15,117 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 10:52:15,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 10:52:15,624 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-10 10:52:15,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 10:52:15,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 10:52:15,626 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 10:52:15,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 10:52:15,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 10:52:15,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 10:52:15,629 INFO L87 Difference]: Start difference. First operand 5140 states and 6214 transitions. Second operand 8 states. [2019-09-10 10:52:16,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 10:52:16,098 INFO L93 Difference]: Finished difference Result 10366 states and 12534 transitions. [2019-09-10 10:52:16,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 10:52:16,098 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 263 [2019-09-10 10:52:16,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 10:52:16,158 INFO L225 Difference]: With dead ends: 10366 [2019-09-10 10:52:16,158 INFO L226 Difference]: Without dead ends: 10366 [2019-09-10 10:52:16,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-09-10 10:52:16,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10366 states. [2019-09-10 10:52:16,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10366 to 5200. [2019-09-10 10:52:16,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5200 states. [2019-09-10 10:52:16,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5200 states to 5200 states and 6288 transitions. [2019-09-10 10:52:16,411 INFO L78 Accepts]: Start accepts. Automaton has 5200 states and 6288 transitions. Word has length 263 [2019-09-10 10:52:16,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 10:52:16,412 INFO L475 AbstractCegarLoop]: Abstraction has 5200 states and 6288 transitions. [2019-09-10 10:52:16,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 10:52:16,412 INFO L276 IsEmpty]: Start isEmpty. Operand 5200 states and 6288 transitions. [2019-09-10 10:52:16,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-09-10 10:52:16,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 10:52:16,431 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 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] [2019-09-10 10:52:16,432 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 10:52:16,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 10:52:16,433 INFO L82 PathProgramCache]: Analyzing trace with hash 767896934, now seen corresponding path program 1 times [2019-09-10 10:52:16,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 10:52:16,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 10:52:16,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 10:52:16,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 10:52:16,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 10:52:16,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 10:52:16,928 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-10 10:52:16,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 10:52:16,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 10:52:16,929 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 10:52:16,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 10:52:16,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 10:52:16,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 10:52:16,932 INFO L87 Difference]: Start difference. First operand 5200 states and 6288 transitions. Second operand 5 states. [2019-09-10 10:52:17,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 10:52:17,081 INFO L93 Difference]: Finished difference Result 5216 states and 6312 transitions. [2019-09-10 10:52:17,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 10:52:17,082 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 263 [2019-09-10 10:52:17,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 10:52:17,104 INFO L225 Difference]: With dead ends: 5216 [2019-09-10 10:52:17,104 INFO L226 Difference]: Without dead ends: 5216 [2019-09-10 10:52:17,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 10:52:17,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5216 states. [2019-09-10 10:52:17,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5216 to 5204. [2019-09-10 10:52:17,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5204 states. [2019-09-10 10:52:17,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5204 states to 5204 states and 6292 transitions. [2019-09-10 10:52:17,253 INFO L78 Accepts]: Start accepts. Automaton has 5204 states and 6292 transitions. Word has length 263 [2019-09-10 10:52:17,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 10:52:17,254 INFO L475 AbstractCegarLoop]: Abstraction has 5204 states and 6292 transitions. [2019-09-10 10:52:17,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 10:52:17,254 INFO L276 IsEmpty]: Start isEmpty. Operand 5204 states and 6292 transitions. [2019-09-10 10:52:17,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-09-10 10:52:17,268 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 10:52:17,268 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 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] [2019-09-10 10:52:17,269 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 10:52:17,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 10:52:17,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1798830281, now seen corresponding path program 1 times [2019-09-10 10:52:17,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 10:52:17,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 10:52:17,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 10:52:17,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 10:52:17,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 10:52:17,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 10:52:17,614 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-10 10:52:17,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 10:52:17,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 10:52:17,615 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 10:52:17,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 10:52:17,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 10:52:17,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 10:52:17,617 INFO L87 Difference]: Start difference. First operand 5204 states and 6292 transitions. Second operand 4 states. [2019-09-10 10:52:17,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 10:52:17,874 INFO L93 Difference]: Finished difference Result 5236 states and 6340 transitions. [2019-09-10 10:52:17,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 10:52:17,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 264 [2019-09-10 10:52:17,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 10:52:17,899 INFO L225 Difference]: With dead ends: 5236 [2019-09-10 10:52:17,900 INFO L226 Difference]: Without dead ends: 5236 [2019-09-10 10:52:17,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 10:52:17,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5236 states. [2019-09-10 10:52:18,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5236 to 5220. [2019-09-10 10:52:18,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5220 states. [2019-09-10 10:52:18,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5220 states to 5220 states and 6316 transitions. [2019-09-10 10:52:18,053 INFO L78 Accepts]: Start accepts. Automaton has 5220 states and 6316 transitions. Word has length 264 [2019-09-10 10:52:18,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 10:52:18,054 INFO L475 AbstractCegarLoop]: Abstraction has 5220 states and 6316 transitions. [2019-09-10 10:52:18,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 10:52:18,054 INFO L276 IsEmpty]: Start isEmpty. Operand 5220 states and 6316 transitions. [2019-09-10 10:52:18,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-09-10 10:52:18,069 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 10:52:18,069 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 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] [2019-09-10 10:52:18,069 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 10:52:18,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 10:52:18,070 INFO L82 PathProgramCache]: Analyzing trace with hash -215575676, now seen corresponding path program 1 times [2019-09-10 10:52:18,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 10:52:18,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 10:52:18,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 10:52:18,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 10:52:18,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 10:52:18,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 10:52:18,693 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-10 10:52:18,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 10:52:18,693 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 10:52:18,709 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 266 with the following transitions: [2019-09-10 10:52:18,715 INFO L207 CegarAbsIntRunner]: [7], [11], [14], [20], [67], [70], [71], [80], [81], [150], [151], [156], [158], [159], [205], [209], [211], [215], [217], [218], [221], [222], [231], [235], [236], [237], [239], [241], [244], [247], [254], [255], [256], [258], [259], [328], [330], [331], [332], [333], [334], [336], [338], [342], [344], [346], [348], [353], [373], [378], [383], [389], [391], [396], [398], [403], [405], [408], [410], [412], [415], [429], [431], [434], [435], [467], [469], [472], [504], [505], [512], [572], [574], [575], [602], [603], [634], [636], [637], [638], [639], [642], [644], [646], [648], [650], [652], [655], [658], [661], [664], [666], [671], [704], [707], [710], [713], [716], [718], [722], [725], [728], [730], [733], [741], [933], [934], [950], [951], [1057], [1062], [1063], [1064], [1065], [1068], [1070], [1072], [1077], [1082], [1089], [1091], [1093], [1095], [1096], [1097], [1099], [1100], [1170], [1171], [1186], [1187], [1202], [1204], [1205], [1212], [1213], [1214], [1216], [1217], [1243], [1245], [1247], [1248], [1260], [1261], [1274], [1276], [1277], [1284], [1286], [1287], [1292], [1326], [1329], [1333], [1341], [1343], [1346], [1351], [1352], [1391], [1392], [1405], [1406], [1407], [1408], [1409], [1410], [1437], [1438], [1439], [1440], [1441], [1442], [1443], [1444], [1445], [1446], [1447], [1448], [1453], [1454], [1455], [1456], [1457], [1458], [1459], [1460], [1461], [1462], [1463], [1464], [1465], [1466], [1473], [1474], [1475], [1476], [1497], [1498], [1527], [1528], [1549], [1550], [1551], [1552], [1553], [1554], [1555], [1556], [1557], [1558], [1559], [1560], [1565], [1566], [1567], [1568], [1595], [1651], [1652], [1655], [1656], [1657], [1658], [1661], [1662], [1663], [1664], [1695], [1696], [1699], [1700], [1707], [1708], [1709], [1710], [1715], [1716], [1719], [1720], [1721], [1733], [1734], [1735], [1737], [1738] [2019-09-10 10:52:18,790 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 10:52:18,790 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 10:52:18,936 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 10:52:18,938 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 141 root evaluator evaluations with a maximum evaluation depth of 0. Performed 141 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 270 variables. [2019-09-10 10:52:18,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 10:52:18,944 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 10:52:19,106 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-10 10:52:19,106 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 10:52:19,119 INFO L420 sIntCurrentIteration]: We unified 264 AI predicates to 264 [2019-09-10 10:52:19,119 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 10:52:19,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 10:52:19,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 7 [2019-09-10 10:52:19,121 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 10:52:19,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 10:52:19,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 10:52:19,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 10:52:19,123 INFO L87 Difference]: Start difference. First operand 5220 states and 6316 transitions. Second operand 2 states. [2019-09-10 10:52:19,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 10:52:19,124 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-10 10:52:19,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 10:52:19,124 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 265 [2019-09-10 10:52:19,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 10:52:19,124 INFO L225 Difference]: With dead ends: 2 [2019-09-10 10:52:19,124 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 10:52:19,125 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 10:52:19,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 10:52:19,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 10:52:19,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 10:52:19,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 10:52:19,126 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 265 [2019-09-10 10:52:19,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 10:52:19,126 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 10:52:19,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 10:52:19,126 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 10:52:19,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 10:52:19,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 10:52:19 BoogieIcfgContainer [2019-09-10 10:52:19,137 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 10:52:19,140 INFO L168 Benchmark]: Toolchain (without parser) took 16062.07 ms. Allocated memory was 132.6 MB in the beginning and 772.8 MB in the end (delta: 640.2 MB). Free memory was 79.6 MB in the beginning and 575.1 MB in the end (delta: -495.5 MB). Peak memory consumption was 144.7 MB. Max. memory is 7.1 GB. [2019-09-10 10:52:19,144 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 132.6 MB. Free memory was 107.2 MB in the beginning and 106.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-09-10 10:52:19,148 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2362.43 ms. Allocated memory was 132.6 MB in the beginning and 265.3 MB in the end (delta: 132.6 MB). Free memory was 79.4 MB in the beginning and 219.8 MB in the end (delta: -140.4 MB). Peak memory consumption was 112.3 MB. Max. memory is 7.1 GB. [2019-09-10 10:52:19,151 INFO L168 Benchmark]: Boogie Preprocessor took 259.72 ms. Allocated memory is still 265.3 MB. Free memory was 219.8 MB in the beginning and 205.7 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. [2019-09-10 10:52:19,151 INFO L168 Benchmark]: RCFGBuilder took 2829.30 ms. Allocated memory was 265.3 MB in the beginning and 367.0 MB in the end (delta: 101.7 MB). Free memory was 205.7 MB in the beginning and 289.8 MB in the end (delta: -84.1 MB). Peak memory consumption was 151.5 MB. Max. memory is 7.1 GB. [2019-09-10 10:52:19,152 INFO L168 Benchmark]: TraceAbstraction took 10606.01 ms. Allocated memory was 367.0 MB in the beginning and 772.8 MB in the end (delta: 405.8 MB). Free memory was 289.8 MB in the beginning and 575.1 MB in the end (delta: -285.4 MB). Peak memory consumption was 120.4 MB. Max. memory is 7.1 GB. [2019-09-10 10:52:19,164 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.22 ms. Allocated memory is still 132.6 MB. Free memory was 107.2 MB in the beginning and 106.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2362.43 ms. Allocated memory was 132.6 MB in the beginning and 265.3 MB in the end (delta: 132.6 MB). Free memory was 79.4 MB in the beginning and 219.8 MB in the end (delta: -140.4 MB). Peak memory consumption was 112.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 259.72 ms. Allocated memory is still 265.3 MB. Free memory was 219.8 MB in the beginning and 205.7 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2829.30 ms. Allocated memory was 265.3 MB in the beginning and 367.0 MB in the end (delta: 101.7 MB). Free memory was 205.7 MB in the beginning and 289.8 MB in the end (delta: -84.1 MB). Peak memory consumption was 151.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10606.01 ms. Allocated memory was 367.0 MB in the beginning and 772.8 MB in the end (delta: 405.8 MB). Free memory was 289.8 MB in the beginning and 575.1 MB in the end (delta: -285.4 MB). Peak memory consumption was 120.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5487]: 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 136 procedures, 901 locations, 1 error locations. SAFE Result, 10.5s OverallTime, 15 OverallIterations, 4 TraceHistogramMax, 2.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 15051 SDtfs, 8249 SDslu, 29434 SDs, 0 SdLazy, 247 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 338 GetRequests, 293 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5220occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 2.4431818181818183 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 5258 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 2521 NumberOfCodeBlocks, 2521 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2506 ConstructedInterpolants, 0 QuantifiedInterpolants, 636454 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 462/464 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...