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-fea9116 [2019-09-20 13:43:38,229 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:43:38,231 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:43:38,244 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:43:38,244 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:43:38,246 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:43:38,247 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:43:38,249 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:43:38,251 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:43:38,252 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:43:38,253 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:43:38,254 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:43:38,255 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:43:38,256 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:43:38,257 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:43:38,258 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:43:38,259 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:43:38,260 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:43:38,262 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:43:38,264 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:43:38,266 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:43:38,268 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:43:38,269 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:43:38,270 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:43:38,275 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:43:38,275 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:43:38,276 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:43:38,277 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:43:38,282 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:43:38,284 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:43:38,284 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:43:38,285 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:43:38,286 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:43:38,288 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:43:38,289 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:43:38,290 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:43:38,293 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:43:38,293 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:43:38,294 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:43:38,295 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:43:38,296 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:43:38,297 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-20 13:43:38,313 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:43:38,314 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:43:38,314 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:43:38,314 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:43:38,315 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:43:38,315 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:43:38,315 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:43:38,315 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:43:38,316 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:43:38,316 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:43:38,317 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:43:38,317 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:43:38,317 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:43:38,317 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:43:38,317 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:43:38,318 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:43:38,318 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:43:38,318 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:43:38,318 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:43:38,318 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:43:38,319 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:43:38,319 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:43:38,319 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:43:38,319 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:43:38,320 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:43:38,320 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:43:38,320 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:43:38,320 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:43:38,320 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:43:38,320 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:43:38,366 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:43:38,386 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:43:38,391 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:43:38,392 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:43:38,393 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:43:38,394 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-20 13:43:38,482 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7d4a6d39/6f660c8b41fa4e2e9b0fcd9d21aae8b5/FLAG31784a977 [2019-09-20 13:43:39,358 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:43:39,359 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-20 13:43:39,393 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7d4a6d39/6f660c8b41fa4e2e9b0fcd9d21aae8b5/FLAG31784a977 [2019-09-20 13:43:39,864 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7d4a6d39/6f660c8b41fa4e2e9b0fcd9d21aae8b5 [2019-09-20 13:43:39,873 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:43:39,874 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:43:39,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:43:39,876 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:43:39,880 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:43:39,881 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:43:39" (1/1) ... [2019-09-20 13:43:39,884 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2920341b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:43:39, skipping insertion in model container [2019-09-20 13:43:39,884 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:43:39" (1/1) ... [2019-09-20 13:43:39,891 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:43:40,008 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:43:41,927 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:43:41,987 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:43:42,257 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:43:42,508 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:43:42,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:43:42 WrapperNode [2019-09-20 13:43:42,508 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:43:42,509 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:43:42,510 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:43:42,510 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:43:42,525 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:43:42" (1/1) ... [2019-09-20 13:43:42,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:43:42" (1/1) ... [2019-09-20 13:43:42,605 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:43:42" (1/1) ... [2019-09-20 13:43:42,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:43:42" (1/1) ... [2019-09-20 13:43:42,700 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:43:42" (1/1) ... [2019-09-20 13:43:42,714 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:43:42" (1/1) ... [2019-09-20 13:43:42,731 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:43:42" (1/1) ... [2019-09-20 13:43:42,762 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:43:42,763 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:43:42,763 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:43:42,763 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:43:42,765 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:43:42" (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-20 13:43:42,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:43:42,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:43:42,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-09-20 13:43:42,876 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_in [2019-09-20 13:43:42,876 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_out [2019-09-20 13:43:42,876 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_bulk [2019-09-20 13:43:42,877 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_is_bulk_in [2019-09-20 13:43:42,878 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_is_bulk_out [2019-09-20 13:43:42,878 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2019-09-20 13:43:42,878 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2019-09-20 13:43:42,879 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2019-09-20 13:43:42,881 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2019-09-20 13:43:42,881 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2019-09-20 13:43:42,883 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_delayed_work [2019-09-20 13:43:42,883 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_delayed_work [2019-09-20 13:43:42,885 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2019-09-20 13:43:42,885 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2019-09-20 13:43:42,885 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2019-09-20 13:43:42,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-09-20 13:43:42,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-09-20 13:43:42,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2019-09-20 13:43:42,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ptr [2019-09-20 13:43:42,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2019-09-20 13:43:42,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-09-20 13:43:42,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2019-09-20 13:43:42,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-09-20 13:43:42,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_trap [2019-09-20 13:43:42,888 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_alloc_skb [2019-09-20 13:43:42,888 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_alloc_skb [2019-09-20 13:43:42,889 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2019-09-20 13:43:42,889 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2019-09-20 13:43:42,889 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2019-09-20 13:43:42,889 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_start_queue [2019-09-20 13:43:42,889 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_wake_queue [2019-09-20 13:43:42,889 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2019-09-20 13:43:42,889 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_stop_queue [2019-09-20 13:43:42,890 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2019-09-20 13:43:42,890 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_ok [2019-09-20 13:43:42,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_alloc_urbs [2019-09-20 13:43:42,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_free_urbs [2019-09-20 13:43:42,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_kill_urbs [2019-09-20 13:43:42,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_rcvbulk_callback [2019-09-20 13:43:42,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_sndbulk_callback [2019-09-20 13:43:42,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_carrier_set [2019-09-20 13:43:42,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_carrier_check_work [2019-09-20 13:43:42,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_get_macaddr [2019-09-20 13:43:42,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_rx_submit [2019-09-20 13:43:42,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_open [2019-09-20 13:43:42,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_close [2019-09-20 13:43:42,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_tx [2019-09-20 13:43:42,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_tx_timeout [2019-09-20 13:43:42,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_ethtool_op_get_link [2019-09-20 13:43:42,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_probe [2019-09-20 13:43:42,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_disconnect [2019-09-20 13:43:42,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_driver_init [2019-09-20 13:43:42,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_driver_exit [2019-09-20 13:43:42,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_driver_1 [2019-09-20 13:43:42,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_net_device_ops_2 [2019-09-20 13:43:42,893 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:43:42,893 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2019-09-20 13:43:42,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_alloc_urb_2 [2019-09-20 13:43:42,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_alloc_urb_3 [2019-09-20 13:43:42,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_free_urb_4 [2019-09-20 13:43:42,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_free_urb_5 [2019-09-20 13:43:42,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_free_urb_6 [2019-09-20 13:43:42,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_free_urb_7 [2019-09-20 13:43:42,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_bulk_urb_8 [2019-09-20 13:43:42,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_9 [2019-09-20 13:43:42,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_11 [2019-09-20 13:43:42,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_12 [2019-09-20 13:43:42,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_register_netdev_13 [2019-09-20 13:43:42,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_netdev_14 [2019-09-20 13:43:42,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata_15 [2019-09-20 13:43:42,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_unregister_netdev_16 [2019-09-20 13:43:42,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_netdev_17 [2019-09-20 13:43:42,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_register_driver_19 [2019-09-20 13:43:42,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_deregister_20 [2019-09-20 13:43:42,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2019-09-20 13:43:42,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata [2019-09-20 13:43:42,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata [2019-09-20 13:43:42,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_put_intf [2019-09-20 13:43:42,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2019-09-20 13:43:42,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2019-09-20 13:43:42,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_fill_int_urb [2019-09-20 13:43:42,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_fill_bulk_urb [2019-09-20 13:43:42,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2019-09-20 13:43:42,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_interface_to_usbdev [2019-09-20 13:43:42,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_get_dev [2019-09-20 13:43:42,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_put_dev [2019-09-20 13:43:42,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_get_interface [2019-09-20 13:43:42,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_put_interface [2019-09-20 13:43:42,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_serial_register [2019-09-20 13:43:42,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_serial_deregister [2019-09-20 13:43:42,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-09-20 13:43:42,902 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_work [2019-09-20 13:43:42,902 INFO L138 BoogieDeclarations]: Found implementation of procedure __netdev_alloc_skb [2019-09-20 13:43:42,902 INFO L138 BoogieDeclarations]: Found implementation of procedure __netif_schedule [2019-09-20 13:43:42,903 INFO L138 BoogieDeclarations]: Found implementation of procedure _dev_info [2019-09-20 13:43:42,903 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_etherdev_mqs [2019-09-20 13:43:42,903 INFO L138 BoogieDeclarations]: Found implementation of procedure cancel_delayed_work_sync [2019-09-20 13:43:42,903 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2019-09-20 13:43:42,903 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_irq [2019-09-20 13:43:42,903 INFO L138 BoogieDeclarations]: Found implementation of procedure eth_type_trans [2019-09-20 13:43:42,904 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2019-09-20 13:43:42,904 INFO L138 BoogieDeclarations]: Found implementation of procedure init_timer_key [2019-09-20 13:43:42,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-09-20 13:43:42,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_ndo_init_2 [2019-09-20 13:43:42,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_ndo_uninit_2 [2019-09-20 13:43:42,904 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_init_map [2019-09-20 13:43:42,904 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_off [2019-09-20 13:43:42,905 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_on [2019-09-20 13:43:42,905 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_rx [2019-09-20 13:43:42,905 INFO L138 BoogieDeclarations]: Found implementation of procedure netpoll_trap [2019-09-20 13:43:42,905 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-09-20 13:43:42,905 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_delayed_work_on [2019-09-20 13:43:42,906 INFO L138 BoogieDeclarations]: Found implementation of procedure register_netdev [2019-09-20 13:43:42,906 INFO L138 BoogieDeclarations]: Found implementation of procedure round_jiffies_relative [2019-09-20 13:43:42,906 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2019-09-20 13:43:42,907 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2019-09-20 13:43:42,907 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2019-09-20 13:43:42,907 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_altnum_to_altsetting [2019-09-20 13:43:42,907 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_control_msg [2019-09-20 13:43:42,908 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_deregister [2019-09-20 13:43:42,908 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2019-09-20 13:43:42,908 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2019-09-20 13:43:42,909 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register_driver [2019-09-20 13:43:42,909 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_interface [2019-09-20 13:43:42,909 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unlink_urb [2019-09-20 13:43:42,909 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_fmt [2019-09-20 13:43:42,909 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2019-09-20 13:43:42,910 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-09-20 13:43:42,910 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-09-20 13:43:42,910 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-09-20 13:43:42,910 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-20 13:43:42,910 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-20 13:43:42,911 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2019-09-20 13:43:42,911 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:43:42,911 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-09-20 13:43:42,912 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-20 13:43:42,915 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-09-20 13:43:42,916 INFO L130 BoogieDeclarations]: Found specification of procedure strcpy [2019-09-20 13:43:42,916 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_in [2019-09-20 13:43:42,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:43:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_out [2019-09-20 13:43:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_bulk [2019-09-20 13:43:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_is_bulk_in [2019-09-20 13:43:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_is_bulk_out [2019-09-20 13:43:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2019-09-20 13:43:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2019-09-20 13:43:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2019-09-20 13:43:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2019-09-20 13:43:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-09-20 13:43:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_fmt [2019-09-20 13:43:42,925 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2019-09-20 13:43:42,925 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2019-09-20 13:43:42,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:43:42,925 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_init_map [2019-09-20 13:43:42,925 INFO L130 BoogieDeclarations]: Found specification of procedure init_timer_key [2019-09-20 13:43:42,925 INFO L130 BoogieDeclarations]: Found specification of procedure round_jiffies_relative [2019-09-20 13:43:42,925 INFO L130 BoogieDeclarations]: Found specification of procedure delayed_work_timer_fn [2019-09-20 13:43:42,926 INFO L130 BoogieDeclarations]: Found specification of procedure __init_work [2019-09-20 13:43:42,926 INFO L130 BoogieDeclarations]: Found specification of procedure queue_delayed_work_on [2019-09-20 13:43:42,926 INFO L130 BoogieDeclarations]: Found specification of procedure cancel_delayed_work_sync [2019-09-20 13:43:42,926 INFO L130 BoogieDeclarations]: Found specification of procedure queue_delayed_work [2019-09-20 13:43:42,926 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_delayed_work [2019-09-20 13:43:42,926 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2019-09-20 13:43:42,926 INFO L130 BoogieDeclarations]: Found specification of procedure _dev_info [2019-09-20 13:43:42,926 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata_15 [2019-09-20 13:43:42,927 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_12 [2019-09-20 13:43:42,927 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2019-09-20 13:43:42,927 INFO L130 BoogieDeclarations]: Found specification of procedure usb_altnum_to_altsetting [2019-09-20 13:43:42,927 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register_driver [2019-09-20 13:43:42,927 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_register_driver_19 [2019-09-20 13:43:42,927 INFO L130 BoogieDeclarations]: Found specification of procedure usb_deregister [2019-09-20 13:43:42,927 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_deregister_20 [2019-09-20 13:43:42,928 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_bulk_urb_8 [2019-09-20 13:43:42,928 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_alloc_urb_2 [2019-09-20 13:43:42,928 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_alloc_urb_3 [2019-09-20 13:43:42,928 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_free_urb_4 [2019-09-20 13:43:42,928 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_free_urb_5 [2019-09-20 13:43:42,928 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_free_urb_6 [2019-09-20 13:43:42,928 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_free_urb_7 [2019-09-20 13:43:42,928 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_9 [2019-09-20 13:43:42,929 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_11 [2019-09-20 13:43:42,929 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unlink_urb [2019-09-20 13:43:42,929 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2019-09-20 13:43:42,929 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2019-09-20 13:43:42,929 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2019-09-20 13:43:42,929 INFO L130 BoogieDeclarations]: Found specification of procedure usb_control_msg [2019-09-20 13:43:42,929 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_interface [2019-09-20 13:43:42,929 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2019-09-20 13:43:42,930 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2019-09-20 13:43:42,930 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2019-09-20 13:43:42,930 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_fill_bulk_urb [2019-09-20 13:43:42,930 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2019-09-20 13:43:42,930 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_interface_to_usbdev [2019-09-20 13:43:42,930 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata [2019-09-20 13:43:42,930 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata [2019-09-20 13:43:42,931 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-09-20 13:43:42,931 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-09-20 13:43:42,931 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2019-09-20 13:43:42,931 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2019-09-20 13:43:42,931 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:43:42,931 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-20 13:43:42,931 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:43:42,931 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-09-20 13:43:42,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-20 13:43:42,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-20 13:43:42,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:43:42,932 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-09-20 13:43:42,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-20 13:43:42,932 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2019-09-20 13:43:42,932 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ptr [2019-09-20 13:43:42,932 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2019-09-20 13:43:42,933 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-09-20 13:43:42,933 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2019-09-20 13:43:42,933 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_trap [2019-09-20 13:43:42,933 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_driver_1 [2019-09-20 13:43:42,933 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_net_device_ops_2 [2019-09-20 13:43:42,933 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2019-09-20 13:43:42,933 INFO L130 BoogieDeclarations]: Found specification of procedure __netdev_alloc_skb [2019-09-20 13:43:42,933 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_alloc_skb [2019-09-20 13:43:42,934 INFO L130 BoogieDeclarations]: Found specification of procedure dev_alloc_skb [2019-09-20 13:43:42,934 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2019-09-20 13:43:42,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:43:42,934 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2019-09-20 13:43:42,934 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2019-09-20 13:43:42,934 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_netdev_14 [2019-09-20 13:43:42,934 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_netdev_17 [2019-09-20 13:43:42,935 INFO L130 BoogieDeclarations]: Found specification of procedure netpoll_trap [2019-09-20 13:43:42,935 INFO L130 BoogieDeclarations]: Found specification of procedure __netif_schedule [2019-09-20 13:43:42,935 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2019-09-20 13:43:42,935 INFO L130 BoogieDeclarations]: Found specification of procedure netif_start_queue [2019-09-20 13:43:42,935 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_wake_queue [2019-09-20 13:43:42,935 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2019-09-20 13:43:42,935 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_stop_queue [2019-09-20 13:43:42,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-20 13:43:42,936 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2019-09-20 13:43:42,936 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_irq [2019-09-20 13:43:42,936 INFO L130 BoogieDeclarations]: Found specification of procedure netif_rx [2019-09-20 13:43:42,936 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_ok [2019-09-20 13:43:42,936 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_on [2019-09-20 13:43:42,936 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_off [2019-09-20 13:43:42,936 INFO L130 BoogieDeclarations]: Found specification of procedure register_netdev [2019-09-20 13:43:42,937 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_register_netdev_13 [2019-09-20 13:43:42,937 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2019-09-20 13:43:42,937 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_unregister_netdev_16 [2019-09-20 13:43:42,937 INFO L130 BoogieDeclarations]: Found specification of procedure eth_type_trans [2019-09-20 13:43:42,937 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_etherdev_mqs [2019-09-20 13:43:42,937 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_rx_submit [2019-09-20 13:43:42,938 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_alloc_urbs [2019-09-20 13:43:42,938 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_free_urbs [2019-09-20 13:43:42,938 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_kill_urbs [2019-09-20 13:43:42,938 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_rcvbulk_callback [2019-09-20 13:43:42,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-20 13:43:42,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:43:42,938 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_sndbulk_callback [2019-09-20 13:43:42,938 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_carrier_set [2019-09-20 13:43:42,939 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_carrier_check_work [2019-09-20 13:43:42,939 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_get_macaddr [2019-09-20 13:43:42,939 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_open [2019-09-20 13:43:42,939 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_close [2019-09-20 13:43:42,939 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_tx [2019-09-20 13:43:42,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-09-20 13:43:42,939 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_tx_timeout [2019-09-20 13:43:42,940 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_ethtool_op_get_link [2019-09-20 13:43:42,944 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_probe [2019-09-20 13:43:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2019-09-20 13:43:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:43:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_disconnect [2019-09-20 13:43:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_driver_init [2019-09-20 13:43:42,948 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_driver_exit [2019-09-20 13:43:42,948 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_ndo_init_2 [2019-09-20 13:43:42,948 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_ndo_uninit_2 [2019-09-20 13:43:42,948 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-09-20 13:43:42,948 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-09-20 13:43:42,948 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:43:42,949 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2019-09-20 13:43:42,949 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_put_intf [2019-09-20 13:43:42,949 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_fill_int_urb [2019-09-20 13:43:42,949 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-09-20 13:43:42,949 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_get_dev [2019-09-20 13:43:42,949 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_put_dev [2019-09-20 13:43:42,949 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_get_interface [2019-09-20 13:43:42,949 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_put_interface [2019-09-20 13:43:42,949 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_serial_register [2019-09-20 13:43:42,950 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_serial_deregister [2019-09-20 13:43:42,950 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-09-20 13:43:42,950 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-20 13:43:42,950 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2019-09-20 13:43:42,950 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-20 13:43:42,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:43:42,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-20 13:43:42,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-20 13:43:42,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:43:42,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-20 13:43:42,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-20 13:43:42,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-20 13:43:42,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-20 13:43:43,836 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2019-09-20 13:43:45,016 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2019-09-20 13:43:45,631 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:43:45,632 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:43:45,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:43:45 BoogieIcfgContainer [2019-09-20 13:43:45,634 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:43:45,635 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:43:45,635 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:43:45,638 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:43:45,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:43:39" (1/3) ... [2019-09-20 13:43:45,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20181391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:43:45, skipping insertion in model container [2019-09-20 13:43:45,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:43:42" (2/3) ... [2019-09-20 13:43:45,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20181391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:43:45, skipping insertion in model container [2019-09-20 13:43:45,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:43:45" (3/3) ... [2019-09-20 13:43:45,641 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-20 13:43:45,651 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:43:45,662 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:43:45,680 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:43:45,709 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:43:45,709 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:43:45,709 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:43:45,709 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:43:45,709 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:43:45,710 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:43:45,710 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:43:45,710 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:43:45,748 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states. [2019-09-20 13:43:45,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-20 13:43:45,777 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:43:45,778 INFO L407 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-20 13:43:45,781 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:43:45,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:43:45,786 INFO L82 PathProgramCache]: Analyzing trace with hash -983968687, now seen corresponding path program 1 times [2019-09-20 13:43:45,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:43:45,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:45,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:43:45,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:45,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:43:46,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:43:46,366 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-20 13:43:46,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:43:46,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:43:46,369 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:43:46,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:43:46,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:43:46,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:43:46,393 INFO L87 Difference]: Start difference. First operand 859 states. Second operand 3 states. [2019-09-20 13:43:46,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:43:46,721 INFO L93 Difference]: Finished difference Result 1588 states and 1911 transitions. [2019-09-20 13:43:46,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:43:46,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-09-20 13:43:46,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:43:46,766 INFO L225 Difference]: With dead ends: 1588 [2019-09-20 13:43:46,766 INFO L226 Difference]: Without dead ends: 1563 [2019-09-20 13:43:46,770 INFO L636 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-20 13:43:46,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2019-09-20 13:43:46,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1563. [2019-09-20 13:43:46,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2019-09-20 13:43:46,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 1872 transitions. [2019-09-20 13:43:46,960 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 1872 transitions. Word has length 51 [2019-09-20 13:43:46,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:43:46,961 INFO L475 AbstractCegarLoop]: Abstraction has 1563 states and 1872 transitions. [2019-09-20 13:43:46,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:43:46,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 1872 transitions. [2019-09-20 13:43:46,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-20 13:43:46,975 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:43:46,975 INFO L407 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-20 13:43:46,976 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:43:46,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:43:46,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1692160595, now seen corresponding path program 1 times [2019-09-20 13:43:46,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:43:47,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:47,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:43:47,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:47,004 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:43:47,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:43:47,277 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-20 13:43:47,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:43:47,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:43:47,278 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:43:47,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:43:47,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:43:47,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:43:47,287 INFO L87 Difference]: Start difference. First operand 1563 states and 1872 transitions. Second operand 3 states. [2019-09-20 13:43:47,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:43:47,388 INFO L93 Difference]: Finished difference Result 1576 states and 1887 transitions. [2019-09-20 13:43:47,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:43:47,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-20 13:43:47,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:43:47,400 INFO L225 Difference]: With dead ends: 1576 [2019-09-20 13:43:47,400 INFO L226 Difference]: Without dead ends: 1576 [2019-09-20 13:43:47,401 INFO L636 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-20 13:43:47,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2019-09-20 13:43:47,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1563. [2019-09-20 13:43:47,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2019-09-20 13:43:47,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 1871 transitions. [2019-09-20 13:43:47,483 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 1871 transitions. Word has length 67 [2019-09-20 13:43:47,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:43:47,485 INFO L475 AbstractCegarLoop]: Abstraction has 1563 states and 1871 transitions. [2019-09-20 13:43:47,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:43:47,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 1871 transitions. [2019-09-20 13:43:47,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-20 13:43:47,489 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:43:47,489 INFO L407 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-20 13:43:47,490 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:43:47,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:43:47,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1749418897, now seen corresponding path program 1 times [2019-09-20 13:43:47,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:43:47,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:47,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:43:47,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:47,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:43:47,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:43:47,805 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-20 13:43:47,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:43:47,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:43:47,806 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:43:47,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:43:47,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:43:47,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:43:47,807 INFO L87 Difference]: Start difference. First operand 1563 states and 1871 transitions. Second operand 3 states. [2019-09-20 13:43:47,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:43:47,930 INFO L93 Difference]: Finished difference Result 3109 states and 3781 transitions. [2019-09-20 13:43:47,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:43:47,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-20 13:43:47,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:43:47,959 INFO L225 Difference]: With dead ends: 3109 [2019-09-20 13:43:47,959 INFO L226 Difference]: Without dead ends: 3109 [2019-09-20 13:43:47,960 INFO L636 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-20 13:43:47,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3109 states. [2019-09-20 13:43:48,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3109 to 3099. [2019-09-20 13:43:48,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3099 states. [2019-09-20 13:43:48,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3099 states to 3099 states and 3769 transitions. [2019-09-20 13:43:48,097 INFO L78 Accepts]: Start accepts. Automaton has 3099 states and 3769 transitions. Word has length 67 [2019-09-20 13:43:48,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:43:48,097 INFO L475 AbstractCegarLoop]: Abstraction has 3099 states and 3769 transitions. [2019-09-20 13:43:48,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:43:48,097 INFO L276 IsEmpty]: Start isEmpty. Operand 3099 states and 3769 transitions. [2019-09-20 13:43:48,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-20 13:43:48,100 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:43:48,100 INFO L407 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-20 13:43:48,100 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:43:48,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:43:48,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1603016112, now seen corresponding path program 1 times [2019-09-20 13:43:48,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:43:48,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:48,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:43:48,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:48,112 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:43:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:43:48,428 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-20 13:43:48,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:43:48,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:43:48,429 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:43:48,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:43:48,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:43:48,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:43:48,431 INFO L87 Difference]: Start difference. First operand 3099 states and 3769 transitions. Second operand 3 states. [2019-09-20 13:43:48,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:43:48,477 INFO L93 Difference]: Finished difference Result 3098 states and 3767 transitions. [2019-09-20 13:43:48,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:43:48,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-20 13:43:48,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:43:48,501 INFO L225 Difference]: With dead ends: 3098 [2019-09-20 13:43:48,501 INFO L226 Difference]: Without dead ends: 3098 [2019-09-20 13:43:48,501 INFO L636 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-20 13:43:48,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3098 states. [2019-09-20 13:43:48,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3098 to 3098. [2019-09-20 13:43:48,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3098 states. [2019-09-20 13:43:48,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 3767 transitions. [2019-09-20 13:43:48,613 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 3767 transitions. Word has length 68 [2019-09-20 13:43:48,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:43:48,613 INFO L475 AbstractCegarLoop]: Abstraction has 3098 states and 3767 transitions. [2019-09-20 13:43:48,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:43:48,613 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 3767 transitions. [2019-09-20 13:43:48,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-20 13:43:48,616 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:43:48,616 INFO L407 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-20 13:43:48,616 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:43:48,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:43:48,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1845685876, now seen corresponding path program 1 times [2019-09-20 13:43:48,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:43:48,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:48,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:43:48,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:48,626 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:43:48,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:43:48,775 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-20 13:43:48,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:43:48,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:43:48,776 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:43:48,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:43:48,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:43:48,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:43:48,777 INFO L87 Difference]: Start difference. First operand 3098 states and 3767 transitions. Second operand 3 states. [2019-09-20 13:43:48,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:43:48,813 INFO L93 Difference]: Finished difference Result 3097 states and 3765 transitions. [2019-09-20 13:43:48,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:43:48,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-20 13:43:48,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:43:48,832 INFO L225 Difference]: With dead ends: 3097 [2019-09-20 13:43:48,832 INFO L226 Difference]: Without dead ends: 3097 [2019-09-20 13:43:48,833 INFO L636 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-20 13:43:48,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3097 states. [2019-09-20 13:43:48,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3097 to 3097. [2019-09-20 13:43:48,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3097 states. [2019-09-20 13:43:48,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3097 states to 3097 states and 3765 transitions. [2019-09-20 13:43:48,942 INFO L78 Accepts]: Start accepts. Automaton has 3097 states and 3765 transitions. Word has length 69 [2019-09-20 13:43:48,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:43:48,943 INFO L475 AbstractCegarLoop]: Abstraction has 3097 states and 3765 transitions. [2019-09-20 13:43:48,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:43:48,943 INFO L276 IsEmpty]: Start isEmpty. Operand 3097 states and 3765 transitions. [2019-09-20 13:43:48,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-20 13:43:48,946 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:43:48,946 INFO L407 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-20 13:43:48,946 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:43:48,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:43:48,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1381269971, now seen corresponding path program 1 times [2019-09-20 13:43:48,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:43:48,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:48,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:43:48,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:48,957 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:43:49,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:43:49,134 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-20 13:43:49,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:43:49,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:43:49,135 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:43:49,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:43:49,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:43:49,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:43:49,137 INFO L87 Difference]: Start difference. First operand 3097 states and 3765 transitions. Second operand 3 states. [2019-09-20 13:43:49,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:43:49,177 INFO L93 Difference]: Finished difference Result 3096 states and 3763 transitions. [2019-09-20 13:43:49,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:43:49,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-09-20 13:43:49,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:43:49,196 INFO L225 Difference]: With dead ends: 3096 [2019-09-20 13:43:49,196 INFO L226 Difference]: Without dead ends: 3096 [2019-09-20 13:43:49,196 INFO L636 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-20 13:43:49,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3096 states. [2019-09-20 13:43:49,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3096 to 3096. [2019-09-20 13:43:49,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3096 states. [2019-09-20 13:43:49,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3096 states to 3096 states and 3763 transitions. [2019-09-20 13:43:49,289 INFO L78 Accepts]: Start accepts. Automaton has 3096 states and 3763 transitions. Word has length 70 [2019-09-20 13:43:49,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:43:49,289 INFO L475 AbstractCegarLoop]: Abstraction has 3096 states and 3763 transitions. [2019-09-20 13:43:49,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:43:49,289 INFO L276 IsEmpty]: Start isEmpty. Operand 3096 states and 3763 transitions. [2019-09-20 13:43:49,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-20 13:43:49,291 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:43:49,292 INFO L407 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-20 13:43:49,292 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:43:49,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:43:49,292 INFO L82 PathProgramCache]: Analyzing trace with hash -130716329, now seen corresponding path program 1 times [2019-09-20 13:43:49,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:43:49,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:49,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:43:49,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:49,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:43:49,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:43:49,514 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-20 13:43:49,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:43:49,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:43:49,515 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:43:49,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:43:49,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:43:49,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:43:49,516 INFO L87 Difference]: Start difference. First operand 3096 states and 3763 transitions. Second operand 3 states. [2019-09-20 13:43:49,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:43:49,545 INFO L93 Difference]: Finished difference Result 3095 states and 3761 transitions. [2019-09-20 13:43:49,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:43:49,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-09-20 13:43:49,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:43:49,562 INFO L225 Difference]: With dead ends: 3095 [2019-09-20 13:43:49,562 INFO L226 Difference]: Without dead ends: 3076 [2019-09-20 13:43:49,562 INFO L636 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-20 13:43:49,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3076 states. [2019-09-20 13:43:49,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3076 to 3076. [2019-09-20 13:43:49,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3076 states. [2019-09-20 13:43:49,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3076 states to 3076 states and 3740 transitions. [2019-09-20 13:43:49,645 INFO L78 Accepts]: Start accepts. Automaton has 3076 states and 3740 transitions. Word has length 71 [2019-09-20 13:43:49,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:43:49,645 INFO L475 AbstractCegarLoop]: Abstraction has 3076 states and 3740 transitions. [2019-09-20 13:43:49,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:43:49,646 INFO L276 IsEmpty]: Start isEmpty. Operand 3076 states and 3740 transitions. [2019-09-20 13:43:49,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-09-20 13:43:49,655 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:43:49,655 INFO L407 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-20 13:43:49,655 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:43:49,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:43:49,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1221910458, now seen corresponding path program 1 times [2019-09-20 13:43:49,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:43:49,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:49,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:43:49,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:49,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:43:49,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:43:49,833 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-20 13:43:49,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:43:49,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:43:49,834 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:43:49,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:43:49,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:43:49,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:43:49,835 INFO L87 Difference]: Start difference. First operand 3076 states and 3740 transitions. Second operand 3 states. [2019-09-20 13:43:49,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:43:49,954 INFO L93 Difference]: Finished difference Result 5109 states and 6188 transitions. [2019-09-20 13:43:49,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:43:49,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 234 [2019-09-20 13:43:49,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:43:49,987 INFO L225 Difference]: With dead ends: 5109 [2019-09-20 13:43:49,988 INFO L226 Difference]: Without dead ends: 5109 [2019-09-20 13:43:49,988 INFO L636 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-20 13:43:49,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5109 states. [2019-09-20 13:43:50,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5109 to 5076. [2019-09-20 13:43:50,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5076 states. [2019-09-20 13:43:50,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5076 states to 5076 states and 6150 transitions. [2019-09-20 13:43:50,174 INFO L78 Accepts]: Start accepts. Automaton has 5076 states and 6150 transitions. Word has length 234 [2019-09-20 13:43:50,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:43:50,174 INFO L475 AbstractCegarLoop]: Abstraction has 5076 states and 6150 transitions. [2019-09-20 13:43:50,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:43:50,174 INFO L276 IsEmpty]: Start isEmpty. Operand 5076 states and 6150 transitions. [2019-09-20 13:43:50,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-20 13:43:50,194 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:43:50,194 INFO L407 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-20 13:43:50,194 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:43:50,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:43:50,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1252478566, now seen corresponding path program 1 times [2019-09-20 13:43:50,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:43:50,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:50,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:43:50,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:50,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:43:50,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:43:50,507 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-20 13:43:50,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:43:50,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:43:50,508 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:43:50,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:43:50,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:43:50,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:43:50,510 INFO L87 Difference]: Start difference. First operand 5076 states and 6150 transitions. Second operand 3 states. [2019-09-20 13:43:50,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:43:50,563 INFO L93 Difference]: Finished difference Result 5080 states and 6154 transitions. [2019-09-20 13:43:50,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:43:50,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2019-09-20 13:43:50,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:43:50,597 INFO L225 Difference]: With dead ends: 5080 [2019-09-20 13:43:50,598 INFO L226 Difference]: Without dead ends: 5080 [2019-09-20 13:43:50,598 INFO L636 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-20 13:43:50,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5080 states. [2019-09-20 13:43:50,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5080 to 5080. [2019-09-20 13:43:50,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5080 states. [2019-09-20 13:43:50,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5080 states to 5080 states and 6154 transitions. [2019-09-20 13:43:50,775 INFO L78 Accepts]: Start accepts. Automaton has 5080 states and 6154 transitions. Word has length 253 [2019-09-20 13:43:50,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:43:50,775 INFO L475 AbstractCegarLoop]: Abstraction has 5080 states and 6154 transitions. [2019-09-20 13:43:50,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:43:50,776 INFO L276 IsEmpty]: Start isEmpty. Operand 5080 states and 6154 transitions. [2019-09-20 13:43:50,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-20 13:43:50,792 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:43:50,793 INFO L407 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-20 13:43:50,793 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:43:50,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:43:50,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1927638692, now seen corresponding path program 1 times [2019-09-20 13:43:50,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:43:50,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:50,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:43:50,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:50,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:43:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:43:51,056 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-20 13:43:51,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:43:51,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:43:51,057 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:43:51,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:43:51,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:43:51,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:43:51,058 INFO L87 Difference]: Start difference. First operand 5080 states and 6154 transitions. Second operand 6 states. [2019-09-20 13:43:51,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:43:51,208 INFO L93 Difference]: Finished difference Result 5108 states and 6186 transitions. [2019-09-20 13:43:51,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:43:51,209 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 253 [2019-09-20 13:43:51,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:43:51,255 INFO L225 Difference]: With dead ends: 5108 [2019-09-20 13:43:51,255 INFO L226 Difference]: Without dead ends: 5108 [2019-09-20 13:43:51,256 INFO L636 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-20 13:43:51,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5108 states. [2019-09-20 13:43:51,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5108 to 5100. [2019-09-20 13:43:51,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5100 states. [2019-09-20 13:43:51,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5100 states to 5100 states and 6174 transitions. [2019-09-20 13:43:51,410 INFO L78 Accepts]: Start accepts. Automaton has 5100 states and 6174 transitions. Word has length 253 [2019-09-20 13:43:51,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:43:51,411 INFO L475 AbstractCegarLoop]: Abstraction has 5100 states and 6174 transitions. [2019-09-20 13:43:51,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:43:51,412 INFO L276 IsEmpty]: Start isEmpty. Operand 5100 states and 6174 transitions. [2019-09-20 13:43:51,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-09-20 13:43:51,426 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:43:51,426 INFO L407 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-20 13:43:51,427 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:43:51,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:43:51,427 INFO L82 PathProgramCache]: Analyzing trace with hash 757500745, now seen corresponding path program 1 times [2019-09-20 13:43:51,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:43:51,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:51,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:43:51,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:51,437 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:43:51,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:43:51,825 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-20 13:43:51,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:43:51,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-20 13:43:51,826 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:43:51,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 13:43:51,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 13:43:51,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:43:51,828 INFO L87 Difference]: Start difference. First operand 5100 states and 6174 transitions. Second operand 8 states. [2019-09-20 13:43:52,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:43:52,231 INFO L93 Difference]: Finished difference Result 10286 states and 12454 transitions. [2019-09-20 13:43:52,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-20 13:43:52,232 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 263 [2019-09-20 13:43:52,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:43:52,274 INFO L225 Difference]: With dead ends: 10286 [2019-09-20 13:43:52,274 INFO L226 Difference]: Without dead ends: 10286 [2019-09-20 13:43:52,275 INFO L636 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-20 13:43:52,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10286 states. [2019-09-20 13:43:52,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10286 to 5160. [2019-09-20 13:43:52,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5160 states. [2019-09-20 13:43:52,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5160 states to 5160 states and 6248 transitions. [2019-09-20 13:43:52,480 INFO L78 Accepts]: Start accepts. Automaton has 5160 states and 6248 transitions. Word has length 263 [2019-09-20 13:43:52,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:43:52,481 INFO L475 AbstractCegarLoop]: Abstraction has 5160 states and 6248 transitions. [2019-09-20 13:43:52,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 13:43:52,481 INFO L276 IsEmpty]: Start isEmpty. Operand 5160 states and 6248 transitions. [2019-09-20 13:43:52,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-09-20 13:43:52,497 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:43:52,498 INFO L407 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-20 13:43:52,498 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:43:52,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:43:52,499 INFO L82 PathProgramCache]: Analyzing trace with hash 623487239, now seen corresponding path program 1 times [2019-09-20 13:43:52,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:43:52,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:52,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:43:52,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:52,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:43:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:43:52,910 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-20 13:43:52,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:43:52,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-20 13:43:52,911 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:43:52,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 13:43:52,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 13:43:52,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:43:52,916 INFO L87 Difference]: Start difference. First operand 5160 states and 6248 transitions. Second operand 9 states. [2019-09-20 13:43:53,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:43:53,046 INFO L93 Difference]: Finished difference Result 5200 states and 6288 transitions. [2019-09-20 13:43:53,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:43:53,047 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 263 [2019-09-20 13:43:53,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:43:53,074 INFO L225 Difference]: With dead ends: 5200 [2019-09-20 13:43:53,074 INFO L226 Difference]: Without dead ends: 5200 [2019-09-20 13:43:53,075 INFO L636 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-20 13:43:53,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5200 states. [2019-09-20 13:43:53,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5200 to 5200. [2019-09-20 13:43:53,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5200 states. [2019-09-20 13:43:53,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5200 states to 5200 states and 6288 transitions. [2019-09-20 13:43:53,222 INFO L78 Accepts]: Start accepts. Automaton has 5200 states and 6288 transitions. Word has length 263 [2019-09-20 13:43:53,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:43:53,223 INFO L475 AbstractCegarLoop]: Abstraction has 5200 states and 6288 transitions. [2019-09-20 13:43:53,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 13:43:53,223 INFO L276 IsEmpty]: Start isEmpty. Operand 5200 states and 6288 transitions. [2019-09-20 13:43:53,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-09-20 13:43:53,238 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:43:53,239 INFO L407 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-20 13:43:53,239 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:43:53,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:43:53,240 INFO L82 PathProgramCache]: Analyzing trace with hash 767896934, now seen corresponding path program 1 times [2019-09-20 13:43:53,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:43:53,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:53,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:43:53,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:53,250 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:43:53,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:43:53,740 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-20 13:43:53,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:43:53,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:43:53,740 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:43:53,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:43:53,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:43:53,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:43:53,742 INFO L87 Difference]: Start difference. First operand 5200 states and 6288 transitions. Second operand 5 states. [2019-09-20 13:43:54,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:43:54,105 INFO L93 Difference]: Finished difference Result 5224 states and 6328 transitions. [2019-09-20 13:43:54,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:43:54,108 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 263 [2019-09-20 13:43:54,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:43:54,131 INFO L225 Difference]: With dead ends: 5224 [2019-09-20 13:43:54,131 INFO L226 Difference]: Without dead ends: 5224 [2019-09-20 13:43:54,132 INFO L636 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-20 13:43:54,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5224 states. [2019-09-20 13:43:54,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5224 to 5208. [2019-09-20 13:43:54,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5208 states. [2019-09-20 13:43:54,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5208 states to 5208 states and 6300 transitions. [2019-09-20 13:43:54,312 INFO L78 Accepts]: Start accepts. Automaton has 5208 states and 6300 transitions. Word has length 263 [2019-09-20 13:43:54,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:43:54,313 INFO L475 AbstractCegarLoop]: Abstraction has 5208 states and 6300 transitions. [2019-09-20 13:43:54,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:43:54,313 INFO L276 IsEmpty]: Start isEmpty. Operand 5208 states and 6300 transitions. [2019-09-20 13:43:54,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-09-20 13:43:54,328 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:43:54,329 INFO L407 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-20 13:43:54,329 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:43:54,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:43:54,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1098199221, now seen corresponding path program 1 times [2019-09-20 13:43:54,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:43:54,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:54,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:43:54,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:54,341 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:43:54,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:43:54,807 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-20 13:43:54,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:43:54,808 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:43:54,809 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 265 with the following transitions: [2019-09-20 13:43:54,813 INFO L207 CegarAbsIntRunner]: [7], [11], [14], [20], [67], [70], [71], [80], [81], [150], [151], [156], [158], [159], [205], [209], [211], [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-20 13:43:54,895 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-20 13:43:54,896 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-20 13:43:55,020 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-20 13:43:55,021 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-20 13:43:55,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:43:55,027 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-20 13:43:55,175 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-20 13:43:55,175 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-20 13:43:55,188 INFO L420 sIntCurrentIteration]: We unified 263 AI predicates to 263 [2019-09-20 13:43:55,189 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-20 13:43:55,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 13:43:55,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2019-09-20 13:43:55,190 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:43:55,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-20 13:43:55,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-20 13:43:55,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 13:43:55,191 INFO L87 Difference]: Start difference. First operand 5208 states and 6300 transitions. Second operand 2 states. [2019-09-20 13:43:55,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:43:55,192 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-20 13:43:55,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-20 13:43:55,193 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 264 [2019-09-20 13:43:55,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:43:55,193 INFO L225 Difference]: With dead ends: 2 [2019-09-20 13:43:55,193 INFO L226 Difference]: Without dead ends: 0 [2019-09-20 13:43:55,193 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 263 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-20 13:43:55,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-20 13:43:55,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-20 13:43:55,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-20 13:43:55,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-20 13:43:55,194 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 264 [2019-09-20 13:43:55,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:43:55,195 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-20 13:43:55,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-20 13:43:55,195 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-20 13:43:55,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-20 13:43:55,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:43:55 BoogieIcfgContainer [2019-09-20 13:43:55,202 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 13:43:55,205 INFO L168 Benchmark]: Toolchain (without parser) took 15329.49 ms. Allocated memory was 131.1 MB in the beginning and 589.3 MB in the end (delta: 458.2 MB). Free memory was 77.7 MB in the beginning and 84.5 MB in the end (delta: -6.8 MB). Peak memory consumption was 451.4 MB. Max. memory is 7.1 GB. [2019-09-20 13:43:55,206 INFO L168 Benchmark]: CDTParser took 1.42 ms. Allocated memory is still 131.1 MB. Free memory was 105.1 MB in the beginning and 104.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-09-20 13:43:55,208 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2633.49 ms. Allocated memory was 131.1 MB in the beginning and 278.9 MB in the end (delta: 147.8 MB). Free memory was 77.5 MB in the beginning and 227.1 MB in the end (delta: -149.6 MB). Peak memory consumption was 117.9 MB. Max. memory is 7.1 GB. [2019-09-20 13:43:55,214 INFO L168 Benchmark]: Boogie Preprocessor took 253.24 ms. Allocated memory is still 278.9 MB. Free memory was 227.1 MB in the beginning and 212.0 MB in the end (delta: 15.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 7.1 GB. [2019-09-20 13:43:55,215 INFO L168 Benchmark]: RCFGBuilder took 2870.71 ms. Allocated memory was 278.9 MB in the beginning and 380.6 MB in the end (delta: 101.7 MB). Free memory was 212.0 MB in the beginning and 307.9 MB in the end (delta: -96.0 MB). Peak memory consumption was 160.9 MB. Max. memory is 7.1 GB. [2019-09-20 13:43:55,216 INFO L168 Benchmark]: TraceAbstraction took 9567.52 ms. Allocated memory was 380.6 MB in the beginning and 589.3 MB in the end (delta: 208.7 MB). Free memory was 307.9 MB in the beginning and 84.5 MB in the end (delta: 223.4 MB). Peak memory consumption was 432.1 MB. Max. memory is 7.1 GB. [2019-09-20 13:43:55,229 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.42 ms. Allocated memory is still 131.1 MB. Free memory was 105.1 MB in the beginning and 104.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2633.49 ms. Allocated memory was 131.1 MB in the beginning and 278.9 MB in the end (delta: 147.8 MB). Free memory was 77.5 MB in the beginning and 227.1 MB in the end (delta: -149.6 MB). Peak memory consumption was 117.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 253.24 ms. Allocated memory is still 278.9 MB. Free memory was 227.1 MB in the beginning and 212.0 MB in the end (delta: 15.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2870.71 ms. Allocated memory was 278.9 MB in the beginning and 380.6 MB in the end (delta: 101.7 MB). Free memory was 212.0 MB in the beginning and 307.9 MB in the end (delta: -96.0 MB). Peak memory consumption was 160.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9567.52 ms. Allocated memory was 380.6 MB in the beginning and 589.3 MB in the end (delta: 208.7 MB). Free memory was 307.9 MB in the beginning and 84.5 MB in the end (delta: 223.4 MB). Peak memory consumption was 432.1 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, 9.5s OverallTime, 14 OverallIterations, 4 TraceHistogramMax, 2.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 14096 SDtfs, 8247 SDslu, 27530 SDs, 0 SdLazy, 233 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 332 GetRequests, 290 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5208occurred in iteration=13, 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.444866920152091 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 14 MinimizatonAttempts, 5206 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 2256 NumberOfCodeBlocks, 2256 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2242 ConstructedInterpolants, 0 QuantifiedInterpolants, 559360 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 13 PerfectInterpolantSequences, 422/423 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...