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-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--can--sja1000--sja1000.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 16:12:14,935 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 16:12:14,937 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 16:12:14,948 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 16:12:14,949 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 16:12:14,950 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 16:12:14,951 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 16:12:14,953 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 16:12:14,954 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 16:12:14,955 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 16:12:14,956 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 16:12:14,957 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 16:12:14,958 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 16:12:14,958 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 16:12:14,959 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 16:12:14,960 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 16:12:14,961 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 16:12:14,962 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 16:12:14,964 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 16:12:14,966 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 16:12:14,967 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 16:12:14,968 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 16:12:14,969 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 16:12:14,970 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 16:12:14,972 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 16:12:14,972 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 16:12:14,973 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 16:12:14,973 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 16:12:14,974 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 16:12:14,975 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 16:12:14,975 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 16:12:14,976 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 16:12:14,977 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 16:12:14,977 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 16:12:14,978 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 16:12:14,978 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 16:12:14,979 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 16:12:14,979 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 16:12:14,980 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 16:12:14,980 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 16:12:14,981 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 16:12:14,982 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 16:12:14,996 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 16:12:14,996 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 16:12:14,997 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 16:12:14,998 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 16:12:14,998 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 16:12:14,998 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 16:12:14,998 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 16:12:14,999 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 16:12:14,999 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 16:12:14,999 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 16:12:14,999 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 16:12:14,999 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 16:12:14,999 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 16:12:15,000 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 16:12:15,000 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 16:12:15,000 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 16:12:15,000 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 16:12:15,000 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 16:12:15,001 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 16:12:15,001 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 16:12:15,001 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 16:12:15,001 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 16:12:15,001 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 16:12:15,002 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 16:12:15,002 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 16:12:15,002 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 16:12:15,002 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 16:12:15,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 16:12:15,003 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 16:12:15,030 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 16:12:15,041 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 16:12:15,044 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 16:12:15,046 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 16:12:15,046 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 16:12:15,047 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--can--sja1000--sja1000.ko-entry_point.cil.out.i [2019-09-08 16:12:15,104 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6eac9f9e/76b62c1dc39f49b79cd4da9b99bc6783/FLAGeae71679b [2019-09-08 16:12:15,879 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 16:12:15,880 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--can--sja1000--sja1000.ko-entry_point.cil.out.i [2019-09-08 16:12:15,926 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6eac9f9e/76b62c1dc39f49b79cd4da9b99bc6783/FLAGeae71679b [2019-09-08 16:12:16,425 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6eac9f9e/76b62c1dc39f49b79cd4da9b99bc6783 [2019-09-08 16:12:16,438 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 16:12:16,441 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 16:12:16,446 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 16:12:16,446 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 16:12:16,449 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 16:12:16,450 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:12:16" (1/1) ... [2019-09-08 16:12:16,453 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8ae743c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:12:16, skipping insertion in model container [2019-09-08 16:12:16,453 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:12:16" (1/1) ... [2019-09-08 16:12:16,461 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 16:12:16,568 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 16:12:18,055 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 16:12:18,089 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 16:12:18,600 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 16:12:18,706 INFO L192 MainTranslator]: Completed translation [2019-09-08 16:12:18,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:12:18 WrapperNode [2019-09-08 16:12:18,707 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 16:12:18,707 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 16:12:18,708 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 16:12:18,708 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 16:12:18,722 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:12:18" (1/1) ... [2019-09-08 16:12:18,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:12:18" (1/1) ... [2019-09-08 16:12:18,763 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:12:18" (1/1) ... [2019-09-08 16:12:18,763 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:12:18" (1/1) ... [2019-09-08 16:12:18,881 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:12:18" (1/1) ... [2019-09-08 16:12:18,902 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:12:18" (1/1) ... [2019-09-08 16:12:18,930 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:12:18" (1/1) ... [2019-09-08 16:12:18,955 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 16:12:18,956 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 16:12:18,956 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 16:12:18,956 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 16:12:18,957 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:12:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 16:12:19,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 16:12:19,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 16:12:19,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~~u8~0~TO~VOID [2019-09-08 16:12:19,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~~u8~0 [2019-09-08 16:12:19,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-09-08 16:12:19,029 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2019-09-08 16:12:19,029 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2019-09-08 16:12:19,029 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2019-09-08 16:12:19,029 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2019-09-08 16:12:19,030 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2019-09-08 16:12:19,030 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2019-09-08 16:12:19,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-09-08 16:12:19,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-09-08 16:12:19,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2019-09-08 16:12:19,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ptr [2019-09-08 16:12:19,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2019-09-08 16:12:19,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-09-08 16:12:19,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2019-09-08 16:12:19,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-09-08 16:12:19,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_trap [2019-09-08 16:12:19,032 INFO L138 BoogieDeclarations]: Found implementation of procedure request_irq [2019-09-08 16:12:19,032 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2019-09-08 16:12:19,032 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2019-09-08 16:12:19,033 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2019-09-08 16:12:19,033 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_start_queue [2019-09-08 16:12:19,033 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_wake_queue [2019-09-08 16:12:19,033 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2019-09-08 16:12:19,033 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_stop_queue [2019-09-08 16:12:19,033 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2019-09-08 16:12:19,034 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_queue_stopped [2019-09-08 16:12:19,034 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2019-09-08 16:12:19,034 INFO L138 BoogieDeclarations]: Found implementation of procedure can_dropped_invalid_skb [2019-09-08 16:12:19,034 INFO L138 BoogieDeclarations]: Found implementation of procedure sja1000_write_cmdreg [2019-09-08 16:12:19,034 INFO L138 BoogieDeclarations]: Found implementation of procedure sja1000_is_absent [2019-09-08 16:12:19,034 INFO L138 BoogieDeclarations]: Found implementation of procedure sja1000_probe_chip [2019-09-08 16:12:19,035 INFO L138 BoogieDeclarations]: Found implementation of procedure set_reset_mode [2019-09-08 16:12:19,035 INFO L138 BoogieDeclarations]: Found implementation of procedure set_normal_mode [2019-09-08 16:12:19,035 INFO L138 BoogieDeclarations]: Found implementation of procedure sja1000_start [2019-09-08 16:12:19,035 INFO L138 BoogieDeclarations]: Found implementation of procedure sja1000_set_mode [2019-09-08 16:12:19,035 INFO L138 BoogieDeclarations]: Found implementation of procedure sja1000_set_bittiming [2019-09-08 16:12:19,035 INFO L138 BoogieDeclarations]: Found implementation of procedure sja1000_get_berr_counter [2019-09-08 16:12:19,035 INFO L138 BoogieDeclarations]: Found implementation of procedure chipset_init [2019-09-08 16:12:19,036 INFO L138 BoogieDeclarations]: Found implementation of procedure sja1000_start_xmit [2019-09-08 16:12:19,036 INFO L138 BoogieDeclarations]: Found implementation of procedure sja1000_rx [2019-09-08 16:12:19,036 INFO L138 BoogieDeclarations]: Found implementation of procedure sja1000_err [2019-09-08 16:12:19,036 INFO L138 BoogieDeclarations]: Found implementation of procedure sja1000_interrupt [2019-09-08 16:12:19,036 INFO L138 BoogieDeclarations]: Found implementation of procedure sja1000_open [2019-09-08 16:12:19,036 INFO L138 BoogieDeclarations]: Found implementation of procedure sja1000_close [2019-09-08 16:12:19,037 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_sja1000dev [2019-09-08 16:12:19,037 INFO L138 BoogieDeclarations]: Found implementation of procedure free_sja1000dev [2019-09-08 16:12:19,037 INFO L138 BoogieDeclarations]: Found implementation of procedure register_sja1000dev [2019-09-08 16:12:19,037 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_sja1000dev [2019-09-08 16:12:19,037 INFO L138 BoogieDeclarations]: Found implementation of procedure sja1000_init [2019-09-08 16:12:19,037 INFO L138 BoogieDeclarations]: Found implementation of procedure sja1000_exit [2019-09-08 16:12:19,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_irq_1 [2019-09-08 16:12:19,038 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_suitable_irq_1 [2019-09-08 16:12:19,038 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_check_1 [2019-09-08 16:12:19,038 INFO L138 BoogieDeclarations]: Found implementation of procedure choose_interrupt_1 [2019-09-08 16:12:19,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_net_device_ops_2 [2019-09-08 16:12:19,038 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_irq_1 [2019-09-08 16:12:19,038 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 16:12:19,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_consume_skb_5 [2019-09-08 16:12:19,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kfree_skb_6 [2019-09-08 16:12:19,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kfree_skb_7 [2019-09-08 16:12:19,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kfree_skb_8 [2019-09-08 16:12:19,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kfree_skb_11 [2019-09-08 16:12:19,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kfree_skb_12 [2019-09-08 16:12:19,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_netif_rx_13 [2019-09-08 16:12:19,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_netif_rx_14 [2019-09-08 16:12:19,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_request_irq_15 [2019-09-08 16:12:19,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_irq_16 [2019-09-08 16:12:19,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_init [2019-09-08 16:12:19,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_add [2019-09-08 16:12:19,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2019-09-08 16:12:19,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_contains [2019-09-08 16:12:19,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_is_empty [2019-09-08 16:12:19,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2019-09-08 16:12:19,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_err_ptr [2019-09-08 16:12:19,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_ptr_err [2019-09-08 16:12:19,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err_or_null [2019-09-08 16:12:19,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2019-09-08 16:12:19,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-09-08 16:12:19,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2019-09-08 16:12:19,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free_int [2019-09-08 16:12:19,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_alloc_skb [2019-09-08 16:12:19,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_netdev_alloc_skb [2019-09-08 16:12:19,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_current [2019-09-08 16:12:19,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-09-08 16:12:19,043 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2019-09-08 16:12:19,043 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_netdev_dbg [2019-09-08 16:12:19,043 INFO L138 BoogieDeclarations]: Found implementation of procedure __netif_schedule [2019-09-08 16:12:19,043 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2019-09-08 16:12:19,044 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2019-09-08 16:12:19,044 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_unlock_irqrestore [2019-09-08 16:12:19,044 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_can_err_skb [2019-09-08 16:12:19,044 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_can_skb [2019-09-08 16:12:19,044 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_candev [2019-09-08 16:12:19,045 INFO L138 BoogieDeclarations]: Found implementation of procedure can_bus_off [2019-09-08 16:12:19,045 INFO L138 BoogieDeclarations]: Found implementation of procedure can_change_mtu [2019-09-08 16:12:19,045 INFO L138 BoogieDeclarations]: Found implementation of procedure can_free_echo_skb [2019-09-08 16:12:19,045 INFO L138 BoogieDeclarations]: Found implementation of procedure can_get_echo_skb [2019-09-08 16:12:19,045 INFO L138 BoogieDeclarations]: Found implementation of procedure can_led_event [2019-09-08 16:12:19,045 INFO L138 BoogieDeclarations]: Found implementation of procedure can_put_echo_skb [2019-09-08 16:12:19,046 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2019-09-08 16:12:19,046 INFO L138 BoogieDeclarations]: Found implementation of procedure devm_can_led_init [2019-09-08 16:12:19,046 INFO L138 BoogieDeclarations]: Found implementation of procedure free_candev [2019-09-08 16:12:19,046 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2019-09-08 16:12:19,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_ndo_init_2 [2019-09-08 16:12:19,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_ndo_uninit_2 [2019-09-08 16:12:19,047 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_err [2019-09-08 16:12:19,047 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_info [2019-09-08 16:12:19,047 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_warn [2019-09-08 16:12:19,047 INFO L138 BoogieDeclarations]: Found implementation of procedure open_candev [2019-09-08 16:12:19,047 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-09-08 16:12:19,047 INFO L138 BoogieDeclarations]: Found implementation of procedure register_candev [2019-09-08 16:12:19,048 INFO L138 BoogieDeclarations]: Found implementation of procedure request_threaded_irq [2019-09-08 16:12:19,048 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_candev [2019-09-08 16:12:19,048 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2019-09-08 16:12:19,048 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-09-08 16:12:19,048 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-09-08 16:12:19,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-08 16:12:19,049 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 16:12:19,049 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-09-08 16:12:19,049 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2019-09-08 16:12:19,049 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2019-09-08 16:12:19,049 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2019-09-08 16:12:19,050 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2019-09-08 16:12:19,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 16:12:19,050 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-09-08 16:12:19,050 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_netdev_dbg [2019-09-08 16:12:19,050 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2019-09-08 16:12:19,051 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2019-09-08 16:12:19,051 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2019-09-08 16:12:19,051 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_unlock_irqrestore [2019-09-08 16:12:19,051 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2019-09-08 16:12:19,051 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2019-09-08 16:12:19,051 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kfree_skb_6 [2019-09-08 16:12:19,052 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kfree_skb_7 [2019-09-08 16:12:19,052 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kfree_skb_8 [2019-09-08 16:12:19,052 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kfree_skb_11 [2019-09-08 16:12:19,052 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kfree_skb_12 [2019-09-08 16:12:19,052 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_consume_skb_5 [2019-09-08 16:12:19,053 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2019-09-08 16:12:19,053 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free_int [2019-09-08 16:12:19,053 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 16:12:19,053 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-08 16:12:19,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 16:12:19,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-09-08 16:12:19,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-08 16:12:19,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 16:12:19,054 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-09-08 16:12:19,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 16:12:19,054 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-09-08 16:12:19,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-08 16:12:19,055 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2019-09-08 16:12:19,057 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ptr [2019-09-08 16:12:19,057 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2019-09-08 16:12:19,057 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-09-08 16:12:19,058 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2019-09-08 16:12:19,058 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_trap [2019-09-08 16:12:19,058 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_irq_1 [2019-09-08 16:12:19,058 INFO L130 BoogieDeclarations]: Found specification of procedure activate_suitable_irq_1 [2019-09-08 16:12:19,058 INFO L130 BoogieDeclarations]: Found specification of procedure reg_check_1 [2019-09-08 16:12:19,058 INFO L130 BoogieDeclarations]: Found specification of procedure choose_interrupt_1 [2019-09-08 16:12:19,059 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_net_device_ops_2 [2019-09-08 16:12:19,059 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_irq_1 [2019-09-08 16:12:19,059 INFO L130 BoogieDeclarations]: Found specification of procedure request_threaded_irq [2019-09-08 16:12:19,059 INFO L130 BoogieDeclarations]: Found specification of procedure request_irq [2019-09-08 16:12:19,059 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_request_irq_15 [2019-09-08 16:12:19,059 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2019-09-08 16:12:19,060 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_irq_16 [2019-09-08 16:12:19,060 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2019-09-08 16:12:19,060 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2019-09-08 16:12:19,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 16:12:19,060 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2019-09-08 16:12:19,060 INFO L130 BoogieDeclarations]: Found specification of procedure __netif_schedule [2019-09-08 16:12:19,061 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2019-09-08 16:12:19,061 INFO L130 BoogieDeclarations]: Found specification of procedure netif_start_queue [2019-09-08 16:12:19,061 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_wake_queue [2019-09-08 16:12:19,061 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2019-09-08 16:12:19,061 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_stop_queue [2019-09-08 16:12:19,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 16:12:19,061 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2019-09-08 16:12:19,062 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_queue_stopped [2019-09-08 16:12:19,062 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2019-09-08 16:12:19,062 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_netif_rx_13 [2019-09-08 16:12:19,062 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_netif_rx_14 [2019-09-08 16:12:19,062 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_err [2019-09-08 16:12:19,062 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_warn [2019-09-08 16:12:19,063 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_info [2019-09-08 16:12:19,063 INFO L130 BoogieDeclarations]: Found specification of procedure can_led_event [2019-09-08 16:12:19,063 INFO L130 BoogieDeclarations]: Found specification of procedure devm_can_led_init [2019-09-08 16:12:19,063 INFO L130 BoogieDeclarations]: Found specification of procedure can_dropped_invalid_skb [2019-09-08 16:12:19,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 16:12:19,063 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_candev [2019-09-08 16:12:19,064 INFO L130 BoogieDeclarations]: Found specification of procedure free_candev [2019-09-08 16:12:19,064 INFO L130 BoogieDeclarations]: Found specification of procedure open_candev [2019-09-08 16:12:19,064 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2019-09-08 16:12:19,064 INFO L130 BoogieDeclarations]: Found specification of procedure can_change_mtu [2019-09-08 16:12:19,064 INFO L130 BoogieDeclarations]: Found specification of procedure register_candev [2019-09-08 16:12:19,064 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_candev [2019-09-08 16:12:19,065 INFO L130 BoogieDeclarations]: Found specification of procedure can_bus_off [2019-09-08 16:12:19,065 INFO L130 BoogieDeclarations]: Found specification of procedure can_put_echo_skb [2019-09-08 16:12:19,065 INFO L130 BoogieDeclarations]: Found specification of procedure can_get_echo_skb [2019-09-08 16:12:19,065 INFO L130 BoogieDeclarations]: Found specification of procedure can_free_echo_skb [2019-09-08 16:12:19,065 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_can_skb [2019-09-08 16:12:19,065 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_can_err_skb [2019-09-08 16:12:19,066 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_sja1000dev [2019-09-08 16:12:19,066 INFO L130 BoogieDeclarations]: Found specification of procedure free_sja1000dev [2019-09-08 16:12:19,066 INFO L130 BoogieDeclarations]: Found specification of procedure register_sja1000dev [2019-09-08 16:12:19,066 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_sja1000dev [2019-09-08 16:12:19,066 INFO L130 BoogieDeclarations]: Found specification of procedure sja1000_interrupt [2019-09-08 16:12:19,066 INFO L130 BoogieDeclarations]: Found specification of procedure sja1000_write_cmdreg [2019-09-08 16:12:19,067 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~~u8~0~TO~VOID [2019-09-08 16:12:19,067 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~~u8~0 [2019-09-08 16:12:19,067 INFO L130 BoogieDeclarations]: Found specification of procedure sja1000_is_absent [2019-09-08 16:12:19,067 INFO L130 BoogieDeclarations]: Found specification of procedure sja1000_probe_chip [2019-09-08 16:12:19,067 INFO L130 BoogieDeclarations]: Found specification of procedure set_reset_mode [2019-09-08 16:12:19,068 INFO L130 BoogieDeclarations]: Found specification of procedure set_normal_mode [2019-09-08 16:12:19,068 INFO L130 BoogieDeclarations]: Found specification of procedure sja1000_start [2019-09-08 16:12:19,068 INFO L130 BoogieDeclarations]: Found specification of procedure sja1000_set_mode [2019-09-08 16:12:19,068 INFO L130 BoogieDeclarations]: Found specification of procedure sja1000_set_bittiming [2019-09-08 16:12:19,068 INFO L130 BoogieDeclarations]: Found specification of procedure sja1000_get_berr_counter [2019-09-08 16:12:19,068 INFO L130 BoogieDeclarations]: Found specification of procedure chipset_init [2019-09-08 16:12:19,069 INFO L130 BoogieDeclarations]: Found specification of procedure sja1000_start_xmit [2019-09-08 16:12:19,069 INFO L130 BoogieDeclarations]: Found specification of procedure sja1000_rx [2019-09-08 16:12:19,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 16:12:19,069 INFO L130 BoogieDeclarations]: Found specification of procedure sja1000_err [2019-09-08 16:12:19,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 16:12:19,069 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-09-08 16:12:19,070 INFO L130 BoogieDeclarations]: Found specification of procedure sja1000_open [2019-09-08 16:12:19,070 INFO L130 BoogieDeclarations]: Found specification of procedure sja1000_close [2019-09-08 16:12:19,070 INFO L130 BoogieDeclarations]: Found specification of procedure sja1000_init [2019-09-08 16:12:19,070 INFO L130 BoogieDeclarations]: Found specification of procedure sja1000_exit [2019-09-08 16:12:19,070 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_ndo_init_2 [2019-09-08 16:12:19,070 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-09-08 16:12:19,071 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_ndo_uninit_2 [2019-09-08 16:12:19,071 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-09-08 16:12:19,071 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 16:12:19,071 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_init [2019-09-08 16:12:19,071 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_add [2019-09-08 16:12:19,071 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2019-09-08 16:12:19,072 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_contains [2019-09-08 16:12:19,072 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_is_empty [2019-09-08 16:12:19,072 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2019-09-08 16:12:19,072 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_err_ptr [2019-09-08 16:12:19,072 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_ptr_err [2019-09-08 16:12:19,072 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err_or_null [2019-09-08 16:12:19,073 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2019-09-08 16:12:19,073 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_netdev_alloc_skb [2019-09-08 16:12:19,073 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_alloc_skb [2019-09-08 16:12:19,073 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_current [2019-09-08 16:12:19,073 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-09-08 16:12:19,073 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-08 16:12:19,074 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 16:12:19,074 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-09-08 16:12:19,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 16:12:19,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 16:12:19,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-08 16:12:19,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 16:12:19,747 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2019-09-08 16:12:21,926 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 16:12:21,926 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 16:12:21,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:12:21 BoogieIcfgContainer [2019-09-08 16:12:21,928 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 16:12:21,929 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 16:12:21,929 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 16:12:21,932 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 16:12:21,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 04:12:16" (1/3) ... [2019-09-08 16:12:21,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7238f0ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:12:21, skipping insertion in model container [2019-09-08 16:12:21,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:12:18" (2/3) ... [2019-09-08 16:12:21,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7238f0ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:12:21, skipping insertion in model container [2019-09-08 16:12:21,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:12:21" (3/3) ... [2019-09-08 16:12:21,948 INFO L109 eAbstractionObserver]: Analyzing ICFG 205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--can--sja1000--sja1000.ko-entry_point.cil.out.i [2019-09-08 16:12:21,957 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 16:12:21,971 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 16:12:21,988 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 16:12:22,029 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 16:12:22,030 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 16:12:22,030 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 16:12:22,030 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 16:12:22,030 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 16:12:22,031 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 16:12:22,031 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 16:12:22,031 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 16:12:22,031 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 16:12:22,077 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states. [2019-09-08 16:12:22,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-08 16:12:22,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:12:22,097 INFO L399 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] [2019-09-08 16:12:22,099 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:12:22,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:12:22,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1121687713, now seen corresponding path program 1 times [2019-09-08 16:12:22,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:12:22,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:12:22,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:12:22,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:12:22,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:12:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:12:22,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 16:12:22,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:12:22,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:12:22,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:12:22,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:12:22,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:12:22,730 INFO L87 Difference]: Start difference. First operand 827 states. Second operand 3 states. [2019-09-08 16:12:23,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:12:23,217 INFO L93 Difference]: Finished difference Result 1990 states and 2654 transitions. [2019-09-08 16:12:23,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:12:23,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-09-08 16:12:23,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:12:23,257 INFO L225 Difference]: With dead ends: 1990 [2019-09-08 16:12:23,257 INFO L226 Difference]: Without dead ends: 1297 [2019-09-08 16:12:23,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:12:23,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2019-09-08 16:12:23,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 1297. [2019-09-08 16:12:23,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1297 states. [2019-09-08 16:12:23,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1297 states to 1297 states and 1692 transitions. [2019-09-08 16:12:23,457 INFO L78 Accepts]: Start accepts. Automaton has 1297 states and 1692 transitions. Word has length 41 [2019-09-08 16:12:23,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:12:23,458 INFO L475 AbstractCegarLoop]: Abstraction has 1297 states and 1692 transitions. [2019-09-08 16:12:23,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:12:23,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1297 states and 1692 transitions. [2019-09-08 16:12:23,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-08 16:12:23,478 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:12:23,478 INFO L399 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] [2019-09-08 16:12:23,479 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:12:23,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:12:23,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1934004690, now seen corresponding path program 1 times [2019-09-08 16:12:23,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:12:23,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:12:23,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:12:23,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:12:23,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:12:23,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:12:23,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 16:12:23,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:12:23,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 16:12:23,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 16:12:23,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 16:12:23,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 16:12:23,632 INFO L87 Difference]: Start difference. First operand 1297 states and 1692 transitions. Second operand 5 states. [2019-09-08 16:12:23,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:12:23,773 INFO L93 Difference]: Finished difference Result 2577 states and 3365 transitions. [2019-09-08 16:12:23,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 16:12:23,773 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-09-08 16:12:23,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:12:23,783 INFO L225 Difference]: With dead ends: 2577 [2019-09-08 16:12:23,784 INFO L226 Difference]: Without dead ends: 1296 [2019-09-08 16:12:23,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 16:12:23,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2019-09-08 16:12:23,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1296. [2019-09-08 16:12:23,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1296 states. [2019-09-08 16:12:23,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1296 states and 1688 transitions. [2019-09-08 16:12:23,844 INFO L78 Accepts]: Start accepts. Automaton has 1296 states and 1688 transitions. Word has length 44 [2019-09-08 16:12:23,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:12:23,844 INFO L475 AbstractCegarLoop]: Abstraction has 1296 states and 1688 transitions. [2019-09-08 16:12:23,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 16:12:23,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 1688 transitions. [2019-09-08 16:12:23,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-08 16:12:23,850 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:12:23,850 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 16:12:23,850 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:12:23,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:12:23,851 INFO L82 PathProgramCache]: Analyzing trace with hash -539260528, now seen corresponding path program 1 times [2019-09-08 16:12:23,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:12:23,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:12:23,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:12:23,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:12:23,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:12:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:12:24,078 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 16:12:24,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:12:24,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 16:12:24,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 16:12:24,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 16:12:24,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 16:12:24,080 INFO L87 Difference]: Start difference. First operand 1296 states and 1688 transitions. Second operand 6 states. [2019-09-08 16:12:25,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:12:25,151 INFO L93 Difference]: Finished difference Result 2580 states and 3397 transitions. [2019-09-08 16:12:25,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 16:12:25,153 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-09-08 16:12:25,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:12:25,166 INFO L225 Difference]: With dead ends: 2580 [2019-09-08 16:12:25,167 INFO L226 Difference]: Without dead ends: 2564 [2019-09-08 16:12:25,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 16:12:25,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2019-09-08 16:12:25,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 2564. [2019-09-08 16:12:25,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2564 states. [2019-09-08 16:12:25,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2564 states to 2564 states and 3381 transitions. [2019-09-08 16:12:25,283 INFO L78 Accepts]: Start accepts. Automaton has 2564 states and 3381 transitions. Word has length 65 [2019-09-08 16:12:25,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:12:25,285 INFO L475 AbstractCegarLoop]: Abstraction has 2564 states and 3381 transitions. [2019-09-08 16:12:25,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 16:12:25,285 INFO L276 IsEmpty]: Start isEmpty. Operand 2564 states and 3381 transitions. [2019-09-08 16:12:25,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-08 16:12:25,298 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:12:25,299 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 16:12:25,299 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:12:25,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:12:25,300 INFO L82 PathProgramCache]: Analyzing trace with hash 186954161, now seen corresponding path program 1 times [2019-09-08 16:12:25,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:12:25,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:12:25,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:12:25,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:12:25,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:12:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:12:25,529 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 16:12:25,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:12:25,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:12:25,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:12:25,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:12:25,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:12:25,532 INFO L87 Difference]: Start difference. First operand 2564 states and 3381 transitions. Second operand 3 states. [2019-09-08 16:12:25,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:12:25,891 INFO L93 Difference]: Finished difference Result 6629 states and 8758 transitions. [2019-09-08 16:12:25,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:12:25,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-09-08 16:12:25,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:12:25,923 INFO L225 Difference]: With dead ends: 6629 [2019-09-08 16:12:25,923 INFO L226 Difference]: Without dead ends: 4081 [2019-09-08 16:12:25,935 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:12:25,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4081 states. [2019-09-08 16:12:26,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4081 to 4051. [2019-09-08 16:12:26,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4051 states. [2019-09-08 16:12:26,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4051 states to 4051 states and 5333 transitions. [2019-09-08 16:12:26,147 INFO L78 Accepts]: Start accepts. Automaton has 4051 states and 5333 transitions. Word has length 112 [2019-09-08 16:12:26,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:12:26,148 INFO L475 AbstractCegarLoop]: Abstraction has 4051 states and 5333 transitions. [2019-09-08 16:12:26,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:12:26,148 INFO L276 IsEmpty]: Start isEmpty. Operand 4051 states and 5333 transitions. [2019-09-08 16:12:26,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-08 16:12:26,156 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:12:26,157 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 16:12:26,157 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:12:26,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:12:26,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1243922125, now seen corresponding path program 2 times [2019-09-08 16:12:26,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:12:26,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:12:26,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:12:26,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:12:26,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:12:26,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:12:26,380 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 16:12:26,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:12:26,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:12:26,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:12:26,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:12:26,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:12:26,382 INFO L87 Difference]: Start difference. First operand 4051 states and 5333 transitions. Second operand 3 states. [2019-09-08 16:12:26,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:12:26,590 INFO L93 Difference]: Finished difference Result 7543 states and 9915 transitions. [2019-09-08 16:12:26,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:12:26,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-09-08 16:12:26,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:12:26,610 INFO L225 Difference]: With dead ends: 7543 [2019-09-08 16:12:26,610 INFO L226 Difference]: Without dead ends: 3517 [2019-09-08 16:12:26,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:12:26,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3517 states. [2019-09-08 16:12:26,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3517 to 3489. [2019-09-08 16:12:26,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3489 states. [2019-09-08 16:12:26,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3489 states to 3489 states and 4577 transitions. [2019-09-08 16:12:26,781 INFO L78 Accepts]: Start accepts. Automaton has 3489 states and 4577 transitions. Word has length 112 [2019-09-08 16:12:26,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:12:26,782 INFO L475 AbstractCegarLoop]: Abstraction has 3489 states and 4577 transitions. [2019-09-08 16:12:26,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:12:26,782 INFO L276 IsEmpty]: Start isEmpty. Operand 3489 states and 4577 transitions. [2019-09-08 16:12:26,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 16:12:26,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:12:26,789 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-09-08 16:12:26,790 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:12:26,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:12:26,790 INFO L82 PathProgramCache]: Analyzing trace with hash 468006100, now seen corresponding path program 1 times [2019-09-08 16:12:26,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:12:26,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:12:26,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:12:26,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:12:26,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:12:26,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:12:26,908 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 16:12:26,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:12:26,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:12:26,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:12:26,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:12:26,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:12:26,910 INFO L87 Difference]: Start difference. First operand 3489 states and 4577 transitions. Second operand 3 states. [2019-09-08 16:12:27,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:12:27,191 INFO L93 Difference]: Finished difference Result 7023 states and 9226 transitions. [2019-09-08 16:12:27,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:12:27,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-09-08 16:12:27,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:12:27,216 INFO L225 Difference]: With dead ends: 7023 [2019-09-08 16:12:27,217 INFO L226 Difference]: Without dead ends: 4269 [2019-09-08 16:12:27,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:12:27,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4269 states. [2019-09-08 16:12:27,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4269 to 4241. [2019-09-08 16:12:27,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4241 states. [2019-09-08 16:12:27,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4241 states to 4241 states and 5560 transitions. [2019-09-08 16:12:27,415 INFO L78 Accepts]: Start accepts. Automaton has 4241 states and 5560 transitions. Word has length 129 [2019-09-08 16:12:27,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:12:27,415 INFO L475 AbstractCegarLoop]: Abstraction has 4241 states and 5560 transitions. [2019-09-08 16:12:27,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:12:27,416 INFO L276 IsEmpty]: Start isEmpty. Operand 4241 states and 5560 transitions. [2019-09-08 16:12:27,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-08 16:12:27,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:12:27,488 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 16:12:27,488 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:12:27,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:12:27,489 INFO L82 PathProgramCache]: Analyzing trace with hash -847576212, now seen corresponding path program 1 times [2019-09-08 16:12:27,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:12:27,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:12:27,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:12:27,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:12:27,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:12:27,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:12:27,668 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 16:12:27,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:12:27,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 16:12:27,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 16:12:27,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 16:12:27,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 16:12:27,670 INFO L87 Difference]: Start difference. First operand 4241 states and 5560 transitions. Second operand 6 states. [2019-09-08 16:12:29,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:12:29,246 INFO L93 Difference]: Finished difference Result 12031 states and 15881 transitions. [2019-09-08 16:12:29,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 16:12:29,247 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 174 [2019-09-08 16:12:29,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:12:29,295 INFO L225 Difference]: With dead ends: 12031 [2019-09-08 16:12:29,295 INFO L226 Difference]: Without dead ends: 7815 [2019-09-08 16:12:29,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-09-08 16:12:29,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7815 states. [2019-09-08 16:12:29,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7815 to 7799. [2019-09-08 16:12:29,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7799 states. [2019-09-08 16:12:29,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7799 states to 7799 states and 10254 transitions. [2019-09-08 16:12:29,765 INFO L78 Accepts]: Start accepts. Automaton has 7799 states and 10254 transitions. Word has length 174 [2019-09-08 16:12:29,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:12:29,765 INFO L475 AbstractCegarLoop]: Abstraction has 7799 states and 10254 transitions. [2019-09-08 16:12:29,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 16:12:29,766 INFO L276 IsEmpty]: Start isEmpty. Operand 7799 states and 10254 transitions. [2019-09-08 16:12:29,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 16:12:29,780 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:12:29,781 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 16:12:29,781 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:12:29,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:12:29,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1626968450, now seen corresponding path program 1 times [2019-09-08 16:12:29,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:12:29,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:12:29,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:12:29,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:12:29,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:12:29,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:12:29,934 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 16:12:29,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:12:29,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 16:12:29,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 16:12:29,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 16:12:29,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 16:12:29,936 INFO L87 Difference]: Start difference. First operand 7799 states and 10254 transitions. Second operand 6 states. [2019-09-08 16:12:31,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:12:31,775 INFO L93 Difference]: Finished difference Result 22657 states and 29910 transitions. [2019-09-08 16:12:31,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 16:12:31,776 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 173 [2019-09-08 16:12:31,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:12:31,846 INFO L225 Difference]: With dead ends: 22657 [2019-09-08 16:12:31,846 INFO L226 Difference]: Without dead ends: 14883 [2019-09-08 16:12:31,876 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-09-08 16:12:31,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14883 states. [2019-09-08 16:12:32,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14883 to 14851. [2019-09-08 16:12:32,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14851 states. [2019-09-08 16:12:32,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14851 states to 14851 states and 19501 transitions. [2019-09-08 16:12:32,580 INFO L78 Accepts]: Start accepts. Automaton has 14851 states and 19501 transitions. Word has length 173 [2019-09-08 16:12:32,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:12:32,581 INFO L475 AbstractCegarLoop]: Abstraction has 14851 states and 19501 transitions. [2019-09-08 16:12:32,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 16:12:32,582 INFO L276 IsEmpty]: Start isEmpty. Operand 14851 states and 19501 transitions. [2019-09-08 16:12:32,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 16:12:32,597 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:12:32,598 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 16:12:32,598 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:12:32,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:12:32,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1972595355, now seen corresponding path program 1 times [2019-09-08 16:12:32,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:12:32,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:12:32,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:12:32,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:12:32,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:12:32,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:12:33,496 WARN L188 SmtUtils]: Spent 713.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2019-09-08 16:12:33,534 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 16:12:33,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:12:33,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 16:12:33,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 16:12:33,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 16:12:33,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 16:12:33,537 INFO L87 Difference]: Start difference. First operand 14851 states and 19501 transitions. Second operand 6 states. [2019-09-08 16:12:35,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:12:35,564 INFO L93 Difference]: Finished difference Result 43851 states and 57762 transitions. [2019-09-08 16:12:35,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 16:12:35,564 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 175 [2019-09-08 16:12:35,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:12:35,681 INFO L225 Difference]: With dead ends: 43851 [2019-09-08 16:12:35,682 INFO L226 Difference]: Without dead ends: 29025 [2019-09-08 16:12:35,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-09-08 16:12:35,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29025 states. [2019-09-08 16:12:36,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29025 to 28961. [2019-09-08 16:12:36,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28961 states. [2019-09-08 16:12:37,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28961 states to 28961 states and 37978 transitions. [2019-09-08 16:12:37,095 INFO L78 Accepts]: Start accepts. Automaton has 28961 states and 37978 transitions. Word has length 175 [2019-09-08 16:12:37,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:12:37,095 INFO L475 AbstractCegarLoop]: Abstraction has 28961 states and 37978 transitions. [2019-09-08 16:12:37,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 16:12:37,096 INFO L276 IsEmpty]: Start isEmpty. Operand 28961 states and 37978 transitions. [2019-09-08 16:12:37,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-08 16:12:37,112 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:12:37,112 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 16:12:37,112 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:12:37,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:12:37,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1362816435, now seen corresponding path program 1 times [2019-09-08 16:12:37,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:12:37,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:12:37,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:12:37,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:12:37,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:12:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:12:37,273 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 16:12:37,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:12:37,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 16:12:37,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 16:12:37,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 16:12:37,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 16:12:37,275 INFO L87 Difference]: Start difference. First operand 28961 states and 37978 transitions. Second operand 7 states. [2019-09-08 16:12:43,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:12:43,985 INFO L93 Difference]: Finished difference Result 88512 states and 116274 transitions. [2019-09-08 16:12:43,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 16:12:43,986 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 172 [2019-09-08 16:12:43,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:12:44,179 INFO L225 Difference]: With dead ends: 88512 [2019-09-08 16:12:44,179 INFO L226 Difference]: Without dead ends: 56614 [2019-09-08 16:12:44,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-09-08 16:12:44,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56614 states. [2019-09-08 16:12:46,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56614 to 56007. [2019-09-08 16:12:46,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56007 states. [2019-09-08 16:12:46,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56007 states to 56007 states and 73345 transitions. [2019-09-08 16:12:46,473 INFO L78 Accepts]: Start accepts. Automaton has 56007 states and 73345 transitions. Word has length 172 [2019-09-08 16:12:46,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:12:46,474 INFO L475 AbstractCegarLoop]: Abstraction has 56007 states and 73345 transitions. [2019-09-08 16:12:46,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 16:12:46,474 INFO L276 IsEmpty]: Start isEmpty. Operand 56007 states and 73345 transitions. [2019-09-08 16:12:46,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 16:12:46,487 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:12:46,488 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 16:12:46,488 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:12:46,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:12:46,489 INFO L82 PathProgramCache]: Analyzing trace with hash -733195482, now seen corresponding path program 1 times [2019-09-08 16:12:46,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:12:46,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:12:46,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:12:46,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:12:46,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:12:46,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:12:46,612 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 16:12:46,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:12:46,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:12:46,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:12:46,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:12:46,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:12:46,614 INFO L87 Difference]: Start difference. First operand 56007 states and 73345 transitions. Second operand 3 states. [2019-09-08 16:12:49,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:12:49,176 INFO L93 Difference]: Finished difference Result 113295 states and 150379 transitions. [2019-09-08 16:12:49,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:12:49,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-09-08 16:12:49,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:12:49,384 INFO L225 Difference]: With dead ends: 113295 [2019-09-08 16:12:49,384 INFO L226 Difference]: Without dead ends: 57347 [2019-09-08 16:12:49,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:12:49,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57347 states. [2019-09-08 16:12:51,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57347 to 56141. [2019-09-08 16:12:51,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56141 states. [2019-09-08 16:12:51,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56141 states to 56141 states and 73479 transitions. [2019-09-08 16:12:51,396 INFO L78 Accepts]: Start accepts. Automaton has 56141 states and 73479 transitions. Word has length 175 [2019-09-08 16:12:51,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:12:51,397 INFO L475 AbstractCegarLoop]: Abstraction has 56141 states and 73479 transitions. [2019-09-08 16:12:51,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:12:51,397 INFO L276 IsEmpty]: Start isEmpty. Operand 56141 states and 73479 transitions. [2019-09-08 16:12:51,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 16:12:51,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:12:51,410 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 16:12:51,411 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:12:51,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:12:51,411 INFO L82 PathProgramCache]: Analyzing trace with hash -949831620, now seen corresponding path program 1 times [2019-09-08 16:12:51,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:12:51,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:12:51,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:12:51,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:12:51,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:12:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:12:51,554 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-09-08 16:12:51,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:12:51,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:12:51,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:12:51,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:12:51,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:12:51,556 INFO L87 Difference]: Start difference. First operand 56141 states and 73479 transitions. Second operand 3 states. [2019-09-08 16:12:52,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:12:52,896 INFO L93 Difference]: Finished difference Result 84780 states and 112160 transitions. [2019-09-08 16:12:52,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:12:52,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-08 16:12:52,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:12:53,100 INFO L225 Difference]: With dead ends: 84780 [2019-09-08 16:12:53,100 INFO L226 Difference]: Without dead ends: 56389 [2019-09-08 16:12:53,206 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:12:53,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56389 states. [2019-09-08 16:12:56,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56389 to 56265. [2019-09-08 16:12:56,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56265 states. [2019-09-08 16:12:56,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56265 states to 56265 states and 73603 transitions. [2019-09-08 16:12:56,976 INFO L78 Accepts]: Start accepts. Automaton has 56265 states and 73603 transitions. Word has length 176 [2019-09-08 16:12:56,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:12:56,977 INFO L475 AbstractCegarLoop]: Abstraction has 56265 states and 73603 transitions. [2019-09-08 16:12:56,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:12:56,977 INFO L276 IsEmpty]: Start isEmpty. Operand 56265 states and 73603 transitions. [2019-09-08 16:12:56,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 16:12:56,993 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:12:56,993 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 16:12:56,993 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:12:56,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:12:56,994 INFO L82 PathProgramCache]: Analyzing trace with hash -857086757, now seen corresponding path program 1 times [2019-09-08 16:12:56,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:12:56,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:12:56,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:12:56,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:12:56,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:12:57,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:12:57,228 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 16:12:57,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:12:57,228 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:12:57,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:12:57,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:12:57,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 2276 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 16:12:57,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:12:57,773 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-09-08 16:12:57,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 16:12:57,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2019-09-08 16:12:57,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 16:12:57,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 16:12:57,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 16:12:57,786 INFO L87 Difference]: Start difference. First operand 56265 states and 73603 transitions. Second operand 5 states. [2019-09-08 16:13:00,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:13:00,724 INFO L93 Difference]: Finished difference Result 69480 states and 90690 transitions. [2019-09-08 16:13:00,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 16:13:00,725 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 178 [2019-09-08 16:13:00,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:13:01,020 INFO L225 Difference]: With dead ends: 69480 [2019-09-08 16:13:01,020 INFO L226 Difference]: Without dead ends: 69464 [2019-09-08 16:13:01,060 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 16:13:01,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69464 states. [2019-09-08 16:13:05,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69464 to 69462. [2019-09-08 16:13:05,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69462 states. [2019-09-08 16:13:05,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69462 states to 69462 states and 90609 transitions. [2019-09-08 16:13:05,941 INFO L78 Accepts]: Start accepts. Automaton has 69462 states and 90609 transitions. Word has length 178 [2019-09-08 16:13:05,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:13:05,941 INFO L475 AbstractCegarLoop]: Abstraction has 69462 states and 90609 transitions. [2019-09-08 16:13:05,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 16:13:05,942 INFO L276 IsEmpty]: Start isEmpty. Operand 69462 states and 90609 transitions. [2019-09-08 16:13:05,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-08 16:13:05,978 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:13:05,978 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 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] [2019-09-08 16:13:05,979 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:13:05,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:13:05,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1556408746, now seen corresponding path program 1 times [2019-09-08 16:13:05,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:13:05,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:13:05,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:13:05,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:13:05,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:13:06,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:13:06,165 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 16:13:06,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:13:06,165 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 16:13:06,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:13:06,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:13:06,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 2357 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 16:13:06,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:13:06,782 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 16:13:06,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:13:06,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2019-09-08 16:13:06,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 16:13:06,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 16:13:06,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2019-09-08 16:13:06,803 INFO L87 Difference]: Start difference. First operand 69462 states and 90609 transitions. Second operand 17 states. [2019-09-08 16:13:24,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:13:24,207 INFO L93 Difference]: Finished difference Result 214240 states and 280448 transitions. [2019-09-08 16:13:24,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 16:13:24,208 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 189 [2019-09-08 16:13:24,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:13:24,661 INFO L225 Difference]: With dead ends: 214240 [2019-09-08 16:13:24,661 INFO L226 Difference]: Without dead ends: 136432 [2019-09-08 16:13:24,863 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=419, Invalid=1933, Unknown=0, NotChecked=0, Total=2352 [2019-09-08 16:13:25,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136432 states. [2019-09-08 16:13:28,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136432 to 120357. [2019-09-08 16:13:28,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120357 states. [2019-09-08 16:13:33,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120357 states to 120357 states and 157575 transitions. [2019-09-08 16:13:33,731 INFO L78 Accepts]: Start accepts. Automaton has 120357 states and 157575 transitions. Word has length 189 [2019-09-08 16:13:33,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:13:33,731 INFO L475 AbstractCegarLoop]: Abstraction has 120357 states and 157575 transitions. [2019-09-08 16:13:33,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 16:13:33,732 INFO L276 IsEmpty]: Start isEmpty. Operand 120357 states and 157575 transitions. [2019-09-08 16:13:33,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-08 16:13:33,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:13:33,757 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 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] [2019-09-08 16:13:33,757 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:13:33,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:13:33,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1506644933, now seen corresponding path program 1 times [2019-09-08 16:13:33,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:13:33,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:13:33,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:13:33,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:13:33,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:13:33,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:13:33,994 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 16:13:33,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:13:33,996 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:13:34,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:13:34,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:13:34,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 2359 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 16:13:34,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:13:34,561 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 16:13:34,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:13:34,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2019-09-08 16:13:34,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 16:13:34,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 16:13:34,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2019-09-08 16:13:34,569 INFO L87 Difference]: Start difference. First operand 120357 states and 157575 transitions. Second operand 19 states. [2019-09-08 16:14:05,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:14:05,257 INFO L93 Difference]: Finished difference Result 364207 states and 477382 transitions. [2019-09-08 16:14:05,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-08 16:14:05,258 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 190 [2019-09-08 16:14:05,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:14:06,071 INFO L225 Difference]: With dead ends: 364207 [2019-09-08 16:14:06,071 INFO L226 Difference]: Without dead ends: 230555 [2019-09-08 16:14:06,264 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1718 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=851, Invalid=5155, Unknown=0, NotChecked=0, Total=6006 [2019-09-08 16:14:06,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230555 states. [2019-09-08 16:14:11,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230555 to 201981. [2019-09-08 16:14:11,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201981 states. [2019-09-08 16:14:18,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201981 states to 201981 states and 264595 transitions. [2019-09-08 16:14:18,870 INFO L78 Accepts]: Start accepts. Automaton has 201981 states and 264595 transitions. Word has length 190 [2019-09-08 16:14:18,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:14:18,871 INFO L475 AbstractCegarLoop]: Abstraction has 201981 states and 264595 transitions. [2019-09-08 16:14:18,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 16:14:18,871 INFO L276 IsEmpty]: Start isEmpty. Operand 201981 states and 264595 transitions. [2019-09-08 16:14:18,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-08 16:14:18,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:14:18,891 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 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] [2019-09-08 16:14:18,891 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:14:18,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:14:18,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1904887279, now seen corresponding path program 1 times [2019-09-08 16:14:18,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:14:18,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:14:18,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:14:18,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:14:18,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:14:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:14:19,101 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 16:14:19,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:14:19,101 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:14:19,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:14:19,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:14:19,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 2361 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 16:14:19,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:14:19,668 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 16:14:19,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:14:19,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2019-09-08 16:14:19,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 16:14:19,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 16:14:19,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2019-09-08 16:14:19,678 INFO L87 Difference]: Start difference. First operand 201981 states and 264595 transitions. Second operand 19 states. [2019-09-08 16:14:50,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:14:50,643 INFO L93 Difference]: Finished difference Result 600955 states and 787893 transitions. [2019-09-08 16:14:50,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-08 16:14:50,644 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 191 [2019-09-08 16:14:50,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:14:51,791 INFO L225 Difference]: With dead ends: 600955 [2019-09-08 16:14:51,791 INFO L226 Difference]: Without dead ends: 372447 [2019-09-08 16:14:52,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1718 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=851, Invalid=5155, Unknown=0, NotChecked=0, Total=6006 [2019-09-08 16:14:52,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372447 states. [2019-09-08 16:15:05,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372447 to 333167. [2019-09-08 16:15:05,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333167 states. [2019-09-08 16:15:14,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333167 states to 333167 states and 436470 transitions. [2019-09-08 16:15:14,130 INFO L78 Accepts]: Start accepts. Automaton has 333167 states and 436470 transitions. Word has length 191 [2019-09-08 16:15:14,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:15:14,130 INFO L475 AbstractCegarLoop]: Abstraction has 333167 states and 436470 transitions. [2019-09-08 16:15:14,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 16:15:14,130 INFO L276 IsEmpty]: Start isEmpty. Operand 333167 states and 436470 transitions. [2019-09-08 16:15:14,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-08 16:15:14,145 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:15:14,146 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 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] [2019-09-08 16:15:14,146 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:15:14,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:15:14,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1298356926, now seen corresponding path program 1 times [2019-09-08 16:15:14,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:15:14,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:15:14,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:15:14,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:15:14,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:15:14,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:15:14,370 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 16:15:14,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:15:14,370 INFO L223 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-09-08 16:15:14,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:15:14,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:15:14,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 2363 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 16:15:14,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:15:14,940 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 16:15:14,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:15:14,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2019-09-08 16:15:14,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 16:15:14,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 16:15:14,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2019-09-08 16:15:14,956 INFO L87 Difference]: Start difference. First operand 333167 states and 436470 transitions. Second operand 19 states. [2019-09-08 16:15:52,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:15:52,292 INFO L93 Difference]: Finished difference Result 976555 states and 1278989 transitions. [2019-09-08 16:15:52,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-08 16:15:52,297 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 192 [2019-09-08 16:15:52,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:15:55,178 INFO L225 Difference]: With dead ends: 976555 [2019-09-08 16:15:55,179 INFO L226 Difference]: Without dead ends: 589377 [2019-09-08 16:15:55,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1718 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=851, Invalid=5155, Unknown=0, NotChecked=0, Total=6006 [2019-09-08 16:15:56,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589377 states. [2019-09-08 16:16:23,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589377 to 536818. [2019-09-08 16:16:23,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536818 states. [2019-09-08 16:16:26,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536818 states to 536818 states and 701769 transitions. [2019-09-08 16:16:26,172 INFO L78 Accepts]: Start accepts. Automaton has 536818 states and 701769 transitions. Word has length 192 [2019-09-08 16:16:26,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:16:26,172 INFO L475 AbstractCegarLoop]: Abstraction has 536818 states and 701769 transitions. [2019-09-08 16:16:26,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 16:16:26,173 INFO L276 IsEmpty]: Start isEmpty. Operand 536818 states and 701769 transitions. [2019-09-08 16:16:26,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 16:16:26,183 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:16:26,184 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-09-08 16:16:26,184 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:16:26,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:16:26,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1034985731, now seen corresponding path program 1 times [2019-09-08 16:16:26,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:16:26,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:16:26,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:16:26,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:16:26,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:16:26,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:16:26,334 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-09-08 16:16:26,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:16:26,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:16:26,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:16:26,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:16:26,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:16:26,336 INFO L87 Difference]: Start difference. First operand 536818 states and 701769 transitions. Second operand 3 states. [2019-09-08 16:16:43,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:16:43,377 INFO L93 Difference]: Finished difference Result 1074825 states and 1404474 transitions. [2019-09-08 16:16:43,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:16:43,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-09-08 16:16:43,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:16:54,405 INFO L225 Difference]: With dead ends: 1074825 [2019-09-08 16:16:54,405 INFO L226 Difference]: Without dead ends: 538762 [2019-09-08 16:16:55,007 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:16:55,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538762 states. [2019-09-08 16:17:07,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538762 to 536818. [2019-09-08 16:17:07,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536818 states. [2019-09-08 16:17:21,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536818 states to 536818 states and 700797 transitions. [2019-09-08 16:17:21,825 INFO L78 Accepts]: Start accepts. Automaton has 536818 states and 700797 transitions. Word has length 195 [2019-09-08 16:17:21,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:17:21,825 INFO L475 AbstractCegarLoop]: Abstraction has 536818 states and 700797 transitions. [2019-09-08 16:17:21,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:17:21,825 INFO L276 IsEmpty]: Start isEmpty. Operand 536818 states and 700797 transitions. [2019-09-08 16:17:21,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-08 16:17:21,846 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:17:21,846 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 5, 5, 5, 4, 3, 3, 3, 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] [2019-09-08 16:17:21,847 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:17:21,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:17:21,847 INFO L82 PathProgramCache]: Analyzing trace with hash -652298276, now seen corresponding path program 2 times [2019-09-08 16:17:21,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:17:21,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:17:21,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:17:21,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:17:21,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:17:21,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:17:21,978 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-09-08 16:17:21,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:17:21,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:17:21,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:17:21,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:17:21,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:17:21,980 INFO L87 Difference]: Start difference. First operand 536818 states and 700797 transitions. Second operand 3 states. [2019-09-08 16:17:41,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:17:41,866 INFO L93 Difference]: Finished difference Result 1003155 states and 1308148 transitions. [2019-09-08 16:17:41,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:17:41,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-09-08 16:17:41,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:17:43,879 INFO L225 Difference]: With dead ends: 1003155 [2019-09-08 16:17:43,879 INFO L226 Difference]: Without dead ends: 467092 [2019-09-08 16:17:44,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:17:44,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467092 states. [2019-09-08 16:18:03,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467092 to 465148. [2019-09-08 16:18:03,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465148 states. [2019-09-08 16:18:05,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465148 states to 465148 states and 604795 transitions. [2019-09-08 16:18:05,900 INFO L78 Accepts]: Start accepts. Automaton has 465148 states and 604795 transitions. Word has length 212 [2019-09-08 16:18:05,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:18:05,901 INFO L475 AbstractCegarLoop]: Abstraction has 465148 states and 604795 transitions. [2019-09-08 16:18:05,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:18:05,901 INFO L276 IsEmpty]: Start isEmpty. Operand 465148 states and 604795 transitions. [2019-09-08 16:18:05,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-08 16:18:05,925 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:18:05,926 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 16:18:05,926 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:18:05,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:18:05,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1047878093, now seen corresponding path program 3 times [2019-09-08 16:18:05,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:18:05,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:18:05,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:18:05,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:18:05,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:18:05,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:18:06,090 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-09-08 16:18:06,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:18:06,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:18:06,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:18:06,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:18:06,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:18:06,092 INFO L87 Difference]: Start difference. First operand 465148 states and 604795 transitions. Second operand 3 states. [2019-09-08 16:18:22,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:18:22,125 INFO L93 Difference]: Finished difference Result 837450 states and 1091054 transitions. [2019-09-08 16:18:22,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:18:22,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 236 [2019-09-08 16:18:22,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:18:23,753 INFO L225 Difference]: With dead ends: 837450 [2019-09-08 16:18:23,753 INFO L226 Difference]: Without dead ends: 372563 [2019-09-08 16:18:24,238 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:18:24,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372563 states. [2019-09-08 16:18:32,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372563 to 372563. [2019-09-08 16:18:32,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372563 states. [2019-09-08 16:18:46,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372563 states to 372563 states and 484661 transitions. [2019-09-08 16:18:47,009 INFO L78 Accepts]: Start accepts. Automaton has 372563 states and 484661 transitions. Word has length 236 [2019-09-08 16:18:47,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:18:47,010 INFO L475 AbstractCegarLoop]: Abstraction has 372563 states and 484661 transitions. [2019-09-08 16:18:47,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:18:47,010 INFO L276 IsEmpty]: Start isEmpty. Operand 372563 states and 484661 transitions. [2019-09-08 16:18:47,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-09-08 16:18:47,028 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:18:47,028 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 5, 5, 5, 4, 4, 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] [2019-09-08 16:18:47,028 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:18:47,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:18:47,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1669830523, now seen corresponding path program 1 times [2019-09-08 16:18:47,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:18:47,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:18:47,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:18:47,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:18:47,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:18:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:18:47,280 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-08 16:18:47,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:18:47,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 16:18:47,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 16:18:47,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 16:18:47,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 16:18:47,281 INFO L87 Difference]: Start difference. First operand 372563 states and 484661 transitions. Second operand 8 states. [2019-09-08 16:19:05,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:19:05,757 INFO L93 Difference]: Finished difference Result 746963 states and 974176 transitions. [2019-09-08 16:19:05,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 16:19:05,757 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 269 [2019-09-08 16:19:05,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:19:06,850 INFO L225 Difference]: With dead ends: 746963 [2019-09-08 16:19:06,851 INFO L226 Difference]: Without dead ends: 375155 [2019-09-08 16:19:07,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-08 16:19:07,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375155 states. [2019-09-08 16:19:15,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375155 to 373535. [2019-09-08 16:19:15,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373535 states. [2019-09-08 16:19:17,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373535 states to 373535 states and 485957 transitions. [2019-09-08 16:19:17,405 INFO L78 Accepts]: Start accepts. Automaton has 373535 states and 485957 transitions. Word has length 269 [2019-09-08 16:19:17,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:19:17,405 INFO L475 AbstractCegarLoop]: Abstraction has 373535 states and 485957 transitions. [2019-09-08 16:19:17,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 16:19:17,405 INFO L276 IsEmpty]: Start isEmpty. Operand 373535 states and 485957 transitions. [2019-09-08 16:19:17,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-09-08 16:19:17,424 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:19:17,424 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 5, 5, 5, 4, 4, 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] [2019-09-08 16:19:17,424 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:19:17,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:19:17,425 INFO L82 PathProgramCache]: Analyzing trace with hash 539103240, now seen corresponding path program 1 times [2019-09-08 16:19:17,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:19:17,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:19:17,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:19:17,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:19:17,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:19:17,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:19:17,786 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-08 16:19:17,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:19:17,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 16:19:17,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 16:19:17,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 16:19:17,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-09-08 16:19:17,789 INFO L87 Difference]: Start difference. First operand 373535 states and 485957 transitions. Second operand 9 states. [2019-09-08 16:19:32,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:19:32,740 INFO L93 Difference]: Finished difference Result 556347 states and 730958 transitions. [2019-09-08 16:19:32,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 16:19:32,740 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 273 [2019-09-08 16:19:32,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:19:32,767 INFO L225 Difference]: With dead ends: 556347 [2019-09-08 16:19:32,767 INFO L226 Difference]: Without dead ends: 0 [2019-09-08 16:19:34,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-09-08 16:19:34,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-08 16:19:34,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-08 16:19:34,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-08 16:19:34,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-08 16:19:34,042 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 273 [2019-09-08 16:19:34,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:19:34,042 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-08 16:19:34,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 16:19:34,042 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-08 16:19:34,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-08 16:19:34,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-08 16:19:37,001 WARN L188 SmtUtils]: Spent 1.22 s on a formula simplification that was a NOOP. DAG size: 1 [2019-09-08 16:19:44,819 WARN L188 SmtUtils]: Spent 5.70 s on a formula simplification that was a NOOP. DAG size: 1 [2019-09-08 16:20:18,316 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-09-08 16:20:20,854 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-09-08 16:20:23,328 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-09-08 16:20:25,903 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-09-08 16:20:28,478 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-09-08 16:20:31,096 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-09-08 16:20:33,548 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-09-08 16:20:36,199 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-09-08 16:20:38,903 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-09-08 16:20:41,671 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-09-08 16:20:47,244 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-09-08 16:20:50,071 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-09-08 16:20:52,902 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-09-08 16:20:55,722 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-09-08 16:20:58,651 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-09-08 16:21:04,626 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-09-08 16:21:07,582 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-09-08 16:21:10,632 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-09-08 16:21:16,838 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-09-08 16:21:20,024 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-09-08 16:21:23,262 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-09-08 16:21:26,479 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-09-08 16:21:29,726 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-09-08 16:21:35,952 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-09-08 16:21:39,331 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-09-08 16:21:42,499 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 1 [2019-09-08 16:21:45,857 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-09-08 16:21:49,383 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-09-08 16:21:52,917 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-09-08 16:21:56,428 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-08 16:21:59,944 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-09-08 16:22:03,579 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-09-08 16:22:07,232 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-09-08 16:22:10,922 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-09-08 16:22:14,319 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-09-08 16:22:18,028 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-09-08 16:22:21,670 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 18 [2019-09-08 16:22:24,708 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 21 [2019-09-08 16:22:27,742 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2019-09-08 16:22:30,879 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 16 [2019-09-08 16:22:33,970 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 25