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-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--staging--gdm724x--gdmulte.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 10:05:06,973 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 10:05:06,975 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 10:05:06,987 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 10:05:06,987 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 10:05:06,988 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 10:05:06,989 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 10:05:06,991 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 10:05:06,993 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 10:05:06,994 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 10:05:06,995 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 10:05:06,996 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 10:05:06,996 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 10:05:06,997 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 10:05:06,998 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 10:05:06,999 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 10:05:07,000 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 10:05:07,001 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 10:05:07,002 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 10:05:07,004 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 10:05:07,005 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 10:05:07,006 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 10:05:07,007 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 10:05:07,008 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 10:05:07,010 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 10:05:07,010 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 10:05:07,010 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 10:05:07,011 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 10:05:07,012 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 10:05:07,012 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 10:05:07,013 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 10:05:07,013 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 10:05:07,014 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 10:05:07,015 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 10:05:07,016 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 10:05:07,016 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 10:05:07,017 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 10:05:07,017 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 10:05:07,017 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 10:05:07,018 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 10:05:07,019 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 10:05:07,019 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 10:05:07,033 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 10:05:07,034 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 10:05:07,035 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 10:05:07,035 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 10:05:07,035 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 10:05:07,035 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 10:05:07,036 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 10:05:07,036 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 10:05:07,036 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 10:05:07,036 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 10:05:07,036 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 10:05:07,037 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 10:05:07,037 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 10:05:07,037 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 10:05:07,037 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 10:05:07,037 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 10:05:07,038 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 10:05:07,038 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 10:05:07,038 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 10:05:07,038 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 10:05:07,038 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 10:05:07,039 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 10:05:07,039 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 10:05:07,039 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 10:05:07,039 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 10:05:07,040 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 10:05:07,040 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 10:05:07,040 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 10:05:07,040 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 10:05:07,068 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 10:05:07,084 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 10:05:07,089 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 10:05:07,091 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 10:05:07,091 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 10:05:07,092 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--staging--gdm724x--gdmulte.ko-entry_point.cil.out.i [2019-10-02 10:05:07,156 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4568b390/c0f4ee617e464fbb92fae7aec8087e4d/FLAGe0763e926 [2019-10-02 10:05:08,027 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 10:05:08,029 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--staging--gdm724x--gdmulte.ko-entry_point.cil.out.i [2019-10-02 10:05:08,085 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4568b390/c0f4ee617e464fbb92fae7aec8087e4d/FLAGe0763e926 [2019-10-02 10:05:08,479 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4568b390/c0f4ee617e464fbb92fae7aec8087e4d [2019-10-02 10:05:08,490 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 10:05:08,492 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 10:05:08,493 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 10:05:08,493 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 10:05:08,497 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 10:05:08,497 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 10:05:08" (1/1) ... [2019-10-02 10:05:08,500 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52ef5973 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:05:08, skipping insertion in model container [2019-10-02 10:05:08,501 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 10:05:08" (1/1) ... [2019-10-02 10:05:08,508 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 10:05:08,692 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 10:05:11,672 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 10:05:11,707 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 10:05:12,149 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 10:05:12,905 INFO L192 MainTranslator]: Completed translation [2019-10-02 10:05:12,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:05:12 WrapperNode [2019-10-02 10:05:12,906 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 10:05:12,906 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 10:05:12,906 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 10:05:12,907 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 10:05:12,917 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:05:12" (1/1) ... [2019-10-02 10:05:12,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:05:12" (1/1) ... [2019-10-02 10:05:13,019 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:05:12" (1/1) ... [2019-10-02 10:05:13,019 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:05:12" (1/1) ... [2019-10-02 10:05:13,183 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:05:12" (1/1) ... [2019-10-02 10:05:13,206 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:05:12" (1/1) ... [2019-10-02 10:05:13,238 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:05:12" (1/1) ... [2019-10-02 10:05:13,276 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 10:05:13,276 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 10:05:13,277 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 10:05:13,277 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 10:05:13,278 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:05:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 10:05:13,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 10:05:13,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 10:05:13,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~X~int~X~$Pointer$~X~$Pointer$~X~int~X~int~TO~int [2019-10-02 10:05:13,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2019-10-02 10:05:13,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~$Pointer$~X~$Pointer$~TO~int [2019-10-02 10:05:13,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~$Pointer$~X~int~TO~int [2019-10-02 10:05:13,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~u16~0~X~$Pointer$~X~int~TO~VOID [2019-10-02 10:05:13,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~int [2019-10-02 10:05:13,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-10-02 10:05:13,352 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2019-10-02 10:05:13,352 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2019-10-02 10:05:13,353 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2019-10-02 10:05:13,353 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2019-10-02 10:05:13,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-10-02 10:05:13,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-10-02 10:05:13,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2019-10-02 10:05:13,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2019-10-02 10:05:13,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2019-10-02 10:05:13,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ptr [2019-10-02 10:05:13,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2019-10-02 10:05:13,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2019-10-02 10:05:13,356 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reserve [2019-10-02 10:05:13,357 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reset_mac_header [2019-10-02 10:05:13,357 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_alloc_skb [2019-10-02 10:05:13,357 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_alloc_skb [2019-10-02 10:05:13,357 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2019-10-02 10:05:13,357 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2019-10-02 10:05:13,357 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2019-10-02 10:05:13,357 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_start_queue [2019-10-02 10:05:13,357 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2019-10-02 10:05:13,357 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_stop_queue [2019-10-02 10:05:13,358 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2019-10-02 10:05:13,358 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_queue_stopped [2019-10-02 10:05:13,358 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2019-10-02 10:05:13,358 INFO L138 BoogieDeclarations]: Found implementation of procedure is_zero_ether_addr [2019-10-02 10:05:13,358 INFO L138 BoogieDeclarations]: Found implementation of procedure eth_random_addr [2019-10-02 10:05:13,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ether_addr_copy [2019-10-02 10:05:13,359 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_lte_open [2019-10-02 10:05:13,359 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_lte_close [2019-10-02 10:05:13,359 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_lte_set_config [2019-10-02 10:05:13,359 INFO L138 BoogieDeclarations]: Found implementation of procedure tx_complete [2019-10-02 10:05:13,359 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_lte_rx [2019-10-02 10:05:13,359 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_lte_emulate_arp [2019-10-02 10:05:13,359 INFO L138 BoogieDeclarations]: Found implementation of procedure icmp6_checksum [2019-10-02 10:05:13,360 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_lte_emulate_ndp [2019-10-02 10:05:13,360 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_lte_tx_nic_type [2019-10-02 10:05:13,360 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_lte_tx [2019-10-02 10:05:13,360 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_lte_stats [2019-10-02 10:05:13,360 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_lte_event_send [2019-10-02 10:05:13,360 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_lte_event_rcv [2019-10-02 10:05:13,360 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_lte_event_init [2019-10-02 10:05:13,361 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_lte_event_exit [2019-10-02 10:05:13,361 INFO L138 BoogieDeclarations]: Found implementation of procedure find_dev_index [2019-10-02 10:05:13,361 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_lte_netif_rx [2019-10-02 10:05:13,361 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_lte_multi_sdu_pkt [2019-10-02 10:05:13,361 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_lte_pdn_table [2019-10-02 10:05:13,361 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_lte_receive_pkt [2019-10-02 10:05:13,362 INFO L138 BoogieDeclarations]: Found implementation of procedure rx_complete [2019-10-02 10:05:13,362 INFO L138 BoogieDeclarations]: Found implementation of procedure start_rx_proc [2019-10-02 10:05:13,362 INFO L138 BoogieDeclarations]: Found implementation of procedure form_mac_address [2019-10-02 10:05:13,362 INFO L138 BoogieDeclarations]: Found implementation of procedure validate_mac_address [2019-10-02 10:05:13,362 INFO L138 BoogieDeclarations]: Found implementation of procedure register_lte_device [2019-10-02 10:05:13,362 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_lte_device [2019-10-02 10:05:13,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_net_device_ops_4 [2019-10-02 10:05:13,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_main_exported_4 [2019-10-02 10:05:13,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_queue_work_on_15 [2019-10-02 10:05:13,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_queue_delayed_work_on_16 [2019-10-02 10:05:13,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_queue_work_on_17 [2019-10-02 10:05:13,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_flush_workqueue_18 [2019-10-02 10:05:13,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_queue_delayed_work_on_19 [2019-10-02 10:05:13,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kmem_cache_alloc_25 [2019-10-02 10:05:13,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_pskb_expand_head_31 [2019-10-02 10:05:13,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_clone_33 [2019-10-02 10:05:13,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_copy_35 [2019-10-02 10:05:13,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv___netdev_alloc_skb_36 [2019-10-02 10:05:13,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv___netdev_alloc_skb_37 [2019-10-02 10:05:13,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv___netdev_alloc_skb_38 [2019-10-02 10:05:13,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_pskb_expand_head_39 [2019-10-02 10:05:13,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_pskb_expand_head_40 [2019-10-02 10:05:13,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_clone_41 [2019-10-02 10:05:13,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kmem_cache_alloc_42 [2019-10-02 10:05:13,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_register_netdev_43 [2019-10-02 10:05:13,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_unregister_netdev_44 [2019-10-02 10:05:13,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_netdev_45 [2019-10-02 10:05:13,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-10-02 10:05:13,366 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_is_nonlinear [2019-10-02 10:05:13,366 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_tailroom [2019-10-02 10:05:13,366 INFO L138 BoogieDeclarations]: Found implementation of procedure netlink_kernel_create [2019-10-02 10:05:13,366 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_put [2019-10-02 10:05:13,366 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_msg_size [2019-10-02 10:05:13,367 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_total_size [2019-10-02 10:05:13,367 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_put [2019-10-02 10:05:13,367 INFO L138 BoogieDeclarations]: Found implementation of procedure netlink_rcv_cb [2019-10-02 10:05:13,367 INFO L138 BoogieDeclarations]: Found implementation of procedure netlink_rcv [2019-10-02 10:05:13,367 INFO L138 BoogieDeclarations]: Found implementation of procedure netlink_init [2019-10-02 10:05:13,367 INFO L138 BoogieDeclarations]: Found implementation of procedure netlink_exit [2019-10-02 10:05:13,367 INFO L138 BoogieDeclarations]: Found implementation of procedure netlink_send [2019-10-02 10:05:13,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_queue_work_on_68 [2019-10-02 10:05:13,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_queue_delayed_work_on_69 [2019-10-02 10:05:13,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_queue_work_on_70 [2019-10-02 10:05:13,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_flush_workqueue_71 [2019-10-02 10:05:13,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_queue_delayed_work_on_72 [2019-10-02 10:05:13,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kmem_cache_alloc_78 [2019-10-02 10:05:13,368 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_skb [2019-10-02 10:05:13,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_pskb_expand_head_84 [2019-10-02 10:05:13,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_clone_86 [2019-10-02 10:05:13,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_copy_88 [2019-10-02 10:05:13,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv___netdev_alloc_skb_89 [2019-10-02 10:05:13,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv___netdev_alloc_skb_90 [2019-10-02 10:05:13,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv___netdev_alloc_skb_91 [2019-10-02 10:05:13,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_pskb_expand_head_92 [2019-10-02 10:05:13,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_pskb_expand_head_93 [2019-10-02 10:05:13,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_clone_94 [2019-10-02 10:05:13,370 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2019-10-02 10:05:13,370 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2019-10-02 10:05:13,370 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2019-10-02 10:05:13,370 INFO L138 BoogieDeclarations]: Found implementation of procedure list_empty [2019-10-02 10:05:13,370 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2019-10-02 10:05:13,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_111 [2019-10-02 10:05:13,371 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_work [2019-10-02 10:05:13,371 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2019-10-02 10:05:13,371 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2019-10-02 10:05:13,371 INFO L138 BoogieDeclarations]: Found implementation of procedure pm_runtime_mark_last_busy [2019-10-02 10:05:13,371 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2019-10-02 10:05:13,371 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2019-10-02 10:05:13,372 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2019-10-02 10:05:13,372 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_mark_last_busy [2019-10-02 10:05:13,372 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2019-10-02 10:05:13,372 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2019-10-02 10:05:13,372 INFO L138 BoogieDeclarations]: Found implementation of procedure request_mac_address [2019-10-02 10:05:13,372 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_tx_struct [2019-10-02 10:05:13,372 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_tx_sdu_struct [2019-10-02 10:05:13,373 INFO L138 BoogieDeclarations]: Found implementation of procedure free_tx_struct [2019-10-02 10:05:13,373 INFO L138 BoogieDeclarations]: Found implementation of procedure free_tx_sdu_struct [2019-10-02 10:05:13,373 INFO L138 BoogieDeclarations]: Found implementation of procedure get_tx_sdu_struct [2019-10-02 10:05:13,373 INFO L138 BoogieDeclarations]: Found implementation of procedure put_tx_struct [2019-10-02 10:05:13,373 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_rx_struct [2019-10-02 10:05:13,373 INFO L138 BoogieDeclarations]: Found implementation of procedure free_rx_struct [2019-10-02 10:05:13,374 INFO L138 BoogieDeclarations]: Found implementation of procedure get_rx_struct [2019-10-02 10:05:13,374 INFO L138 BoogieDeclarations]: Found implementation of procedure put_rx_struct [2019-10-02 10:05:13,374 INFO L138 BoogieDeclarations]: Found implementation of procedure release_usb [2019-10-02 10:05:13,374 INFO L138 BoogieDeclarations]: Found implementation of procedure init_usb [2019-10-02 10:05:13,374 INFO L138 BoogieDeclarations]: Found implementation of procedure set_mac_address [2019-10-02 10:05:13,374 INFO L138 BoogieDeclarations]: Found implementation of procedure do_rx [2019-10-02 10:05:13,375 INFO L138 BoogieDeclarations]: Found implementation of procedure remove_rx_submit_list [2019-10-02 10:05:13,375 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_usb_rcv_complete [2019-10-02 10:05:13,375 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_usb_recv [2019-10-02 10:05:13,375 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_usb_send_complete [2019-10-02 10:05:13,375 INFO L138 BoogieDeclarations]: Found implementation of procedure send_tx_packet [2019-10-02 10:05:13,375 INFO L138 BoogieDeclarations]: Found implementation of procedure packet_aggregation [2019-10-02 10:05:13,375 INFO L138 BoogieDeclarations]: Found implementation of procedure do_tx [2019-10-02 10:05:13,376 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_usb_sdu_send [2019-10-02 10:05:13,376 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_usb_hci_send [2019-10-02 10:05:13,376 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_usb_get_endian [2019-10-02 10:05:13,376 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_usb_probe [2019-10-02 10:05:13,376 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_usb_disconnect [2019-10-02 10:05:13,376 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_usb_suspend [2019-10-02 10:05:13,376 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_usb_resume [2019-10-02 10:05:13,377 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_usb_lte_init [2019-10-02 10:05:13,377 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_usb_lte_exit [2019-10-02 10:05:13,377 INFO L138 BoogieDeclarations]: Found implementation of procedure call_and_disable_work_1 [2019-10-02 10:05:13,377 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_work_2 [2019-10-02 10:05:13,377 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_work_1 [2019-10-02 10:05:13,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_driver_3 [2019-10-02 10:05:13,377 INFO L138 BoogieDeclarations]: Found implementation of procedure work_init_2 [2019-10-02 10:05:13,377 INFO L138 BoogieDeclarations]: Found implementation of procedure work_init_1 [2019-10-02 10:05:13,378 INFO L138 BoogieDeclarations]: Found implementation of procedure call_and_disable_all_2 [2019-10-02 10:05:13,378 INFO L138 BoogieDeclarations]: Found implementation of procedure call_and_disable_all_1 [2019-10-02 10:05:13,378 INFO L138 BoogieDeclarations]: Found implementation of procedure invoke_work_1 [2019-10-02 10:05:13,378 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_work_2 [2019-10-02 10:05:13,378 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_work_1 [2019-10-02 10:05:13,378 INFO L138 BoogieDeclarations]: Found implementation of procedure call_and_disable_work_2 [2019-10-02 10:05:13,378 INFO L138 BoogieDeclarations]: Found implementation of procedure invoke_work_2 [2019-10-02 10:05:13,378 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 10:05:13,379 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2019-10-02 10:05:13,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_queue_work_on_114 [2019-10-02 10:05:13,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_queue_delayed_work_on_115 [2019-10-02 10:05:13,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_queue_work_on_116 [2019-10-02 10:05:13,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_flush_workqueue_117 [2019-10-02 10:05:13,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_queue_delayed_work_on_118 [2019-10-02 10:05:13,379 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2019-10-02 10:05:13,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kmem_cache_alloc_124 [2019-10-02 10:05:13,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_pskb_expand_head_130 [2019-10-02 10:05:13,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_clone_132 [2019-10-02 10:05:13,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_copy_134 [2019-10-02 10:05:13,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv___netdev_alloc_skb_135 [2019-10-02 10:05:13,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv___netdev_alloc_skb_136 [2019-10-02 10:05:13,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv___netdev_alloc_skb_137 [2019-10-02 10:05:13,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_pskb_expand_head_138 [2019-10-02 10:05:13,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_pskb_expand_head_139 [2019-10-02 10:05:13,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_clone_140 [2019-10-02 10:05:13,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_alloc_urb_141 [2019-10-02 10:05:13,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_alloc_urb_142 [2019-10-02 10:05:13,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_143 [2019-10-02 10:05:13,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_144 [2019-10-02 10:05:13,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_145 [2019-10-02 10:05:13,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_register_driver_146 [2019-10-02 10:05:13,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_deregister_147 [2019-10-02 10:05:13,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_flush_workqueue_148 [2019-10-02 10:05:13,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_workqueue_149 [2019-10-02 10:05:13,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_flush_workqueue_150 [2019-10-02 10:05:13,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_workqueue_151 [2019-10-02 10:05:13,382 INFO L138 BoogieDeclarations]: Found implementation of procedure __arch_swab32 [2019-10-02 10:05:13,382 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2019-10-02 10:05:13,382 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_set_endian [2019-10-02 10:05:13,383 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_cpu_to_dev16 [2019-10-02 10:05:13,383 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_dev16_to_cpu [2019-10-02 10:05:13,383 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_cpu_to_dev32 [2019-10-02 10:05:13,383 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_dev32_to_cpu [2019-10-02 10:05:13,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_queue_work_on_177 [2019-10-02 10:05:13,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_queue_delayed_work_on_178 [2019-10-02 10:05:13,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_queue_work_on_179 [2019-10-02 10:05:13,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_flush_workqueue_180 [2019-10-02 10:05:13,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_queue_delayed_work_on_181 [2019-10-02 10:05:13,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kmem_cache_alloc_187 [2019-10-02 10:05:13,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-10-02 10:05:13,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2019-10-02 10:05:13,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_err_ptr [2019-10-02 10:05:13,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_ptr_err [2019-10-02 10:05:13,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err_or_null [2019-10-02 10:05:13,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2019-10-02 10:05:13,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags_and_return_some_page [2019-10-02 10:05:13,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_nonatomic [2019-10-02 10:05:13,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock [2019-10-02 10:05:13,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock [2019-10-02 10:05:13,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_trylock [2019-10-02 10:05:13,386 INFO L138 BoogieDeclarations]: Found implementation of procedure __alloc_workqueue_key [2019-10-02 10:05:13,386 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_work [2019-10-02 10:05:13,386 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2019-10-02 10:05:13,386 INFO L138 BoogieDeclarations]: Found implementation of procedure __netlink_kernel_create [2019-10-02 10:05:13,386 INFO L138 BoogieDeclarations]: Found implementation of procedure __nlmsg_put [2019-10-02 10:05:13,386 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2019-10-02 10:05:13,386 INFO L138 BoogieDeclarations]: Found implementation of procedure _dev_info [2019-10-02 10:05:13,386 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_unlock_irqrestore [2019-10-02 10:05:13,387 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_netdev_mqs [2019-10-02 10:05:13,387 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2019-10-02 10:05:13,387 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_workqueue [2019-10-02 10:05:13,387 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2019-10-02 10:05:13,387 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_by_index [2019-10-02 10:05:13,387 INFO L138 BoogieDeclarations]: Found implementation of procedure flush_workqueue [2019-10-02 10:05:13,387 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2019-10-02 10:05:13,387 INFO L138 BoogieDeclarations]: Found implementation of procedure get_random_bytes [2019-10-02 10:05:13,388 INFO L138 BoogieDeclarations]: Found implementation of procedure init_timer_key [2019-10-02 10:05:13,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-10-02 10:05:13,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-10-02 10:05:13,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_ndo_init_4 [2019-10-02 10:05:13,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_ndo_uninit_4 [2019-10-02 10:05:13,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_some_page [2019-10-02 10:05:13,388 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2019-10-02 10:05:13,388 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_init_map [2019-10-02 10:05:13,389 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2019-10-02 10:05:13,389 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2019-10-02 10:05:13,389 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_err [2019-10-02 10:05:13,389 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_info [2019-10-02 10:05:13,389 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_on [2019-10-02 10:05:13,389 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_rx_ni [2019-10-02 10:05:13,389 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_wake_queue [2019-10-02 10:05:13,389 INFO L138 BoogieDeclarations]: Found implementation of procedure netlink_broadcast [2019-10-02 10:05:13,390 INFO L138 BoogieDeclarations]: Found implementation of procedure netlink_has_listeners [2019-10-02 10:05:13,390 INFO L138 BoogieDeclarations]: Found implementation of procedure pm_runtime_set_autosuspend_delay [2019-10-02 10:05:13,390 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-10-02 10:05:13,390 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_delayed_work_on [2019-10-02 10:05:13,390 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_work_on [2019-10-02 10:05:13,390 INFO L138 BoogieDeclarations]: Found implementation of procedure register_netdev [2019-10-02 10:05:13,390 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_pull [2019-10-02 10:05:13,391 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2019-10-02 10:05:13,391 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_release [2019-10-02 10:05:13,391 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2019-10-02 10:05:13,391 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_get_interface [2019-10-02 10:05:13,391 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_put_interface [2019-10-02 10:05:13,391 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2019-10-02 10:05:13,391 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_deregister [2019-10-02 10:05:13,392 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_enable_autosuspend [2019-10-02 10:05:13,392 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2019-10-02 10:05:13,392 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_dev [2019-10-02 10:05:13,392 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2019-10-02 10:05:13,392 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_put_dev [2019-10-02 10:05:13,392 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register_driver [2019-10-02 10:05:13,392 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-10-02 10:05:13,392 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-10-02 10:05:13,393 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-10-02 10:05:13,393 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-10-02 10:05:13,393 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-10-02 10:05:13,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 10:05:13,393 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2019-10-02 10:05:13,393 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2019-10-02 10:05:13,394 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2019-10-02 10:05:13,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 10:05:13,394 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2019-10-02 10:05:13,394 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-10-02 10:05:13,394 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2019-10-02 10:05:13,394 INFO L130 BoogieDeclarations]: Found specification of procedure sscanf [2019-10-02 10:05:13,394 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 10:05:13,394 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-02 10:05:13,395 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-10-02 10:05:13,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 10:05:13,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-10-02 10:05:13,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-02 10:05:13,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 10:05:13,395 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-10-02 10:05:13,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 10:05:13,396 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-10-02 10:05:13,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-10-02 10:05:13,396 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2019-10-02 10:05:13,396 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2019-10-02 10:05:13,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-10-02 10:05:13,396 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2019-10-02 10:05:13,396 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ptr [2019-10-02 10:05:13,397 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2019-10-02 10:05:13,397 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2019-10-02 10:05:13,397 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-10-02 10:05:13,397 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2019-10-02 10:05:13,397 INFO L130 BoogieDeclarations]: Found specification of procedure queue_work_on [2019-10-02 10:05:13,397 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_queue_work_on_15 [2019-10-02 10:05:13,397 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_queue_work_on_17 [2019-10-02 10:05:13,397 INFO L130 BoogieDeclarations]: Found specification of procedure queue_delayed_work_on [2019-10-02 10:05:13,397 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_queue_delayed_work_on_16 [2019-10-02 10:05:13,398 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_queue_delayed_work_on_19 [2019-10-02 10:05:13,398 INFO L130 BoogieDeclarations]: Found specification of procedure flush_workqueue [2019-10-02 10:05:13,398 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_flush_workqueue_18 [2019-10-02 10:05:13,398 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kmem_cache_alloc_25 [2019-10-02 10:05:13,398 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kmem_cache_alloc_42 [2019-10-02 10:05:13,398 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2019-10-02 10:05:13,398 INFO L130 BoogieDeclarations]: Found specification of procedure call_and_disable_all_1 [2019-10-02 10:05:13,398 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_net_device_ops_4 [2019-10-02 10:05:13,399 INFO L130 BoogieDeclarations]: Found specification of procedure activate_work_1 [2019-10-02 10:05:13,399 INFO L130 BoogieDeclarations]: Found specification of procedure get_random_bytes [2019-10-02 10:05:13,399 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2019-10-02 10:05:13,399 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_clone_33 [2019-10-02 10:05:13,399 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_clone_41 [2019-10-02 10:05:13,399 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_copy_35 [2019-10-02 10:05:13,399 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_pskb_expand_head_31 [2019-10-02 10:05:13,399 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_pskb_expand_head_39 [2019-10-02 10:05:13,400 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_pskb_expand_head_40 [2019-10-02 10:05:13,400 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2019-10-02 10:05:13,400 INFO L130 BoogieDeclarations]: Found specification of procedure skb_pull [2019-10-02 10:05:13,400 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reserve [2019-10-02 10:05:13,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 10:05:13,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 10:05:13,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 10:05:13,400 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reset_mac_header [2019-10-02 10:05:13,401 INFO L130 BoogieDeclarations]: Found specification of procedure ldv___netdev_alloc_skb_36 [2019-10-02 10:05:13,401 INFO L130 BoogieDeclarations]: Found specification of procedure ldv___netdev_alloc_skb_37 [2019-10-02 10:05:13,401 INFO L130 BoogieDeclarations]: Found specification of procedure ldv___netdev_alloc_skb_38 [2019-10-02 10:05:13,401 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_alloc_skb [2019-10-02 10:05:13,401 INFO L130 BoogieDeclarations]: Found specification of procedure dev_alloc_skb [2019-10-02 10:05:13,401 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2019-10-02 10:05:13,401 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2019-10-02 10:05:13,401 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2019-10-02 10:05:13,402 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_netdev_45 [2019-10-02 10:05:13,402 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2019-10-02 10:05:13,402 INFO L130 BoogieDeclarations]: Found specification of procedure netif_start_queue [2019-10-02 10:05:13,402 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_wake_queue [2019-10-02 10:05:13,402 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2019-10-02 10:05:13,402 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_stop_queue [2019-10-02 10:05:13,402 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2019-10-02 10:05:13,402 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_queue_stopped [2019-10-02 10:05:13,403 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2019-10-02 10:05:13,403 INFO L130 BoogieDeclarations]: Found specification of procedure netif_rx_ni [2019-10-02 10:05:13,403 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_on [2019-10-02 10:05:13,403 INFO L130 BoogieDeclarations]: Found specification of procedure ether_setup [2019-10-02 10:05:13,403 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_netdev_mqs [2019-10-02 10:05:13,403 INFO L130 BoogieDeclarations]: Found specification of procedure register_netdev [2019-10-02 10:05:13,403 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_register_netdev_43 [2019-10-02 10:05:13,403 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2019-10-02 10:05:13,404 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_unregister_netdev_44 [2019-10-02 10:05:13,404 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_err [2019-10-02 10:05:13,404 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_info [2019-10-02 10:05:13,404 INFO L130 BoogieDeclarations]: Found specification of procedure is_zero_ether_addr [2019-10-02 10:05:13,404 INFO L130 BoogieDeclarations]: Found specification of procedure eth_random_addr [2019-10-02 10:05:13,404 INFO L130 BoogieDeclarations]: Found specification of procedure ether_addr_copy [2019-10-02 10:05:13,404 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_dev16_to_cpu [2019-10-02 10:05:13,404 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_dev32_to_cpu [2019-10-02 10:05:13,405 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_lte_event_init [2019-10-02 10:05:13,405 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_lte_event_exit [2019-10-02 10:05:13,405 INFO L130 BoogieDeclarations]: Found specification of procedure start_rx_proc [2019-10-02 10:05:13,405 INFO L130 BoogieDeclarations]: Found specification of procedure register_lte_device [2019-10-02 10:05:13,405 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_lte_device [2019-10-02 10:05:13,405 INFO L130 BoogieDeclarations]: Found specification of procedure netlink_init [2019-10-02 10:05:13,405 INFO L130 BoogieDeclarations]: Found specification of procedure netlink_exit [2019-10-02 10:05:13,406 INFO L130 BoogieDeclarations]: Found specification of procedure netlink_send [2019-10-02 10:05:13,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 10:05:13,406 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_lte_open [2019-10-02 10:05:13,406 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_lte_close [2019-10-02 10:05:13,406 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_lte_set_config [2019-10-02 10:05:13,406 INFO L130 BoogieDeclarations]: Found specification of procedure tx_complete [2019-10-02 10:05:13,406 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_lte_rx [2019-10-02 10:05:13,406 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_lte_emulate_arp [2019-10-02 10:05:13,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-10-02 10:05:13,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 10:05:13,407 INFO L130 BoogieDeclarations]: Found specification of procedure icmp6_checksum [2019-10-02 10:05:13,407 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_lte_emulate_ndp [2019-10-02 10:05:13,407 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_lte_tx_nic_type [2019-10-02 10:05:13,407 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_lte_tx [2019-10-02 10:05:13,407 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~X~int~X~$Pointer$~X~$Pointer$~X~int~X~int~TO~int [2019-10-02 10:05:13,408 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_lte_stats [2019-10-02 10:05:13,408 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_lte_event_send [2019-10-02 10:05:13,408 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2019-10-02 10:05:13,408 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_lte_event_rcv [2019-10-02 10:05:13,408 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~$Pointer$~X~$Pointer$~TO~int [2019-10-02 10:05:13,408 INFO L130 BoogieDeclarations]: Found specification of procedure find_dev_index [2019-10-02 10:05:13,408 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_lte_netif_rx [2019-10-02 10:05:13,409 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_lte_multi_sdu_pkt [2019-10-02 10:05:13,409 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_lte_pdn_table [2019-10-02 10:05:13,409 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_lte_receive_pkt [2019-10-02 10:05:13,409 INFO L130 BoogieDeclarations]: Found specification of procedure rx_complete [2019-10-02 10:05:13,409 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~$Pointer$~X~int~TO~int [2019-10-02 10:05:13,409 INFO L130 BoogieDeclarations]: Found specification of procedure form_mac_address [2019-10-02 10:05:13,409 INFO L130 BoogieDeclarations]: Found specification of procedure validate_mac_address [2019-10-02 10:05:13,409 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_ndo_init_4 [2019-10-02 10:05:13,410 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_ndo_uninit_4 [2019-10-02 10:05:13,410 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_main_exported_4 [2019-10-02 10:05:13,410 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-10-02 10:05:13,410 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2019-10-02 10:05:13,410 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_size_call_parameter [2019-10-02 10:05:13,410 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2019-10-02 10:05:13,410 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2019-10-02 10:05:13,411 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_queue_work_on_68 [2019-10-02 10:05:13,411 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_queue_work_on_70 [2019-10-02 10:05:13,411 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_queue_delayed_work_on_69 [2019-10-02 10:05:13,411 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_queue_delayed_work_on_72 [2019-10-02 10:05:13,411 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_flush_workqueue_71 [2019-10-02 10:05:13,411 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kmem_cache_alloc_78 [2019-10-02 10:05:13,411 INFO L130 BoogieDeclarations]: Found specification of procedure sock_release [2019-10-02 10:05:13,411 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_skb [2019-10-02 10:05:13,412 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_clone_86 [2019-10-02 10:05:13,412 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_clone_94 [2019-10-02 10:05:13,412 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_copy_88 [2019-10-02 10:05:13,412 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_pskb_expand_head_84 [2019-10-02 10:05:13,412 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_pskb_expand_head_92 [2019-10-02 10:05:13,412 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_pskb_expand_head_93 [2019-10-02 10:05:13,412 INFO L130 BoogieDeclarations]: Found specification of procedure skb_is_nonlinear [2019-10-02 10:05:13,412 INFO L130 BoogieDeclarations]: Found specification of procedure skb_tailroom [2019-10-02 10:05:13,412 INFO L130 BoogieDeclarations]: Found specification of procedure ldv___netdev_alloc_skb_89 [2019-10-02 10:05:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure ldv___netdev_alloc_skb_90 [2019-10-02 10:05:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure ldv___netdev_alloc_skb_91 [2019-10-02 10:05:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure __netlink_kernel_create [2019-10-02 10:05:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure netlink_kernel_create [2019-10-02 10:05:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure netlink_has_listeners [2019-10-02 10:05:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure netlink_broadcast [2019-10-02 10:05:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure __nlmsg_put [2019-10-02 10:05:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_by_index [2019-10-02 10:05:13,414 INFO L130 BoogieDeclarations]: Found specification of procedure dev_put [2019-10-02 10:05:13,414 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_msg_size [2019-10-02 10:05:13,414 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_total_size [2019-10-02 10:05:13,414 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_put [2019-10-02 10:05:13,414 INFO L130 BoogieDeclarations]: Found specification of procedure netlink_rcv_cb [2019-10-02 10:05:13,414 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~u16~0~X~$Pointer$~X~int~TO~VOID [2019-10-02 10:05:13,414 INFO L130 BoogieDeclarations]: Found specification of procedure netlink_rcv [2019-10-02 10:05:13,414 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock [2019-10-02 10:05:13,415 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock [2019-10-02 10:05:13,415 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2019-10-02 10:05:13,415 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2019-10-02 10:05:13,415 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2019-10-02 10:05:13,415 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2019-10-02 10:05:13,415 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2019-10-02 10:05:13,415 INFO L130 BoogieDeclarations]: Found specification of procedure list_empty [2019-10-02 10:05:13,416 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_init_map [2019-10-02 10:05:13,416 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2019-10-02 10:05:13,416 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_unlock_irqrestore [2019-10-02 10:05:13,416 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2019-10-02 10:05:13,416 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_111 [2019-10-02 10:05:13,416 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2019-10-02 10:05:13,416 INFO L130 BoogieDeclarations]: Found specification of procedure init_timer_key [2019-10-02 10:05:13,416 INFO L130 BoogieDeclarations]: Found specification of procedure delayed_work_timer_fn [2019-10-02 10:05:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure __init_work [2019-10-02 10:05:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure __alloc_workqueue_key [2019-10-02 10:05:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_workqueue [2019-10-02 10:05:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_workqueue_149 [2019-10-02 10:05:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_workqueue_151 [2019-10-02 10:05:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_queue_work_on_114 [2019-10-02 10:05:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_queue_work_on_116 [2019-10-02 10:05:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_queue_delayed_work_on_115 [2019-10-02 10:05:13,418 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_queue_delayed_work_on_118 [2019-10-02 10:05:13,418 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_flush_workqueue_117 [2019-10-02 10:05:13,418 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_flush_workqueue_148 [2019-10-02 10:05:13,418 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_flush_workqueue_150 [2019-10-02 10:05:13,418 INFO L130 BoogieDeclarations]: Found specification of procedure queue_work [2019-10-02 10:05:13,418 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-10-02 10:05:13,418 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kmem_cache_alloc_124 [2019-10-02 10:05:13,418 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2019-10-02 10:05:13,419 INFO L130 BoogieDeclarations]: Found specification of procedure call_and_disable_work_1 [2019-10-02 10:05:13,419 INFO L130 BoogieDeclarations]: Found specification of procedure disable_work_2 [2019-10-02 10:05:13,419 INFO L130 BoogieDeclarations]: Found specification of procedure disable_work_1 [2019-10-02 10:05:13,419 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_driver_3 [2019-10-02 10:05:13,419 INFO L130 BoogieDeclarations]: Found specification of procedure work_init_2 [2019-10-02 10:05:13,419 INFO L130 BoogieDeclarations]: Found specification of procedure work_init_1 [2019-10-02 10:05:13,419 INFO L130 BoogieDeclarations]: Found specification of procedure call_and_disable_all_2 [2019-10-02 10:05:13,513 INFO L130 BoogieDeclarations]: Found specification of procedure invoke_work_1 [2019-10-02 10:05:13,513 INFO L130 BoogieDeclarations]: Found specification of procedure activate_work_2 [2019-10-02 10:05:13,514 INFO L130 BoogieDeclarations]: Found specification of procedure call_and_disable_work_2 [2019-10-02 10:05:13,514 INFO L130 BoogieDeclarations]: Found specification of procedure invoke_work_2 [2019-10-02 10:05:13,514 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2019-10-02 10:05:13,514 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2019-10-02 10:05:13,514 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2019-10-02 10:05:13,514 INFO L130 BoogieDeclarations]: Found specification of procedure _dev_info [2019-10-02 10:05:13,514 INFO L130 BoogieDeclarations]: Found specification of procedure pm_runtime_set_autosuspend_delay [2019-10-02 10:05:13,514 INFO L130 BoogieDeclarations]: Found specification of procedure pm_runtime_mark_last_busy [2019-10-02 10:05:13,515 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2019-10-02 10:05:13,515 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2019-10-02 10:05:13,515 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2019-10-02 10:05:13,515 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_dev [2019-10-02 10:05:13,515 INFO L130 BoogieDeclarations]: Found specification of procedure usb_put_dev [2019-10-02 10:05:13,515 INFO L130 BoogieDeclarations]: Found specification of procedure usb_enable_autosuspend [2019-10-02 10:05:13,515 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_get_interface [2019-10-02 10:05:13,515 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_put_interface [2019-10-02 10:05:13,516 INFO L130 BoogieDeclarations]: Found specification of procedure usb_mark_last_busy [2019-10-02 10:05:13,516 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register_driver [2019-10-02 10:05:13,516 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_register_driver_146 [2019-10-02 10:05:13,516 INFO L130 BoogieDeclarations]: Found specification of procedure usb_deregister [2019-10-02 10:05:13,516 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_deregister_147 [2019-10-02 10:05:13,516 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2019-10-02 10:05:13,516 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_alloc_urb_141 [2019-10-02 10:05:13,516 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_alloc_urb_142 [2019-10-02 10:05:13,516 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2019-10-02 10:05:13,517 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_143 [2019-10-02 10:05:13,517 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_144 [2019-10-02 10:05:13,517 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_145 [2019-10-02 10:05:13,517 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2019-10-02 10:05:13,517 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2019-10-02 10:05:13,517 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2019-10-02 10:05:13,517 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_clone_132 [2019-10-02 10:05:13,518 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_clone_140 [2019-10-02 10:05:13,518 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_copy_134 [2019-10-02 10:05:13,518 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_pskb_expand_head_130 [2019-10-02 10:05:13,518 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_pskb_expand_head_138 [2019-10-02 10:05:13,518 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_pskb_expand_head_139 [2019-10-02 10:05:13,518 INFO L130 BoogieDeclarations]: Found specification of procedure ldv___netdev_alloc_skb_135 [2019-10-02 10:05:13,518 INFO L130 BoogieDeclarations]: Found specification of procedure ldv___netdev_alloc_skb_136 [2019-10-02 10:05:13,518 INFO L130 BoogieDeclarations]: Found specification of procedure ldv___netdev_alloc_skb_137 [2019-10-02 10:05:13,519 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_set_endian [2019-10-02 10:05:13,519 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_cpu_to_dev16 [2019-10-02 10:05:13,519 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_cpu_to_dev32 [2019-10-02 10:05:13,519 INFO L130 BoogieDeclarations]: Found specification of procedure do_tx [2019-10-02 10:05:13,519 INFO L130 BoogieDeclarations]: Found specification of procedure do_rx [2019-10-02 10:05:13,519 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_usb_recv [2019-10-02 10:05:13,519 INFO L130 BoogieDeclarations]: Found specification of procedure request_mac_address [2019-10-02 10:05:13,520 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_tx_struct [2019-10-02 10:05:13,520 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_tx_sdu_struct [2019-10-02 10:05:13,520 INFO L130 BoogieDeclarations]: Found specification of procedure free_tx_struct [2019-10-02 10:05:13,520 INFO L130 BoogieDeclarations]: Found specification of procedure free_tx_sdu_struct [2019-10-02 10:05:13,520 INFO L130 BoogieDeclarations]: Found specification of procedure get_tx_sdu_struct [2019-10-02 10:05:13,520 INFO L130 BoogieDeclarations]: Found specification of procedure put_tx_struct [2019-10-02 10:05:13,520 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_rx_struct [2019-10-02 10:05:13,520 INFO L130 BoogieDeclarations]: Found specification of procedure free_rx_struct [2019-10-02 10:05:13,520 INFO L130 BoogieDeclarations]: Found specification of procedure get_rx_struct [2019-10-02 10:05:13,521 INFO L130 BoogieDeclarations]: Found specification of procedure put_rx_struct [2019-10-02 10:05:13,521 INFO L130 BoogieDeclarations]: Found specification of procedure release_usb [2019-10-02 10:05:13,521 INFO L130 BoogieDeclarations]: Found specification of procedure init_usb [2019-10-02 10:05:13,521 INFO L130 BoogieDeclarations]: Found specification of procedure set_mac_address [2019-10-02 10:05:13,521 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~int [2019-10-02 10:05:13,521 INFO L130 BoogieDeclarations]: Found specification of procedure remove_rx_submit_list [2019-10-02 10:05:13,521 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_usb_rcv_complete [2019-10-02 10:05:13,521 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_usb_send_complete [2019-10-02 10:05:13,522 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-10-02 10:05:13,522 INFO L130 BoogieDeclarations]: Found specification of procedure send_tx_packet [2019-10-02 10:05:13,522 INFO L130 BoogieDeclarations]: Found specification of procedure packet_aggregation [2019-10-02 10:05:13,522 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_usb_sdu_send [2019-10-02 10:05:13,522 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_usb_hci_send [2019-10-02 10:05:13,522 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_usb_get_endian [2019-10-02 10:05:13,522 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_usb_probe [2019-10-02 10:05:13,523 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_usb_disconnect [2019-10-02 10:05:13,523 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_usb_suspend [2019-10-02 10:05:13,523 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_usb_resume [2019-10-02 10:05:13,523 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_usb_lte_init [2019-10-02 10:05:13,523 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_usb_lte_exit [2019-10-02 10:05:13,523 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-10-02 10:05:13,523 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-10-02 10:05:13,523 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 10:05:13,524 INFO L130 BoogieDeclarations]: Found specification of procedure __arch_swab32 [2019-10-02 10:05:13,524 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2019-10-02 10:05:13,524 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_queue_work_on_177 [2019-10-02 10:05:13,524 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_queue_work_on_179 [2019-10-02 10:05:13,524 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_queue_delayed_work_on_178 [2019-10-02 10:05:13,524 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_queue_delayed_work_on_181 [2019-10-02 10:05:13,524 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_flush_workqueue_180 [2019-10-02 10:05:13,525 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kmem_cache_alloc_187 [2019-10-02 10:05:13,525 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-10-02 10:05:13,525 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2019-10-02 10:05:13,525 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_err_ptr [2019-10-02 10:05:13,525 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_ptr_err [2019-10-02 10:05:13,525 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err_or_null [2019-10-02 10:05:13,525 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_some_page [2019-10-02 10:05:13,525 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags_and_return_some_page [2019-10-02 10:05:13,526 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_nonatomic [2019-10-02 10:05:13,526 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_trylock [2019-10-02 10:05:13,526 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-10-02 10:05:13,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-02 10:05:13,526 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 10:05:13,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 10:05:13,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 10:05:13,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-02 10:05:13,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 10:05:13,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-10-02 10:05:13,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-10-02 10:05:13,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-10-02 10:05:13,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-10-02 10:05:14,884 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2019-10-02 10:05:23,053 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 10:05:23,053 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-02 10:05:23,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 10:05:23 BoogieIcfgContainer [2019-10-02 10:05:23,056 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 10:05:23,057 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 10:05:23,057 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 10:05:23,061 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 10:05:23,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 10:05:08" (1/3) ... [2019-10-02 10:05:23,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37b004e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 10:05:23, skipping insertion in model container [2019-10-02 10:05:23,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:05:12" (2/3) ... [2019-10-02 10:05:23,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37b004e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 10:05:23, skipping insertion in model container [2019-10-02 10:05:23,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 10:05:23" (3/3) ... [2019-10-02 10:05:23,064 INFO L109 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-43_2a-drivers--staging--gdm724x--gdmulte.ko-entry_point.cil.out.i [2019-10-02 10:05:23,074 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 10:05:23,084 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 10:05:23,101 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 10:05:23,145 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 10:05:23,145 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 10:05:23,145 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 10:05:23,146 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 10:05:23,146 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 10:05:23,146 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 10:05:23,146 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 10:05:23,146 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 10:05:23,146 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 10:05:23,206 INFO L276 IsEmpty]: Start isEmpty. Operand 2168 states. [2019-10-02 10:05:23,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-02 10:05:23,222 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:05:23,223 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:05:23,226 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:05:23,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:05:23,232 INFO L82 PathProgramCache]: Analyzing trace with hash 909883369, now seen corresponding path program 1 times [2019-10-02 10:05:23,234 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:05:23,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:05:23,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:05:23,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:05:23,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:05:23,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:05:23,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:05:23,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:05:24,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 10:05:24,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 10:05:24,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 10:05:24,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 10:05:24,021 INFO L87 Difference]: Start difference. First operand 2168 states. Second operand 3 states. [2019-10-02 10:05:24,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:05:24,523 INFO L93 Difference]: Finished difference Result 5410 states and 7451 transitions. [2019-10-02 10:05:24,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 10:05:24,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-10-02 10:05:24,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:05:24,569 INFO L225 Difference]: With dead ends: 5410 [2019-10-02 10:05:24,569 INFO L226 Difference]: Without dead ends: 3470 [2019-10-02 10:05:24,586 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 10:05:24,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3470 states. [2019-10-02 10:05:24,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3470 to 3436. [2019-10-02 10:05:24,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3436 states. [2019-10-02 10:05:24,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3436 states to 3436 states and 4622 transitions. [2019-10-02 10:05:24,889 INFO L78 Accepts]: Start accepts. Automaton has 3436 states and 4622 transitions. Word has length 63 [2019-10-02 10:05:24,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:05:24,889 INFO L475 AbstractCegarLoop]: Abstraction has 3436 states and 4622 transitions. [2019-10-02 10:05:24,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 10:05:24,890 INFO L276 IsEmpty]: Start isEmpty. Operand 3436 states and 4622 transitions. [2019-10-02 10:05:24,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-02 10:05:24,905 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:05:24,906 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 10:05:24,906 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:05:24,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:05:24,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1020497842, now seen corresponding path program 1 times [2019-10-02 10:05:24,906 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:05:24,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:05:24,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:05:24,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:05:24,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:05:25,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:05:25,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 10:05:25,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:05:25,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 10:05:25,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 10:05:25,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 10:05:25,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 10:05:25,315 INFO L87 Difference]: Start difference. First operand 3436 states and 4622 transitions. Second operand 3 states. [2019-10-02 10:05:25,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:05:25,826 INFO L93 Difference]: Finished difference Result 10242 states and 13929 transitions. [2019-10-02 10:05:25,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 10:05:25,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-10-02 10:05:25,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:05:25,887 INFO L225 Difference]: With dead ends: 10242 [2019-10-02 10:05:25,887 INFO L226 Difference]: Without dead ends: 6834 [2019-10-02 10:05:25,906 INFO L640 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-10-02 10:05:25,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6834 states. [2019-10-02 10:05:26,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6834 to 6831. [2019-10-02 10:05:26,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6831 states. [2019-10-02 10:05:26,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6831 states to 6831 states and 9260 transitions. [2019-10-02 10:05:26,353 INFO L78 Accepts]: Start accepts. Automaton has 6831 states and 9260 transitions. Word has length 87 [2019-10-02 10:05:26,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:05:26,356 INFO L475 AbstractCegarLoop]: Abstraction has 6831 states and 9260 transitions. [2019-10-02 10:05:26,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 10:05:26,356 INFO L276 IsEmpty]: Start isEmpty. Operand 6831 states and 9260 transitions. [2019-10-02 10:05:26,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-02 10:05:26,361 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:05:26,362 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 10:05:26,362 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:05:26,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:05:26,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1587854656, now seen corresponding path program 1 times [2019-10-02 10:05:26,363 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:05:26,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:05:26,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:05:26,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:05:26,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:05:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:05:26,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 10:05:26,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:05:26,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 10:05:26,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 10:05:26,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 10:05:26,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 10:05:26,723 INFO L87 Difference]: Start difference. First operand 6831 states and 9260 transitions. Second operand 3 states. [2019-10-02 10:05:27,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:05:27,240 INFO L93 Difference]: Finished difference Result 16983 states and 23166 transitions. [2019-10-02 10:05:27,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 10:05:27,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-10-02 10:05:27,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:05:27,321 INFO L225 Difference]: With dead ends: 16983 [2019-10-02 10:05:27,321 INFO L226 Difference]: Without dead ends: 10180 [2019-10-02 10:05:27,354 INFO L640 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-10-02 10:05:27,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10180 states. [2019-10-02 10:05:27,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10180 to 10177. [2019-10-02 10:05:27,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10177 states. [2019-10-02 10:05:28,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10177 states to 10177 states and 13850 transitions. [2019-10-02 10:05:28,045 INFO L78 Accepts]: Start accepts. Automaton has 10177 states and 13850 transitions. Word has length 86 [2019-10-02 10:05:28,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:05:28,046 INFO L475 AbstractCegarLoop]: Abstraction has 10177 states and 13850 transitions. [2019-10-02 10:05:28,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 10:05:28,046 INFO L276 IsEmpty]: Start isEmpty. Operand 10177 states and 13850 transitions. [2019-10-02 10:05:28,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-02 10:05:28,050 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:05:28,050 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 10:05:28,050 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:05:28,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:05:28,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1823293623, now seen corresponding path program 1 times [2019-10-02 10:05:28,051 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:05:28,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:05:28,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:05:28,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:05:28,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:05:28,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:05:28,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 10:05:28,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:05:28,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 10:05:28,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 10:05:28,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 10:05:28,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 10:05:28,326 INFO L87 Difference]: Start difference. First operand 10177 states and 13850 transitions. Second operand 5 states. [2019-10-02 10:05:34,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:05:34,755 INFO L93 Difference]: Finished difference Result 23728 states and 32530 transitions. [2019-10-02 10:05:34,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 10:05:34,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-10-02 10:05:34,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:05:34,853 INFO L225 Difference]: With dead ends: 23728 [2019-10-02 10:05:34,853 INFO L226 Difference]: Without dead ends: 13579 [2019-10-02 10:05:34,905 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 10:05:34,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13579 states. [2019-10-02 10:05:36,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13579 to 13572. [2019-10-02 10:05:36,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13572 states. [2019-10-02 10:05:36,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13572 states to 13572 states and 18530 transitions. [2019-10-02 10:05:36,238 INFO L78 Accepts]: Start accepts. Automaton has 13572 states and 18530 transitions. Word has length 89 [2019-10-02 10:05:36,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:05:36,239 INFO L475 AbstractCegarLoop]: Abstraction has 13572 states and 18530 transitions. [2019-10-02 10:05:36,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 10:05:36,239 INFO L276 IsEmpty]: Start isEmpty. Operand 13572 states and 18530 transitions. [2019-10-02 10:05:36,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-02 10:05:36,242 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:05:36,242 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 10:05:36,243 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:05:36,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:05:36,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1430976521, now seen corresponding path program 1 times [2019-10-02 10:05:36,243 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:05:36,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:05:36,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:05:36,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:05:36,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:05:36,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:05:36,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 10:05:36,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:05:36,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 10:05:36,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 10:05:36,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 10:05:36,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 10:05:36,497 INFO L87 Difference]: Start difference. First operand 13572 states and 18530 transitions. Second operand 5 states. [2019-10-02 10:05:40,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:05:40,117 INFO L93 Difference]: Finished difference Result 29712 states and 40638 transitions. [2019-10-02 10:05:40,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 10:05:40,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2019-10-02 10:05:40,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:05:40,192 INFO L225 Difference]: With dead ends: 29712 [2019-10-02 10:05:40,193 INFO L226 Difference]: Without dead ends: 16094 [2019-10-02 10:05:40,235 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 10:05:40,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16094 states. [2019-10-02 10:05:40,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16094 to 16083. [2019-10-02 10:05:40,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16083 states. [2019-10-02 10:05:40,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16083 states to 16083 states and 21849 transitions. [2019-10-02 10:05:40,829 INFO L78 Accepts]: Start accepts. Automaton has 16083 states and 21849 transitions. Word has length 88 [2019-10-02 10:05:40,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:05:40,830 INFO L475 AbstractCegarLoop]: Abstraction has 16083 states and 21849 transitions. [2019-10-02 10:05:40,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 10:05:40,830 INFO L276 IsEmpty]: Start isEmpty. Operand 16083 states and 21849 transitions. [2019-10-02 10:05:40,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-02 10:05:40,836 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:05:40,837 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 10:05:40,837 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:05:40,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:05:40,838 INFO L82 PathProgramCache]: Analyzing trace with hash 2108771395, now seen corresponding path program 1 times [2019-10-02 10:05:40,838 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:05:40,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:05:40,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:05:40,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:05:40,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:05:40,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:05:41,144 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 10:05:41,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:05:41,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 10:05:41,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 10:05:41,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 10:05:41,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 10:05:41,148 INFO L87 Difference]: Start difference. First operand 16083 states and 21849 transitions. Second operand 3 states. [2019-10-02 10:05:41,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:05:41,663 INFO L93 Difference]: Finished difference Result 16547 states and 22409 transitions. [2019-10-02 10:05:41,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 10:05:41,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-10-02 10:05:41,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:05:41,743 INFO L225 Difference]: With dead ends: 16547 [2019-10-02 10:05:41,743 INFO L226 Difference]: Without dead ends: 16544 [2019-10-02 10:05:41,751 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 10:05:41,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16544 states. [2019-10-02 10:05:42,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16544 to 16544. [2019-10-02 10:05:42,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16544 states. [2019-10-02 10:05:42,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16544 states to 16544 states and 22397 transitions. [2019-10-02 10:05:42,429 INFO L78 Accepts]: Start accepts. Automaton has 16544 states and 22397 transitions. Word has length 114 [2019-10-02 10:05:42,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:05:42,430 INFO L475 AbstractCegarLoop]: Abstraction has 16544 states and 22397 transitions. [2019-10-02 10:05:42,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 10:05:42,431 INFO L276 IsEmpty]: Start isEmpty. Operand 16544 states and 22397 transitions. [2019-10-02 10:05:42,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-02 10:05:42,454 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:05:42,456 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 10:05:42,457 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:05:42,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:05:42,458 INFO L82 PathProgramCache]: Analyzing trace with hash 2005470300, now seen corresponding path program 1 times [2019-10-02 10:05:42,458 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:05:42,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:05:42,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:05:42,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:05:42,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:05:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:05:42,894 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 10:05:42,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:05:42,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 10:05:42,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 10:05:42,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 10:05:42,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 10:05:42,897 INFO L87 Difference]: Start difference. First operand 16544 states and 22397 transitions. Second operand 3 states. [2019-10-02 10:05:44,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:05:44,386 INFO L93 Difference]: Finished difference Result 40689 states and 55090 transitions. [2019-10-02 10:05:44,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 10:05:44,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 228 [2019-10-02 10:05:44,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:05:44,488 INFO L225 Difference]: With dead ends: 40689 [2019-10-02 10:05:44,488 INFO L226 Difference]: Without dead ends: 24173 [2019-10-02 10:05:44,542 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 10:05:44,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24173 states. [2019-10-02 10:05:45,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24173 to 24039. [2019-10-02 10:05:45,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24039 states. [2019-10-02 10:05:45,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24039 states to 24039 states and 32538 transitions. [2019-10-02 10:05:45,386 INFO L78 Accepts]: Start accepts. Automaton has 24039 states and 32538 transitions. Word has length 228 [2019-10-02 10:05:45,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:05:45,388 INFO L475 AbstractCegarLoop]: Abstraction has 24039 states and 32538 transitions. [2019-10-02 10:05:45,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 10:05:45,389 INFO L276 IsEmpty]: Start isEmpty. Operand 24039 states and 32538 transitions. [2019-10-02 10:05:45,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-10-02 10:05:45,421 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:05:45,421 INFO L411 BasicCegarLoop]: trace histogram [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, 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] [2019-10-02 10:05:45,422 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:05:45,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:05:45,422 INFO L82 PathProgramCache]: Analyzing trace with hash -2133493543, now seen corresponding path program 1 times [2019-10-02 10:05:45,422 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:05:45,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:05:45,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:05:45,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:05:45,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:05:45,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:05:45,689 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 10:05:45,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:05:45,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 10:05:45,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 10:05:45,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 10:05:45,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 10:05:45,691 INFO L87 Difference]: Start difference. First operand 24039 states and 32538 transitions. Second operand 3 states. [2019-10-02 10:05:47,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:05:47,469 INFO L93 Difference]: Finished difference Result 55704 states and 75401 transitions. [2019-10-02 10:05:47,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 10:05:47,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 251 [2019-10-02 10:05:47,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:05:47,612 INFO L225 Difference]: With dead ends: 55704 [2019-10-02 10:05:47,613 INFO L226 Difference]: Without dead ends: 31693 [2019-10-02 10:05:47,685 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 10:05:47,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31693 states. [2019-10-02 10:05:50,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31693 to 31559. [2019-10-02 10:05:50,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31559 states. [2019-10-02 10:05:50,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31559 states to 31559 states and 42713 transitions. [2019-10-02 10:05:50,255 INFO L78 Accepts]: Start accepts. Automaton has 31559 states and 42713 transitions. Word has length 251 [2019-10-02 10:05:50,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:05:50,256 INFO L475 AbstractCegarLoop]: Abstraction has 31559 states and 42713 transitions. [2019-10-02 10:05:50,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 10:05:50,257 INFO L276 IsEmpty]: Start isEmpty. Operand 31559 states and 42713 transitions. [2019-10-02 10:05:50,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-10-02 10:05:50,285 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:05:50,285 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:05:50,286 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:05:50,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:05:50,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1807375558, now seen corresponding path program 1 times [2019-10-02 10:05:50,286 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:05:50,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:05:50,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:05:50,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:05:50,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:05:50,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:05:50,626 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-10-02 10:05:50,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:05:50,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 10:05:50,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 10:05:50,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 10:05:50,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 10:05:50,628 INFO L87 Difference]: Start difference. First operand 31559 states and 42713 transitions. Second operand 5 states. [2019-10-02 10:05:52,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:05:52,689 INFO L93 Difference]: Finished difference Result 76508 states and 103340 transitions. [2019-10-02 10:05:52,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 10:05:52,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 278 [2019-10-02 10:05:52,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:05:53,129 INFO L225 Difference]: With dead ends: 76508 [2019-10-02 10:05:53,130 INFO L226 Difference]: Without dead ends: 44977 [2019-10-02 10:05:53,217 INFO L640 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-10-02 10:05:53,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44977 states. [2019-10-02 10:05:54,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44977 to 44964. [2019-10-02 10:05:54,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44964 states. [2019-10-02 10:05:54,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44964 states to 44964 states and 60640 transitions. [2019-10-02 10:05:54,422 INFO L78 Accepts]: Start accepts. Automaton has 44964 states and 60640 transitions. Word has length 278 [2019-10-02 10:05:54,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:05:54,423 INFO L475 AbstractCegarLoop]: Abstraction has 44964 states and 60640 transitions. [2019-10-02 10:05:54,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 10:05:54,423 INFO L276 IsEmpty]: Start isEmpty. Operand 44964 states and 60640 transitions. [2019-10-02 10:05:54,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-10-02 10:05:54,453 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:05:54,453 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:05:54,453 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:05:54,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:05:54,454 INFO L82 PathProgramCache]: Analyzing trace with hash -396109965, now seen corresponding path program 1 times [2019-10-02 10:05:54,454 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:05:54,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:05:54,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:05:54,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:05:54,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:05:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:05:54,700 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-10-02 10:05:54,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:05:54,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 10:05:54,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 10:05:54,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 10:05:54,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 10:05:54,702 INFO L87 Difference]: Start difference. First operand 44964 states and 60640 transitions. Second operand 3 states. [2019-10-02 10:05:56,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:05:56,597 INFO L93 Difference]: Finished difference Result 124927 states and 169961 transitions. [2019-10-02 10:05:56,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 10:05:56,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 301 [2019-10-02 10:05:56,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:05:56,960 INFO L225 Difference]: With dead ends: 124927 [2019-10-02 10:05:56,960 INFO L226 Difference]: Without dead ends: 79991 [2019-10-02 10:05:59,151 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 10:05:59,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79991 states. [2019-10-02 10:06:01,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79991 to 74952. [2019-10-02 10:06:01,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74952 states. [2019-10-02 10:06:01,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74952 states to 74952 states and 102262 transitions. [2019-10-02 10:06:01,327 INFO L78 Accepts]: Start accepts. Automaton has 74952 states and 102262 transitions. Word has length 301 [2019-10-02 10:06:01,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:06:01,327 INFO L475 AbstractCegarLoop]: Abstraction has 74952 states and 102262 transitions. [2019-10-02 10:06:01,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 10:06:01,328 INFO L276 IsEmpty]: Start isEmpty. Operand 74952 states and 102262 transitions. [2019-10-02 10:06:01,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-10-02 10:06:01,355 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:06:01,356 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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, 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] [2019-10-02 10:06:01,356 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:06:01,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:06:01,356 INFO L82 PathProgramCache]: Analyzing trace with hash -2109737547, now seen corresponding path program 1 times [2019-10-02 10:06:01,357 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:06:01,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:06:01,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:06:01,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:06:01,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:06:01,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:06:01,725 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-10-02 10:06:01,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:06:01,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 10:06:01,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 10:06:01,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 10:06:01,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 10:06:01,728 INFO L87 Difference]: Start difference. First operand 74952 states and 102262 transitions. Second operand 5 states. [2019-10-02 10:06:06,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:06:06,484 INFO L93 Difference]: Finished difference Result 174546 states and 238064 transitions. [2019-10-02 10:06:06,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 10:06:06,484 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 294 [2019-10-02 10:06:06,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:06:06,809 INFO L225 Difference]: With dead ends: 174546 [2019-10-02 10:06:06,809 INFO L226 Difference]: Without dead ends: 99630 [2019-10-02 10:06:06,934 INFO L640 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-10-02 10:06:07,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99630 states. [2019-10-02 10:06:08,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99630 to 74952. [2019-10-02 10:06:08,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74952 states. [2019-10-02 10:06:09,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74952 states to 74952 states and 102262 transitions. [2019-10-02 10:06:09,204 INFO L78 Accepts]: Start accepts. Automaton has 74952 states and 102262 transitions. Word has length 294 [2019-10-02 10:06:09,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:06:09,205 INFO L475 AbstractCegarLoop]: Abstraction has 74952 states and 102262 transitions. [2019-10-02 10:06:09,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 10:06:09,205 INFO L276 IsEmpty]: Start isEmpty. Operand 74952 states and 102262 transitions. [2019-10-02 10:06:09,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-10-02 10:06:09,229 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:06:09,230 INFO L411 BasicCegarLoop]: trace histogram [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, 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] [2019-10-02 10:06:09,230 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:06:09,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:06:09,230 INFO L82 PathProgramCache]: Analyzing trace with hash 88382866, now seen corresponding path program 1 times [2019-10-02 10:06:09,231 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:06:09,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:06:09,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:06:09,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:06:09,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:06:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:06:09,632 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-10-02 10:06:09,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:06:09,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 10:06:09,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 10:06:09,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 10:06:09,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 10:06:09,634 INFO L87 Difference]: Start difference. First operand 74952 states and 102262 transitions. Second operand 6 states. [2019-10-02 10:06:12,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:06:12,842 INFO L93 Difference]: Finished difference Result 174606 states and 238154 transitions. [2019-10-02 10:06:12,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 10:06:12,842 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 312 [2019-10-02 10:06:12,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:06:13,199 INFO L225 Difference]: With dead ends: 174606 [2019-10-02 10:06:13,200 INFO L226 Difference]: Without dead ends: 99690 [2019-10-02 10:06:13,325 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-10-02 10:06:13,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99690 states. [2019-10-02 10:06:18,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99690 to 74992. [2019-10-02 10:06:18,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74992 states. [2019-10-02 10:06:18,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74992 states to 74992 states and 102322 transitions. [2019-10-02 10:06:18,645 INFO L78 Accepts]: Start accepts. Automaton has 74992 states and 102322 transitions. Word has length 312 [2019-10-02 10:06:18,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:06:18,645 INFO L475 AbstractCegarLoop]: Abstraction has 74992 states and 102322 transitions. [2019-10-02 10:06:18,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 10:06:18,645 INFO L276 IsEmpty]: Start isEmpty. Operand 74992 states and 102322 transitions. [2019-10-02 10:06:18,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2019-10-02 10:06:18,668 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:06:18,669 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 5, 5, 4, 4, 4, 4, 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, 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] [2019-10-02 10:06:18,669 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:06:18,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:06:18,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1226581916, now seen corresponding path program 1 times [2019-10-02 10:06:18,670 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:06:18,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:06:18,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:06:18,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:06:18,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:06:18,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:06:19,095 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-10-02 10:06:19,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:06:19,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 10:06:19,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 10:06:19,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 10:06:19,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 10:06:19,103 INFO L87 Difference]: Start difference. First operand 74992 states and 102322 transitions. Second operand 3 states. [2019-10-02 10:06:21,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:06:21,184 INFO L93 Difference]: Finished difference Result 150268 states and 205147 transitions. [2019-10-02 10:06:21,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 10:06:21,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 423 [2019-10-02 10:06:21,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:06:21,418 INFO L225 Difference]: With dead ends: 150268 [2019-10-02 10:06:21,418 INFO L226 Difference]: Without dead ends: 75312 [2019-10-02 10:06:21,547 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 10:06:21,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75312 states. [2019-10-02 10:06:26,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75312 to 75032. [2019-10-02 10:06:26,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75032 states. [2019-10-02 10:06:26,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75032 states to 75032 states and 102362 transitions. [2019-10-02 10:06:26,893 INFO L78 Accepts]: Start accepts. Automaton has 75032 states and 102362 transitions. Word has length 423 [2019-10-02 10:06:26,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:06:26,894 INFO L475 AbstractCegarLoop]: Abstraction has 75032 states and 102362 transitions. [2019-10-02 10:06:26,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 10:06:26,894 INFO L276 IsEmpty]: Start isEmpty. Operand 75032 states and 102362 transitions. [2019-10-02 10:06:26,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2019-10-02 10:06:26,917 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:06:26,917 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:06:26,918 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:06:26,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:06:26,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1062433936, now seen corresponding path program 1 times [2019-10-02 10:06:26,918 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:06:26,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:06:26,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:06:26,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:06:26,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:06:27,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:06:27,599 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2019-10-02 10:06:27,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:06:27,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 10:06:27,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 10:06:27,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 10:06:27,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 10:06:27,602 INFO L87 Difference]: Start difference. First operand 75032 states and 102362 transitions. Second operand 9 states. [2019-10-02 10:06:30,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:06:30,566 INFO L93 Difference]: Finished difference Result 175016 states and 238704 transitions. [2019-10-02 10:06:30,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 10:06:30,566 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 501 [2019-10-02 10:06:30,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:06:30,857 INFO L225 Difference]: With dead ends: 175016 [2019-10-02 10:06:30,857 INFO L226 Difference]: Without dead ends: 100020 [2019-10-02 10:06:30,973 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2019-10-02 10:06:31,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100020 states. [2019-10-02 10:06:32,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100020 to 75132. [2019-10-02 10:06:32,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75132 states. [2019-10-02 10:06:33,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75132 states to 75132 states and 102482 transitions. [2019-10-02 10:06:33,768 INFO L78 Accepts]: Start accepts. Automaton has 75132 states and 102482 transitions. Word has length 501 [2019-10-02 10:06:33,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:06:33,768 INFO L475 AbstractCegarLoop]: Abstraction has 75132 states and 102482 transitions. [2019-10-02 10:06:33,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 10:06:33,769 INFO L276 IsEmpty]: Start isEmpty. Operand 75132 states and 102482 transitions. [2019-10-02 10:06:33,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2019-10-02 10:06:33,785 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:06:33,785 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-10-02 10:06:33,785 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:06:33,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:06:33,786 INFO L82 PathProgramCache]: Analyzing trace with hash 441738798, now seen corresponding path program 1 times [2019-10-02 10:06:33,786 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:06:33,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:06:33,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:06:33,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:06:33,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:06:33,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:06:34,240 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2019-10-02 10:06:34,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:06:34,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 10:06:34,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 10:06:34,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 10:06:34,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 10:06:34,244 INFO L87 Difference]: Start difference. First operand 75132 states and 102482 transitions. Second operand 3 states. [2019-10-02 10:06:36,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:06:36,094 INFO L93 Difference]: Finished difference Result 150428 states and 205327 transitions. [2019-10-02 10:06:36,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 10:06:36,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 490 [2019-10-02 10:06:36,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:06:36,360 INFO L225 Difference]: With dead ends: 150428 [2019-10-02 10:06:36,361 INFO L226 Difference]: Without dead ends: 75332 [2019-10-02 10:06:36,506 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 10:06:36,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75332 states. [2019-10-02 10:06:41,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75332 to 75152. [2019-10-02 10:06:41,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75152 states. [2019-10-02 10:06:41,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75152 states to 75152 states and 102502 transitions. [2019-10-02 10:06:41,858 INFO L78 Accepts]: Start accepts. Automaton has 75152 states and 102502 transitions. Word has length 490 [2019-10-02 10:06:41,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:06:41,858 INFO L475 AbstractCegarLoop]: Abstraction has 75152 states and 102502 transitions. [2019-10-02 10:06:41,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 10:06:41,859 INFO L276 IsEmpty]: Start isEmpty. Operand 75152 states and 102502 transitions. [2019-10-02 10:06:41,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2019-10-02 10:06:41,880 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:06:41,881 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-10-02 10:06:41,881 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:06:41,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:06:41,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1956194232, now seen corresponding path program 1 times [2019-10-02 10:06:41,881 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:06:41,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:06:41,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:06:41,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:06:41,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:06:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:06:42,300 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2019-10-02 10:06:42,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:06:42,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 10:06:42,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 10:06:42,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 10:06:42,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 10:06:42,302 INFO L87 Difference]: Start difference. First operand 75152 states and 102502 transitions. Second operand 5 states. [2019-10-02 10:06:44,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:06:44,319 INFO L93 Difference]: Finished difference Result 150308 states and 205027 transitions. [2019-10-02 10:06:44,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 10:06:44,320 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 495 [2019-10-02 10:06:44,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:06:44,562 INFO L225 Difference]: With dead ends: 150308 [2019-10-02 10:06:44,562 INFO L226 Difference]: Without dead ends: 75192 [2019-10-02 10:06:44,702 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 10:06:44,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75192 states. [2019-10-02 10:06:46,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75192 to 75152. [2019-10-02 10:06:46,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75152 states. [2019-10-02 10:06:47,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75152 states to 75152 states and 102482 transitions. [2019-10-02 10:06:47,166 INFO L78 Accepts]: Start accepts. Automaton has 75152 states and 102482 transitions. Word has length 495 [2019-10-02 10:06:47,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:06:47,167 INFO L475 AbstractCegarLoop]: Abstraction has 75152 states and 102482 transitions. [2019-10-02 10:06:47,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 10:06:47,167 INFO L276 IsEmpty]: Start isEmpty. Operand 75152 states and 102482 transitions. [2019-10-02 10:06:47,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2019-10-02 10:06:47,190 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:06:47,191 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:06:47,191 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:06:47,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:06:47,191 INFO L82 PathProgramCache]: Analyzing trace with hash 190302647, now seen corresponding path program 1 times [2019-10-02 10:06:47,191 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:06:47,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:06:47,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:06:47,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:06:47,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:06:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:06:47,668 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2019-10-02 10:06:47,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:06:47,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 10:06:47,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 10:06:47,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 10:06:47,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-02 10:06:47,670 INFO L87 Difference]: Start difference. First operand 75152 states and 102482 transitions. Second operand 7 states. [2019-10-02 10:07:05,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:07:05,393 INFO L93 Difference]: Finished difference Result 150268 states and 204977 transitions. [2019-10-02 10:07:05,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 10:07:05,394 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 551 [2019-10-02 10:07:05,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:07:05,621 INFO L225 Difference]: With dead ends: 150268 [2019-10-02 10:07:05,621 INFO L226 Difference]: Without dead ends: 75152 [2019-10-02 10:07:05,742 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-10-02 10:07:05,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75152 states. [2019-10-02 10:07:08,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75152 to 75052. [2019-10-02 10:07:08,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75052 states. [2019-10-02 10:07:08,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75052 states to 75052 states and 102232 transitions. [2019-10-02 10:07:08,650 INFO L78 Accepts]: Start accepts. Automaton has 75052 states and 102232 transitions. Word has length 551 [2019-10-02 10:07:08,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:07:08,650 INFO L475 AbstractCegarLoop]: Abstraction has 75052 states and 102232 transitions. [2019-10-02 10:07:08,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 10:07:08,650 INFO L276 IsEmpty]: Start isEmpty. Operand 75052 states and 102232 transitions. [2019-10-02 10:07:08,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 551 [2019-10-02 10:07:08,666 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:07:08,667 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:07:08,667 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:07:08,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:07:08,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1763950371, now seen corresponding path program 1 times [2019-10-02 10:07:08,668 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:07:08,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:07:08,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:07:08,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:07:08,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:07:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:07:09,208 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2019-10-02 10:07:09,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:07:09,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 10:07:09,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 10:07:09,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 10:07:09,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-02 10:07:09,211 INFO L87 Difference]: Start difference. First operand 75052 states and 102232 transitions. Second operand 7 states. [2019-10-02 10:07:34,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:07:34,736 INFO L93 Difference]: Finished difference Result 150068 states and 204477 transitions. [2019-10-02 10:07:34,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 10:07:34,736 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 550 [2019-10-02 10:07:34,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:07:34,945 INFO L225 Difference]: With dead ends: 150068 [2019-10-02 10:07:34,945 INFO L226 Difference]: Without dead ends: 75052 [2019-10-02 10:07:35,053 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-10-02 10:07:35,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75052 states. [2019-10-02 10:07:37,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75052 to 74952. [2019-10-02 10:07:37,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74952 states. [2019-10-02 10:07:37,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74952 states to 74952 states and 101982 transitions. [2019-10-02 10:07:37,876 INFO L78 Accepts]: Start accepts. Automaton has 74952 states and 101982 transitions. Word has length 550 [2019-10-02 10:07:37,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:07:37,876 INFO L475 AbstractCegarLoop]: Abstraction has 74952 states and 101982 transitions. [2019-10-02 10:07:37,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 10:07:37,876 INFO L276 IsEmpty]: Start isEmpty. Operand 74952 states and 101982 transitions. [2019-10-02 10:07:37,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2019-10-02 10:07:37,893 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:07:37,893 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:07:37,893 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:07:37,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:07:37,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1154883906, now seen corresponding path program 1 times [2019-10-02 10:07:37,894 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:07:37,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:07:37,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:07:37,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:07:37,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:07:37,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:07:38,327 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2019-10-02 10:07:38,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:07:38,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 10:07:38,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 10:07:38,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 10:07:38,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 10:07:38,329 INFO L87 Difference]: Start difference. First operand 74952 states and 101982 transitions. Second operand 3 states. [2019-10-02 10:07:41,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:07:41,277 INFO L93 Difference]: Finished difference Result 149922 states and 207201 transitions. [2019-10-02 10:07:41,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 10:07:41,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 548 [2019-10-02 10:07:41,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:07:41,614 INFO L225 Difference]: With dead ends: 149922 [2019-10-02 10:07:41,615 INFO L226 Difference]: Without dead ends: 75006 [2019-10-02 10:07:41,741 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 10:07:41,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75006 states. [2019-10-02 10:07:44,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75006 to 75006. [2019-10-02 10:07:44,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75006 states. [2019-10-02 10:07:44,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75006 states to 75006 states and 102036 transitions. [2019-10-02 10:07:44,619 INFO L78 Accepts]: Start accepts. Automaton has 75006 states and 102036 transitions. Word has length 548 [2019-10-02 10:07:44,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:07:44,619 INFO L475 AbstractCegarLoop]: Abstraction has 75006 states and 102036 transitions. [2019-10-02 10:07:44,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 10:07:44,620 INFO L276 IsEmpty]: Start isEmpty. Operand 75006 states and 102036 transitions. [2019-10-02 10:07:44,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2019-10-02 10:07:44,636 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:07:44,636 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:07:44,637 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:07:44,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:07:44,637 INFO L82 PathProgramCache]: Analyzing trace with hash 413388160, now seen corresponding path program 1 times [2019-10-02 10:07:44,637 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:07:44,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:07:44,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:07:44,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:07:44,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:07:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:07:45,173 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2019-10-02 10:07:45,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:07:45,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 10:07:45,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 10:07:45,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 10:07:45,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 10:07:45,175 INFO L87 Difference]: Start difference. First operand 75006 states and 102036 transitions. Second operand 3 states. [2019-10-02 10:07:48,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:07:48,180 INFO L93 Difference]: Finished difference Result 150250 states and 207703 transitions. [2019-10-02 10:07:48,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 10:07:48,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 548 [2019-10-02 10:07:48,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:07:48,424 INFO L225 Difference]: With dead ends: 150250 [2019-10-02 10:07:48,424 INFO L226 Difference]: Without dead ends: 75280 [2019-10-02 10:07:48,544 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 10:07:48,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75280 states. [2019-10-02 10:07:51,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75280 to 75060. [2019-10-02 10:07:51,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75060 states. [2019-10-02 10:07:51,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75060 states to 75060 states and 102090 transitions. [2019-10-02 10:07:51,372 INFO L78 Accepts]: Start accepts. Automaton has 75060 states and 102090 transitions. Word has length 548 [2019-10-02 10:07:51,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:07:51,373 INFO L475 AbstractCegarLoop]: Abstraction has 75060 states and 102090 transitions. [2019-10-02 10:07:51,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 10:07:51,373 INFO L276 IsEmpty]: Start isEmpty. Operand 75060 states and 102090 transitions. [2019-10-02 10:07:51,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2019-10-02 10:07:51,388 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:07:51,388 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:07:51,389 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:07:51,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:07:51,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1886036099, now seen corresponding path program 1 times [2019-10-02 10:07:51,389 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:07:51,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:07:51,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:07:51,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:07:51,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:07:51,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:07:52,389 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2019-10-02 10:07:52,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:07:52,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 10:07:52,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 10:07:52,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 10:07:52,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 10:07:52,391 INFO L87 Difference]: Start difference. First operand 75060 states and 102090 transitions. Second operand 5 states. [2019-10-02 10:07:54,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:07:54,771 INFO L93 Difference]: Finished difference Result 150462 states and 207608 transitions. [2019-10-02 10:07:54,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 10:07:54,771 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 549 [2019-10-02 10:07:54,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:07:55,101 INFO L225 Difference]: With dead ends: 150462 [2019-10-02 10:07:55,102 INFO L226 Difference]: Without dead ends: 75438 [2019-10-02 10:07:55,241 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 10:07:55,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75438 states. [2019-10-02 10:07:57,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75438 to 75351. [2019-10-02 10:07:57,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75351 states. [2019-10-02 10:07:57,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75351 states to 75351 states and 102406 transitions. [2019-10-02 10:07:57,966 INFO L78 Accepts]: Start accepts. Automaton has 75351 states and 102406 transitions. Word has length 549 [2019-10-02 10:07:57,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:07:57,966 INFO L475 AbstractCegarLoop]: Abstraction has 75351 states and 102406 transitions. [2019-10-02 10:07:57,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 10:07:57,966 INFO L276 IsEmpty]: Start isEmpty. Operand 75351 states and 102406 transitions. [2019-10-02 10:07:57,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2019-10-02 10:07:57,982 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:07:57,983 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:07:57,983 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:07:57,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:07:57,984 INFO L82 PathProgramCache]: Analyzing trace with hash 651011979, now seen corresponding path program 1 times [2019-10-02 10:07:57,984 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:07:57,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:07:57,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:07:57,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:07:57,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:07:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:08:01,927 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2019-10-02 10:08:01,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:08:01,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 10:08:01,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 10:08:01,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 10:08:01,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 10:08:01,928 INFO L87 Difference]: Start difference. First operand 75351 states and 102406 transitions. Second operand 5 states. [2019-10-02 10:08:21,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:08:21,291 INFO L93 Difference]: Finished difference Result 196688 states and 269431 transitions. [2019-10-02 10:08:21,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 10:08:21,295 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 548 [2019-10-02 10:08:21,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:08:21,672 INFO L225 Difference]: With dead ends: 196688 [2019-10-02 10:08:21,672 INFO L226 Difference]: Without dead ends: 121373 [2019-10-02 10:08:21,792 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-10-02 10:08:21,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121373 states. [2019-10-02 10:08:25,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121373 to 115338. [2019-10-02 10:08:25,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115338 states. [2019-10-02 10:08:25,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115338 states to 115338 states and 157499 transitions. [2019-10-02 10:08:25,893 INFO L78 Accepts]: Start accepts. Automaton has 115338 states and 157499 transitions. Word has length 548 [2019-10-02 10:08:25,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:08:25,894 INFO L475 AbstractCegarLoop]: Abstraction has 115338 states and 157499 transitions. [2019-10-02 10:08:25,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 10:08:25,894 INFO L276 IsEmpty]: Start isEmpty. Operand 115338 states and 157499 transitions. [2019-10-02 10:08:25,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 553 [2019-10-02 10:08:25,913 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:08:25,914 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:08:25,914 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:08:25,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:08:25,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1614598615, now seen corresponding path program 1 times [2019-10-02 10:08:25,915 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:08:25,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:08:25,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:08:25,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:08:25,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:08:25,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:08:26,239 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2019-10-02 10:08:26,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:08:26,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 10:08:26,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 10:08:26,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 10:08:26,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 10:08:26,240 INFO L87 Difference]: Start difference. First operand 115338 states and 157499 transitions. Second operand 3 states. [2019-10-02 10:08:32,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:08:32,243 INFO L93 Difference]: Finished difference Result 230760 states and 315201 transitions. [2019-10-02 10:08:32,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 10:08:32,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 552 [2019-10-02 10:08:32,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:08:32,638 INFO L225 Difference]: With dead ends: 230760 [2019-10-02 10:08:32,638 INFO L226 Difference]: Without dead ends: 115458 [2019-10-02 10:08:32,859 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 10:08:32,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115458 states. [2019-10-02 10:08:40,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115458 to 115368. [2019-10-02 10:08:40,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115368 states. [2019-10-02 10:08:41,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115368 states to 115368 states and 157529 transitions. [2019-10-02 10:08:41,570 INFO L78 Accepts]: Start accepts. Automaton has 115368 states and 157529 transitions. Word has length 552 [2019-10-02 10:08:41,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:08:41,571 INFO L475 AbstractCegarLoop]: Abstraction has 115368 states and 157529 transitions. [2019-10-02 10:08:41,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 10:08:41,571 INFO L276 IsEmpty]: Start isEmpty. Operand 115368 states and 157529 transitions. [2019-10-02 10:08:41,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 635 [2019-10-02 10:08:41,594 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:08:41,595 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:08:41,595 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:08:41,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:08:41,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1958285517, now seen corresponding path program 1 times [2019-10-02 10:08:41,595 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:08:41,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:08:41,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:08:41,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:08:41,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:08:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:08:42,254 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-10-02 10:08:42,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:08:42,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 10:08:42,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 10:08:42,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 10:08:42,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 10:08:42,256 INFO L87 Difference]: Start difference. First operand 115368 states and 157529 transitions. Second operand 6 states. [2019-10-02 10:08:47,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:08:47,642 INFO L93 Difference]: Finished difference Result 269877 states and 368923 transitions. [2019-10-02 10:08:47,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 10:08:47,643 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 634 [2019-10-02 10:08:47,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:08:48,149 INFO L225 Difference]: With dead ends: 269877 [2019-10-02 10:08:48,149 INFO L226 Difference]: Without dead ends: 154545 [2019-10-02 10:08:48,351 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-10-02 10:08:48,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154545 states. [2019-10-02 10:08:53,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154545 to 115278. [2019-10-02 10:08:53,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115278 states. [2019-10-02 10:09:00,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115278 states to 115278 states and 157379 transitions. [2019-10-02 10:09:00,578 INFO L78 Accepts]: Start accepts. Automaton has 115278 states and 157379 transitions. Word has length 634 [2019-10-02 10:09:00,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:09:00,578 INFO L475 AbstractCegarLoop]: Abstraction has 115278 states and 157379 transitions. [2019-10-02 10:09:00,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 10:09:00,579 INFO L276 IsEmpty]: Start isEmpty. Operand 115278 states and 157379 transitions. [2019-10-02 10:09:00,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2019-10-02 10:09:00,599 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:09:00,599 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:09:00,599 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:09:00,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:09:00,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1638139428, now seen corresponding path program 1 times [2019-10-02 10:09:00,600 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:09:00,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:09:00,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:09:00,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:09:00,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:09:00,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:09:01,309 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2019-10-02 10:09:01,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:09:01,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 10:09:01,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 10:09:01,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 10:09:01,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 10:09:01,311 INFO L87 Difference]: Start difference. First operand 115278 states and 157379 transitions. Second operand 6 states. [2019-10-02 10:09:28,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:09:28,128 INFO L93 Difference]: Finished difference Result 249589 states and 345337 transitions. [2019-10-02 10:09:28,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 10:09:28,128 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 568 [2019-10-02 10:09:28,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:09:28,568 INFO L225 Difference]: With dead ends: 249589 [2019-10-02 10:09:28,568 INFO L226 Difference]: Without dead ends: 134347 [2019-10-02 10:09:28,752 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-02 10:09:28,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134347 states. [2019-10-02 10:09:34,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134347 to 121950. [2019-10-02 10:09:34,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121950 states. [2019-10-02 10:09:34,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121950 states to 121950 states and 169198 transitions. [2019-10-02 10:09:35,002 INFO L78 Accepts]: Start accepts. Automaton has 121950 states and 169198 transitions. Word has length 568 [2019-10-02 10:09:35,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:09:35,002 INFO L475 AbstractCegarLoop]: Abstraction has 121950 states and 169198 transitions. [2019-10-02 10:09:35,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 10:09:35,002 INFO L276 IsEmpty]: Start isEmpty. Operand 121950 states and 169198 transitions. [2019-10-02 10:09:35,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 566 [2019-10-02 10:09:35,029 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:09:35,029 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:09:35,029 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:09:35,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:09:35,030 INFO L82 PathProgramCache]: Analyzing trace with hash 556854656, now seen corresponding path program 1 times [2019-10-02 10:09:35,030 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:09:35,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:09:35,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:09:35,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:09:35,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:09:35,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:09:35,433 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2019-10-02 10:09:35,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:09:35,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 10:09:35,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 10:09:35,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 10:09:35,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 10:09:35,435 INFO L87 Difference]: Start difference. First operand 121950 states and 169198 transitions. Second operand 5 states. [2019-10-02 10:09:40,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:09:40,890 INFO L93 Difference]: Finished difference Result 243488 states and 337957 transitions. [2019-10-02 10:09:40,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 10:09:40,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 565 [2019-10-02 10:09:40,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:09:46,490 INFO L225 Difference]: With dead ends: 243488 [2019-10-02 10:09:46,490 INFO L226 Difference]: Without dead ends: 121588 [2019-10-02 10:09:46,677 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 10:09:46,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121588 states. [2019-10-02 10:09:50,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121588 to 121302. [2019-10-02 10:09:50,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121302 states. [2019-10-02 10:09:51,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121302 states to 121302 states and 168242 transitions. [2019-10-02 10:09:51,332 INFO L78 Accepts]: Start accepts. Automaton has 121302 states and 168242 transitions. Word has length 565 [2019-10-02 10:09:51,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:09:51,333 INFO L475 AbstractCegarLoop]: Abstraction has 121302 states and 168242 transitions. [2019-10-02 10:09:51,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 10:09:51,333 INFO L276 IsEmpty]: Start isEmpty. Operand 121302 states and 168242 transitions. [2019-10-02 10:09:51,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2019-10-02 10:09:51,356 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:09:51,356 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:09:51,357 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:09:51,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:09:51,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1117420917, now seen corresponding path program 1 times [2019-10-02 10:09:51,357 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:09:51,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:09:51,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:09:51,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:09:51,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:09:51,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:09:51,982 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2019-10-02 10:09:51,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:09:51,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 10:09:51,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 10:09:51,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 10:09:51,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 10:09:51,985 INFO L87 Difference]: Start difference. First operand 121302 states and 168242 transitions. Second operand 5 states. [2019-10-02 10:10:01,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:10:01,115 INFO L93 Difference]: Finished difference Result 242534 states and 336549 transitions. [2019-10-02 10:10:01,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 10:10:01,115 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 566 [2019-10-02 10:10:01,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:10:01,518 INFO L225 Difference]: With dead ends: 242534 [2019-10-02 10:10:01,518 INFO L226 Difference]: Without dead ends: 121632 [2019-10-02 10:10:01,746 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 10:10:01,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121632 states. [2019-10-02 10:10:06,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121632 to 121422. [2019-10-02 10:10:06,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121422 states. [2019-10-02 10:10:06,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121422 states to 121422 states and 168362 transitions. [2019-10-02 10:10:06,837 INFO L78 Accepts]: Start accepts. Automaton has 121422 states and 168362 transitions. Word has length 566 [2019-10-02 10:10:06,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:10:06,837 INFO L475 AbstractCegarLoop]: Abstraction has 121422 states and 168362 transitions. [2019-10-02 10:10:06,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 10:10:06,837 INFO L276 IsEmpty]: Start isEmpty. Operand 121422 states and 168362 transitions. [2019-10-02 10:10:06,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 586 [2019-10-02 10:10:06,859 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:10:06,860 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:10:06,860 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:10:06,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:10:06,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1841148808, now seen corresponding path program 1 times [2019-10-02 10:10:06,860 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:10:06,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:10:06,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:10:06,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:10:06,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:10:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:10:07,408 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2019-10-02 10:10:07,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:10:07,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 10:10:07,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 10:10:07,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 10:10:07,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 10:10:07,410 INFO L87 Difference]: Start difference. First operand 121422 states and 168362 transitions. Second operand 5 states. [2019-10-02 10:10:12,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:10:12,269 INFO L93 Difference]: Finished difference Result 242774 states and 336789 transitions. [2019-10-02 10:10:12,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 10:10:12,270 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 585 [2019-10-02 10:10:12,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:10:12,701 INFO L225 Difference]: With dead ends: 242774 [2019-10-02 10:10:12,702 INFO L226 Difference]: Without dead ends: 121752 [2019-10-02 10:10:12,947 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 10:10:13,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121752 states. [2019-10-02 10:10:23,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121752 to 121542. [2019-10-02 10:10:23,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121542 states. [2019-10-02 10:10:23,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121542 states to 121542 states and 168482 transitions. [2019-10-02 10:10:23,740 INFO L78 Accepts]: Start accepts. Automaton has 121542 states and 168482 transitions. Word has length 585 [2019-10-02 10:10:23,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:10:23,740 INFO L475 AbstractCegarLoop]: Abstraction has 121542 states and 168482 transitions. [2019-10-02 10:10:23,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 10:10:23,741 INFO L276 IsEmpty]: Start isEmpty. Operand 121542 states and 168482 transitions. [2019-10-02 10:10:23,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2019-10-02 10:10:23,766 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:10:23,767 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:10:23,767 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:10:23,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:10:23,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1243314977, now seen corresponding path program 1 times [2019-10-02 10:10:23,768 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:10:23,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:10:23,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:10:23,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:10:23,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:10:23,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:10:24,195 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2019-10-02 10:10:24,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:10:24,195 INFO L224 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-10-02 10:10:24,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:10:26,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:10:26,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 5674 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 10:10:26,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:10:26,453 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2019-10-02 10:10:26,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 10:10:26,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-10-02 10:10:26,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 10:10:26,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 10:10:26,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 10:10:26,471 INFO L87 Difference]: Start difference. First operand 121542 states and 168482 transitions. Second operand 7 states. [2019-10-02 10:10:59,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:10:59,298 INFO L93 Difference]: Finished difference Result 284719 states and 410639 transitions. [2019-10-02 10:10:59,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 10:10:59,299 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 589 [2019-10-02 10:10:59,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:11:00,552 INFO L225 Difference]: With dead ends: 284719 [2019-10-02 10:11:00,553 INFO L226 Difference]: Without dead ends: 163161 [2019-10-02 10:11:01,010 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 590 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-10-02 10:11:01,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163161 states. [2019-10-02 10:11:12,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163161 to 154214. [2019-10-02 10:11:12,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154214 states. [2019-10-02 10:11:13,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154214 states to 154214 states and 214021 transitions. [2019-10-02 10:11:13,268 INFO L78 Accepts]: Start accepts. Automaton has 154214 states and 214021 transitions. Word has length 589 [2019-10-02 10:11:13,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:11:13,269 INFO L475 AbstractCegarLoop]: Abstraction has 154214 states and 214021 transitions. [2019-10-02 10:11:13,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 10:11:13,269 INFO L276 IsEmpty]: Start isEmpty. Operand 154214 states and 214021 transitions. [2019-10-02 10:11:13,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 616 [2019-10-02 10:11:13,350 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:11:13,351 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:11:13,351 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:11:13,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:11:13,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1124841982, now seen corresponding path program 1 times [2019-10-02 10:11:13,352 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:11:13,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:11:13,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:11:13,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:11:13,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:11:13,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:11:15,312 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2019-10-02 10:11:15,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:11:15,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 10:11:15,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 10:11:15,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 10:11:15,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 10:11:15,316 INFO L87 Difference]: Start difference. First operand 154214 states and 214021 transitions. Second operand 3 states. [2019-10-02 10:11:25,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:11:25,099 INFO L93 Difference]: Finished difference Result 308071 states and 427861 transitions. [2019-10-02 10:11:25,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 10:11:25,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 615 [2019-10-02 10:11:25,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:11:25,888 INFO L225 Difference]: With dead ends: 308071 [2019-10-02 10:11:25,888 INFO L226 Difference]: Without dead ends: 154254 [2019-10-02 10:11:26,230 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 10:11:26,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154254 states. [2019-10-02 10:11:32,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154254 to 154254. [2019-10-02 10:11:32,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154254 states. [2019-10-02 10:11:32,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154254 states to 154254 states and 214061 transitions. [2019-10-02 10:11:32,654 INFO L78 Accepts]: Start accepts. Automaton has 154254 states and 214061 transitions. Word has length 615 [2019-10-02 10:11:32,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:11:32,655 INFO L475 AbstractCegarLoop]: Abstraction has 154254 states and 214061 transitions. [2019-10-02 10:11:32,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 10:11:32,655 INFO L276 IsEmpty]: Start isEmpty. Operand 154254 states and 214061 transitions. [2019-10-02 10:11:32,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 616 [2019-10-02 10:11:32,698 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:11:32,699 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:11:32,699 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:11:32,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:11:32,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1294460924, now seen corresponding path program 1 times [2019-10-02 10:11:32,700 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:11:32,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:11:32,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:11:32,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:11:32,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:11:32,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:11:38,370 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2019-10-02 10:11:38,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:11:38,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 10:11:38,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 10:11:38,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 10:11:38,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 10:11:38,372 INFO L87 Difference]: Start difference. First operand 154254 states and 214061 transitions. Second operand 4 states. [2019-10-02 10:11:43,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:11:43,755 INFO L93 Difference]: Finished difference Result 308271 states and 427901 transitions. [2019-10-02 10:11:43,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 10:11:43,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 615 [2019-10-02 10:11:43,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:11:44,491 INFO L225 Difference]: With dead ends: 308271 [2019-10-02 10:11:44,491 INFO L226 Difference]: Without dead ends: 154414 [2019-10-02 10:11:44,850 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 10:11:45,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154414 states. [2019-10-02 10:11:51,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154414 to 154414. [2019-10-02 10:11:51,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154414 states. [2019-10-02 10:11:59,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154414 states to 154414 states and 214221 transitions. [2019-10-02 10:11:59,125 INFO L78 Accepts]: Start accepts. Automaton has 154414 states and 214221 transitions. Word has length 615 [2019-10-02 10:11:59,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:11:59,125 INFO L475 AbstractCegarLoop]: Abstraction has 154414 states and 214221 transitions. [2019-10-02 10:11:59,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 10:11:59,126 INFO L276 IsEmpty]: Start isEmpty. Operand 154414 states and 214221 transitions. [2019-10-02 10:11:59,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 613 [2019-10-02 10:11:59,178 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:11:59,179 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:11:59,180 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:11:59,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:11:59,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1227550567, now seen corresponding path program 1 times [2019-10-02 10:11:59,181 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:11:59,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:11:59,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:11:59,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:11:59,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:11:59,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:11:59,859 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 54 proven. 1 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-10-02 10:11:59,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:11:59,859 INFO L224 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-10-02 10:12:00,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:12:01,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:12:01,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 5556 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 10:12:01,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:12:01,465 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 220 proven. 1 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-10-02 10:12:01,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:12:01,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-10-02 10:12:01,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 10:12:01,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 10:12:01,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 10:12:01,481 INFO L87 Difference]: Start difference. First operand 154414 states and 214221 transitions. Second operand 6 states. [2019-10-02 10:12:06,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:12:06,837 INFO L93 Difference]: Finished difference Result 310231 states and 430861 transitions. [2019-10-02 10:12:06,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 10:12:06,838 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 612 [2019-10-02 10:12:06,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:12:07,416 INFO L225 Difference]: With dead ends: 310231 [2019-10-02 10:12:07,416 INFO L226 Difference]: Without dead ends: 156214 [2019-10-02 10:12:08,276 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 615 GetRequests, 611 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 10:12:08,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156214 states. [2019-10-02 10:12:15,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156214 to 155054. [2019-10-02 10:12:15,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155054 states. [2019-10-02 10:12:15,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155054 states to 155054 states and 215221 transitions. [2019-10-02 10:12:15,724 INFO L78 Accepts]: Start accepts. Automaton has 155054 states and 215221 transitions. Word has length 612 [2019-10-02 10:12:15,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:12:15,725 INFO L475 AbstractCegarLoop]: Abstraction has 155054 states and 215221 transitions. [2019-10-02 10:12:15,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 10:12:15,725 INFO L276 IsEmpty]: Start isEmpty. Operand 155054 states and 215221 transitions. [2019-10-02 10:12:15,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 646 [2019-10-02 10:12:15,756 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:12:15,757 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:12:15,757 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:12:15,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:12:15,757 INFO L82 PathProgramCache]: Analyzing trace with hash 2077327613, now seen corresponding path program 1 times [2019-10-02 10:12:15,758 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:12:15,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:12:15,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:12:15,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:12:15,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:12:15,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:12:16,324 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-10-02 10:12:16,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:12:16,325 INFO L224 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-10-02 10:12:17,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:12:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:12:18,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 5989 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 10:12:18,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:12:18,838 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 177 proven. 1 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2019-10-02 10:12:18,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:12:18,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-10-02 10:12:18,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 10:12:18,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 10:12:18,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-10-02 10:12:18,866 INFO L87 Difference]: Start difference. First operand 155054 states and 215221 transitions. Second operand 10 states. [2019-10-02 10:13:18,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:13:18,705 INFO L93 Difference]: Finished difference Result 321630 states and 459601 transitions. [2019-10-02 10:13:18,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 10:13:18,705 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 645 [2019-10-02 10:13:18,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:13:19,921 INFO L225 Difference]: With dead ends: 321630 [2019-10-02 10:13:19,921 INFO L226 Difference]: Without dead ends: 166354 [2019-10-02 10:13:20,195 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 669 GetRequests, 647 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2019-10-02 10:13:20,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166354 states. [2019-10-02 10:13:27,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166354 to 154932. [2019-10-02 10:13:27,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154932 states. [2019-10-02 10:13:29,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154932 states to 154932 states and 214634 transitions. [2019-10-02 10:13:29,726 INFO L78 Accepts]: Start accepts. Automaton has 154932 states and 214634 transitions. Word has length 645 [2019-10-02 10:13:29,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:13:29,726 INFO L475 AbstractCegarLoop]: Abstraction has 154932 states and 214634 transitions. [2019-10-02 10:13:29,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 10:13:29,726 INFO L276 IsEmpty]: Start isEmpty. Operand 154932 states and 214634 transitions. [2019-10-02 10:13:29,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 646 [2019-10-02 10:13:29,757 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:13:29,757 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:13:29,757 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:13:29,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:13:29,758 INFO L82 PathProgramCache]: Analyzing trace with hash -842014477, now seen corresponding path program 1 times [2019-10-02 10:13:29,758 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:13:29,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:13:29,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:13:29,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:13:29,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:13:29,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:13:30,339 INFO L134 CoverageAnalysis]: Checked inductivity of 575 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 554 trivial. 0 not checked. [2019-10-02 10:13:30,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:13:30,339 INFO L224 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:13:30,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:13:32,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:13:32,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 5993 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 10:13:32,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:13:33,380 INFO L134 CoverageAnalysis]: Checked inductivity of 575 backedges. 178 proven. 3 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2019-10-02 10:13:33,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:13:33,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-10-02 10:13:33,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 10:13:33,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 10:13:33,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-10-02 10:13:33,407 INFO L87 Difference]: Start difference. First operand 154932 states and 214634 transitions. Second operand 11 states. [2019-10-02 10:14:33,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:14:33,922 INFO L93 Difference]: Finished difference Result 302351 states and 433420 transitions. [2019-10-02 10:14:33,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 10:14:33,923 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 645 [2019-10-02 10:14:33,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:14:34,396 INFO L225 Difference]: With dead ends: 302351 [2019-10-02 10:14:34,396 INFO L226 Difference]: Without dead ends: 147245 [2019-10-02 10:14:34,660 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 673 GetRequests, 646 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=213, Invalid=599, Unknown=0, NotChecked=0, Total=812 [2019-10-02 10:14:34,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147245 states. [2019-10-02 10:14:41,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147245 to 135775. [2019-10-02 10:14:41,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135775 states. [2019-10-02 10:14:42,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135775 states to 135775 states and 189507 transitions. [2019-10-02 10:14:42,181 INFO L78 Accepts]: Start accepts. Automaton has 135775 states and 189507 transitions. Word has length 645 [2019-10-02 10:14:42,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:14:42,181 INFO L475 AbstractCegarLoop]: Abstraction has 135775 states and 189507 transitions. [2019-10-02 10:14:42,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 10:14:42,181 INFO L276 IsEmpty]: Start isEmpty. Operand 135775 states and 189507 transitions. [2019-10-02 10:14:42,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 744 [2019-10-02 10:14:42,189 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:14:42,189 INFO L411 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 5, 5, 4, 4, 4, 4, 4, 4, 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, 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, 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] [2019-10-02 10:14:42,189 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:14:42,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:14:42,190 INFO L82 PathProgramCache]: Analyzing trace with hash -487420845, now seen corresponding path program 1 times [2019-10-02 10:14:42,190 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:14:42,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:14:42,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:14:42,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:14:42,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:14:42,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:14:44,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 1036 trivial. 0 not checked. [2019-10-02 10:14:44,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:14:44,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 10:14:44,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 10:14:44,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 10:14:44,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 10:14:44,100 INFO L87 Difference]: Start difference. First operand 135775 states and 189507 transitions. Second operand 3 states. [2019-10-02 10:14:51,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:14:51,111 INFO L93 Difference]: Finished difference Result 271498 states and 379071 transitions. [2019-10-02 10:14:51,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 10:14:51,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 743 [2019-10-02 10:14:51,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:14:52,211 INFO L225 Difference]: With dead ends: 271498 [2019-10-02 10:14:52,212 INFO L226 Difference]: Without dead ends: 135843 [2019-10-02 10:14:52,413 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 10:14:52,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135843 states. [2019-10-02 10:15:04,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135843 to 135843. [2019-10-02 10:15:04,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135843 states. [2019-10-02 10:15:04,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135843 states to 135843 states and 189575 transitions. [2019-10-02 10:15:04,614 INFO L78 Accepts]: Start accepts. Automaton has 135843 states and 189575 transitions. Word has length 743 [2019-10-02 10:15:04,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:15:04,615 INFO L475 AbstractCegarLoop]: Abstraction has 135843 states and 189575 transitions. [2019-10-02 10:15:04,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 10:15:04,615 INFO L276 IsEmpty]: Start isEmpty. Operand 135843 states and 189575 transitions. [2019-10-02 10:15:04,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 743 [2019-10-02 10:15:04,622 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:15:04,622 INFO L411 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 5, 5, 4, 4, 4, 4, 4, 4, 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, 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, 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-10-02 10:15:04,623 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:15:04,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:15:04,623 INFO L82 PathProgramCache]: Analyzing trace with hash 918826435, now seen corresponding path program 1 times [2019-10-02 10:15:04,623 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:15:04,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:15:04,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:15:04,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:15:04,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:15:05,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:15:05,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 72 proven. 8 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2019-10-02 10:15:05,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:15:05,667 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:15:06,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:15:07,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:15:07,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 6167 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 10:15:07,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:15:07,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 516 proven. 8 refuted. 0 times theorem prover too weak. 584 trivial. 0 not checked. [2019-10-02 10:15:07,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:15:07,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-02 10:15:07,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 10:15:07,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 10:15:07,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-02 10:15:07,773 INFO L87 Difference]: Start difference. First operand 135843 states and 189575 transitions. Second operand 6 states. [2019-10-02 10:15:13,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:15:13,661 INFO L93 Difference]: Finished difference Result 273130 states and 381417 transitions. [2019-10-02 10:15:13,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 10:15:13,661 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 742 [2019-10-02 10:15:13,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:15:14,083 INFO L225 Difference]: With dead ends: 273130 [2019-10-02 10:15:14,083 INFO L226 Difference]: Without dead ends: 137407 [2019-10-02 10:15:14,280 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 746 GetRequests, 742 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-02 10:15:14,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137407 states. [2019-10-02 10:15:19,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137407 to 136251. [2019-10-02 10:15:19,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136251 states. [2019-10-02 10:15:20,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136251 states to 136251 states and 190255 transitions. [2019-10-02 10:15:20,310 INFO L78 Accepts]: Start accepts. Automaton has 136251 states and 190255 transitions. Word has length 742 [2019-10-02 10:15:20,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:15:20,311 INFO L475 AbstractCegarLoop]: Abstraction has 136251 states and 190255 transitions. [2019-10-02 10:15:20,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 10:15:20,311 INFO L276 IsEmpty]: Start isEmpty. Operand 136251 states and 190255 transitions. [2019-10-02 10:15:20,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 861 [2019-10-02 10:15:20,319 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:15:20,320 INFO L411 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 15, 15, 14, 14, 14, 14, 14, 8, 8, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-10-02 10:15:20,320 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:15:20,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:15:20,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1111002275, now seen corresponding path program 1 times [2019-10-02 10:15:20,320 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:15:20,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:15:20,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:15:20,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:15:20,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:15:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:15:29,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2048 backedges. 90 proven. 2 refuted. 0 times theorem prover too weak. 1956 trivial. 0 not checked. [2019-10-02 10:15:29,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:15:29,427 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:15:29,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:15:30,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:15:30,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 6637 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 10:15:30,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:15:31,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2048 backedges. 960 proven. 21 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2019-10-02 10:15:31,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:15:31,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 8 [2019-10-02 10:15:31,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 10:15:31,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 10:15:31,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-02 10:15:31,334 INFO L87 Difference]: Start difference. First operand 136251 states and 190255 transitions. Second operand 8 states. [2019-10-02 10:15:36,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:15:36,762 INFO L93 Difference]: Finished difference Result 274286 states and 383219 transitions. [2019-10-02 10:15:36,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 10:15:36,762 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 860 [2019-10-02 10:15:36,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:15:37,247 INFO L225 Difference]: With dead ends: 274286 [2019-10-02 10:15:37,248 INFO L226 Difference]: Without dead ends: 138155 [2019-10-02 10:15:37,489 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 863 GetRequests, 857 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-02 10:15:37,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138155 states. [2019-10-02 10:15:44,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138155 to 136727. [2019-10-02 10:15:44,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136727 states. [2019-10-02 10:15:45,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136727 states to 136727 states and 191003 transitions. [2019-10-02 10:15:45,480 INFO L78 Accepts]: Start accepts. Automaton has 136727 states and 191003 transitions. Word has length 860 [2019-10-02 10:15:45,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:15:45,480 INFO L475 AbstractCegarLoop]: Abstraction has 136727 states and 191003 transitions. [2019-10-02 10:15:45,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 10:15:45,481 INFO L276 IsEmpty]: Start isEmpty. Operand 136727 states and 191003 transitions. [2019-10-02 10:15:45,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 978 [2019-10-02 10:15:45,491 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:15:45,491 INFO L411 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 19, 19, 18, 18, 18, 18, 18, 8, 8, 8, 8, 8, 8, 8, 8, 8, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-10-02 10:15:45,491 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:15:45,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:15:45,492 INFO L82 PathProgramCache]: Analyzing trace with hash -367937495, now seen corresponding path program 2 times [2019-10-02 10:15:45,492 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:15:45,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:15:45,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:15:45,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:15:45,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:15:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:15:46,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3333 backedges. 108 proven. 6 refuted. 0 times theorem prover too weak. 3219 trivial. 0 not checked. [2019-10-02 10:15:46,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:15:46,423 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000