java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-validator-v0.8/linux-stable-47dffc7-1-144_2a-drivers--net--usb--cdc-phonet.ko-entry_point_ldv-val-v0.8.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 17:29:19,273 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 17:29:19,275 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 17:29:19,288 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 17:29:19,288 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 17:29:19,290 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 17:29:19,292 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 17:29:19,295 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 17:29:19,297 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 17:29:19,304 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 17:29:19,305 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 17:29:19,306 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 17:29:19,307 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 17:29:19,308 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 17:29:19,308 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 17:29:19,310 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 17:29:19,311 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 17:29:19,312 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 17:29:19,316 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 17:29:19,319 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 17:29:19,321 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 17:29:19,323 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 17:29:19,324 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 17:29:19,326 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 17:29:19,329 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 17:29:19,329 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 17:29:19,329 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 17:29:19,332 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 17:29:19,332 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 17:29:19,334 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 17:29:19,334 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 17:29:19,335 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 17:29:19,336 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 17:29:19,337 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 17:29:19,339 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 17:29:19,339 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 17:29:19,340 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 17:29:19,341 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 17:29:19,341 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 17:29:19,342 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 17:29:19,343 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 17:29:19,344 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 17:29:19,363 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 17:29:19,363 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 17:29:19,364 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 17:29:19,364 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 17:29:19,364 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 17:29:19,365 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 17:29:19,365 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 17:29:19,366 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 17:29:19,366 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 17:29:19,366 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 17:29:19,367 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 17:29:19,367 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 17:29:19,367 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 17:29:19,367 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 17:29:19,367 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 17:29:19,368 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 17:29:19,368 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 17:29:19,369 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 17:29:19,369 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 17:29:19,370 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 17:29:19,370 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 17:29:19,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 17:29:19,370 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 17:29:19,370 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 17:29:19,371 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 17:29:19,371 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 17:29:19,371 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 17:29:19,371 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 17:29:19,371 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 17:29:19,400 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 17:29:19,412 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 17:29:19,416 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 17:29:19,417 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 17:29:19,417 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 17:29:19,418 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-validator-v0.8/linux-stable-47dffc7-1-144_2a-drivers--net--usb--cdc-phonet.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-09-08 17:29:19,483 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e47392342/51b42f8f019b4d82a475b65edbca892e/FLAG18f3c906f [2019-09-08 17:29:20,252 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 17:29:20,253 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-validator-v0.8/linux-stable-47dffc7-1-144_2a-drivers--net--usb--cdc-phonet.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-09-08 17:29:20,294 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e47392342/51b42f8f019b4d82a475b65edbca892e/FLAG18f3c906f [2019-09-08 17:29:20,365 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e47392342/51b42f8f019b4d82a475b65edbca892e [2019-09-08 17:29:20,374 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 17:29:20,376 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 17:29:20,377 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 17:29:20,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 17:29:20,381 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 17:29:20,382 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:29:20" (1/1) ... [2019-09-08 17:29:20,385 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d85583e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:29:20, skipping insertion in model container [2019-09-08 17:29:20,385 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:29:20" (1/1) ... [2019-09-08 17:29:20,391 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 17:29:20,520 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 17:29:22,018 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 17:29:22,048 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 17:29:22,335 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 17:29:22,629 INFO L192 MainTranslator]: Completed translation [2019-09-08 17:29:22,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:29:22 WrapperNode [2019-09-08 17:29:22,631 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 17:29:22,632 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 17:29:22,632 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 17:29:22,632 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 17:29:22,653 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:29:22" (1/1) ... [2019-09-08 17:29:22,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:29:22" (1/1) ... [2019-09-08 17:29:22,745 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:29:22" (1/1) ... [2019-09-08 17:29:22,746 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:29:22" (1/1) ... [2019-09-08 17:29:22,870 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:29:22" (1/1) ... [2019-09-08 17:29:22,896 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:29:22" (1/1) ... [2019-09-08 17:29:22,918 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:29:22" (1/1) ... [2019-09-08 17:29:22,944 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 17:29:22,944 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 17:29:22,945 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 17:29:22,945 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 17:29:22,946 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:29:22" (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-08 17:29:23,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 17:29:23,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 17:29:23,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-09-08 17:29:23,023 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2019-09-08 17:29:23,024 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2019-09-08 17:29:23,024 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2019-09-08 17:29:23,024 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2019-09-08 17:29:23,025 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2019-09-08 17:29:23,025 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2019-09-08 17:29:23,025 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2019-09-08 17:29:23,025 INFO L138 BoogieDeclarations]: Found implementation of procedure numa_node_id [2019-09-08 17:29:23,025 INFO L138 BoogieDeclarations]: Found implementation of procedure gfp_zonelist [2019-09-08 17:29:23,026 INFO L138 BoogieDeclarations]: Found implementation of procedure node_zonelist [2019-09-08 17:29:23,026 INFO L138 BoogieDeclarations]: Found implementation of procedure __alloc_pages [2019-09-08 17:29:23,027 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_pages_node [2019-09-08 17:29:23,027 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2019-09-08 17:29:23,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-09-08 17:29:23,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-09-08 17:29:23,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2019-09-08 17:29:23,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2019-09-08 17:29:23,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2019-09-08 17:29:23,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ptr [2019-09-08 17:29:23,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2019-09-08 17:29:23,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2019-09-08 17:29:23,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-09-08 17:29:23,031 INFO L138 BoogieDeclarations]: Found implementation of procedure lowmem_page_address [2019-09-08 17:29:23,031 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_end_pointer [2019-09-08 17:29:23,031 INFO L138 BoogieDeclarations]: Found implementation of procedure __skb_pull [2019-09-08 17:29:23,031 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reset_mac_header [2019-09-08 17:29:23,032 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_alloc_skb [2019-09-08 17:29:23,032 INFO L138 BoogieDeclarations]: Found implementation of procedure __skb_alloc_pages [2019-09-08 17:29:23,032 INFO L138 BoogieDeclarations]: Found implementation of procedure __skb_alloc_page [2019-09-08 17:29:23,032 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2019-09-08 17:29:23,032 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2019-09-08 17:29:23,032 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2019-09-08 17:29:23,033 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_wake_queue [2019-09-08 17:29:23,033 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2019-09-08 17:29:23,033 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_stop_queue [2019-09-08 17:29:23,033 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2019-09-08 17:29:23,034 INFO L138 BoogieDeclarations]: Found implementation of procedure usbpn_xmit [2019-09-08 17:29:23,034 INFO L138 BoogieDeclarations]: Found implementation of procedure tx_complete [2019-09-08 17:29:23,034 INFO L138 BoogieDeclarations]: Found implementation of procedure rx_submit [2019-09-08 17:29:23,034 INFO L138 BoogieDeclarations]: Found implementation of procedure rx_complete [2019-09-08 17:29:23,034 INFO L138 BoogieDeclarations]: Found implementation of procedure usbpn_open [2019-09-08 17:29:23,034 INFO L138 BoogieDeclarations]: Found implementation of procedure usbpn_close [2019-09-08 17:29:23,034 INFO L138 BoogieDeclarations]: Found implementation of procedure usbpn_ioctl [2019-09-08 17:29:23,034 INFO L138 BoogieDeclarations]: Found implementation of procedure usbpn_set_mtu [2019-09-08 17:29:23,035 INFO L138 BoogieDeclarations]: Found implementation of procedure usbpn_setup [2019-09-08 17:29:23,035 INFO L138 BoogieDeclarations]: Found implementation of procedure usbpn_probe [2019-09-08 17:29:23,035 INFO L138 BoogieDeclarations]: Found implementation of procedure usbpn_disconnect [2019-09-08 17:29:23,035 INFO L138 BoogieDeclarations]: Found implementation of procedure usbpn_driver_init [2019-09-08 17:29:23,035 INFO L138 BoogieDeclarations]: Found implementation of procedure usbpn_driver_exit [2019-09-08 17:29:23,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_driver_1 [2019-09-08 17:29:23,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_net_device_ops_2 [2019-09-08 17:29:23,036 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 17:29:23,036 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2019-09-08 17:29:23,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_alloc_urb_2 [2019-09-08 17:29:23,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_bulk_urb_3 [2019-09-08 17:29:23,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_4 [2019-09-08 17:29:23,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_free_urb_5 [2019-09-08 17:29:23,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_free_urb_6 [2019-09-08 17:29:23,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_8 [2019-09-08 17:29:23,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_alloc_urb_9 [2019-09-08 17:29:23,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_free_urb_10 [2019-09-08 17:29:23,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_11 [2019-09-08 17:29:23,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_register_netdev_12 [2019-09-08 17:29:23,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_netdev_14 [2019-09-08 17:29:23,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata_15 [2019-09-08 17:29:23,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_unregister_netdev_16 [2019-09-08 17:29:23,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_register_driver_17 [2019-09-08 17:29:23,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_deregister_18 [2019-09-08 17:29:23,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-09-08 17:29:23,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata [2019-09-08 17:29:23,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata [2019-09-08 17:29:23,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_put_intf [2019-09-08 17:29:23,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2019-09-08 17:29:23,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2019-09-08 17:29:23,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_fill_int_urb [2019-09-08 17:29:23,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_fill_bulk_urb [2019-09-08 17:29:23,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2019-09-08 17:29:23,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_interface_to_usbdev [2019-09-08 17:29:23,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_get_dev [2019-09-08 17:29:23,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_put_dev [2019-09-08 17:29:23,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_get_interface [2019-09-08 17:29:23,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_put_interface [2019-09-08 17:29:23,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_serial_register [2019-09-08 17:29:23,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_serial_deregister [2019-09-08 17:29:23,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-09-08 17:29:23,044 INFO L138 BoogieDeclarations]: Found implementation of procedure __alloc_pages_nodemask [2019-09-08 17:29:23,044 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_dev_dbg [2019-09-08 17:29:23,045 INFO L138 BoogieDeclarations]: Found implementation of procedure __netdev_alloc_skb [2019-09-08 17:29:23,045 INFO L138 BoogieDeclarations]: Found implementation of procedure __netif_schedule [2019-09-08 17:29:23,046 INFO L138 BoogieDeclarations]: Found implementation of procedure __phys_addr [2019-09-08 17:29:23,046 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2019-09-08 17:29:23,046 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock [2019-09-08 17:29:23,046 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2019-09-08 17:29:23,046 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_unlock [2019-09-08 17:29:23,046 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_unlock_irqrestore [2019-09-08 17:29:23,046 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_netdev_mqs [2019-09-08 17:29:23,047 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2019-09-08 17:29:23,047 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_any [2019-09-08 17:29:23,047 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2019-09-08 17:29:23,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-09-08 17:29:23,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_ndo_init_2 [2019-09-08 17:29:23,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_ndo_uninit_2 [2019-09-08 17:29:23,047 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_rx [2019-09-08 17:29:23,048 INFO L138 BoogieDeclarations]: Found implementation of procedure netpoll_trap [2019-09-08 17:29:23,048 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-09-08 17:29:23,048 INFO L138 BoogieDeclarations]: Found implementation of procedure put_page [2019-09-08 17:29:23,048 INFO L138 BoogieDeclarations]: Found implementation of procedure register_netdev [2019-09-08 17:29:23,048 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_add_rx_frag [2019-09-08 17:29:23,048 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2019-09-08 17:29:23,048 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2019-09-08 17:29:23,049 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_deregister [2019-09-08 17:29:23,049 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_driver_claim_interface [2019-09-08 17:29:23,049 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_driver_release_interface [2019-09-08 17:29:23,049 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_ifnum_to_if [2019-09-08 17:29:23,050 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2019-09-08 17:29:23,050 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register_driver [2019-09-08 17:29:23,050 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_interface [2019-09-08 17:29:23,051 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2019-09-08 17:29:23,051 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-09-08 17:29:23,051 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-09-08 17:29:23,052 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-09-08 17:29:23,053 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-08 17:29:23,053 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-08 17:29:23,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 17:29:23,053 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-09-08 17:29:23,053 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2019-09-08 17:29:23,054 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2019-09-08 17:29:23,054 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2019-09-08 17:29:23,054 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-09-08 17:29:23,055 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_dev_dbg [2019-09-08 17:29:23,055 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2019-09-08 17:29:23,055 INFO L130 BoogieDeclarations]: Found specification of procedure __phys_addr [2019-09-08 17:29:23,055 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2019-09-08 17:29:23,055 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-08 17:29:23,055 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-09-08 17:29:23,056 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2019-09-08 17:29:23,057 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock [2019-09-08 17:29:23,060 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2019-09-08 17:29:23,061 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_unlock [2019-09-08 17:29:23,061 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_unlock_irqrestore [2019-09-08 17:29:23,061 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2019-09-08 17:29:23,066 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2019-09-08 17:29:23,067 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2019-09-08 17:29:23,067 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2019-09-08 17:29:23,067 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_size_call_parameter [2019-09-08 17:29:23,067 INFO L130 BoogieDeclarations]: Found specification of procedure numa_node_id [2019-09-08 17:29:23,067 INFO L130 BoogieDeclarations]: Found specification of procedure gfp_zonelist [2019-09-08 17:29:23,067 INFO L130 BoogieDeclarations]: Found specification of procedure node_zonelist [2019-09-08 17:29:23,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 17:29:23,068 INFO L130 BoogieDeclarations]: Found specification of procedure __alloc_pages_nodemask [2019-09-08 17:29:23,068 INFO L130 BoogieDeclarations]: Found specification of procedure __alloc_pages [2019-09-08 17:29:23,068 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_pages_node [2019-09-08 17:29:23,068 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata_15 [2019-09-08 17:29:23,068 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_11 [2019-09-08 17:29:23,069 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2019-09-08 17:29:23,069 INFO L130 BoogieDeclarations]: Found specification of procedure usb_driver_claim_interface [2019-09-08 17:29:23,069 INFO L130 BoogieDeclarations]: Found specification of procedure usb_driver_release_interface [2019-09-08 17:29:23,069 INFO L130 BoogieDeclarations]: Found specification of procedure usb_ifnum_to_if [2019-09-08 17:29:23,069 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register_driver [2019-09-08 17:29:23,069 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_register_driver_17 [2019-09-08 17:29:23,070 INFO L130 BoogieDeclarations]: Found specification of procedure usb_deregister [2019-09-08 17:29:23,070 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_deregister_18 [2019-09-08 17:29:23,070 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_bulk_urb_3 [2019-09-08 17:29:23,070 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_alloc_urb_2 [2019-09-08 17:29:23,070 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_alloc_urb_9 [2019-09-08 17:29:23,070 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_free_urb_5 [2019-09-08 17:29:23,070 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_free_urb_6 [2019-09-08 17:29:23,070 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_free_urb_10 [2019-09-08 17:29:23,071 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_4 [2019-09-08 17:29:23,071 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_8 [2019-09-08 17:29:23,071 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2019-09-08 17:29:23,071 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_interface [2019-09-08 17:29:23,071 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2019-09-08 17:29:23,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 17:29:23,071 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2019-09-08 17:29:23,071 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2019-09-08 17:29:23,072 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_fill_bulk_urb [2019-09-08 17:29:23,072 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2019-09-08 17:29:23,072 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_interface_to_usbdev [2019-09-08 17:29:23,072 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata [2019-09-08 17:29:23,072 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata [2019-09-08 17:29:23,072 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 17:29:23,072 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-08 17:29:23,073 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 17:29:23,073 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-09-08 17:29:23,073 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-08 17:29:23,073 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 17:29:23,073 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-09-08 17:29:23,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 17:29:23,073 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-09-08 17:29:23,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-08 17:29:23,074 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2019-09-08 17:29:23,074 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2019-09-08 17:29:23,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-09-08 17:29:23,074 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2019-09-08 17:29:23,074 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ptr [2019-09-08 17:29:23,074 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2019-09-08 17:29:23,074 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2019-09-08 17:29:23,075 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_driver_1 [2019-09-08 17:29:23,075 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_net_device_ops_2 [2019-09-08 17:29:23,075 INFO L130 BoogieDeclarations]: Found specification of procedure put_page [2019-09-08 17:29:23,075 INFO L130 BoogieDeclarations]: Found specification of procedure lowmem_page_address [2019-09-08 17:29:23,075 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2019-09-08 17:29:23,075 INFO L130 BoogieDeclarations]: Found specification of procedure skb_end_pointer [2019-09-08 17:29:23,075 INFO L130 BoogieDeclarations]: Found specification of procedure skb_add_rx_frag [2019-09-08 17:29:23,076 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2019-09-08 17:29:23,076 INFO L130 BoogieDeclarations]: Found specification of procedure __skb_pull [2019-09-08 17:29:23,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 17:29:23,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 17:29:23,076 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reset_mac_header [2019-09-08 17:29:23,076 INFO L130 BoogieDeclarations]: Found specification of procedure __netdev_alloc_skb [2019-09-08 17:29:23,076 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_alloc_skb [2019-09-08 17:29:23,076 INFO L130 BoogieDeclarations]: Found specification of procedure __skb_alloc_pages [2019-09-08 17:29:23,077 INFO L130 BoogieDeclarations]: Found specification of procedure __skb_alloc_page [2019-09-08 17:29:23,077 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2019-09-08 17:29:23,077 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2019-09-08 17:29:23,077 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2019-09-08 17:29:23,077 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_netdev_14 [2019-09-08 17:29:23,077 INFO L130 BoogieDeclarations]: Found specification of procedure netpoll_trap [2019-09-08 17:29:23,077 INFO L130 BoogieDeclarations]: Found specification of procedure __netif_schedule [2019-09-08 17:29:23,078 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2019-09-08 17:29:23,078 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_wake_queue [2019-09-08 17:29:23,078 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2019-09-08 17:29:23,078 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_stop_queue [2019-09-08 17:29:23,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 17:29:23,078 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2019-09-08 17:29:23,078 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_any [2019-09-08 17:29:23,078 INFO L130 BoogieDeclarations]: Found specification of procedure netif_rx [2019-09-08 17:29:23,079 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_netdev_mqs [2019-09-08 17:29:23,079 INFO L130 BoogieDeclarations]: Found specification of procedure register_netdev [2019-09-08 17:29:23,079 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_register_netdev_12 [2019-09-08 17:29:23,079 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2019-09-08 17:29:23,079 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_unregister_netdev_16 [2019-09-08 17:29:23,079 INFO L130 BoogieDeclarations]: Found specification of procedure tx_complete [2019-09-08 17:29:23,079 INFO L130 BoogieDeclarations]: Found specification of procedure rx_complete [2019-09-08 17:29:23,080 INFO L130 BoogieDeclarations]: Found specification of procedure usbpn_xmit [2019-09-08 17:29:23,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 17:29:23,080 INFO L130 BoogieDeclarations]: Found specification of procedure rx_submit [2019-09-08 17:29:23,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-08 17:29:23,080 INFO L130 BoogieDeclarations]: Found specification of procedure usbpn_close [2019-09-08 17:29:23,080 INFO L130 BoogieDeclarations]: Found specification of procedure usbpn_open [2019-09-08 17:29:23,080 INFO L130 BoogieDeclarations]: Found specification of procedure usbpn_ioctl [2019-09-08 17:29:23,080 INFO L130 BoogieDeclarations]: Found specification of procedure usbpn_set_mtu [2019-09-08 17:29:23,081 INFO L130 BoogieDeclarations]: Found specification of procedure usbpn_setup [2019-09-08 17:29:23,081 INFO L130 BoogieDeclarations]: Found specification of procedure usbpn_probe [2019-09-08 17:29:23,081 INFO L130 BoogieDeclarations]: Found specification of procedure usbpn_disconnect [2019-09-08 17:29:23,081 INFO L130 BoogieDeclarations]: Found specification of procedure usbpn_driver_init [2019-09-08 17:29:23,081 INFO L130 BoogieDeclarations]: Found specification of procedure usbpn_driver_exit [2019-09-08 17:29:23,081 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_ndo_init_2 [2019-09-08 17:29:23,081 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_ndo_uninit_2 [2019-09-08 17:29:23,081 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-09-08 17:29:23,082 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-09-08 17:29:23,082 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 17:29:23,082 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-09-08 17:29:23,082 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_put_intf [2019-09-08 17:29:23,082 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_fill_int_urb [2019-09-08 17:29:23,082 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-09-08 17:29:23,082 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_get_dev [2019-09-08 17:29:23,083 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_put_dev [2019-09-08 17:29:23,083 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_get_interface [2019-09-08 17:29:23,083 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_put_interface [2019-09-08 17:29:23,083 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_serial_register [2019-09-08 17:29:23,083 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_serial_deregister [2019-09-08 17:29:23,084 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-09-08 17:29:23,088 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 17:29:23,089 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-09-08 17:29:23,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 17:29:23,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-08 17:29:23,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-08 17:29:23,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 17:29:23,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 17:29:23,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-08 17:29:23,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-08 17:29:23,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-08 17:29:24,131 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2019-09-08 17:29:27,191 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 17:29:27,191 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 17:29:27,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:29:27 BoogieIcfgContainer [2019-09-08 17:29:27,193 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 17:29:27,194 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 17:29:27,195 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 17:29:27,198 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 17:29:27,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 05:29:20" (1/3) ... [2019-09-08 17:29:27,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a8d19cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:29:27, skipping insertion in model container [2019-09-08 17:29:27,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:29:22" (2/3) ... [2019-09-08 17:29:27,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a8d19cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:29:27, skipping insertion in model container [2019-09-08 17:29:27,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:29:27" (3/3) ... [2019-09-08 17:29:27,201 INFO L109 eAbstractionObserver]: Analyzing ICFG linux-stable-47dffc7-1-144_2a-drivers--net--usb--cdc-phonet.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-09-08 17:29:27,211 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 17:29:27,220 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 17:29:27,236 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 17:29:27,271 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 17:29:27,272 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 17:29:27,272 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 17:29:27,272 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 17:29:27,272 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 17:29:27,273 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 17:29:27,273 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 17:29:27,273 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 17:29:27,273 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 17:29:27,308 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states. [2019-09-08 17:29:27,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 17:29:27,320 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 17:29:27,321 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 17:29:27,323 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 17:29:27,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 17:29:27,329 INFO L82 PathProgramCache]: Analyzing trace with hash 616442020, now seen corresponding path program 1 times [2019-09-08 17:29:27,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 17:29:27,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 17:29:27,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:29:27,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 17:29:27,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:29:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 17:29:27,973 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-08 17:29:27,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 17:29:27,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 17:29:27,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 17:29:28,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 17:29:28,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 17:29:28,021 INFO L87 Difference]: Start difference. First operand 867 states. Second operand 3 states. [2019-09-08 17:29:28,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 17:29:28,529 INFO L93 Difference]: Finished difference Result 2401 states and 3034 transitions. [2019-09-08 17:29:28,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 17:29:28,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-09-08 17:29:28,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 17:29:28,572 INFO L225 Difference]: With dead ends: 2401 [2019-09-08 17:29:28,572 INFO L226 Difference]: Without dead ends: 1567 [2019-09-08 17:29:28,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 17:29:28,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2019-09-08 17:29:28,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1567. [2019-09-08 17:29:28,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2019-09-08 17:29:28,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 1964 transitions. [2019-09-08 17:29:28,811 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 1964 transitions. Word has length 84 [2019-09-08 17:29:28,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 17:29:28,812 INFO L475 AbstractCegarLoop]: Abstraction has 1567 states and 1964 transitions. [2019-09-08 17:29:28,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 17:29:28,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 1964 transitions. [2019-09-08 17:29:28,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 17:29:28,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 17:29:28,827 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 17:29:28,828 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 17:29:28,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 17:29:28,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1014439466, now seen corresponding path program 1 times [2019-09-08 17:29:28,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 17:29:28,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 17:29:28,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:29:28,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 17:29:28,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:29:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 17:29:29,018 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-08 17:29:29,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 17:29:29,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 17:29:29,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 17:29:29,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 17:29:29,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 17:29:29,021 INFO L87 Difference]: Start difference. First operand 1567 states and 1964 transitions. Second operand 3 states. [2019-09-08 17:29:29,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 17:29:29,110 INFO L93 Difference]: Finished difference Result 1593 states and 1996 transitions. [2019-09-08 17:29:29,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 17:29:29,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-08 17:29:29,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 17:29:29,119 INFO L225 Difference]: With dead ends: 1593 [2019-09-08 17:29:29,120 INFO L226 Difference]: Without dead ends: 1580 [2019-09-08 17:29:29,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 17:29:29,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2019-09-08 17:29:29,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1567. [2019-09-08 17:29:29,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2019-09-08 17:29:29,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 1963 transitions. [2019-09-08 17:29:29,183 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 1963 transitions. Word has length 104 [2019-09-08 17:29:29,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 17:29:29,183 INFO L475 AbstractCegarLoop]: Abstraction has 1567 states and 1963 transitions. [2019-09-08 17:29:29,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 17:29:29,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 1963 transitions. [2019-09-08 17:29:29,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 17:29:29,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 17:29:29,186 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 17:29:29,186 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 17:29:29,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 17:29:29,187 INFO L82 PathProgramCache]: Analyzing trace with hash -957181164, now seen corresponding path program 1 times [2019-09-08 17:29:29,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 17:29:29,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 17:29:29,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:29:29,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 17:29:29,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:29:29,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 17:29:29,405 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-08 17:29:29,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 17:29:29,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 17:29:29,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 17:29:29,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 17:29:29,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 17:29:29,407 INFO L87 Difference]: Start difference. First operand 1567 states and 1963 transitions. Second operand 3 states. [2019-09-08 17:29:29,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 17:29:29,640 INFO L93 Difference]: Finished difference Result 4644 states and 5946 transitions. [2019-09-08 17:29:29,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 17:29:29,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-08 17:29:29,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 17:29:29,661 INFO L225 Difference]: With dead ends: 4644 [2019-09-08 17:29:29,662 INFO L226 Difference]: Without dead ends: 3105 [2019-09-08 17:29:29,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 17:29:29,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3105 states. [2019-09-08 17:29:29,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3105 to 3095. [2019-09-08 17:29:29,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3095 states. [2019-09-08 17:29:29,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3095 states to 3095 states and 3931 transitions. [2019-09-08 17:29:29,862 INFO L78 Accepts]: Start accepts. Automaton has 3095 states and 3931 transitions. Word has length 104 [2019-09-08 17:29:29,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 17:29:29,865 INFO L475 AbstractCegarLoop]: Abstraction has 3095 states and 3931 transitions. [2019-09-08 17:29:29,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 17:29:29,865 INFO L276 IsEmpty]: Start isEmpty. Operand 3095 states and 3931 transitions. [2019-09-08 17:29:29,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 17:29:29,873 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 17:29:29,873 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 17:29:29,873 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 17:29:29,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 17:29:29,874 INFO L82 PathProgramCache]: Analyzing trace with hash 391804454, now seen corresponding path program 1 times [2019-09-08 17:29:29,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 17:29:29,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 17:29:29,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:29:29,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 17:29:29,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:29:29,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 17:29:30,131 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-08 17:29:30,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 17:29:30,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 17:29:30,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 17:29:30,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 17:29:30,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 17:29:30,133 INFO L87 Difference]: Start difference. First operand 3095 states and 3931 transitions. Second operand 3 states. [2019-09-08 17:29:30,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 17:29:30,242 INFO L93 Difference]: Finished difference Result 3097 states and 3932 transitions. [2019-09-08 17:29:30,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 17:29:30,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-09-08 17:29:30,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 17:29:30,261 INFO L225 Difference]: With dead ends: 3097 [2019-09-08 17:29:30,262 INFO L226 Difference]: Without dead ends: 3094 [2019-09-08 17:29:30,264 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 17:29:30,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3094 states. [2019-09-08 17:29:30,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3094 to 3094. [2019-09-08 17:29:30,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3094 states. [2019-09-08 17:29:30,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3094 states to 3094 states and 3929 transitions. [2019-09-08 17:29:30,421 INFO L78 Accepts]: Start accepts. Automaton has 3094 states and 3929 transitions. Word has length 105 [2019-09-08 17:29:30,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 17:29:30,421 INFO L475 AbstractCegarLoop]: Abstraction has 3094 states and 3929 transitions. [2019-09-08 17:29:30,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 17:29:30,422 INFO L276 IsEmpty]: Start isEmpty. Operand 3094 states and 3929 transitions. [2019-09-08 17:29:30,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 17:29:30,424 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 17:29:30,424 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 17:29:30,424 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 17:29:30,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 17:29:30,425 INFO L82 PathProgramCache]: Analyzing trace with hash -739309481, now seen corresponding path program 1 times [2019-09-08 17:29:30,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 17:29:30,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 17:29:30,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:29:30,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 17:29:30,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:29:30,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 17:29:30,566 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-08 17:29:30,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 17:29:30,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 17:29:30,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 17:29:30,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 17:29:30,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 17:29:30,569 INFO L87 Difference]: Start difference. First operand 3094 states and 3929 transitions. Second operand 3 states. [2019-09-08 17:29:30,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 17:29:30,699 INFO L93 Difference]: Finished difference Result 3096 states and 3930 transitions. [2019-09-08 17:29:30,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 17:29:30,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-08 17:29:30,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 17:29:30,721 INFO L225 Difference]: With dead ends: 3096 [2019-09-08 17:29:30,721 INFO L226 Difference]: Without dead ends: 3093 [2019-09-08 17:29:30,723 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 17:29:30,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3093 states. [2019-09-08 17:29:30,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3093 to 3093. [2019-09-08 17:29:30,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3093 states. [2019-09-08 17:29:30,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3093 states to 3093 states and 3927 transitions. [2019-09-08 17:29:30,975 INFO L78 Accepts]: Start accepts. Automaton has 3093 states and 3927 transitions. Word has length 106 [2019-09-08 17:29:30,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 17:29:30,976 INFO L475 AbstractCegarLoop]: Abstraction has 3093 states and 3927 transitions. [2019-09-08 17:29:30,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 17:29:30,976 INFO L276 IsEmpty]: Start isEmpty. Operand 3093 states and 3927 transitions. [2019-09-08 17:29:30,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 17:29:30,978 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 17:29:30,979 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 17:29:30,979 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 17:29:30,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 17:29:30,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1444098231, now seen corresponding path program 1 times [2019-09-08 17:29:30,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 17:29:30,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 17:29:30,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:29:30,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 17:29:30,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:29:31,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 17:29:31,115 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-08 17:29:31,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 17:29:31,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 17:29:31,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 17:29:31,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 17:29:31,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 17:29:31,116 INFO L87 Difference]: Start difference. First operand 3093 states and 3927 transitions. Second operand 3 states. [2019-09-08 17:29:31,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 17:29:31,245 INFO L93 Difference]: Finished difference Result 3095 states and 3928 transitions. [2019-09-08 17:29:31,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 17:29:31,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-09-08 17:29:31,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 17:29:31,263 INFO L225 Difference]: With dead ends: 3095 [2019-09-08 17:29:31,264 INFO L226 Difference]: Without dead ends: 3092 [2019-09-08 17:29:31,266 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 17:29:31,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3092 states. [2019-09-08 17:29:31,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3092 to 3092. [2019-09-08 17:29:31,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3092 states. [2019-09-08 17:29:31,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3092 states to 3092 states and 3925 transitions. [2019-09-08 17:29:31,426 INFO L78 Accepts]: Start accepts. Automaton has 3092 states and 3925 transitions. Word has length 107 [2019-09-08 17:29:31,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 17:29:31,426 INFO L475 AbstractCegarLoop]: Abstraction has 3092 states and 3925 transitions. [2019-09-08 17:29:31,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 17:29:31,427 INFO L276 IsEmpty]: Start isEmpty. Operand 3092 states and 3925 transitions. [2019-09-08 17:29:31,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 17:29:31,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 17:29:31,429 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 17:29:31,429 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 17:29:31,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 17:29:31,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1817708134, now seen corresponding path program 1 times [2019-09-08 17:29:31,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 17:29:31,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 17:29:31,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:29:31,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 17:29:31,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:29:31,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 17:29:31,571 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-08 17:29:31,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 17:29:31,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 17:29:31,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 17:29:31,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 17:29:31,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 17:29:31,573 INFO L87 Difference]: Start difference. First operand 3092 states and 3925 transitions. Second operand 3 states. [2019-09-08 17:29:31,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 17:29:31,687 INFO L93 Difference]: Finished difference Result 3094 states and 3926 transitions. [2019-09-08 17:29:31,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 17:29:31,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-09-08 17:29:31,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 17:29:31,705 INFO L225 Difference]: With dead ends: 3094 [2019-09-08 17:29:31,705 INFO L226 Difference]: Without dead ends: 3072 [2019-09-08 17:29:31,707 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 17:29:31,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2019-09-08 17:29:31,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 3072. [2019-09-08 17:29:31,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3072 states. [2019-09-08 17:29:31,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3072 states to 3072 states and 3902 transitions. [2019-09-08 17:29:31,873 INFO L78 Accepts]: Start accepts. Automaton has 3072 states and 3902 transitions. Word has length 108 [2019-09-08 17:29:31,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 17:29:31,873 INFO L475 AbstractCegarLoop]: Abstraction has 3072 states and 3902 transitions. [2019-09-08 17:29:31,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 17:29:31,874 INFO L276 IsEmpty]: Start isEmpty. Operand 3072 states and 3902 transitions. [2019-09-08 17:29:31,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 17:29:31,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 17:29:31,881 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 17:29:31,882 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 17:29:31,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 17:29:31,882 INFO L82 PathProgramCache]: Analyzing trace with hash 656364007, now seen corresponding path program 1 times [2019-09-08 17:29:31,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 17:29:31,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 17:29:31,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:29:31,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 17:29:31,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:29:31,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 17:29:32,043 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-08 17:29:32,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 17:29:32,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 17:29:32,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 17:29:32,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 17:29:32,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 17:29:32,045 INFO L87 Difference]: Start difference. First operand 3072 states and 3902 transitions. Second operand 3 states. [2019-09-08 17:29:32,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 17:29:32,412 INFO L93 Difference]: Finished difference Result 8760 states and 11157 transitions. [2019-09-08 17:29:32,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 17:29:32,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-09-08 17:29:32,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 17:29:32,444 INFO L225 Difference]: With dead ends: 8760 [2019-09-08 17:29:32,444 INFO L226 Difference]: Without dead ends: 5716 [2019-09-08 17:29:32,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 17:29:32,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5716 states. [2019-09-08 17:29:32,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5716 to 5598. [2019-09-08 17:29:32,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5598 states. [2019-09-08 17:29:32,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5598 states to 5598 states and 7155 transitions. [2019-09-08 17:29:32,750 INFO L78 Accepts]: Start accepts. Automaton has 5598 states and 7155 transitions. Word has length 155 [2019-09-08 17:29:32,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 17:29:32,750 INFO L475 AbstractCegarLoop]: Abstraction has 5598 states and 7155 transitions. [2019-09-08 17:29:32,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 17:29:32,750 INFO L276 IsEmpty]: Start isEmpty. Operand 5598 states and 7155 transitions. [2019-09-08 17:29:32,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-09-08 17:29:32,761 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 17:29:32,761 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:29:32,762 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 17:29:32,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 17:29:32,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1911127885, now seen corresponding path program 1 times [2019-09-08 17:29:32,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 17:29:32,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 17:29:32,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:29:32,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 17:29:32,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:29:32,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 17:29:32,994 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-09-08 17:29:32,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 17:29:32,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 17:29:32,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 17:29:32,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 17:29:32,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 17:29:32,996 INFO L87 Difference]: Start difference. First operand 5598 states and 7155 transitions. Second operand 3 states. [2019-09-08 17:29:33,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 17:29:33,439 INFO L93 Difference]: Finished difference Result 15665 states and 20018 transitions. [2019-09-08 17:29:33,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 17:29:33,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2019-09-08 17:29:33,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 17:29:33,498 INFO L225 Difference]: With dead ends: 15665 [2019-09-08 17:29:33,499 INFO L226 Difference]: Without dead ends: 10103 [2019-09-08 17:29:33,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 17:29:33,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10103 states. [2019-09-08 17:29:33,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10103 to 10030. [2019-09-08 17:29:33,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10030 states. [2019-09-08 17:29:34,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10030 states to 10030 states and 12809 transitions. [2019-09-08 17:29:34,019 INFO L78 Accepts]: Start accepts. Automaton has 10030 states and 12809 transitions. Word has length 298 [2019-09-08 17:29:34,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 17:29:34,020 INFO L475 AbstractCegarLoop]: Abstraction has 10030 states and 12809 transitions. [2019-09-08 17:29:34,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 17:29:34,020 INFO L276 IsEmpty]: Start isEmpty. Operand 10030 states and 12809 transitions. [2019-09-08 17:29:34,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-09-08 17:29:34,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 17:29:34,035 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:29:34,035 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 17:29:34,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 17:29:34,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1658737754, now seen corresponding path program 1 times [2019-09-08 17:29:34,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 17:29:34,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 17:29:34,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:29:34,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 17:29:34,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:29:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 17:29:34,277 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-08 17:29:34,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 17:29:34,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 17:29:34,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 17:29:34,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 17:29:34,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 17:29:34,279 INFO L87 Difference]: Start difference. First operand 10030 states and 12809 transitions. Second operand 3 states. [2019-09-08 17:29:34,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 17:29:34,804 INFO L93 Difference]: Finished difference Result 20120 states and 25746 transitions. [2019-09-08 17:29:34,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 17:29:34,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 317 [2019-09-08 17:29:34,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 17:29:34,868 INFO L225 Difference]: With dead ends: 20120 [2019-09-08 17:29:34,868 INFO L226 Difference]: Without dead ends: 10126 [2019-09-08 17:29:34,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 17:29:34,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10126 states. [2019-09-08 17:29:35,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10126 to 10126. [2019-09-08 17:29:35,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10126 states. [2019-09-08 17:29:35,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10126 states to 10126 states and 12953 transitions. [2019-09-08 17:29:35,420 INFO L78 Accepts]: Start accepts. Automaton has 10126 states and 12953 transitions. Word has length 317 [2019-09-08 17:29:35,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 17:29:35,422 INFO L475 AbstractCegarLoop]: Abstraction has 10126 states and 12953 transitions. [2019-09-08 17:29:35,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 17:29:35,423 INFO L276 IsEmpty]: Start isEmpty. Operand 10126 states and 12953 transitions. [2019-09-08 17:29:35,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-08 17:29:35,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 17:29:35,443 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:29:35,444 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 17:29:35,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 17:29:35,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1852809298, now seen corresponding path program 1 times [2019-09-08 17:29:35,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 17:29:35,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 17:29:35,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:29:35,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 17:29:35,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:29:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 17:29:36,512 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-09-08 17:29:36,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 17:29:36,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 17:29:36,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 17:29:36,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 17:29:36,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 17:29:36,514 INFO L87 Difference]: Start difference. First operand 10126 states and 12953 transitions. Second operand 3 states. [2019-09-08 17:29:37,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 17:29:37,341 INFO L93 Difference]: Finished difference Result 21298 states and 27312 transitions. [2019-09-08 17:29:37,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 17:29:37,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-08 17:29:37,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 17:29:37,387 INFO L225 Difference]: With dead ends: 21298 [2019-09-08 17:29:37,387 INFO L226 Difference]: Without dead ends: 11208 [2019-09-08 17:29:37,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 17:29:37,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11208 states. [2019-09-08 17:29:37,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11208 to 11098. [2019-09-08 17:29:37,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11098 states. [2019-09-08 17:29:37,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11098 states to 11098 states and 14190 transitions. [2019-09-08 17:29:37,892 INFO L78 Accepts]: Start accepts. Automaton has 11098 states and 14190 transitions. Word has length 324 [2019-09-08 17:29:37,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 17:29:37,893 INFO L475 AbstractCegarLoop]: Abstraction has 11098 states and 14190 transitions. [2019-09-08 17:29:37,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 17:29:37,893 INFO L276 IsEmpty]: Start isEmpty. Operand 11098 states and 14190 transitions. [2019-09-08 17:29:37,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-09-08 17:29:37,909 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 17:29:37,909 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:29:37,910 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 17:29:37,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 17:29:37,910 INFO L82 PathProgramCache]: Analyzing trace with hash -2125142210, now seen corresponding path program 1 times [2019-09-08 17:29:37,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 17:29:37,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 17:29:37,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:29:37,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 17:29:37,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:29:38,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 17:29:38,250 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-09-08 17:29:38,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 17:29:38,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 17:29:38,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 17:29:38,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 17:29:38,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 17:29:38,252 INFO L87 Difference]: Start difference. First operand 11098 states and 14190 transitions. Second operand 3 states. [2019-09-08 17:29:39,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 17:29:39,477 INFO L93 Difference]: Finished difference Result 26778 states and 34238 transitions. [2019-09-08 17:29:39,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 17:29:39,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 342 [2019-09-08 17:29:39,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 17:29:39,539 INFO L225 Difference]: With dead ends: 26778 [2019-09-08 17:29:39,539 INFO L226 Difference]: Without dead ends: 15716 [2019-09-08 17:29:39,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 17:29:39,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15716 states. [2019-09-08 17:29:40,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15716 to 15562. [2019-09-08 17:29:40,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15562 states. [2019-09-08 17:29:40,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15562 states to 15562 states and 19827 transitions. [2019-09-08 17:29:40,179 INFO L78 Accepts]: Start accepts. Automaton has 15562 states and 19827 transitions. Word has length 342 [2019-09-08 17:29:40,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 17:29:40,180 INFO L475 AbstractCegarLoop]: Abstraction has 15562 states and 19827 transitions. [2019-09-08 17:29:40,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 17:29:40,180 INFO L276 IsEmpty]: Start isEmpty. Operand 15562 states and 19827 transitions. [2019-09-08 17:29:40,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2019-09-08 17:29:40,199 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 17:29:40,199 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:29:40,200 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 17:29:40,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 17:29:40,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1215095276, now seen corresponding path program 1 times [2019-09-08 17:29:40,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 17:29:40,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 17:29:40,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:29:40,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 17:29:40,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:29:40,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 17:29:40,919 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 22 proven. 22 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2019-09-08 17:29:40,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 17:29:40,920 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 17:29:40,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 17:29:41,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 17:29:41,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 3037 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 17:29:41,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 17:29:41,859 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-09-08 17:29:41,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 17:29:41,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2019-09-08 17:29:41,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 17:29:41,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 17:29:41,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 17:29:41,880 INFO L87 Difference]: Start difference. First operand 15562 states and 19827 transitions. Second operand 6 states. [2019-09-08 17:29:47,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 17:29:47,781 INFO L93 Difference]: Finished difference Result 63138 states and 80433 transitions. [2019-09-08 17:29:47,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 17:29:47,782 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 369 [2019-09-08 17:29:47,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 17:29:48,112 INFO L225 Difference]: With dead ends: 63138 [2019-09-08 17:29:48,112 INFO L226 Difference]: Without dead ends: 63120 [2019-09-08 17:29:48,143 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 369 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 17:29:48,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63120 states. [2019-09-08 17:29:52,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63120 to 62918. [2019-09-08 17:29:52,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62918 states. [2019-09-08 17:29:53,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62918 states to 62918 states and 80184 transitions. [2019-09-08 17:29:53,101 INFO L78 Accepts]: Start accepts. Automaton has 62918 states and 80184 transitions. Word has length 369 [2019-09-08 17:29:53,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 17:29:53,102 INFO L475 AbstractCegarLoop]: Abstraction has 62918 states and 80184 transitions. [2019-09-08 17:29:53,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 17:29:53,102 INFO L276 IsEmpty]: Start isEmpty. Operand 62918 states and 80184 transitions. [2019-09-08 17:29:53,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2019-09-08 17:29:53,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 17:29:53,192 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 17:29:53,192 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 17:29:53,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 17:29:53,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1918472060, now seen corresponding path program 1 times [2019-09-08 17:29:53,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 17:29:53,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 17:29:53,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:29:53,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 17:29:53,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:29:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 17:29:53,590 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-09-08 17:29:53,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 17:29:53,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 17:29:53,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 17:29:53,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 17:29:53,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 17:29:53,593 INFO L87 Difference]: Start difference. First operand 62918 states and 80184 transitions. Second operand 3 states. [2019-09-08 17:29:56,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 17:29:56,458 INFO L93 Difference]: Finished difference Result 125800 states and 160328 transitions. [2019-09-08 17:29:56,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 17:29:56,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 389 [2019-09-08 17:29:56,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 17:29:56,698 INFO L225 Difference]: With dead ends: 125800 [2019-09-08 17:29:56,699 INFO L226 Difference]: Without dead ends: 59467 [2019-09-08 17:29:56,822 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 17:29:56,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59467 states. [2019-09-08 17:30:00,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59467 to 59405. [2019-09-08 17:30:00,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59405 states. [2019-09-08 17:30:00,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59405 states to 59405 states and 75561 transitions. [2019-09-08 17:30:00,957 INFO L78 Accepts]: Start accepts. Automaton has 59405 states and 75561 transitions. Word has length 389 [2019-09-08 17:30:00,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 17:30:00,958 INFO L475 AbstractCegarLoop]: Abstraction has 59405 states and 75561 transitions. [2019-09-08 17:30:00,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 17:30:00,959 INFO L276 IsEmpty]: Start isEmpty. Operand 59405 states and 75561 transitions. [2019-09-08 17:30:01,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-09-08 17:30:01,014 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 17:30:01,015 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:30:01,015 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 17:30:01,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 17:30:01,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1074524505, now seen corresponding path program 1 times [2019-09-08 17:30:01,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 17:30:01,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 17:30:01,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:30:01,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 17:30:01,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:30:01,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 17:30:01,367 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2019-09-08 17:30:01,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 17:30:01,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 17:30:01,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 17:30:01,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 17:30:01,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 17:30:01,369 INFO L87 Difference]: Start difference. First operand 59405 states and 75561 transitions. Second operand 5 states. [2019-09-08 17:30:04,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 17:30:04,950 INFO L93 Difference]: Finished difference Result 177505 states and 225697 transitions. [2019-09-08 17:30:04,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 17:30:04,952 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 387 [2019-09-08 17:30:04,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 17:30:05,389 INFO L225 Difference]: With dead ends: 177505 [2019-09-08 17:30:05,389 INFO L226 Difference]: Without dead ends: 118136 [2019-09-08 17:30:05,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 17:30:05,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118136 states. [2019-09-08 17:30:10,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118136 to 59080. [2019-09-08 17:30:10,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59080 states. [2019-09-08 17:30:10,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59080 states to 59080 states and 75126 transitions. [2019-09-08 17:30:10,740 INFO L78 Accepts]: Start accepts. Automaton has 59080 states and 75126 transitions. Word has length 387 [2019-09-08 17:30:10,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 17:30:10,741 INFO L475 AbstractCegarLoop]: Abstraction has 59080 states and 75126 transitions. [2019-09-08 17:30:10,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 17:30:10,741 INFO L276 IsEmpty]: Start isEmpty. Operand 59080 states and 75126 transitions. [2019-09-08 17:30:10,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2019-09-08 17:30:10,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 17:30:10,786 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 17:30:10,786 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 17:30:10,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 17:30:10,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1117540346, now seen corresponding path program 1 times [2019-09-08 17:30:10,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 17:30:10,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 17:30:10,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:30:10,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 17:30:10,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:30:10,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 17:30:11,037 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-09-08 17:30:11,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 17:30:11,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 17:30:11,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 17:30:11,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 17:30:11,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 17:30:11,042 INFO L87 Difference]: Start difference. First operand 59080 states and 75126 transitions. Second operand 3 states. [2019-09-08 17:30:12,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 17:30:12,534 INFO L93 Difference]: Finished difference Result 86430 states and 110002 transitions. [2019-09-08 17:30:12,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 17:30:12,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 389 [2019-09-08 17:30:12,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 17:30:12,632 INFO L225 Difference]: With dead ends: 86430 [2019-09-08 17:30:12,632 INFO L226 Difference]: Without dead ends: 27385 [2019-09-08 17:30:12,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 17:30:12,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27385 states. [2019-09-08 17:30:14,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27385 to 27385. [2019-09-08 17:30:14,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27385 states. [2019-09-08 17:30:14,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27385 states to 27385 states and 34914 transitions. [2019-09-08 17:30:14,113 INFO L78 Accepts]: Start accepts. Automaton has 27385 states and 34914 transitions. Word has length 389 [2019-09-08 17:30:14,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 17:30:14,113 INFO L475 AbstractCegarLoop]: Abstraction has 27385 states and 34914 transitions. [2019-09-08 17:30:14,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 17:30:14,114 INFO L276 IsEmpty]: Start isEmpty. Operand 27385 states and 34914 transitions. [2019-09-08 17:30:14,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-09-08 17:30:14,130 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 17:30:14,131 INFO L399 BasicCegarLoop]: trace histogram [7, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:30:14,131 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 17:30:14,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 17:30:14,131 INFO L82 PathProgramCache]: Analyzing trace with hash -938869884, now seen corresponding path program 1 times [2019-09-08 17:30:14,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 17:30:14,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 17:30:14,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:30:14,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 17:30:14,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:30:14,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 17:30:14,390 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-09-08 17:30:14,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 17:30:14,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 17:30:14,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 17:30:14,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 17:30:14,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 17:30:14,392 INFO L87 Difference]: Start difference. First operand 27385 states and 34914 transitions. Second operand 3 states. [2019-09-08 17:30:15,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 17:30:15,039 INFO L93 Difference]: Finished difference Result 40579 states and 51735 transitions. [2019-09-08 17:30:15,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 17:30:15,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 391 [2019-09-08 17:30:15,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 17:30:15,079 INFO L225 Difference]: With dead ends: 40579 [2019-09-08 17:30:15,079 INFO L226 Difference]: Without dead ends: 13277 [2019-09-08 17:30:15,111 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 17:30:15,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13277 states. [2019-09-08 17:30:15,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13277 to 13143. [2019-09-08 17:30:15,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13143 states. [2019-09-08 17:30:15,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13143 states to 13143 states and 16708 transitions. [2019-09-08 17:30:15,508 INFO L78 Accepts]: Start accepts. Automaton has 13143 states and 16708 transitions. Word has length 391 [2019-09-08 17:30:15,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 17:30:15,508 INFO L475 AbstractCegarLoop]: Abstraction has 13143 states and 16708 transitions. [2019-09-08 17:30:15,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 17:30:15,508 INFO L276 IsEmpty]: Start isEmpty. Operand 13143 states and 16708 transitions. [2019-09-08 17:30:15,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2019-09-08 17:30:15,523 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 17:30:15,523 INFO L399 BasicCegarLoop]: trace histogram [8, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:30:15,523 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 17:30:15,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 17:30:15,524 INFO L82 PathProgramCache]: Analyzing trace with hash 586741593, now seen corresponding path program 1 times [2019-09-08 17:30:15,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 17:30:15,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 17:30:15,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:30:15,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 17:30:15,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:30:15,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 17:30:15,847 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2019-09-08 17:30:15,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 17:30:15,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 17:30:15,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 17:30:15,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 17:30:15,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 17:30:15,849 INFO L87 Difference]: Start difference. First operand 13143 states and 16708 transitions. Second operand 3 states. [2019-09-08 17:30:17,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 17:30:17,509 INFO L93 Difference]: Finished difference Result 26179 states and 33283 transitions. [2019-09-08 17:30:17,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 17:30:17,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 409 [2019-09-08 17:30:17,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 17:30:17,547 INFO L225 Difference]: With dead ends: 26179 [2019-09-08 17:30:17,547 INFO L226 Difference]: Without dead ends: 13307 [2019-09-08 17:30:17,568 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 17:30:17,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13307 states. [2019-09-08 17:30:18,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13307 to 13143. [2019-09-08 17:30:18,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13143 states. [2019-09-08 17:30:18,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13143 states to 13143 states and 16642 transitions. [2019-09-08 17:30:18,064 INFO L78 Accepts]: Start accepts. Automaton has 13143 states and 16642 transitions. Word has length 409 [2019-09-08 17:30:18,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 17:30:18,065 INFO L475 AbstractCegarLoop]: Abstraction has 13143 states and 16642 transitions. [2019-09-08 17:30:18,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 17:30:18,065 INFO L276 IsEmpty]: Start isEmpty. Operand 13143 states and 16642 transitions. [2019-09-08 17:30:18,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2019-09-08 17:30:18,079 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 17:30:18,080 INFO L399 BasicCegarLoop]: trace histogram [7, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:30:18,080 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 17:30:18,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 17:30:18,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1695193488, now seen corresponding path program 1 times [2019-09-08 17:30:18,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 17:30:18,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 17:30:18,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:30:18,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 17:30:18,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:30:18,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 17:30:18,449 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-09-08 17:30:18,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 17:30:18,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 17:30:18,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 17:30:18,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 17:30:18,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 17:30:18,452 INFO L87 Difference]: Start difference. First operand 13143 states and 16642 transitions. Second operand 8 states. [2019-09-08 17:30:19,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 17:30:19,300 INFO L93 Difference]: Finished difference Result 26159 states and 33292 transitions. [2019-09-08 17:30:19,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 17:30:19,300 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 425 [2019-09-08 17:30:19,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 17:30:19,341 INFO L225 Difference]: With dead ends: 26159 [2019-09-08 17:30:19,341 INFO L226 Difference]: Without dead ends: 13287 [2019-09-08 17:30:19,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-08 17:30:19,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13287 states. [2019-09-08 17:30:19,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13287 to 13197. [2019-09-08 17:30:19,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13197 states. [2019-09-08 17:30:19,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13197 states to 13197 states and 16714 transitions. [2019-09-08 17:30:19,938 INFO L78 Accepts]: Start accepts. Automaton has 13197 states and 16714 transitions. Word has length 425 [2019-09-08 17:30:19,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 17:30:19,939 INFO L475 AbstractCegarLoop]: Abstraction has 13197 states and 16714 transitions. [2019-09-08 17:30:19,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 17:30:19,939 INFO L276 IsEmpty]: Start isEmpty. Operand 13197 states and 16714 transitions. [2019-09-08 17:30:19,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2019-09-08 17:30:19,957 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 17:30:19,958 INFO L399 BasicCegarLoop]: trace histogram [7, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:30:19,958 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 17:30:19,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 17:30:19,959 INFO L82 PathProgramCache]: Analyzing trace with hash -339786381, now seen corresponding path program 1 times [2019-09-08 17:30:19,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 17:30:19,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 17:30:19,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:30:19,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 17:30:19,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:30:20,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 17:30:20,500 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-08 17:30:20,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 17:30:20,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 17:30:20,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 17:30:20,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 17:30:20,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 17:30:20,502 INFO L87 Difference]: Start difference. First operand 13197 states and 16714 transitions. Second operand 3 states. [2019-09-08 17:30:21,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 17:30:21,177 INFO L93 Difference]: Finished difference Result 26785 states and 34139 transitions. [2019-09-08 17:30:21,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 17:30:21,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 429 [2019-09-08 17:30:21,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 17:30:21,225 INFO L225 Difference]: With dead ends: 26785 [2019-09-08 17:30:21,225 INFO L226 Difference]: Without dead ends: 13671 [2019-09-08 17:30:21,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 17:30:21,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13671 states. [2019-09-08 17:30:22,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13671 to 13575. [2019-09-08 17:30:22,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13575 states. [2019-09-08 17:30:22,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13575 states to 13575 states and 17344 transitions. [2019-09-08 17:30:22,056 INFO L78 Accepts]: Start accepts. Automaton has 13575 states and 17344 transitions. Word has length 429 [2019-09-08 17:30:22,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 17:30:22,057 INFO L475 AbstractCegarLoop]: Abstraction has 13575 states and 17344 transitions. [2019-09-08 17:30:22,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 17:30:22,057 INFO L276 IsEmpty]: Start isEmpty. Operand 13575 states and 17344 transitions. [2019-09-08 17:30:22,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2019-09-08 17:30:22,069 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 17:30:22,070 INFO L399 BasicCegarLoop]: trace histogram [7, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:30:22,070 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 17:30:22,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 17:30:22,070 INFO L82 PathProgramCache]: Analyzing trace with hash 564392973, now seen corresponding path program 1 times [2019-09-08 17:30:22,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 17:30:22,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 17:30:22,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:30:22,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 17:30:22,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:30:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 17:30:22,579 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2019-09-08 17:30:22,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 17:30:22,579 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 17:30:22,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 17:30:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 17:30:23,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 3270 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 17:30:23,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 17:30:23,254 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-09-08 17:30:23,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 17:30:23,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-08 17:30:23,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 17:30:23,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 17:30:23,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 17:30:23,264 INFO L87 Difference]: Start difference. First operand 13575 states and 17344 transitions. Second operand 9 states. [2019-09-08 17:30:24,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 17:30:24,835 INFO L93 Difference]: Finished difference Result 27372 states and 35152 transitions. [2019-09-08 17:30:24,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 17:30:24,836 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 436 [2019-09-08 17:30:24,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 17:30:24,865 INFO L225 Difference]: With dead ends: 27372 [2019-09-08 17:30:24,865 INFO L226 Difference]: Without dead ends: 13816 [2019-09-08 17:30:24,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 434 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2019-09-08 17:30:24,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13816 states. [2019-09-08 17:30:25,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13816 to 13600. [2019-09-08 17:30:25,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13600 states. [2019-09-08 17:30:25,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13600 states to 13600 states and 17369 transitions. [2019-09-08 17:30:25,268 INFO L78 Accepts]: Start accepts. Automaton has 13600 states and 17369 transitions. Word has length 436 [2019-09-08 17:30:25,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 17:30:25,268 INFO L475 AbstractCegarLoop]: Abstraction has 13600 states and 17369 transitions. [2019-09-08 17:30:25,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 17:30:25,268 INFO L276 IsEmpty]: Start isEmpty. Operand 13600 states and 17369 transitions. [2019-09-08 17:30:25,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2019-09-08 17:30:25,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 17:30:25,283 INFO L399 BasicCegarLoop]: trace histogram [7, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:30:25,283 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 17:30:25,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 17:30:25,283 INFO L82 PathProgramCache]: Analyzing trace with hash 2114588240, now seen corresponding path program 1 times [2019-09-08 17:30:25,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 17:30:25,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 17:30:25,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:30:25,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 17:30:25,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:30:25,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 17:30:26,142 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-08 17:30:26,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 17:30:26,143 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 17:30:26,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 17:30:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 17:30:30,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 3291 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-08 17:30:30,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 17:30:30,750 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2019-09-08 17:30:30,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 17:30:30,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2019-09-08 17:30:30,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 17:30:30,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 17:30:30,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-09-08 17:30:30,769 INFO L87 Difference]: Start difference. First operand 13600 states and 17369 transitions. Second operand 14 states. [2019-09-08 17:31:00,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 17:31:00,891 INFO L93 Difference]: Finished difference Result 34140 states and 43845 transitions. [2019-09-08 17:31:00,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 17:31:00,893 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 442 [2019-09-08 17:31:00,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 17:31:00,933 INFO L225 Difference]: With dead ends: 34140 [2019-09-08 17:31:00,933 INFO L226 Difference]: Without dead ends: 20544 [2019-09-08 17:31:00,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 438 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=979, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 17:31:00,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20544 states. [2019-09-08 17:31:01,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20544 to 19809. [2019-09-08 17:31:01,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19809 states. [2019-09-08 17:31:01,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19809 states to 19809 states and 25195 transitions. [2019-09-08 17:31:01,553 INFO L78 Accepts]: Start accepts. Automaton has 19809 states and 25195 transitions. Word has length 442 [2019-09-08 17:31:01,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 17:31:01,554 INFO L475 AbstractCegarLoop]: Abstraction has 19809 states and 25195 transitions. [2019-09-08 17:31:01,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 17:31:01,554 INFO L276 IsEmpty]: Start isEmpty. Operand 19809 states and 25195 transitions. [2019-09-08 17:31:01,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2019-09-08 17:31:01,582 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 17:31:01,582 INFO L399 BasicCegarLoop]: trace histogram [7, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:31:01,582 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 17:31:01,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 17:31:01,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1095977150, now seen corresponding path program 1 times [2019-09-08 17:31:01,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 17:31:01,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 17:31:01,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:31:01,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 17:31:01,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:31:01,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 17:31:01,899 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-08 17:31:01,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 17:31:01,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 17:31:01,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 17:31:01,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 17:31:01,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 17:31:01,902 INFO L87 Difference]: Start difference. First operand 19809 states and 25195 transitions. Second operand 4 states. [2019-09-08 17:31:02,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 17:31:02,786 INFO L93 Difference]: Finished difference Result 39471 states and 50807 transitions. [2019-09-08 17:31:02,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 17:31:02,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 479 [2019-09-08 17:31:02,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 17:31:02,850 INFO L225 Difference]: With dead ends: 39471 [2019-09-08 17:31:02,850 INFO L226 Difference]: Without dead ends: 19809 [2019-09-08 17:31:02,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 17:31:02,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19809 states. [2019-09-08 17:31:04,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19809 to 19809. [2019-09-08 17:31:04,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19809 states. [2019-09-08 17:31:04,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19809 states to 19809 states and 25171 transitions. [2019-09-08 17:31:04,489 INFO L78 Accepts]: Start accepts. Automaton has 19809 states and 25171 transitions. Word has length 479 [2019-09-08 17:31:04,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 17:31:04,490 INFO L475 AbstractCegarLoop]: Abstraction has 19809 states and 25171 transitions. [2019-09-08 17:31:04,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 17:31:04,490 INFO L276 IsEmpty]: Start isEmpty. Operand 19809 states and 25171 transitions. [2019-09-08 17:31:04,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2019-09-08 17:31:04,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 17:31:04,525 INFO L399 BasicCegarLoop]: trace histogram [9, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:31:04,525 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 17:31:04,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 17:31:04,526 INFO L82 PathProgramCache]: Analyzing trace with hash -219183642, now seen corresponding path program 1 times [2019-09-08 17:31:04,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 17:31:04,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 17:31:04,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:31:04,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 17:31:04,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:31:04,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 17:31:04,948 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 80 proven. 37 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2019-09-08 17:31:04,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 17:31:04,949 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 17:31:04,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 17:31:05,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 17:31:05,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 3459 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 17:31:05,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 17:31:05,629 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-09-08 17:31:05,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 17:31:05,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2019-09-08 17:31:05,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 17:31:05,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 17:31:05,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 17:31:05,638 INFO L87 Difference]: Start difference. First operand 19809 states and 25171 transitions. Second operand 5 states. [2019-09-08 17:31:07,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 17:31:07,767 INFO L93 Difference]: Finished difference Result 45426 states and 57799 transitions. [2019-09-08 17:31:07,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 17:31:07,767 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 477 [2019-09-08 17:31:07,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 17:31:07,818 INFO L225 Difference]: With dead ends: 45426 [2019-09-08 17:31:07,818 INFO L226 Difference]: Without dead ends: 25908 [2019-09-08 17:31:07,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 477 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 17:31:07,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25908 states. [2019-09-08 17:31:08,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25908 to 20598. [2019-09-08 17:31:08,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20598 states. [2019-09-08 17:31:08,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20598 states to 20598 states and 26150 transitions. [2019-09-08 17:31:08,517 INFO L78 Accepts]: Start accepts. Automaton has 20598 states and 26150 transitions. Word has length 477 [2019-09-08 17:31:08,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 17:31:08,517 INFO L475 AbstractCegarLoop]: Abstraction has 20598 states and 26150 transitions. [2019-09-08 17:31:08,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 17:31:08,518 INFO L276 IsEmpty]: Start isEmpty. Operand 20598 states and 26150 transitions. [2019-09-08 17:31:08,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2019-09-08 17:31:08,543 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 17:31:08,544 INFO L399 BasicCegarLoop]: trace histogram [9, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:31:08,544 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 17:31:08,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 17:31:08,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1150268454, now seen corresponding path program 2 times [2019-09-08 17:31:08,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 17:31:08,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 17:31:08,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:31:08,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 17:31:08,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:31:08,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat