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--caif--caif_hsi.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 06:53:19,340 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 06:53:19,343 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 06:53:19,355 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 06:53:19,356 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 06:53:19,357 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 06:53:19,358 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 06:53:19,360 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 06:53:19,362 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 06:53:19,363 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 06:53:19,364 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 06:53:19,366 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 06:53:19,366 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 06:53:19,367 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 06:53:19,368 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 06:53:19,369 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 06:53:19,370 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 06:53:19,371 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 06:53:19,373 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 06:53:19,376 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 06:53:19,378 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 06:53:19,379 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 06:53:19,380 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 06:53:19,381 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 06:53:19,384 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 06:53:19,385 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 06:53:19,385 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 06:53:19,386 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 06:53:19,386 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 06:53:19,393 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 06:53:19,393 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 06:53:19,394 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 06:53:19,395 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 06:53:19,396 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 06:53:19,397 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 06:53:19,397 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 06:53:19,398 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 06:53:19,398 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 06:53:19,399 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 06:53:19,401 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 06:53:19,405 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 06:53:19,406 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 06:53:19,442 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 06:53:19,442 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 06:53:19,445 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 06:53:19,445 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 06:53:19,445 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 06:53:19,445 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 06:53:19,446 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 06:53:19,446 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 06:53:19,446 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 06:53:19,446 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 06:53:19,446 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 06:53:19,447 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 06:53:19,447 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 06:53:19,447 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 06:53:19,448 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 06:53:19,448 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 06:53:19,448 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 06:53:19,449 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 06:53:19,449 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 06:53:19,449 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 06:53:19,449 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 06:53:19,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 06:53:19,450 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 06:53:19,450 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 06:53:19,450 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 06:53:19,450 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 06:53:19,450 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 06:53:19,451 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 06:53:19,451 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 06:53:19,485 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 06:53:19,498 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 06:53:19,502 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 06:53:19,503 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 06:53:19,504 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 06:53:19,505 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--caif--caif_hsi.ko-entry_point.cil.out.i [2019-10-02 06:53:19,593 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a93cef3ae/205070ff405b43e2934b0ef6ea3b667a/FLAGf7e6d78ce [2019-10-02 06:53:20,467 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 06:53:20,470 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--caif--caif_hsi.ko-entry_point.cil.out.i [2019-10-02 06:53:20,526 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a93cef3ae/205070ff405b43e2934b0ef6ea3b667a/FLAGf7e6d78ce [2019-10-02 06:53:20,903 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a93cef3ae/205070ff405b43e2934b0ef6ea3b667a [2019-10-02 06:53:20,914 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 06:53:20,916 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 06:53:20,917 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 06:53:20,917 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 06:53:20,920 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 06:53:20,921 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 06:53:20" (1/1) ... [2019-10-02 06:53:20,923 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@609faa02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 06:53:20, skipping insertion in model container [2019-10-02 06:53:20,924 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 06:53:20" (1/1) ... [2019-10-02 06:53:20,931 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 06:53:21,100 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 06:53:23,374 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 06:53:23,408 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 06:53:23,939 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 06:53:24,192 INFO L192 MainTranslator]: Completed translation [2019-10-02 06:53:24,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 06:53:24 WrapperNode [2019-10-02 06:53:24,194 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 06:53:24,195 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 06:53:24,195 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 06:53:24,195 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 06:53:24,209 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 06:53:24" (1/1) ... [2019-10-02 06:53:24,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 06:53:24" (1/1) ... [2019-10-02 06:53:24,314 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 06:53:24" (1/1) ... [2019-10-02 06:53:24,314 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 06:53:24" (1/1) ... [2019-10-02 06:53:24,457 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 06:53:24" (1/1) ... [2019-10-02 06:53:24,489 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 06:53:24" (1/1) ... [2019-10-02 06:53:24,528 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 06:53:24" (1/1) ... [2019-10-02 06:53:24,566 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 06:53:24,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 06:53:24,567 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 06:53:24,567 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 06:53:24,568 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 06:53:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 06:53:24,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 06:53:24,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 06:53:24,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2019-10-02 06:53:24,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~$Pointer$~TO~int [2019-10-02 06:53:24,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~VOID [2019-10-02 06:53:24,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2019-10-02 06:53:24,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~$Pointer$ [2019-10-02 06:53:24,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2019-10-02 06:53:24,662 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2019-10-02 06:53:24,663 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2019-10-02 06:53:24,663 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2019-10-02 06:53:24,664 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2019-10-02 06:53:24,666 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2019-10-02 06:53:24,666 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2019-10-02 06:53:24,668 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2019-10-02 06:53:24,668 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2019-10-02 06:53:24,669 INFO L138 BoogieDeclarations]: Found implementation of procedure preempt_count [2019-10-02 06:53:24,669 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2019-10-02 06:53:24,669 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2019-10-02 06:53:24,670 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2019-10-02 06:53:24,670 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_work [2019-10-02 06:53:24,670 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_work [2019-10-02 06:53:24,670 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2019-10-02 06:53:24,670 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2019-10-02 06:53:24,671 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2019-10-02 06:53:24,671 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_queue_len [2019-10-02 06:53:24,671 INFO L138 BoogieDeclarations]: Found implementation of procedure __skb_queue_head_init [2019-10-02 06:53:24,672 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_queue_head_init [2019-10-02 06:53:24,672 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reset_mac_header [2019-10-02 06:53:24,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-10-02 06:53:24,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-10-02 06:53:24,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2019-10-02 06:53:24,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ptr [2019-10-02 06:53:24,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2019-10-02 06:53:24,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-10-02 06:53:24,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2019-10-02 06:53:24,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-10-02 06:53:24,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_trap [2019-10-02 06:53:24,674 INFO L138 BoogieDeclarations]: Found implementation of procedure hold_net [2019-10-02 06:53:24,674 INFO L138 BoogieDeclarations]: Found implementation of procedure release_net [2019-10-02 06:53:24,675 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_net_set [2019-10-02 06:53:24,675 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2019-10-02 06:53:24,675 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_attr_size [2019-10-02 06:53:24,675 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_total_size [2019-10-02 06:53:24,675 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_data [2019-10-02 06:53:24,675 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_put_u32 [2019-10-02 06:53:24,675 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_get_u32 [2019-10-02 06:53:24,676 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_inactivity_tout [2019-10-02 06:53:24,676 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_update_aggregation_stats [2019-10-02 06:53:24,676 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_can_send_aggregate [2019-10-02 06:53:24,676 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_dequeue [2019-10-02 06:53:24,676 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_tx_queue_len [2019-10-02 06:53:24,676 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_abort_tx [2019-10-02 06:53:24,677 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_flush_fifo [2019-10-02 06:53:24,677 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_tx_frm [2019-10-02 06:53:24,677 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_start_tx [2019-10-02 06:53:24,677 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_tx_done [2019-10-02 06:53:24,677 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_tx_done_cb [2019-10-02 06:53:24,677 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_rx_desc [2019-10-02 06:53:24,678 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_rx_desc_len [2019-10-02 06:53:24,678 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_rx_pld [2019-10-02 06:53:24,678 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_rx_done [2019-10-02 06:53:24,679 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_rx_slowpath [2019-10-02 06:53:24,679 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_rx_done_cb [2019-10-02 06:53:24,679 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_wake_up [2019-10-02 06:53:24,679 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_wake_down [2019-10-02 06:53:24,679 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_out_of_sync [2019-10-02 06:53:24,680 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_wake_up_cb [2019-10-02 06:53:24,680 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_wake_down_cb [2019-10-02 06:53:24,680 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_aggregation_tout [2019-10-02 06:53:24,681 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_xmit [2019-10-02 06:53:24,681 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_setup [2019-10-02 06:53:24,681 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_open [2019-10-02 06:53:24,681 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_close [2019-10-02 06:53:24,682 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_uninit [2019-10-02 06:53:24,682 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_netlink_parms [2019-10-02 06:53:24,683 INFO L138 BoogieDeclarations]: Found implementation of procedure caif_hsi_changelink [2019-10-02 06:53:24,683 INFO L138 BoogieDeclarations]: Found implementation of procedure caif_hsi_get_size [2019-10-02 06:53:24,683 INFO L138 BoogieDeclarations]: Found implementation of procedure caif_hsi_fill_info [2019-10-02 06:53:24,683 INFO L138 BoogieDeclarations]: Found implementation of procedure caif_hsi_newlink [2019-10-02 06:53:24,683 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_exit_module [2019-10-02 06:53:24,683 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_init_module [2019-10-02 06:53:24,684 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_timer_3 [2019-10-02 06:53:24,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_net_device_ops_5 [2019-10-02 06:53:24,685 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_1 [2019-10-02 06:53:24,685 INFO L138 BoogieDeclarations]: Found implementation of procedure choose_timer_2 [2019-10-02 06:53:24,685 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_2 [2019-10-02 06:53:24,686 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_pending_timer_2 [2019-10-02 06:53:24,686 INFO L138 BoogieDeclarations]: Found implementation of procedure choose_timer_3 [2019-10-02 06:53:24,686 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_timer_2 [2019-10-02 06:53:24,687 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_timer_1 [2019-10-02 06:53:24,687 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_pending_timer_3 [2019-10-02 06:53:24,688 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_3 [2019-10-02 06:53:24,688 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_pending_timer_1 [2019-10-02 06:53:24,688 INFO L138 BoogieDeclarations]: Found implementation of procedure choose_timer_1 [2019-10-02 06:53:24,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize_rtnl_link_ops_4 [2019-10-02 06:53:24,688 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 06:53:24,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_consume_skb_5 [2019-10-02 06:53:24,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kfree_skb_6 [2019-10-02 06:53:24,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kfree_skb_7 [2019-10-02 06:53:24,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kfree_skb_8 [2019-10-02 06:53:24,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kfree_skb_11 [2019-10-02 06:53:24,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kfree_skb_13 [2019-10-02 06:53:24,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_dequeue_14 [2019-10-02 06:53:24,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kfree_skb_15 [2019-10-02 06:53:24,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mod_timer_16 [2019-10-02 06:53:24,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_consume_skb_17 [2019-10-02 06:53:24,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_consume_skb_18 [2019-10-02 06:53:24,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mod_timer_19 [2019-10-02 06:53:24,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mod_timer_20 [2019-10-02 06:53:24,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_skb_21 [2019-10-02 06:53:24,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_netif_rx_22 [2019-10-02 06:53:24,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_netif_rx_ni_23 [2019-10-02 06:53:24,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_netif_rx_25 [2019-10-02 06:53:24,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_netif_rx_ni_26 [2019-10-02 06:53:24,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mod_timer_pending_27 [2019-10-02 06:53:24,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mod_timer_28 [2019-10-02 06:53:24,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_del_timer_29 [2019-10-02 06:53:24,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_del_timer_sync_30 [2019-10-02 06:53:24,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_del_timer_sync_31 [2019-10-02 06:53:24,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_del_timer_sync_32 [2019-10-02 06:53:24,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_del_timer_sync_33 [2019-10-02 06:53:24,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_init [2019-10-02 06:53:24,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_add [2019-10-02 06:53:24,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2019-10-02 06:53:24,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_contains [2019-10-02 06:53:24,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_is_empty [2019-10-02 06:53:24,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2019-10-02 06:53:24,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_err_ptr [2019-10-02 06:53:24,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_ptr_err [2019-10-02 06:53:24,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err_or_null [2019-10-02 06:53:24,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2019-10-02 06:53:24,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-10-02 06:53:24,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2019-10-02 06:53:24,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free_int [2019-10-02 06:53:24,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_alloc_skb [2019-10-02 06:53:24,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_netdev_alloc_skb [2019-10-02 06:53:24,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_current [2019-10-02 06:53:24,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-10-02 06:53:24,699 INFO L138 BoogieDeclarations]: Found implementation of procedure __alloc_workqueue_key [2019-10-02 06:53:24,703 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_netdev_dbg [2019-10-02 06:53:24,704 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_pr_debug [2019-10-02 06:53:24,704 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2019-10-02 06:53:24,704 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_work [2019-10-02 06:53:24,711 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2019-10-02 06:53:24,712 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2019-10-02 06:53:24,712 INFO L138 BoogieDeclarations]: Found implementation of procedure __symbol_get [2019-10-02 06:53:24,713 INFO L138 BoogieDeclarations]: Found implementation of procedure __symbol_put [2019-10-02 06:53:24,713 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2019-10-02 06:53:24,713 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_bh [2019-10-02 06:53:24,714 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_unlock_bh [2019-10-02 06:53:24,714 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2019-10-02 06:53:24,714 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2019-10-02 06:53:24,714 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_workqueue [2019-10-02 06:53:24,714 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_close [2019-10-02 06:53:24,714 INFO L138 BoogieDeclarations]: Found implementation of procedure dump_stack [2019-10-02 06:53:24,715 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2019-10-02 06:53:24,715 INFO L138 BoogieDeclarations]: Found implementation of procedure flush_workqueue [2019-10-02 06:53:24,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_4 [2019-10-02 06:53:24,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_ndo_init_5 [2019-10-02 06:53:24,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_release_4 [2019-10-02 06:53:24,716 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2019-10-02 06:53:24,716 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_init_map [2019-10-02 06:53:24,716 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2019-10-02 06:53:24,716 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer_pending [2019-10-02 06:53:24,716 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_err [2019-10-02 06:53:24,716 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_state_change [2019-10-02 06:53:24,717 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_warn [2019-10-02 06:53:24,717 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_put [2019-10-02 06:53:24,717 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait_event [2019-10-02 06:53:24,717 INFO L138 BoogieDeclarations]: Found implementation of procedure print_hex_dump [2019-10-02 06:53:24,717 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-10-02 06:53:24,717 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_work_on [2019-10-02 06:53:24,718 INFO L138 BoogieDeclarations]: Found implementation of procedure register_netdevice [2019-10-02 06:53:24,718 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_is_locked [2019-10-02 06:53:24,718 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_link_register [2019-10-02 06:53:24,718 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_link_unregister [2019-10-02 06:53:24,718 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_lock [2019-10-02 06:53:24,718 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2019-10-02 06:53:24,719 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_timeout [2019-10-02 06:53:24,719 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_copy_bits [2019-10-02 06:53:24,719 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2019-10-02 06:53:24,719 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_queue_tail [2019-10-02 06:53:24,719 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2019-10-02 06:53:24,719 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2019-10-02 06:53:24,720 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-10-02 06:53:24,720 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-10-02 06:53:24,720 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-10-02 06:53:24,720 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-10-02 06:53:24,721 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-10-02 06:53:24,721 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 06:53:24,721 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-10-02 06:53:24,721 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2019-10-02 06:53:24,721 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2019-10-02 06:53:24,721 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2019-10-02 06:53:24,722 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2019-10-02 06:53:24,722 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2019-10-02 06:53:24,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 06:53:24,722 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-10-02 06:53:24,722 INFO L130 BoogieDeclarations]: Found specification of procedure dump_stack [2019-10-02 06:53:24,722 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_pr_debug [2019-10-02 06:53:24,723 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_netdev_dbg [2019-10-02 06:53:24,723 INFO L130 BoogieDeclarations]: Found specification of procedure print_hex_dump [2019-10-02 06:53:24,723 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2019-10-02 06:53:24,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 06:53:24,723 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2019-10-02 06:53:24,723 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2019-10-02 06:53:24,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 06:53:24,724 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2019-10-02 06:53:24,724 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2019-10-02 06:53:24,724 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2019-10-02 06:53:24,724 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2019-10-02 06:53:24,725 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-10-02 06:53:24,725 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-10-02 06:53:24,725 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2019-10-02 06:53:24,725 INFO L130 BoogieDeclarations]: Found specification of procedure preempt_count [2019-10-02 06:53:24,725 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_init_map [2019-10-02 06:53:24,725 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2019-10-02 06:53:24,725 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_bh [2019-10-02 06:53:24,726 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_unlock_bh [2019-10-02 06:53:24,726 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2019-10-02 06:53:24,726 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2019-10-02 06:53:24,726 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2019-10-02 06:53:24,726 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2019-10-02 06:53:24,727 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2019-10-02 06:53:24,727 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait_event [2019-10-02 06:53:24,727 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2019-10-02 06:53:24,727 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2019-10-02 06:53:24,727 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_del_timer_29 [2019-10-02 06:53:24,727 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2019-10-02 06:53:24,728 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mod_timer_16 [2019-10-02 06:53:24,728 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mod_timer_19 [2019-10-02 06:53:24,728 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mod_timer_20 [2019-10-02 06:53:24,728 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mod_timer_28 [2019-10-02 06:53:24,728 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer_pending [2019-10-02 06:53:24,729 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mod_timer_pending_27 [2019-10-02 06:53:24,729 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2019-10-02 06:53:24,729 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_del_timer_sync_30 [2019-10-02 06:53:24,729 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_del_timer_sync_31 [2019-10-02 06:53:24,729 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_del_timer_sync_32 [2019-10-02 06:53:24,730 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_del_timer_sync_33 [2019-10-02 06:53:24,730 INFO L130 BoogieDeclarations]: Found specification of procedure __init_work [2019-10-02 06:53:24,730 INFO L130 BoogieDeclarations]: Found specification of procedure __alloc_workqueue_key [2019-10-02 06:53:24,730 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_workqueue [2019-10-02 06:53:24,730 INFO L130 BoogieDeclarations]: Found specification of procedure queue_work_on [2019-10-02 06:53:24,730 INFO L130 BoogieDeclarations]: Found specification of procedure flush_workqueue [2019-10-02 06:53:24,731 INFO L130 BoogieDeclarations]: Found specification of procedure queue_work [2019-10-02 06:53:24,731 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_work [2019-10-02 06:53:24,731 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-10-02 06:53:24,731 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-10-02 06:53:24,731 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2019-10-02 06:53:24,731 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2019-10-02 06:53:24,732 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2019-10-02 06:53:24,732 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_timeout [2019-10-02 06:53:24,732 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kfree_skb_6 [2019-10-02 06:53:24,732 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kfree_skb_7 [2019-10-02 06:53:24,732 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kfree_skb_8 [2019-10-02 06:53:24,733 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kfree_skb_11 [2019-10-02 06:53:24,733 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kfree_skb_13 [2019-10-02 06:53:24,733 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kfree_skb_15 [2019-10-02 06:53:24,733 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_consume_skb_5 [2019-10-02 06:53:24,733 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_consume_skb_17 [2019-10-02 06:53:24,733 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_consume_skb_18 [2019-10-02 06:53:24,734 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_skb_21 [2019-10-02 06:53:24,734 INFO L130 BoogieDeclarations]: Found specification of procedure skb_queue_len [2019-10-02 06:53:24,734 INFO L130 BoogieDeclarations]: Found specification of procedure __skb_queue_head_init [2019-10-02 06:53:24,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 06:53:24,739 INFO L130 BoogieDeclarations]: Found specification of procedure skb_queue_head_init [2019-10-02 06:53:24,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 06:53:24,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 06:53:24,740 INFO L130 BoogieDeclarations]: Found specification of procedure skb_queue_tail [2019-10-02 06:53:24,740 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_dequeue_14 [2019-10-02 06:53:24,743 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2019-10-02 06:53:24,743 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reset_mac_header [2019-10-02 06:53:24,744 INFO L130 BoogieDeclarations]: Found specification of procedure skb_copy_bits [2019-10-02 06:53:24,744 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2019-10-02 06:53:24,744 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2019-10-02 06:53:24,744 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free_int [2019-10-02 06:53:24,745 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 06:53:24,745 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-02 06:53:24,745 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 06:53:24,745 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-10-02 06:53:24,745 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-02 06:53:24,745 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 06:53:24,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 06:53:24,746 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-10-02 06:53:24,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-10-02 06:53:24,746 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2019-10-02 06:53:24,746 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ptr [2019-10-02 06:53:24,746 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2019-10-02 06:53:24,747 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-10-02 06:53:24,747 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2019-10-02 06:53:24,747 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_trap [2019-10-02 06:53:24,747 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_timer_3 [2019-10-02 06:53:24,747 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_net_device_ops_5 [2019-10-02 06:53:24,747 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_1 [2019-10-02 06:53:24,747 INFO L130 BoogieDeclarations]: Found specification of procedure choose_timer_2 [2019-10-02 06:53:24,748 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_2 [2019-10-02 06:53:24,748 INFO L130 BoogieDeclarations]: Found specification of procedure activate_pending_timer_2 [2019-10-02 06:53:24,748 INFO L130 BoogieDeclarations]: Found specification of procedure choose_timer_3 [2019-10-02 06:53:24,748 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_timer_2 [2019-10-02 06:53:24,748 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_timer_1 [2019-10-02 06:53:24,748 INFO L130 BoogieDeclarations]: Found specification of procedure activate_pending_timer_3 [2019-10-02 06:53:24,748 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_3 [2019-10-02 06:53:24,749 INFO L130 BoogieDeclarations]: Found specification of procedure activate_pending_timer_1 [2019-10-02 06:53:24,749 INFO L130 BoogieDeclarations]: Found specification of procedure choose_timer_1 [2019-10-02 06:53:24,749 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize_rtnl_link_ops_4 [2019-10-02 06:53:24,749 INFO L130 BoogieDeclarations]: Found specification of procedure __symbol_get [2019-10-02 06:53:24,749 INFO L130 BoogieDeclarations]: Found specification of procedure __symbol_put [2019-10-02 06:53:24,749 INFO L130 BoogieDeclarations]: Found specification of procedure hold_net [2019-10-02 06:53:24,749 INFO L130 BoogieDeclarations]: Found specification of procedure release_net [2019-10-02 06:53:24,750 INFO L130 BoogieDeclarations]: Found specification of procedure dev_net_set [2019-10-02 06:53:24,750 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2019-10-02 06:53:24,750 INFO L130 BoogieDeclarations]: Found specification of procedure dev_close [2019-10-02 06:53:24,750 INFO L130 BoogieDeclarations]: Found specification of procedure register_netdevice [2019-10-02 06:53:24,750 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2019-10-02 06:53:24,750 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_netif_rx_22 [2019-10-02 06:53:24,750 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_netif_rx_25 [2019-10-02 06:53:24,751 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_netif_rx_ni_23 [2019-10-02 06:53:24,751 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_netif_rx_ni_26 [2019-10-02 06:53:24,751 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2019-10-02 06:53:24,751 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_state_change [2019-10-02 06:53:24,751 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_err [2019-10-02 06:53:24,751 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_warn [2019-10-02 06:53:24,751 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_lock [2019-10-02 06:53:24,752 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2019-10-02 06:53:24,752 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_is_locked [2019-10-02 06:53:24,752 INFO L130 BoogieDeclarations]: Found specification of procedure nla_put [2019-10-02 06:53:24,752 INFO L130 BoogieDeclarations]: Found specification of procedure nla_attr_size [2019-10-02 06:53:24,752 INFO L130 BoogieDeclarations]: Found specification of procedure nla_total_size [2019-10-02 06:53:24,752 INFO L130 BoogieDeclarations]: Found specification of procedure nla_data [2019-10-02 06:53:24,752 INFO L130 BoogieDeclarations]: Found specification of procedure nla_put_u32 [2019-10-02 06:53:24,753 INFO L130 BoogieDeclarations]: Found specification of procedure nla_get_u32 [2019-10-02 06:53:24,753 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_link_register [2019-10-02 06:53:24,753 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_link_unregister [2019-10-02 06:53:24,753 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_inactivity_tout [2019-10-02 06:53:24,753 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_update_aggregation_stats [2019-10-02 06:53:24,753 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_can_send_aggregate [2019-10-02 06:53:24,753 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_dequeue [2019-10-02 06:53:24,754 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_tx_queue_len [2019-10-02 06:53:24,754 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_abort_tx [2019-10-02 06:53:24,754 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_flush_fifo [2019-10-02 06:53:24,754 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2019-10-02 06:53:24,754 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~$Pointer$~TO~int [2019-10-02 06:53:24,754 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_tx_frm [2019-10-02 06:53:24,754 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_start_tx [2019-10-02 06:53:24,755 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_tx_done [2019-10-02 06:53:24,755 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~VOID [2019-10-02 06:53:24,755 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_tx_done_cb [2019-10-02 06:53:24,755 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_rx_desc [2019-10-02 06:53:24,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-10-02 06:53:24,755 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_rx_desc_len [2019-10-02 06:53:24,755 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_rx_pld [2019-10-02 06:53:24,756 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_rx_done [2019-10-02 06:53:24,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-10-02 06:53:24,756 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_rx_slowpath [2019-10-02 06:53:24,756 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_rx_done_cb [2019-10-02 06:53:24,756 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_wake_up [2019-10-02 06:53:24,756 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2019-10-02 06:53:24,756 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_wake_down [2019-10-02 06:53:24,757 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_out_of_sync [2019-10-02 06:53:24,757 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_wake_up_cb [2019-10-02 06:53:24,757 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_wake_down_cb [2019-10-02 06:53:24,757 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_aggregation_tout [2019-10-02 06:53:24,757 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_xmit [2019-10-02 06:53:24,757 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_setup [2019-10-02 06:53:24,757 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_open [2019-10-02 06:53:24,758 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_close [2019-10-02 06:53:24,758 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_uninit [2019-10-02 06:53:24,758 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_netlink_parms [2019-10-02 06:53:24,758 INFO L130 BoogieDeclarations]: Found specification of procedure caif_hsi_changelink [2019-10-02 06:53:24,758 INFO L130 BoogieDeclarations]: Found specification of procedure caif_hsi_get_size [2019-10-02 06:53:24,758 INFO L130 BoogieDeclarations]: Found specification of procedure caif_hsi_fill_info [2019-10-02 06:53:24,759 INFO L130 BoogieDeclarations]: Found specification of procedure caif_hsi_newlink [2019-10-02 06:53:24,759 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~$Pointer$ [2019-10-02 06:53:24,759 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_exit_module [2019-10-02 06:53:24,759 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_init_module [2019-10-02 06:53:24,759 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_release_4 [2019-10-02 06:53:24,759 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_ndo_init_5 [2019-10-02 06:53:24,759 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-10-02 06:53:24,760 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-10-02 06:53:24,760 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_4 [2019-10-02 06:53:24,760 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2019-10-02 06:53:24,760 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 06:53:24,760 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_init [2019-10-02 06:53:24,760 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_add [2019-10-02 06:53:24,760 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2019-10-02 06:53:24,761 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_contains [2019-10-02 06:53:24,761 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_is_empty [2019-10-02 06:53:24,761 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2019-10-02 06:53:24,761 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_err_ptr [2019-10-02 06:53:24,761 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_ptr_err [2019-10-02 06:53:24,761 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err_or_null [2019-10-02 06:53:24,761 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_netdev_alloc_skb [2019-10-02 06:53:24,762 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_alloc_skb [2019-10-02 06:53:24,762 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_current [2019-10-02 06:53:24,762 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-10-02 06:53:24,762 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-02 06:53:24,762 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-02 06:53:24,763 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 06:53:24,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 06:53:24,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 06:53:24,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-02 06:53:24,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 06:53:24,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-10-02 06:53:24,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-10-02 06:53:24,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-10-02 06:53:24,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-10-02 06:53:26,813 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2019-10-02 06:53:38,994 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 06:53:38,994 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 06:53:38,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 06:53:38 BoogieIcfgContainer [2019-10-02 06:53:38,997 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 06:53:38,998 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 06:53:38,999 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 06:53:39,002 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 06:53:39,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 06:53:20" (1/3) ... [2019-10-02 06:53:39,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d7ad71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 06:53:39, skipping insertion in model container [2019-10-02 06:53:39,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 06:53:24" (2/3) ... [2019-10-02 06:53:39,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d7ad71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 06:53:39, skipping insertion in model container [2019-10-02 06:53:39,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 06:53:38" (3/3) ... [2019-10-02 06:53:39,005 INFO L109 eAbstractionObserver]: Analyzing ICFG 205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--caif--caif_hsi.ko-entry_point.cil.out.i [2019-10-02 06:53:39,013 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 06:53:39,023 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 06:53:39,036 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 06:53:39,078 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 06:53:39,079 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 06:53:39,079 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 06:53:39,079 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 06:53:39,080 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 06:53:39,080 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 06:53:39,080 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 06:53:39,080 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 06:53:39,080 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 06:53:39,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states. [2019-10-02 06:53:39,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-02 06:53:39,148 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:53:39,150 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 06:53:39,152 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:53:39,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:53:39,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1501589027, now seen corresponding path program 1 times [2019-10-02 06:53:39,161 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:53:39,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:53:39,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:53:39,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:53:39,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:53:39,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:53:40,391 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 06:53:40,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 06:53:40,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 06:53:40,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 06:53:40,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 06:53:40,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 06:53:40,429 INFO L87 Difference]: Start difference. First operand 1659 states. Second operand 6 states. [2019-10-02 06:53:46,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:53:46,420 INFO L93 Difference]: Finished difference Result 3941 states and 5365 transitions. [2019-10-02 06:53:46,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 06:53:46,422 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-10-02 06:53:46,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:53:46,479 INFO L225 Difference]: With dead ends: 3941 [2019-10-02 06:53:46,479 INFO L226 Difference]: Without dead ends: 2578 [2019-10-02 06:53:46,501 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 06:53:46,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2578 states. [2019-10-02 06:53:46,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2578 to 2578. [2019-10-02 06:53:46,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2578 states. [2019-10-02 06:53:46,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2578 states to 2578 states and 3445 transitions. [2019-10-02 06:53:46,768 INFO L78 Accepts]: Start accepts. Automaton has 2578 states and 3445 transitions. Word has length 62 [2019-10-02 06:53:46,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:53:46,769 INFO L475 AbstractCegarLoop]: Abstraction has 2578 states and 3445 transitions. [2019-10-02 06:53:46,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 06:53:46,770 INFO L276 IsEmpty]: Start isEmpty. Operand 2578 states and 3445 transitions. [2019-10-02 06:53:46,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-02 06:53:46,787 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:53:46,788 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2019-10-02 06:53:46,788 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:53:46,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:53:46,789 INFO L82 PathProgramCache]: Analyzing trace with hash -753384260, now seen corresponding path program 1 times [2019-10-02 06:53:46,789 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:53:46,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:53:46,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:53:46,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:53:46,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:53:46,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:53:47,357 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 06:53:47,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 06:53:47,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 06:53:47,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 06:53:47,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 06:53:47,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 06:53:47,361 INFO L87 Difference]: Start difference. First operand 2578 states and 3445 transitions. Second operand 5 states. [2019-10-02 06:53:47,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:53:47,520 INFO L93 Difference]: Finished difference Result 5148 states and 7013 transitions. [2019-10-02 06:53:47,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 06:53:47,521 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 162 [2019-10-02 06:53:47,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:53:47,548 INFO L225 Difference]: With dead ends: 5148 [2019-10-02 06:53:47,549 INFO L226 Difference]: Without dead ends: 2590 [2019-10-02 06:53:47,566 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 06:53:47,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2590 states. [2019-10-02 06:53:47,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2590 to 2588. [2019-10-02 06:53:47,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2588 states. [2019-10-02 06:53:47,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2588 states to 2588 states and 3469 transitions. [2019-10-02 06:53:47,706 INFO L78 Accepts]: Start accepts. Automaton has 2588 states and 3469 transitions. Word has length 162 [2019-10-02 06:53:47,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:53:47,707 INFO L475 AbstractCegarLoop]: Abstraction has 2588 states and 3469 transitions. [2019-10-02 06:53:47,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 06:53:47,707 INFO L276 IsEmpty]: Start isEmpty. Operand 2588 states and 3469 transitions. [2019-10-02 06:53:47,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-02 06:53:47,731 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:53:47,731 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 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] [2019-10-02 06:53:47,732 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:53:47,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:53:47,732 INFO L82 PathProgramCache]: Analyzing trace with hash 206472384, now seen corresponding path program 1 times [2019-10-02 06:53:47,732 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:53:47,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:53:47,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:53:47,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:53:47,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:53:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:53:48,242 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 06:53:48,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 06:53:48,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 06:53:48,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 06:53:48,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 06:53:48,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 06:53:48,246 INFO L87 Difference]: Start difference. First operand 2588 states and 3469 transitions. Second operand 5 states. [2019-10-02 06:53:48,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:53:48,440 INFO L93 Difference]: Finished difference Result 5178 states and 7015 transitions. [2019-10-02 06:53:48,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 06:53:48,441 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 167 [2019-10-02 06:53:48,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:53:48,467 INFO L225 Difference]: With dead ends: 5178 [2019-10-02 06:53:48,468 INFO L226 Difference]: Without dead ends: 2610 [2019-10-02 06:53:48,484 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 06:53:48,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2019-10-02 06:53:48,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2596. [2019-10-02 06:53:48,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2596 states. [2019-10-02 06:53:48,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2596 states to 2596 states and 3481 transitions. [2019-10-02 06:53:48,641 INFO L78 Accepts]: Start accepts. Automaton has 2596 states and 3481 transitions. Word has length 167 [2019-10-02 06:53:48,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:53:48,644 INFO L475 AbstractCegarLoop]: Abstraction has 2596 states and 3481 transitions. [2019-10-02 06:53:48,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 06:53:48,644 INFO L276 IsEmpty]: Start isEmpty. Operand 2596 states and 3481 transitions. [2019-10-02 06:53:48,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-02 06:53:48,660 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:53:48,660 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 06:53:48,661 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:53:48,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:53:48,661 INFO L82 PathProgramCache]: Analyzing trace with hash -2017660782, now seen corresponding path program 1 times [2019-10-02 06:53:48,661 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:53:48,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:53:48,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:53:48,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:53:48,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:53:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:53:49,220 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 06:53:49,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 06:53:49,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 06:53:49,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 06:53:49,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 06:53:49,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 06:53:49,224 INFO L87 Difference]: Start difference. First operand 2596 states and 3481 transitions. Second operand 3 states. [2019-10-02 06:53:50,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:53:50,751 INFO L93 Difference]: Finished difference Result 6866 states and 9170 transitions. [2019-10-02 06:53:50,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 06:53:50,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-10-02 06:53:50,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:53:50,784 INFO L225 Difference]: With dead ends: 6866 [2019-10-02 06:53:50,785 INFO L226 Difference]: Without dead ends: 4290 [2019-10-02 06:53:50,798 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 06:53:50,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4290 states. [2019-10-02 06:53:50,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4290 to 4256. [2019-10-02 06:53:50,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4256 states. [2019-10-02 06:53:50,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4256 states to 4256 states and 5679 transitions. [2019-10-02 06:53:50,991 INFO L78 Accepts]: Start accepts. Automaton has 4256 states and 5679 transitions. Word has length 204 [2019-10-02 06:53:50,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:53:50,992 INFO L475 AbstractCegarLoop]: Abstraction has 4256 states and 5679 transitions. [2019-10-02 06:53:50,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 06:53:50,992 INFO L276 IsEmpty]: Start isEmpty. Operand 4256 states and 5679 transitions. [2019-10-02 06:53:51,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-02 06:53:51,017 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:53:51,017 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 06:53:51,018 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:53:51,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:53:51,019 INFO L82 PathProgramCache]: Analyzing trace with hash 2049978954, now seen corresponding path program 1 times [2019-10-02 06:53:51,019 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:53:51,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:53:51,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:53:51,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:53:51,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:53:51,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:53:51,522 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-10-02 06:53:51,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 06:53:51,523 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 06:53:52,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:53:55,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:53:55,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 5229 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 06:53:55,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 06:53:55,442 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 06:53:55,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 06:53:55,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-10-02 06:53:55,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 06:53:55,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 06:53:55,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 06:53:55,481 INFO L87 Difference]: Start difference. First operand 4256 states and 5679 transitions. Second operand 4 states. [2019-10-02 06:53:55,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:53:55,677 INFO L93 Difference]: Finished difference Result 8528 states and 11522 transitions. [2019-10-02 06:53:55,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 06:53:55,678 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 191 [2019-10-02 06:53:55,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:53:55,710 INFO L225 Difference]: With dead ends: 8528 [2019-10-02 06:53:55,710 INFO L226 Difference]: Without dead ends: 4292 [2019-10-02 06:53:55,732 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 06:53:55,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4292 states. [2019-10-02 06:53:55,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4292 to 4268. [2019-10-02 06:53:55,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4268 states. [2019-10-02 06:53:55,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4268 states to 4268 states and 5691 transitions. [2019-10-02 06:53:55,913 INFO L78 Accepts]: Start accepts. Automaton has 4268 states and 5691 transitions. Word has length 191 [2019-10-02 06:53:55,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:53:55,914 INFO L475 AbstractCegarLoop]: Abstraction has 4268 states and 5691 transitions. [2019-10-02 06:53:55,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 06:53:55,914 INFO L276 IsEmpty]: Start isEmpty. Operand 4268 states and 5691 transitions. [2019-10-02 06:53:55,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-10-02 06:53:55,926 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:53:55,927 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2019-10-02 06:53:55,927 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:53:55,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:53:55,927 INFO L82 PathProgramCache]: Analyzing trace with hash 170033087, now seen corresponding path program 1 times [2019-10-02 06:53:55,928 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:53:55,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:53:55,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:53:55,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:53:55,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:53:56,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:53:56,372 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 06:53:56,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 06:53:56,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 06:53:56,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 06:53:56,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 06:53:56,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 06:53:56,374 INFO L87 Difference]: Start difference. First operand 4268 states and 5691 transitions. Second operand 3 states. [2019-10-02 06:53:56,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:53:56,484 INFO L93 Difference]: Finished difference Result 8528 states and 11469 transitions. [2019-10-02 06:53:56,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 06:53:56,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-10-02 06:53:56,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:53:56,523 INFO L225 Difference]: With dead ends: 8528 [2019-10-02 06:53:56,523 INFO L226 Difference]: Without dead ends: 4280 [2019-10-02 06:53:56,549 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 06:53:56,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4280 states. [2019-10-02 06:53:56,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4280 to 4272. [2019-10-02 06:53:56,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4272 states. [2019-10-02 06:53:56,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4272 states to 4272 states and 5695 transitions. [2019-10-02 06:53:56,803 INFO L78 Accepts]: Start accepts. Automaton has 4272 states and 5695 transitions. Word has length 182 [2019-10-02 06:53:56,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:53:56,807 INFO L475 AbstractCegarLoop]: Abstraction has 4272 states and 5695 transitions. [2019-10-02 06:53:56,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 06:53:56,808 INFO L276 IsEmpty]: Start isEmpty. Operand 4272 states and 5695 transitions. [2019-10-02 06:53:56,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-02 06:53:56,825 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:53:56,826 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2019-10-02 06:53:56,826 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:53:56,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:53:56,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1283546689, now seen corresponding path program 1 times [2019-10-02 06:53:56,827 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:53:56,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:53:56,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:53:56,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:53:56,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:53:57,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:53:57,228 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 06:53:57,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 06:53:57,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 06:53:57,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 06:53:57,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 06:53:57,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 06:53:57,230 INFO L87 Difference]: Start difference. First operand 4272 states and 5695 transitions. Second operand 3 states. [2019-10-02 06:53:57,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:53:57,420 INFO L93 Difference]: Finished difference Result 8612 states and 11596 transitions. [2019-10-02 06:53:57,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 06:53:57,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-10-02 06:53:57,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:53:57,464 INFO L225 Difference]: With dead ends: 8612 [2019-10-02 06:53:57,465 INFO L226 Difference]: Without dead ends: 4360 [2019-10-02 06:53:57,494 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 06:53:57,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4360 states. [2019-10-02 06:53:57,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4360 to 4276. [2019-10-02 06:53:57,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4276 states. [2019-10-02 06:53:57,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 5699 transitions. [2019-10-02 06:53:57,742 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 5699 transitions. Word has length 187 [2019-10-02 06:53:57,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:53:57,743 INFO L475 AbstractCegarLoop]: Abstraction has 4276 states and 5699 transitions. [2019-10-02 06:53:57,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 06:53:57,744 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 5699 transitions. [2019-10-02 06:53:57,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-10-02 06:53:57,764 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:53:57,765 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 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] [2019-10-02 06:53:57,765 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:53:57,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:53:57,766 INFO L82 PathProgramCache]: Analyzing trace with hash 2065048825, now seen corresponding path program 1 times [2019-10-02 06:53:57,766 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:53:57,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:53:57,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:53:57,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:53:57,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:53:57,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:53:58,253 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-02 06:53:58,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 06:53:58,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 06:53:58,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 06:53:58,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 06:53:58,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 06:53:58,256 INFO L87 Difference]: Start difference. First operand 4276 states and 5699 transitions. Second operand 3 states. [2019-10-02 06:53:58,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:53:58,441 INFO L93 Difference]: Finished difference Result 8548 states and 11492 transitions. [2019-10-02 06:53:58,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 06:53:58,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2019-10-02 06:53:58,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:53:58,483 INFO L225 Difference]: With dead ends: 8548 [2019-10-02 06:53:58,483 INFO L226 Difference]: Without dead ends: 4292 [2019-10-02 06:53:58,507 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 06:53:58,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4292 states. [2019-10-02 06:53:58,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4292 to 4292. [2019-10-02 06:53:58,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4292 states. [2019-10-02 06:53:58,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4292 states to 4292 states and 5715 transitions. [2019-10-02 06:53:58,666 INFO L78 Accepts]: Start accepts. Automaton has 4292 states and 5715 transitions. Word has length 211 [2019-10-02 06:53:58,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:53:58,667 INFO L475 AbstractCegarLoop]: Abstraction has 4292 states and 5715 transitions. [2019-10-02 06:53:58,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 06:53:58,667 INFO L276 IsEmpty]: Start isEmpty. Operand 4292 states and 5715 transitions. [2019-10-02 06:53:58,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-10-02 06:53:58,681 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:53:58,681 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 06:53:58,681 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:53:58,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:53:58,682 INFO L82 PathProgramCache]: Analyzing trace with hash -258784886, now seen corresponding path program 1 times [2019-10-02 06:53:58,682 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:53:58,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:53:58,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:53:58,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:53:58,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:53:58,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:53:59,389 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 06:53:59,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 06:53:59,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 06:53:59,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 06:53:59,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 06:53:59,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 06:53:59,392 INFO L87 Difference]: Start difference. First operand 4292 states and 5715 transitions. Second operand 7 states. [2019-10-02 06:54:16,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:54:16,427 INFO L93 Difference]: Finished difference Result 14323 states and 19996 transitions. [2019-10-02 06:54:16,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 06:54:16,428 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 208 [2019-10-02 06:54:16,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:54:16,507 INFO L225 Difference]: With dead ends: 14323 [2019-10-02 06:54:16,507 INFO L226 Difference]: Without dead ends: 10051 [2019-10-02 06:54:16,533 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-10-02 06:54:16,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10051 states. [2019-10-02 06:54:16,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10051 to 9508. [2019-10-02 06:54:16,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9508 states. [2019-10-02 06:54:16,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9508 states to 9508 states and 13121 transitions. [2019-10-02 06:54:16,963 INFO L78 Accepts]: Start accepts. Automaton has 9508 states and 13121 transitions. Word has length 208 [2019-10-02 06:54:16,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:54:16,966 INFO L475 AbstractCegarLoop]: Abstraction has 9508 states and 13121 transitions. [2019-10-02 06:54:16,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 06:54:16,966 INFO L276 IsEmpty]: Start isEmpty. Operand 9508 states and 13121 transitions. [2019-10-02 06:54:16,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-10-02 06:54:16,995 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:54:16,995 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 06:54:16,996 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:54:16,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:54:16,996 INFO L82 PathProgramCache]: Analyzing trace with hash 730801387, now seen corresponding path program 1 times [2019-10-02 06:54:16,996 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:54:16,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:54:17,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:54:17,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:54:17,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:54:17,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:54:17,360 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 06:54:17,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 06:54:17,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 06:54:17,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 06:54:17,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 06:54:17,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 06:54:17,367 INFO L87 Difference]: Start difference. First operand 9508 states and 13121 transitions. Second operand 3 states. [2019-10-02 06:54:17,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:54:17,813 INFO L93 Difference]: Finished difference Result 19684 states and 27558 transitions. [2019-10-02 06:54:17,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 06:54:17,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-10-02 06:54:17,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:54:17,863 INFO L225 Difference]: With dead ends: 19684 [2019-10-02 06:54:17,864 INFO L226 Difference]: Without dead ends: 10196 [2019-10-02 06:54:17,891 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 06:54:17,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10196 states. [2019-10-02 06:54:18,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10196 to 9524. [2019-10-02 06:54:18,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9524 states. [2019-10-02 06:54:18,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9524 states to 9524 states and 13137 transitions. [2019-10-02 06:54:18,324 INFO L78 Accepts]: Start accepts. Automaton has 9524 states and 13137 transitions. Word has length 205 [2019-10-02 06:54:18,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:54:18,324 INFO L475 AbstractCegarLoop]: Abstraction has 9524 states and 13137 transitions. [2019-10-02 06:54:18,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 06:54:18,325 INFO L276 IsEmpty]: Start isEmpty. Operand 9524 states and 13137 transitions. [2019-10-02 06:54:18,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-10-02 06:54:18,350 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:54:18,350 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 06:54:18,351 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:54:18,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:54:18,351 INFO L82 PathProgramCache]: Analyzing trace with hash -47620534, now seen corresponding path program 1 times [2019-10-02 06:54:18,351 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:54:18,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:54:18,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:54:18,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:54:18,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:54:18,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:54:18,774 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 06:54:18,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 06:54:18,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 06:54:18,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 06:54:18,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 06:54:18,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 06:54:18,776 INFO L87 Difference]: Start difference. First operand 9524 states and 13137 transitions. Second operand 5 states. [2019-10-02 06:54:27,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:54:27,013 INFO L93 Difference]: Finished difference Result 19156 states and 26664 transitions. [2019-10-02 06:54:27,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 06:54:27,013 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 208 [2019-10-02 06:54:27,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:54:27,064 INFO L225 Difference]: With dead ends: 19156 [2019-10-02 06:54:27,064 INFO L226 Difference]: Without dead ends: 9652 [2019-10-02 06:54:27,091 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 06:54:27,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9652 states. [2019-10-02 06:54:27,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9652 to 9620. [2019-10-02 06:54:27,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9620 states. [2019-10-02 06:54:27,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9620 states to 9620 states and 13265 transitions. [2019-10-02 06:54:27,475 INFO L78 Accepts]: Start accepts. Automaton has 9620 states and 13265 transitions. Word has length 208 [2019-10-02 06:54:27,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:54:27,478 INFO L475 AbstractCegarLoop]: Abstraction has 9620 states and 13265 transitions. [2019-10-02 06:54:27,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 06:54:27,478 INFO L276 IsEmpty]: Start isEmpty. Operand 9620 states and 13265 transitions. [2019-10-02 06:54:27,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-10-02 06:54:27,509 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:54:27,509 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 06:54:27,510 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:54:27,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:54:27,510 INFO L82 PathProgramCache]: Analyzing trace with hash -429411653, now seen corresponding path program 1 times [2019-10-02 06:54:27,510 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:54:27,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:54:27,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:54:27,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:54:27,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:54:27,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:54:28,320 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 06:54:28,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 06:54:28,321 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 06:54:28,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:54:30,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:54:30,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 5291 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 06:54:30,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 06:54:30,981 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 06:54:31,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 06:54:31,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-02 06:54:31,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 06:54:31,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 06:54:31,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 06:54:31,029 INFO L87 Difference]: Start difference. First operand 9620 states and 13265 transitions. Second operand 5 states. [2019-10-02 06:54:31,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:54:31,493 INFO L93 Difference]: Finished difference Result 19260 states and 26970 transitions. [2019-10-02 06:54:31,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 06:54:31,494 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 203 [2019-10-02 06:54:31,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:54:31,575 INFO L225 Difference]: With dead ends: 19260 [2019-10-02 06:54:31,576 INFO L226 Difference]: Without dead ends: 9660 [2019-10-02 06:54:31,667 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 06:54:31,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9660 states. [2019-10-02 06:54:32,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9660 to 9644. [2019-10-02 06:54:32,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9644 states. [2019-10-02 06:54:32,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9644 states to 9644 states and 13297 transitions. [2019-10-02 06:54:32,152 INFO L78 Accepts]: Start accepts. Automaton has 9644 states and 13297 transitions. Word has length 203 [2019-10-02 06:54:32,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:54:32,153 INFO L475 AbstractCegarLoop]: Abstraction has 9644 states and 13297 transitions. [2019-10-02 06:54:32,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 06:54:32,153 INFO L276 IsEmpty]: Start isEmpty. Operand 9644 states and 13297 transitions. [2019-10-02 06:54:32,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-10-02 06:54:32,173 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:54:32,173 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 06:54:32,174 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:54:32,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:54:32,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1385229965, now seen corresponding path program 1 times [2019-10-02 06:54:32,174 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:54:32,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:54:32,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:54:32,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:54:32,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:54:32,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:54:32,853 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-02 06:54:32,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 06:54:32,853 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 06:54:33,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:54:36,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:54:36,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 5437 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 06:54:36,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 06:54:36,457 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 06:54:36,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 06:54:36,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-10-02 06:54:36,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 06:54:36,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 06:54:36,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 06:54:36,506 INFO L87 Difference]: Start difference. First operand 9644 states and 13297 transitions. Second operand 9 states. [2019-10-02 06:54:37,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:54:37,563 INFO L93 Difference]: Finished difference Result 19604 states and 27396 transitions. [2019-10-02 06:54:37,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 06:54:37,563 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 229 [2019-10-02 06:54:37,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:54:37,607 INFO L225 Difference]: With dead ends: 19604 [2019-10-02 06:54:37,607 INFO L226 Difference]: Without dead ends: 9980 [2019-10-02 06:54:37,634 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-10-02 06:54:37,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9980 states. [2019-10-02 06:54:37,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9980 to 9684. [2019-10-02 06:54:37,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9684 states. [2019-10-02 06:54:38,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9684 states to 9684 states and 13349 transitions. [2019-10-02 06:54:38,006 INFO L78 Accepts]: Start accepts. Automaton has 9684 states and 13349 transitions. Word has length 229 [2019-10-02 06:54:38,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:54:38,007 INFO L475 AbstractCegarLoop]: Abstraction has 9684 states and 13349 transitions. [2019-10-02 06:54:38,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 06:54:38,007 INFO L276 IsEmpty]: Start isEmpty. Operand 9684 states and 13349 transitions. [2019-10-02 06:54:38,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-02 06:54:38,026 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:54:38,026 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 06:54:38,027 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:54:38,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:54:38,027 INFO L82 PathProgramCache]: Analyzing trace with hash -361713772, now seen corresponding path program 1 times [2019-10-02 06:54:38,027 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:54:38,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:54:38,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:54:38,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:54:38,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:54:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:54:39,003 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-02 06:54:39,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 06:54:39,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 06:54:39,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 06:54:39,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 06:54:39,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 06:54:39,009 INFO L87 Difference]: Start difference. First operand 9684 states and 13349 transitions. Second operand 8 states. [2019-10-02 06:54:39,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:54:39,368 INFO L93 Difference]: Finished difference Result 19572 states and 27262 transitions. [2019-10-02 06:54:39,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 06:54:39,369 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 233 [2019-10-02 06:54:39,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:54:39,425 INFO L225 Difference]: With dead ends: 19572 [2019-10-02 06:54:39,426 INFO L226 Difference]: Without dead ends: 9908 [2019-10-02 06:54:39,459 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 06:54:39,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9908 states. [2019-10-02 06:54:39,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9908 to 9732. [2019-10-02 06:54:39,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9732 states. [2019-10-02 06:54:39,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9732 states to 9732 states and 13413 transitions. [2019-10-02 06:54:39,837 INFO L78 Accepts]: Start accepts. Automaton has 9732 states and 13413 transitions. Word has length 233 [2019-10-02 06:54:39,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:54:39,838 INFO L475 AbstractCegarLoop]: Abstraction has 9732 states and 13413 transitions. [2019-10-02 06:54:39,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 06:54:39,838 INFO L276 IsEmpty]: Start isEmpty. Operand 9732 states and 13413 transitions. [2019-10-02 06:54:39,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-10-02 06:54:39,856 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:54:39,856 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 06:54:39,856 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:54:39,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:54:39,857 INFO L82 PathProgramCache]: Analyzing trace with hash -753234975, now seen corresponding path program 1 times [2019-10-02 06:54:39,857 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:54:39,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:54:39,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:54:39,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:54:39,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:54:39,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:54:40,216 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 06:54:40,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 06:54:40,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 06:54:40,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 06:54:40,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 06:54:40,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 06:54:40,218 INFO L87 Difference]: Start difference. First operand 9732 states and 13413 transitions. Second operand 4 states. [2019-10-02 06:54:40,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:54:40,634 INFO L93 Difference]: Finished difference Result 20292 states and 28414 transitions. [2019-10-02 06:54:40,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 06:54:40,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 217 [2019-10-02 06:54:40,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:54:40,692 INFO L225 Difference]: With dead ends: 20292 [2019-10-02 06:54:40,693 INFO L226 Difference]: Without dead ends: 10580 [2019-10-02 06:54:40,725 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 06:54:40,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10580 states. [2019-10-02 06:54:41,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10580 to 9876. [2019-10-02 06:54:41,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9876 states. [2019-10-02 06:54:41,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9876 states to 9876 states and 13621 transitions. [2019-10-02 06:54:41,117 INFO L78 Accepts]: Start accepts. Automaton has 9876 states and 13621 transitions. Word has length 217 [2019-10-02 06:54:41,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:54:41,117 INFO L475 AbstractCegarLoop]: Abstraction has 9876 states and 13621 transitions. [2019-10-02 06:54:41,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 06:54:41,117 INFO L276 IsEmpty]: Start isEmpty. Operand 9876 states and 13621 transitions. [2019-10-02 06:54:41,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-10-02 06:54:41,137 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:54:41,137 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 06:54:41,137 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:54:41,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:54:41,138 INFO L82 PathProgramCache]: Analyzing trace with hash -239780910, now seen corresponding path program 1 times [2019-10-02 06:54:41,138 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:54:41,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:54:41,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:54:41,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:54:41,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:54:41,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:54:41,683 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 06:54:41,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 06:54:41,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 06:54:41,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 06:54:41,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 06:54:41,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 06:54:41,686 INFO L87 Difference]: Start difference. First operand 9876 states and 13621 transitions. Second operand 9 states. [2019-10-02 06:54:42,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:54:42,459 INFO L93 Difference]: Finished difference Result 20660 states and 29010 transitions. [2019-10-02 06:54:42,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 06:54:42,459 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 214 [2019-10-02 06:54:42,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:54:42,513 INFO L225 Difference]: With dead ends: 20660 [2019-10-02 06:54:42,513 INFO L226 Difference]: Without dead ends: 10804 [2019-10-02 06:54:42,540 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-02 06:54:42,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10804 states. [2019-10-02 06:54:42,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10804 to 10004. [2019-10-02 06:54:42,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10004 states. [2019-10-02 06:54:42,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10004 states to 10004 states and 13807 transitions. [2019-10-02 06:54:42,921 INFO L78 Accepts]: Start accepts. Automaton has 10004 states and 13807 transitions. Word has length 214 [2019-10-02 06:54:42,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:54:42,922 INFO L475 AbstractCegarLoop]: Abstraction has 10004 states and 13807 transitions. [2019-10-02 06:54:42,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 06:54:42,922 INFO L276 IsEmpty]: Start isEmpty. Operand 10004 states and 13807 transitions. [2019-10-02 06:54:42,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-10-02 06:54:42,944 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:54:42,944 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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-10-02 06:54:42,945 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:54:42,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:54:42,945 INFO L82 PathProgramCache]: Analyzing trace with hash -2033841551, now seen corresponding path program 1 times [2019-10-02 06:54:42,946 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:54:42,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:54:42,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:54:42,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:54:42,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:54:43,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:54:43,600 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 06:54:43,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 06:54:43,601 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 06:54:44,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:54:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:54:46,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 5311 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 06:54:46,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 06:54:46,345 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 06:54:46,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 06:54:46,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-02 06:54:46,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 06:54:46,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 06:54:46,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-02 06:54:46,394 INFO L87 Difference]: Start difference. First operand 10004 states and 13807 transitions. Second operand 6 states. [2019-10-02 06:54:47,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:54:47,062 INFO L93 Difference]: Finished difference Result 20028 states and 28054 transitions. [2019-10-02 06:54:47,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 06:54:47,062 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 208 [2019-10-02 06:54:47,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:54:47,109 INFO L225 Difference]: With dead ends: 20028 [2019-10-02 06:54:47,109 INFO L226 Difference]: Without dead ends: 10044 [2019-10-02 06:54:47,148 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-02 06:54:47,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10044 states. [2019-10-02 06:54:47,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10044 to 10028. [2019-10-02 06:54:47,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10028 states. [2019-10-02 06:54:47,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10028 states to 10028 states and 13839 transitions. [2019-10-02 06:54:47,599 INFO L78 Accepts]: Start accepts. Automaton has 10028 states and 13839 transitions. Word has length 208 [2019-10-02 06:54:47,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:54:47,600 INFO L475 AbstractCegarLoop]: Abstraction has 10028 states and 13839 transitions. [2019-10-02 06:54:47,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 06:54:47,600 INFO L276 IsEmpty]: Start isEmpty. Operand 10028 states and 13839 transitions. [2019-10-02 06:54:47,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-02 06:54:47,621 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:54:47,622 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 06:54:47,622 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:54:47,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:54:47,623 INFO L82 PathProgramCache]: Analyzing trace with hash 312706793, now seen corresponding path program 1 times [2019-10-02 06:54:47,623 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:54:47,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:54:47,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:54:47,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:54:47,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:54:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:54:48,048 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-02 06:54:48,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 06:54:48,049 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 06:54:48,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:54:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:54:50,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 5448 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 06:54:50,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 06:54:50,828 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-02 06:54:50,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 06:54:50,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2019-10-02 06:54:50,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 06:54:50,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 06:54:50,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-02 06:54:50,881 INFO L87 Difference]: Start difference. First operand 10028 states and 13839 transitions. Second operand 10 states. [2019-10-02 06:54:51,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:54:51,713 INFO L93 Difference]: Finished difference Result 20620 states and 28874 transitions. [2019-10-02 06:54:51,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 06:54:51,713 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 231 [2019-10-02 06:54:51,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:54:51,759 INFO L225 Difference]: With dead ends: 20620 [2019-10-02 06:54:51,759 INFO L226 Difference]: Without dead ends: 10612 [2019-10-02 06:54:51,790 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-02 06:54:51,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10612 states. [2019-10-02 06:54:52,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10612 to 10108. [2019-10-02 06:54:52,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10108 states. [2019-10-02 06:54:52,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10108 states to 10108 states and 13967 transitions. [2019-10-02 06:54:52,236 INFO L78 Accepts]: Start accepts. Automaton has 10108 states and 13967 transitions. Word has length 231 [2019-10-02 06:54:52,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:54:52,237 INFO L475 AbstractCegarLoop]: Abstraction has 10108 states and 13967 transitions. [2019-10-02 06:54:52,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 06:54:52,237 INFO L276 IsEmpty]: Start isEmpty. Operand 10108 states and 13967 transitions. [2019-10-02 06:54:52,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-10-02 06:54:52,496 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:54:52,497 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 06:54:52,497 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:54:52,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:54:52,498 INFO L82 PathProgramCache]: Analyzing trace with hash -2079896710, now seen corresponding path program 1 times [2019-10-02 06:54:52,498 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:54:52,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:54:52,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:54:52,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:54:52,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:54:52,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:54:52,860 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 06:54:52,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 06:54:52,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 06:54:52,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 06:54:52,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 06:54:52,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 06:54:52,863 INFO L87 Difference]: Start difference. First operand 10108 states and 13967 transitions. Second operand 6 states. [2019-10-02 06:54:53,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:54:53,206 INFO L93 Difference]: Finished difference Result 21116 states and 29698 transitions. [2019-10-02 06:54:53,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 06:54:53,207 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 218 [2019-10-02 06:54:53,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:54:53,239 INFO L225 Difference]: With dead ends: 21116 [2019-10-02 06:54:53,240 INFO L226 Difference]: Without dead ends: 10996 [2019-10-02 06:54:53,265 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 06:54:53,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10996 states. [2019-10-02 06:54:53,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10996 to 10236. [2019-10-02 06:54:53,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10236 states. [2019-10-02 06:54:53,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10236 states to 10236 states and 14143 transitions. [2019-10-02 06:54:53,644 INFO L78 Accepts]: Start accepts. Automaton has 10236 states and 14143 transitions. Word has length 218 [2019-10-02 06:54:53,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:54:53,644 INFO L475 AbstractCegarLoop]: Abstraction has 10236 states and 14143 transitions. [2019-10-02 06:54:53,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 06:54:53,645 INFO L276 IsEmpty]: Start isEmpty. Operand 10236 states and 14143 transitions. [2019-10-02 06:54:53,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-10-02 06:54:53,666 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:54:53,667 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 06:54:53,667 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:54:53,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:54:53,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1390123591, now seen corresponding path program 1 times [2019-10-02 06:54:53,668 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:54:53,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:54:53,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:54:53,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:54:53,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:54:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:54:54,076 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 06:54:54,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 06:54:54,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 06:54:54,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 06:54:54,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 06:54:54,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 06:54:54,079 INFO L87 Difference]: Start difference. First operand 10236 states and 14143 transitions. Second operand 5 states. [2019-10-02 06:54:54,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:54:54,312 INFO L93 Difference]: Finished difference Result 20644 states and 28762 transitions. [2019-10-02 06:54:54,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 06:54:54,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 221 [2019-10-02 06:54:54,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:54:54,344 INFO L225 Difference]: With dead ends: 20644 [2019-10-02 06:54:54,345 INFO L226 Difference]: Without dead ends: 10428 [2019-10-02 06:54:54,365 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 06:54:54,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10428 states. [2019-10-02 06:54:54,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10428 to 10268. [2019-10-02 06:54:54,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10268 states. [2019-10-02 06:54:54,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10268 states to 10268 states and 14175 transitions. [2019-10-02 06:54:54,730 INFO L78 Accepts]: Start accepts. Automaton has 10268 states and 14175 transitions. Word has length 221 [2019-10-02 06:54:54,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:54:54,731 INFO L475 AbstractCegarLoop]: Abstraction has 10268 states and 14175 transitions. [2019-10-02 06:54:54,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 06:54:54,731 INFO L276 IsEmpty]: Start isEmpty. Operand 10268 states and 14175 transitions. [2019-10-02 06:54:54,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-10-02 06:54:54,751 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:54:54,752 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 06:54:54,752 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:54:54,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:54:54,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1673734541, now seen corresponding path program 2 times [2019-10-02 06:54:54,753 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:54:54,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:54:54,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:54:54,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:54:54,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:54:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:54:55,214 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 06:54:55,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 06:54:55,215 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 06:54:55,946 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 06:55:09,725 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 06:55:09,725 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 06:55:09,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 5335 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 06:55:09,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 06:55:10,010 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 06:55:10,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 06:55:10,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-10-02 06:55:10,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 06:55:10,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 06:55:10,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-02 06:55:10,082 INFO L87 Difference]: Start difference. First operand 10268 states and 14175 transitions. Second operand 7 states. [2019-10-02 06:55:10,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:55:10,300 INFO L93 Difference]: Finished difference Result 20540 states and 28766 transitions. [2019-10-02 06:55:10,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 06:55:10,300 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 215 [2019-10-02 06:55:10,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:55:10,331 INFO L225 Difference]: With dead ends: 20540 [2019-10-02 06:55:10,332 INFO L226 Difference]: Without dead ends: 10292 [2019-10-02 06:55:10,353 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-02 06:55:10,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10292 states. [2019-10-02 06:55:10,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10292 to 10292. [2019-10-02 06:55:10,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10292 states. [2019-10-02 06:55:10,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10292 states to 10292 states and 14207 transitions. [2019-10-02 06:55:10,700 INFO L78 Accepts]: Start accepts. Automaton has 10292 states and 14207 transitions. Word has length 215 [2019-10-02 06:55:10,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:55:10,701 INFO L475 AbstractCegarLoop]: Abstraction has 10292 states and 14207 transitions. [2019-10-02 06:55:10,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 06:55:10,701 INFO L276 IsEmpty]: Start isEmpty. Operand 10292 states and 14207 transitions. [2019-10-02 06:55:10,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-10-02 06:55:10,720 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:55:10,721 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 06:55:10,721 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:55:10,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:55:10,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1935008211, now seen corresponding path program 1 times [2019-10-02 06:55:10,722 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:55:10,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:55:10,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:55:10,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 06:55:10,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:55:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:55:11,108 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-02 06:55:11,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 06:55:11,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 06:55:11,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 06:55:11,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 06:55:11,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 06:55:11,109 INFO L87 Difference]: Start difference. First operand 10292 states and 14207 transitions. Second operand 5 states. [2019-10-02 06:55:11,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:55:11,397 INFO L93 Difference]: Finished difference Result 20772 states and 28922 transitions. [2019-10-02 06:55:11,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 06:55:11,401 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 223 [2019-10-02 06:55:11,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:55:11,444 INFO L225 Difference]: With dead ends: 20772 [2019-10-02 06:55:11,445 INFO L226 Difference]: Without dead ends: 10500 [2019-10-02 06:55:11,470 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 06:55:11,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10500 states. [2019-10-02 06:55:11,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10500 to 10292. [2019-10-02 06:55:11,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10292 states. [2019-10-02 06:55:11,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10292 states to 10292 states and 14207 transitions. [2019-10-02 06:55:11,791 INFO L78 Accepts]: Start accepts. Automaton has 10292 states and 14207 transitions. Word has length 223 [2019-10-02 06:55:11,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:55:11,791 INFO L475 AbstractCegarLoop]: Abstraction has 10292 states and 14207 transitions. [2019-10-02 06:55:11,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 06:55:11,792 INFO L276 IsEmpty]: Start isEmpty. Operand 10292 states and 14207 transitions. [2019-10-02 06:55:11,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-10-02 06:55:11,803 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:55:11,804 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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-10-02 06:55:11,804 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:55:11,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:55:11,804 INFO L82 PathProgramCache]: Analyzing trace with hash 31737641, now seen corresponding path program 2 times [2019-10-02 06:55:11,804 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:55:11,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:55:11,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:55:11,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:55:11,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:55:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:55:13,197 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-02 06:55:13,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 06:55:13,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-02 06:55:13,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 06:55:13,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 06:55:13,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-02 06:55:13,199 INFO L87 Difference]: Start difference. First operand 10292 states and 14207 transitions. Second operand 14 states. [2019-10-02 06:55:14,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:55:14,211 INFO L93 Difference]: Finished difference Result 20908 states and 29698 transitions. [2019-10-02 06:55:14,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 06:55:14,211 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 220 [2019-10-02 06:55:14,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:55:14,243 INFO L225 Difference]: With dead ends: 20908 [2019-10-02 06:55:14,244 INFO L226 Difference]: Without dead ends: 10636 [2019-10-02 06:55:14,267 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-10-02 06:55:14,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10636 states. [2019-10-02 06:55:14,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10636 to 10380. [2019-10-02 06:55:14,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10380 states. [2019-10-02 06:55:14,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10380 states to 10380 states and 14296 transitions. [2019-10-02 06:55:14,511 INFO L78 Accepts]: Start accepts. Automaton has 10380 states and 14296 transitions. Word has length 220 [2019-10-02 06:55:14,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:55:14,511 INFO L475 AbstractCegarLoop]: Abstraction has 10380 states and 14296 transitions. [2019-10-02 06:55:14,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 06:55:14,511 INFO L276 IsEmpty]: Start isEmpty. Operand 10380 states and 14296 transitions. [2019-10-02 06:55:14,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-10-02 06:55:14,528 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:55:14,528 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 06:55:14,529 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:55:14,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:55:14,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1606118921, now seen corresponding path program 1 times [2019-10-02 06:55:14,529 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:55:14,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:55:14,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:55:14,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 06:55:14,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:55:14,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:55:14,836 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 06:55:14,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 06:55:14,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 06:55:14,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 06:55:14,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 06:55:14,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 06:55:14,838 INFO L87 Difference]: Start difference. First operand 10380 states and 14296 transitions. Second operand 4 states. [2019-10-02 06:55:15,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:55:15,209 INFO L93 Difference]: Finished difference Result 20784 states and 29124 transitions. [2019-10-02 06:55:15,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 06:55:15,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 226 [2019-10-02 06:55:15,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:55:15,253 INFO L225 Difference]: With dead ends: 20784 [2019-10-02 06:55:15,253 INFO L226 Difference]: Without dead ends: 10416 [2019-10-02 06:55:15,283 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 06:55:15,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10416 states. [2019-10-02 06:55:15,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10416 to 10416. [2019-10-02 06:55:15,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10416 states. [2019-10-02 06:55:15,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10416 states to 10416 states and 14340 transitions. [2019-10-02 06:55:15,623 INFO L78 Accepts]: Start accepts. Automaton has 10416 states and 14340 transitions. Word has length 226 [2019-10-02 06:55:15,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:55:15,623 INFO L475 AbstractCegarLoop]: Abstraction has 10416 states and 14340 transitions. [2019-10-02 06:55:15,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 06:55:15,624 INFO L276 IsEmpty]: Start isEmpty. Operand 10416 states and 14340 transitions. [2019-10-02 06:55:15,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-10-02 06:55:15,646 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:55:15,647 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 06:55:15,647 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:55:15,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:55:15,648 INFO L82 PathProgramCache]: Analyzing trace with hash 496030837, now seen corresponding path program 1 times [2019-10-02 06:55:15,648 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:55:15,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:55:15,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:55:15,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:55:15,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:55:15,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:55:15,958 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 06:55:15,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 06:55:15,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 06:55:15,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 06:55:15,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 06:55:15,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 06:55:15,961 INFO L87 Difference]: Start difference. First operand 10416 states and 14340 transitions. Second operand 3 states. [2019-10-02 06:55:16,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:55:16,220 INFO L93 Difference]: Finished difference Result 15715 states and 22067 transitions. [2019-10-02 06:55:16,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 06:55:16,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2019-10-02 06:55:16,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:55:16,264 INFO L225 Difference]: With dead ends: 15715 [2019-10-02 06:55:16,264 INFO L226 Difference]: Without dead ends: 10432 [2019-10-02 06:55:16,285 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 06:55:16,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10432 states. [2019-10-02 06:55:16,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10432 to 10424. [2019-10-02 06:55:16,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10424 states. [2019-10-02 06:55:16,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10424 states to 10424 states and 14348 transitions. [2019-10-02 06:55:16,537 INFO L78 Accepts]: Start accepts. Automaton has 10424 states and 14348 transitions. Word has length 225 [2019-10-02 06:55:16,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:55:16,538 INFO L475 AbstractCegarLoop]: Abstraction has 10424 states and 14348 transitions. [2019-10-02 06:55:16,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 06:55:16,538 INFO L276 IsEmpty]: Start isEmpty. Operand 10424 states and 14348 transitions. [2019-10-02 06:55:16,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-02 06:55:16,551 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:55:16,551 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 06:55:16,551 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:55:16,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:55:16,552 INFO L82 PathProgramCache]: Analyzing trace with hash -186277591, now seen corresponding path program 1 times [2019-10-02 06:55:16,552 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:55:16,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:55:16,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:55:16,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:55:16,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:55:17,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:55:17,537 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-02 06:55:17,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 06:55:17,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 06:55:17,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 06:55:17,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 06:55:17,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 06:55:17,540 INFO L87 Difference]: Start difference. First operand 10424 states and 14348 transitions. Second operand 11 states. [2019-10-02 06:55:18,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:55:18,119 INFO L93 Difference]: Finished difference Result 21100 states and 29378 transitions. [2019-10-02 06:55:18,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 06:55:18,120 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 236 [2019-10-02 06:55:18,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:55:18,166 INFO L225 Difference]: With dead ends: 21100 [2019-10-02 06:55:18,166 INFO L226 Difference]: Without dead ends: 10696 [2019-10-02 06:55:18,197 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-10-02 06:55:18,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10696 states. [2019-10-02 06:55:18,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10696 to 10472. [2019-10-02 06:55:18,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10472 states. [2019-10-02 06:55:18,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10472 states to 10472 states and 14404 transitions. [2019-10-02 06:55:18,460 INFO L78 Accepts]: Start accepts. Automaton has 10472 states and 14404 transitions. Word has length 236 [2019-10-02 06:55:18,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:55:18,460 INFO L475 AbstractCegarLoop]: Abstraction has 10472 states and 14404 transitions. [2019-10-02 06:55:18,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 06:55:18,461 INFO L276 IsEmpty]: Start isEmpty. Operand 10472 states and 14404 transitions. [2019-10-02 06:55:18,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-10-02 06:55:18,473 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:55:18,473 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 06:55:18,473 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:55:18,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:55:18,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1437606677, now seen corresponding path program 1 times [2019-10-02 06:55:18,474 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:55:18,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:55:18,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:55:18,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:55:18,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:55:18,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:55:19,024 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-02 06:55:19,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 06:55:19,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 06:55:19,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 06:55:19,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 06:55:19,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 06:55:19,026 INFO L87 Difference]: Start difference. First operand 10472 states and 14404 transitions. Second operand 3 states. [2019-10-02 06:55:19,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:55:19,360 INFO L93 Difference]: Finished difference Result 21644 states and 30172 transitions. [2019-10-02 06:55:19,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 06:55:19,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 247 [2019-10-02 06:55:19,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:55:19,415 INFO L225 Difference]: With dead ends: 21644 [2019-10-02 06:55:19,415 INFO L226 Difference]: Without dead ends: 11192 [2019-10-02 06:55:19,448 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 06:55:19,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11192 states. [2019-10-02 06:55:19,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11192 to 10856. [2019-10-02 06:55:19,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10856 states. [2019-10-02 06:55:19,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10856 states to 10856 states and 15052 transitions. [2019-10-02 06:55:19,850 INFO L78 Accepts]: Start accepts. Automaton has 10856 states and 15052 transitions. Word has length 247 [2019-10-02 06:55:19,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:55:19,851 INFO L475 AbstractCegarLoop]: Abstraction has 10856 states and 15052 transitions. [2019-10-02 06:55:19,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 06:55:19,851 INFO L276 IsEmpty]: Start isEmpty. Operand 10856 states and 15052 transitions. [2019-10-02 06:55:19,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-10-02 06:55:19,870 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:55:19,870 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 06:55:19,870 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:55:19,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:55:19,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1368548102, now seen corresponding path program 1 times [2019-10-02 06:55:19,871 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:55:19,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:55:19,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:55:19,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:55:19,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:55:20,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:55:20,587 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 06:55:20,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 06:55:20,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 06:55:20,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 06:55:20,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 06:55:20,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 06:55:20,589 INFO L87 Difference]: Start difference. First operand 10856 states and 15052 transitions. Second operand 11 states. [2019-10-02 06:55:21,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:55:21,000 INFO L93 Difference]: Finished difference Result 21916 states and 30806 transitions. [2019-10-02 06:55:21,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 06:55:21,001 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 235 [2019-10-02 06:55:21,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:55:21,038 INFO L225 Difference]: With dead ends: 21916 [2019-10-02 06:55:21,038 INFO L226 Difference]: Without dead ends: 11080 [2019-10-02 06:55:21,061 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-02 06:55:21,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11080 states. [2019-10-02 06:55:21,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11080 to 10880. [2019-10-02 06:55:21,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10880 states. [2019-10-02 06:55:21,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10880 states to 10880 states and 15076 transitions. [2019-10-02 06:55:21,509 INFO L78 Accepts]: Start accepts. Automaton has 10880 states and 15076 transitions. Word has length 235 [2019-10-02 06:55:21,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:55:21,509 INFO L475 AbstractCegarLoop]: Abstraction has 10880 states and 15076 transitions. [2019-10-02 06:55:21,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 06:55:21,509 INFO L276 IsEmpty]: Start isEmpty. Operand 10880 states and 15076 transitions. [2019-10-02 06:55:21,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-10-02 06:55:21,523 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:55:21,523 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 06:55:21,523 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:55:21,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:55:21,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1459667722, now seen corresponding path program 1 times [2019-10-02 06:55:21,524 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:55:21,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:55:21,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:55:21,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:55:21,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:55:21,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:55:21,858 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 06:55:21,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 06:55:21,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 06:55:21,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 06:55:21,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 06:55:21,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 06:55:21,859 INFO L87 Difference]: Start difference. First operand 10880 states and 15076 transitions. Second operand 8 states. [2019-10-02 06:55:22,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:55:22,790 INFO L93 Difference]: Finished difference Result 22364 states and 31547 transitions. [2019-10-02 06:55:22,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 06:55:22,791 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 227 [2019-10-02 06:55:22,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:55:22,825 INFO L225 Difference]: With dead ends: 22364 [2019-10-02 06:55:22,825 INFO L226 Difference]: Without dead ends: 11504 [2019-10-02 06:55:22,849 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-10-02 06:55:22,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11504 states. [2019-10-02 06:55:23,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11504 to 10912. [2019-10-02 06:55:23,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10912 states. [2019-10-02 06:55:23,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10912 states to 10912 states and 15119 transitions. [2019-10-02 06:55:23,096 INFO L78 Accepts]: Start accepts. Automaton has 10912 states and 15119 transitions. Word has length 227 [2019-10-02 06:55:23,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:55:23,096 INFO L475 AbstractCegarLoop]: Abstraction has 10912 states and 15119 transitions. [2019-10-02 06:55:23,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 06:55:23,097 INFO L276 IsEmpty]: Start isEmpty. Operand 10912 states and 15119 transitions. [2019-10-02 06:55:23,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-02 06:55:23,109 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:55:23,110 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 06:55:23,110 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:55:23,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:55:23,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1455332501, now seen corresponding path program 1 times [2019-10-02 06:55:23,110 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:55:23,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:55:23,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:55:23,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:55:23,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:55:23,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:55:23,428 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-10-02 06:55:23,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 06:55:23,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 06:55:23,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 06:55:23,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 06:55:23,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 06:55:23,431 INFO L87 Difference]: Start difference. First operand 10912 states and 15119 transitions. Second operand 7 states. [2019-10-02 06:55:23,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:55:23,795 INFO L93 Difference]: Finished difference Result 21828 states and 30776 transitions. [2019-10-02 06:55:23,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 06:55:23,795 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 230 [2019-10-02 06:55:23,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:55:23,843 INFO L225 Difference]: With dead ends: 21828 [2019-10-02 06:55:23,843 INFO L226 Difference]: Without dead ends: 10936 [2019-10-02 06:55:23,865 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 06:55:23,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10936 states. [2019-10-02 06:55:24,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10936 to 10912. [2019-10-02 06:55:24,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10912 states. [2019-10-02 06:55:24,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10912 states to 10912 states and 15111 transitions. [2019-10-02 06:55:24,107 INFO L78 Accepts]: Start accepts. Automaton has 10912 states and 15111 transitions. Word has length 230 [2019-10-02 06:55:24,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:55:24,107 INFO L475 AbstractCegarLoop]: Abstraction has 10912 states and 15111 transitions. [2019-10-02 06:55:24,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 06:55:24,108 INFO L276 IsEmpty]: Start isEmpty. Operand 10912 states and 15111 transitions. [2019-10-02 06:55:24,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-02 06:55:24,120 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:55:24,121 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 06:55:24,121 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:55:24,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:55:24,121 INFO L82 PathProgramCache]: Analyzing trace with hash 476635900, now seen corresponding path program 1 times [2019-10-02 06:55:24,121 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:55:24,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:55:24,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:55:24,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:55:24,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:55:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:55:24,695 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-10-02 06:55:24,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 06:55:24,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 06:55:24,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 06:55:24,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 06:55:24,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 06:55:24,697 INFO L87 Difference]: Start difference. First operand 10912 states and 15111 transitions. Second operand 10 states. [2019-10-02 06:55:25,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:55:25,208 INFO L93 Difference]: Finished difference Result 21892 states and 30752 transitions. [2019-10-02 06:55:25,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 06:55:25,208 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 230 [2019-10-02 06:55:25,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:55:25,253 INFO L225 Difference]: With dead ends: 21892 [2019-10-02 06:55:25,253 INFO L226 Difference]: Without dead ends: 11000 [2019-10-02 06:55:25,286 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-10-02 06:55:25,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11000 states. [2019-10-02 06:55:26,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11000 to 10912. [2019-10-02 06:55:26,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10912 states. [2019-10-02 06:55:26,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10912 states to 10912 states and 15095 transitions. [2019-10-02 06:55:26,791 INFO L78 Accepts]: Start accepts. Automaton has 10912 states and 15095 transitions. Word has length 230 [2019-10-02 06:55:26,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:55:26,791 INFO L475 AbstractCegarLoop]: Abstraction has 10912 states and 15095 transitions. [2019-10-02 06:55:26,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 06:55:26,791 INFO L276 IsEmpty]: Start isEmpty. Operand 10912 states and 15095 transitions. [2019-10-02 06:55:26,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-10-02 06:55:26,806 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:55:26,806 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 06:55:26,807 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:55:26,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:55:26,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1448071330, now seen corresponding path program 1 times [2019-10-02 06:55:26,807 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:55:26,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:55:26,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:55:26,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:55:26,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:55:26,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:55:27,096 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2019-10-02 06:55:27,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 06:55:27,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 06:55:27,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 06:55:27,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 06:55:27,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 06:55:27,100 INFO L87 Difference]: Start difference. First operand 10912 states and 15095 transitions. Second operand 3 states. [2019-10-02 06:55:30,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:55:30,807 INFO L93 Difference]: Finished difference Result 26236 states and 36217 transitions. [2019-10-02 06:55:30,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 06:55:30,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-10-02 06:55:30,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:55:30,855 INFO L225 Difference]: With dead ends: 26236 [2019-10-02 06:55:30,855 INFO L226 Difference]: Without dead ends: 15336 [2019-10-02 06:55:30,881 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 06:55:30,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15336 states. [2019-10-02 06:55:31,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15336 to 15302. [2019-10-02 06:55:31,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15302 states. [2019-10-02 06:55:31,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15302 states to 15302 states and 21082 transitions. [2019-10-02 06:55:31,239 INFO L78 Accepts]: Start accepts. Automaton has 15302 states and 21082 transitions. Word has length 263 [2019-10-02 06:55:31,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:55:31,239 INFO L475 AbstractCegarLoop]: Abstraction has 15302 states and 21082 transitions. [2019-10-02 06:55:31,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 06:55:31,239 INFO L276 IsEmpty]: Start isEmpty. Operand 15302 states and 21082 transitions. [2019-10-02 06:55:31,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-02 06:55:31,257 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:55:31,257 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 06:55:31,257 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:55:31,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:55:31,258 INFO L82 PathProgramCache]: Analyzing trace with hash -493829132, now seen corresponding path program 1 times [2019-10-02 06:55:31,258 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:55:31,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:55:31,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:55:31,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:55:31,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:55:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:55:31,701 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 06:55:31,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 06:55:31,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 06:55:31,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 06:55:31,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 06:55:31,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 06:55:31,703 INFO L87 Difference]: Start difference. First operand 15302 states and 21082 transitions. Second operand 9 states. [2019-10-02 06:56:13,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:56:13,477 INFO L93 Difference]: Finished difference Result 48917 states and 73875 transitions. [2019-10-02 06:56:13,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 06:56:13,478 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 238 [2019-10-02 06:56:13,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:56:13,663 INFO L225 Difference]: With dead ends: 48917 [2019-10-02 06:56:13,663 INFO L226 Difference]: Without dead ends: 33635 [2019-10-02 06:56:13,725 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-10-02 06:56:13,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33635 states. [2019-10-02 06:56:14,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33635 to 30122. [2019-10-02 06:56:14,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30122 states. [2019-10-02 06:56:14,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30122 states to 30122 states and 44598 transitions. [2019-10-02 06:56:14,721 INFO L78 Accepts]: Start accepts. Automaton has 30122 states and 44598 transitions. Word has length 238 [2019-10-02 06:56:14,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:56:14,722 INFO L475 AbstractCegarLoop]: Abstraction has 30122 states and 44598 transitions. [2019-10-02 06:56:14,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 06:56:14,722 INFO L276 IsEmpty]: Start isEmpty. Operand 30122 states and 44598 transitions. [2019-10-02 06:56:14,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-10-02 06:56:14,741 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:56:14,742 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 06:56:14,742 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:56:14,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:56:14,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1764514387, now seen corresponding path program 1 times [2019-10-02 06:56:14,743 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:56:14,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:56:14,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:56:14,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:56:14,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:56:14,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:56:14,996 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 06:56:14,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 06:56:14,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 06:56:14,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 06:56:14,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 06:56:14,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 06:56:14,998 INFO L87 Difference]: Start difference. First operand 30122 states and 44598 transitions. Second operand 4 states. [2019-10-02 06:56:15,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:56:15,837 INFO L93 Difference]: Finished difference Result 52768 states and 82128 transitions. [2019-10-02 06:56:15,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 06:56:15,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2019-10-02 06:56:15,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:56:15,974 INFO L225 Difference]: With dead ends: 52768 [2019-10-02 06:56:15,974 INFO L226 Difference]: Without dead ends: 30176 [2019-10-02 06:56:16,065 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 06:56:16,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30176 states. [2019-10-02 06:56:17,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30176 to 30140. [2019-10-02 06:56:17,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30140 states. [2019-10-02 06:56:17,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30140 states to 30140 states and 44622 transitions. [2019-10-02 06:56:17,445 INFO L78 Accepts]: Start accepts. Automaton has 30140 states and 44622 transitions. Word has length 240 [2019-10-02 06:56:17,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:56:17,446 INFO L475 AbstractCegarLoop]: Abstraction has 30140 states and 44622 transitions. [2019-10-02 06:56:17,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 06:56:17,446 INFO L276 IsEmpty]: Start isEmpty. Operand 30140 states and 44622 transitions. [2019-10-02 06:56:17,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-10-02 06:56:17,466 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:56:17,466 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 06:56:17,466 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:56:17,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:56:17,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1418109679, now seen corresponding path program 1 times [2019-10-02 06:56:17,467 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:56:17,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:56:17,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:56:17,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:56:17,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:56:17,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:56:18,122 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (const Int) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:478) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:250) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:250) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.termWithLocalSimplification(SmtUtils.java:1305) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.termWithLocalSimplification(SmtUtils.java:1186) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.TermTransferrer.convertApplicationTerm(TermTransferrer.java:182) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:339) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:574) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:465) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-02 06:56:18,129 INFO L168 Benchmark]: Toolchain (without parser) took 177211.96 ms. Allocated memory was 139.5 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 75.9 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 972.9 MB. Max. memory is 7.1 GB. [2019-10-02 06:56:18,130 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 139.5 MB. Free memory is still 105.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-02 06:56:18,131 INFO L168 Benchmark]: CACSL2BoogieTranslator took 3277.33 ms. Allocated memory was 139.5 MB in the beginning and 276.8 MB in the end (delta: 137.4 MB). Free memory was 75.9 MB in the beginning and 138.7 MB in the end (delta: -62.8 MB). Peak memory consumption was 113.5 MB. Max. memory is 7.1 GB. [2019-10-02 06:56:18,132 INFO L168 Benchmark]: Boogie Preprocessor took 371.88 ms. Allocated memory is still 276.8 MB. Free memory was 138.7 MB in the beginning and 107.1 MB in the end (delta: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 7.1 GB. [2019-10-02 06:56:18,132 INFO L168 Benchmark]: RCFGBuilder took 14430.41 ms. Allocated memory was 276.8 MB in the beginning and 756.5 MB in the end (delta: 479.7 MB). Free memory was 107.1 MB in the beginning and 600.0 MB in the end (delta: -492.9 MB). Peak memory consumption was 553.6 MB. Max. memory is 7.1 GB. [2019-10-02 06:56:18,133 INFO L168 Benchmark]: TraceAbstraction took 159127.99 ms. Allocated memory was 756.5 MB in the beginning and 2.7 GB in the end (delta: 2.0 GB). Free memory was 600.0 MB in the beginning and 1.7 GB in the end (delta: -1.1 GB). Peak memory consumption was 879.9 MB. Max. memory is 7.1 GB. [2019-10-02 06:56:18,139 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 139.5 MB. Free memory is still 105.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 3277.33 ms. Allocated memory was 139.5 MB in the beginning and 276.8 MB in the end (delta: 137.4 MB). Free memory was 75.9 MB in the beginning and 138.7 MB in the end (delta: -62.8 MB). Peak memory consumption was 113.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 371.88 ms. Allocated memory is still 276.8 MB. Free memory was 138.7 MB in the beginning and 107.1 MB in the end (delta: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 14430.41 ms. Allocated memory was 276.8 MB in the beginning and 756.5 MB in the end (delta: 479.7 MB). Free memory was 107.1 MB in the beginning and 600.0 MB in the end (delta: -492.9 MB). Peak memory consumption was 553.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 159127.99 ms. Allocated memory was 756.5 MB in the beginning and 2.7 GB in the end (delta: 2.0 GB). Free memory was 600.0 MB in the beginning and 1.7 GB in the end (delta: -1.1 GB). Peak memory consumption was 879.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Undeclared function symbol (const Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Undeclared function symbol (const Int): de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:478) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...