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.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 04:27:07,820 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 04:27:07,822 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 04:27:07,836 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 04:27:07,836 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 04:27:07,838 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 04:27:07,840 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 04:27:07,851 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 04:27:07,853 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 04:27:07,857 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 04:27:07,858 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 04:27:07,859 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 04:27:07,861 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 04:27:07,862 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 04:27:07,863 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 04:27:07,867 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 04:27:07,868 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 04:27:07,872 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 04:27:07,875 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 04:27:07,880 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 04:27:07,883 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 04:27:07,884 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 04:27:07,887 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 04:27:07,888 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 04:27:07,891 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 04:27:07,892 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 04:27:07,892 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 04:27:07,894 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 04:27:07,896 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 04:27:07,898 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 04:27:07,899 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 04:27:07,900 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 04:27:07,901 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 04:27:07,902 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 04:27:07,906 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 04:27:07,907 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 04:27:07,907 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 04:27:07,908 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 04:27:07,908 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 04:27:07,910 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 04:27:07,911 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 04:27:07,912 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 04:27:07,935 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 04:27:07,935 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 04:27:07,938 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 04:27:07,938 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 04:27:07,938 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 04:27:07,939 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 04:27:07,939 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 04:27:07,939 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 04:27:07,939 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 04:27:07,940 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 04:27:07,941 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 04:27:07,941 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 04:27:07,941 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 04:27:07,942 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 04:27:07,942 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 04:27:07,942 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 04:27:07,943 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 04:27:07,943 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 04:27:07,943 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 04:27:07,943 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 04:27:07,944 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 04:27:07,944 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 04:27:07,944 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 04:27:07,944 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 04:27:07,945 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 04:27:07,945 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 04:27:07,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 04:27:07,945 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 04:27:07,946 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 04:27:07,998 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 04:27:08,018 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 04:27:08,022 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 04:27:08,024 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 04:27:08,024 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 04:27:08,025 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-entry_point.cil.out.i [2019-10-02 04:27:08,100 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7651e82fd/db7dd41b558547c1b6704107d17a22cf/FLAG9dce801fa [2019-10-02 04:27:09,013 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 04:27:09,014 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-entry_point.cil.out.i [2019-10-02 04:27:09,066 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7651e82fd/db7dd41b558547c1b6704107d17a22cf/FLAG9dce801fa [2019-10-02 04:27:09,409 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7651e82fd/db7dd41b558547c1b6704107d17a22cf [2019-10-02 04:27:09,419 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 04:27:09,421 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 04:27:09,422 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 04:27:09,423 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 04:27:09,426 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 04:27:09,427 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 04:27:09" (1/1) ... [2019-10-02 04:27:09,431 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@99e08fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:27:09, skipping insertion in model container [2019-10-02 04:27:09,431 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 04:27:09" (1/1) ... [2019-10-02 04:27:09,439 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 04:27:09,636 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 04:27:12,137 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 04:27:12,188 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 04:27:12,651 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 04:27:12,847 INFO L192 MainTranslator]: Completed translation [2019-10-02 04:27:12,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:27:12 WrapperNode [2019-10-02 04:27:12,849 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 04:27:12,850 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 04:27:12,850 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 04:27:12,850 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 04:27:12,866 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:27:12" (1/1) ... [2019-10-02 04:27:12,866 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:27:12" (1/1) ... [2019-10-02 04:27:12,950 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:27:12" (1/1) ... [2019-10-02 04:27:12,951 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:27:12" (1/1) ... [2019-10-02 04:27:13,104 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:27:12" (1/1) ... [2019-10-02 04:27:13,145 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:27:12" (1/1) ... [2019-10-02 04:27:13,200 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:27:12" (1/1) ... [2019-10-02 04:27:13,237 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 04:27:13,238 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 04:27:13,238 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 04:27:13,239 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 04:27:13,248 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:27:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 04:27:13,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 04:27:13,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 04:27:13,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~~gfp_t~0~X~$Pointer$~TO~$Pointer$ [2019-10-02 04:27:13,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~~dma_addr_t~0~X~$Pointer$~TO~VOID [2019-10-02 04:27:13,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~X~$Pointer$~X~int~TO~int [2019-10-02 04:27:13,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2019-10-02 04:27:13,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2019-10-02 04:27:13,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-10-02 04:27:13,339 INFO L138 BoogieDeclarations]: Found implementation of procedure __arch_swab32 [2019-10-02 04:27:13,339 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2019-10-02 04:27:13,339 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2019-10-02 04:27:13,340 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2019-10-02 04:27:13,342 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2019-10-02 04:27:13,342 INFO L138 BoogieDeclarations]: Found implementation of procedure arch_local_save_flags [2019-10-02 04:27:13,343 INFO L138 BoogieDeclarations]: Found implementation of procedure arch_irqs_disabled_flags [2019-10-02 04:27:13,344 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2019-10-02 04:27:13,346 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2019-10-02 04:27:13,346 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2019-10-02 04:27:13,346 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2019-10-02 04:27:13,347 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_schedule [2019-10-02 04:27:13,347 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_make_path [2019-10-02 04:27:13,347 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2019-10-02 04:27:13,347 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2019-10-02 04:27:13,347 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2019-10-02 04:27:13,348 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2019-10-02 04:27:13,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-10-02 04:27:13,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-10-02 04:27:13,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2019-10-02 04:27:13,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ptr [2019-10-02 04:27:13,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2019-10-02 04:27:13,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-10-02 04:27:13,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2019-10-02 04:27:13,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-10-02 04:27:13,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_trap [2019-10-02 04:27:13,349 INFO L138 BoogieDeclarations]: Found implementation of procedure is_device_dma_capable [2019-10-02 04:27:13,349 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2019-10-02 04:27:13,349 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_alloc_coherent_mask [2019-10-02 04:27:13,349 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_alloc_coherent_gfp_flags [2019-10-02 04:27:13,350 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_alloc_attrs [2019-10-02 04:27:13,350 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_free_attrs [2019-10-02 04:27:13,350 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_alloc_consistent [2019-10-02 04:27:13,350 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_free_consistent [2019-10-02 04:27:13,350 INFO L138 BoogieDeclarations]: Found implementation of procedure input_allocate_device [2019-10-02 04:27:13,350 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_key [2019-10-02 04:27:13,350 INFO L138 BoogieDeclarations]: Found implementation of procedure input_sync [2019-10-02 04:27:13,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_handle_irq [2019-10-02 04:27:13,351 INFO L138 BoogieDeclarations]: Found implementation of procedure crc16 [2019-10-02 04:27:13,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_send_command [2019-10-02 04:27:13,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_get_stb_state [2019-10-02 04:27:13,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_audio_pes2ts_cb [2019-10-02 04:27:13,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_video_pes2ts_cb [2019-10-02 04:27:13,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_set_pids [2019-10-02 04:27:13,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_process_pva [2019-10-02 04:27:13,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_process_filter [2019-10-02 04:27:13,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_process_packet [2019-10-02 04:27:13,353 INFO L138 BoogieDeclarations]: Found implementation of procedure swap_bytes [2019-10-02 04:27:13,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_process_urb_frame [2019-10-02 04:27:13,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_process_urb_frame_list [2019-10-02 04:27:13,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_process_urb [2019-10-02 04:27:13,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_setup_urbs [2019-10-02 04:27:13,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_stop_iso_xfer [2019-10-02 04:27:13,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_set_interface [2019-10-02 04:27:13,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_start_iso_xfer [2019-10-02 04:27:13,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_start_ts_feed [2019-10-02 04:27:13,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_start_sec_feed [2019-10-02 04:27:13,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_start_feed [2019-10-02 04:27:13,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_stop_ts_feed [2019-10-02 04:27:13,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_stop_sec_feed [2019-10-02 04:27:13,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_stop_feed [2019-10-02 04:27:13,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_free_iso_urbs [2019-10-02 04:27:13,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_alloc_iso_urbs [2019-10-02 04:27:13,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_init_tasklet [2019-10-02 04:27:13,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_init_rc [2019-10-02 04:27:13,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_init_v_pes [2019-10-02 04:27:13,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_init_usb [2019-10-02 04:27:13,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_boot_dsp [2019-10-02 04:27:13,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_init_stb [2019-10-02 04:27:13,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_init_dvb [2019-10-02 04:27:13,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_exit_dvb [2019-10-02 04:27:13,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_exit_rc [2019-10-02 04:27:13,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_exit_usb [2019-10-02 04:27:13,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_exit_tasklet [2019-10-02 04:27:13,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_init_filters [2019-10-02 04:27:13,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_exit_filters [2019-10-02 04:27:13,359 INFO L138 BoogieDeclarations]: Found implementation of procedure fe_send_command [2019-10-02 04:27:13,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_probe [2019-10-02 04:27:13,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_disconnect [2019-10-02 04:27:13,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_set_model [2019-10-02 04:27:13,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_driver_init [2019-10-02 04:27:13,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_driver_exit [2019-10-02 04:27:13,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_driver_1 [2019-10-02 04:27:13,362 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 04:27:13,362 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2019-10-02 04:27:13,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_2 [2019-10-02 04:27:13,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_3 [2019-10-02 04:27:13,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_4 [2019-10-02 04:27:13,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_free_urb_5 [2019-10-02 04:27:13,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_alloc_urb_6 [2019-10-02 04:27:13,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_7 [2019-10-02 04:27:13,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_alloc_urb_8 [2019-10-02 04:27:13,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_free_urb_9 [2019-10-02 04:27:13,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_int_urb_10 [2019-10-02 04:27:13,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_free_urb_11 [2019-10-02 04:27:13,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_12 [2019-10-02 04:27:13,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata_13 [2019-10-02 04:27:13,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_register_driver_15 [2019-10-02 04:27:13,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_deregister_16 [2019-10-02 04:27:13,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2019-10-02 04:27:13,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata [2019-10-02 04:27:13,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata [2019-10-02 04:27:13,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_put_intf [2019-10-02 04:27:13,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2019-10-02 04:27:13,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2019-10-02 04:27:13,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_fill_int_urb [2019-10-02 04:27:13,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_fill_bulk_urb [2019-10-02 04:27:13,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2019-10-02 04:27:13,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_interface_to_usbdev [2019-10-02 04:27:13,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_get_dev [2019-10-02 04:27:13,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_put_dev [2019-10-02 04:27:13,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_get_interface [2019-10-02 04:27:13,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_put_interface [2019-10-02 04:27:13,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_serial_register [2019-10-02 04:27:13,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_serial_deregister [2019-10-02 04:27:13,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-10-02 04:27:13,368 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2019-10-02 04:27:13,368 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2019-10-02 04:27:13,368 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2019-10-02 04:27:13,368 INFO L138 BoogieDeclarations]: Found implementation of procedure __tasklet_schedule [2019-10-02 04:27:13,368 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2019-10-02 04:27:13,369 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_unlock_irqrestore [2019-10-02 04:27:13,369 INFO L138 BoogieDeclarations]: Found implementation of procedure crc32_le [2019-10-02 04:27:13,369 INFO L138 BoogieDeclarations]: Found implementation of procedure debug_dma_alloc_coherent [2019-10-02 04:27:13,369 INFO L138 BoogieDeclarations]: Found implementation of procedure debug_dma_free_coherent [2019-10-02 04:27:13,369 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_dmx_init [2019-10-02 04:27:13,370 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_dmx_release [2019-10-02 04:27:13,370 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_dmxdev_init [2019-10-02 04:27:13,370 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_dmxdev_release [2019-10-02 04:27:13,370 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_filter_pes2ts [2019-10-02 04:27:13,370 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_filter_pes2ts_init [2019-10-02 04:27:13,371 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_net_init [2019-10-02 04:27:13,374 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_net_release [2019-10-02 04:27:13,375 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_register_adapter [2019-10-02 04:27:13,375 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_register_frontend [2019-10-02 04:27:13,375 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_unregister_adapter [2019-10-02 04:27:13,380 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_unregister_frontend [2019-10-02 04:27:13,381 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event [2019-10-02 04:27:13,381 INFO L138 BoogieDeclarations]: Found implementation of procedure input_free_device [2019-10-02 04:27:13,381 INFO L138 BoogieDeclarations]: Found implementation of procedure input_register_device [2019-10-02 04:27:13,381 INFO L138 BoogieDeclarations]: Found implementation of procedure input_unregister_device [2019-10-02 04:27:13,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-10-02 04:27:13,381 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2019-10-02 04:27:13,381 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_interruptible_nested [2019-10-02 04:27:13,382 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2019-10-02 04:27:13,382 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-10-02 04:27:13,382 INFO L138 BoogieDeclarations]: Found implementation of procedure release_firmware [2019-10-02 04:27:13,382 INFO L138 BoogieDeclarations]: Found implementation of procedure request_firmware [2019-10-02 04:27:13,382 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2019-10-02 04:27:13,382 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_init [2019-10-02 04:27:13,382 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_kill [2019-10-02 04:27:13,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusbdecfe_dvbs_attach [2019-10-02 04:27:13,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusbdecfe_dvbt_attach [2019-10-02 04:27:13,383 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2019-10-02 04:27:13,383 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2019-10-02 04:27:13,383 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_deregister [2019-10-02 04:27:13,383 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2019-10-02 04:27:13,383 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2019-10-02 04:27:13,383 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register_driver [2019-10-02 04:27:13,384 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_interface [2019-10-02 04:27:13,384 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2019-10-02 04:27:13,384 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-10-02 04:27:13,384 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-10-02 04:27:13,384 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-10-02 04:27:13,385 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-10-02 04:27:13,385 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-10-02 04:27:13,385 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 04:27:13,385 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-10-02 04:27:13,385 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-10-02 04:27:13,385 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-10-02 04:27:13,385 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2019-10-02 04:27:13,385 INFO L130 BoogieDeclarations]: Found specification of procedure __arch_swab32 [2019-10-02 04:27:13,386 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2019-10-02 04:27:13,386 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2019-10-02 04:27:13,386 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2019-10-02 04:27:13,386 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2019-10-02 04:27:13,386 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-10-02 04:27:13,386 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2019-10-02 04:27:13,386 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2019-10-02 04:27:13,386 INFO L130 BoogieDeclarations]: Found specification of procedure arch_local_save_flags [2019-10-02 04:27:13,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 04:27:13,387 INFO L130 BoogieDeclarations]: Found specification of procedure arch_irqs_disabled_flags [2019-10-02 04:27:13,387 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2019-10-02 04:27:13,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 04:27:13,387 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2019-10-02 04:27:13,387 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2019-10-02 04:27:13,387 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2019-10-02 04:27:13,387 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2019-10-02 04:27:13,388 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2019-10-02 04:27:13,388 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_unlock_irqrestore [2019-10-02 04:27:13,388 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2019-10-02 04:27:13,388 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2019-10-02 04:27:13,388 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2019-10-02 04:27:13,388 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_interruptible_nested [2019-10-02 04:27:13,388 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2019-10-02 04:27:13,389 INFO L130 BoogieDeclarations]: Found specification of procedure __tasklet_schedule [2019-10-02 04:27:13,389 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_schedule [2019-10-02 04:27:13,389 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_kill [2019-10-02 04:27:13,389 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_init [2019-10-02 04:27:13,389 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata_13 [2019-10-02 04:27:13,389 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_12 [2019-10-02 04:27:13,389 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2019-10-02 04:27:13,390 INFO L130 BoogieDeclarations]: Found specification of procedure usb_make_path [2019-10-02 04:27:13,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 04:27:13,390 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register_driver [2019-10-02 04:27:13,390 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_register_driver_15 [2019-10-02 04:27:13,390 INFO L130 BoogieDeclarations]: Found specification of procedure usb_deregister [2019-10-02 04:27:13,390 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_deregister_16 [2019-10-02 04:27:13,390 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_int_urb_10 [2019-10-02 04:27:13,390 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_alloc_urb_6 [2019-10-02 04:27:13,391 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_alloc_urb_8 [2019-10-02 04:27:13,391 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_free_urb_5 [2019-10-02 04:27:13,391 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_free_urb_9 [2019-10-02 04:27:13,391 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_free_urb_11 [2019-10-02 04:27:13,391 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_2 [2019-10-02 04:27:13,391 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_3 [2019-10-02 04:27:13,391 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_4 [2019-10-02 04:27:13,392 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_7 [2019-10-02 04:27:13,392 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2019-10-02 04:27:13,392 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2019-10-02 04:27:13,392 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2019-10-02 04:27:13,392 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2019-10-02 04:27:13,392 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_interface [2019-10-02 04:27:13,392 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2019-10-02 04:27:13,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 04:27:13,393 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2019-10-02 04:27:13,393 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2019-10-02 04:27:13,393 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_fill_int_urb [2019-10-02 04:27:13,393 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2019-10-02 04:27:13,393 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_interface_to_usbdev [2019-10-02 04:27:13,393 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata [2019-10-02 04:27:13,393 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata [2019-10-02 04:27:13,394 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-10-02 04:27:13,394 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-10-02 04:27:13,394 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2019-10-02 04:27:13,394 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2019-10-02 04:27:13,394 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2019-10-02 04:27:13,394 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 04:27:13,394 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-02 04:27:13,394 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 04:27:13,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-10-02 04:27:13,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-02 04:27:13,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 04:27:13,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 04:27:13,395 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-10-02 04:27:13,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-10-02 04:27:13,395 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2019-10-02 04:27:13,395 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ptr [2019-10-02 04:27:13,396 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2019-10-02 04:27:13,396 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-10-02 04:27:13,396 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2019-10-02 04:27:13,396 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_trap [2019-10-02 04:27:13,396 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_driver_1 [2019-10-02 04:27:13,396 INFO L130 BoogieDeclarations]: Found specification of procedure is_device_dma_capable [2019-10-02 04:27:13,396 INFO L130 BoogieDeclarations]: Found specification of procedure debug_dma_alloc_coherent [2019-10-02 04:27:13,396 INFO L130 BoogieDeclarations]: Found specification of procedure debug_dma_free_coherent [2019-10-02 04:27:13,397 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2019-10-02 04:27:13,397 INFO L130 BoogieDeclarations]: Found specification of procedure dma_alloc_coherent_mask [2019-10-02 04:27:13,397 INFO L130 BoogieDeclarations]: Found specification of procedure dma_alloc_coherent_gfp_flags [2019-10-02 04:27:13,397 INFO L130 BoogieDeclarations]: Found specification of procedure dma_alloc_attrs [2019-10-02 04:27:13,397 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~~gfp_t~0~X~$Pointer$~TO~$Pointer$ [2019-10-02 04:27:13,397 INFO L130 BoogieDeclarations]: Found specification of procedure dma_free_attrs [2019-10-02 04:27:13,397 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~~dma_addr_t~0~X~$Pointer$~TO~VOID [2019-10-02 04:27:13,398 INFO L130 BoogieDeclarations]: Found specification of procedure pci_alloc_consistent [2019-10-02 04:27:13,398 INFO L130 BoogieDeclarations]: Found specification of procedure pci_free_consistent [2019-10-02 04:27:13,398 INFO L130 BoogieDeclarations]: Found specification of procedure request_firmware [2019-10-02 04:27:13,398 INFO L130 BoogieDeclarations]: Found specification of procedure release_firmware [2019-10-02 04:27:13,398 INFO L130 BoogieDeclarations]: Found specification of procedure crc32_le [2019-10-02 04:27:13,398 INFO L130 BoogieDeclarations]: Found specification of procedure input_allocate_device [2019-10-02 04:27:13,398 INFO L130 BoogieDeclarations]: Found specification of procedure input_free_device [2019-10-02 04:27:13,399 INFO L130 BoogieDeclarations]: Found specification of procedure input_register_device [2019-10-02 04:27:13,399 INFO L130 BoogieDeclarations]: Found specification of procedure input_unregister_device [2019-10-02 04:27:13,399 INFO L130 BoogieDeclarations]: Found specification of procedure input_event [2019-10-02 04:27:13,399 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_key [2019-10-02 04:27:13,399 INFO L130 BoogieDeclarations]: Found specification of procedure input_sync [2019-10-02 04:27:13,399 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_register_adapter [2019-10-02 04:27:13,399 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_unregister_adapter [2019-10-02 04:27:13,399 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_dmxdev_init [2019-10-02 04:27:13,400 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_dmxdev_release [2019-10-02 04:27:13,400 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_dmx_init [2019-10-02 04:27:13,400 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_dmx_release [2019-10-02 04:27:13,400 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_filter_pes2ts_init [2019-10-02 04:27:13,400 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_filter_pes2ts [2019-10-02 04:27:13,400 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_register_frontend [2019-10-02 04:27:13,400 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_unregister_frontend [2019-10-02 04:27:13,401 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_net_release [2019-10-02 04:27:13,401 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_net_init [2019-10-02 04:27:13,401 INFO L130 BoogieDeclarations]: Found specification of procedure ttusbdecfe_dvbs_attach [2019-10-02 04:27:13,401 INFO L130 BoogieDeclarations]: Found specification of procedure ttusbdecfe_dvbt_attach [2019-10-02 04:27:13,401 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_set_model [2019-10-02 04:27:13,401 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_handle_irq [2019-10-02 04:27:13,401 INFO L130 BoogieDeclarations]: Found specification of procedure crc16 [2019-10-02 04:27:13,402 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_send_command [2019-10-02 04:27:13,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-10-02 04:27:13,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 04:27:13,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 04:27:13,402 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_get_stb_state [2019-10-02 04:27:13,402 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_audio_pes2ts_cb [2019-10-02 04:27:13,402 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~X~$Pointer$~X~int~TO~int [2019-10-02 04:27:13,402 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_video_pes2ts_cb [2019-10-02 04:27:13,403 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_set_pids [2019-10-02 04:27:13,403 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_process_pva [2019-10-02 04:27:13,403 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_process_filter [2019-10-02 04:27:13,403 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_process_packet [2019-10-02 04:27:13,403 INFO L130 BoogieDeclarations]: Found specification of procedure swap_bytes [2019-10-02 04:27:13,403 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_process_urb_frame [2019-10-02 04:27:13,403 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_process_urb_frame_list [2019-10-02 04:27:13,403 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_process_urb [2019-10-02 04:27:13,404 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_setup_urbs [2019-10-02 04:27:13,404 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_stop_iso_xfer [2019-10-02 04:27:13,404 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_set_interface [2019-10-02 04:27:13,404 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_start_iso_xfer [2019-10-02 04:27:13,404 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_start_ts_feed [2019-10-02 04:27:13,404 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_start_sec_feed [2019-10-02 04:27:13,404 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_start_feed [2019-10-02 04:27:13,404 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_stop_ts_feed [2019-10-02 04:27:13,405 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_stop_sec_feed [2019-10-02 04:27:13,405 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_stop_feed [2019-10-02 04:27:13,405 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_free_iso_urbs [2019-10-02 04:27:13,405 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_alloc_iso_urbs [2019-10-02 04:27:13,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-10-02 04:27:13,405 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_init_tasklet [2019-10-02 04:27:13,405 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_init_rc [2019-10-02 04:27:13,405 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_init_v_pes [2019-10-02 04:27:13,406 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_init_usb [2019-10-02 04:27:13,406 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_boot_dsp [2019-10-02 04:27:13,406 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_init_stb [2019-10-02 04:27:13,406 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_init_dvb [2019-10-02 04:27:13,406 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2019-10-02 04:27:13,406 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_exit_dvb [2019-10-02 04:27:13,406 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2019-10-02 04:27:13,406 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-10-02 04:27:13,407 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_exit_rc [2019-10-02 04:27:13,407 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_exit_usb [2019-10-02 04:27:13,407 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_exit_tasklet [2019-10-02 04:27:13,407 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_init_filters [2019-10-02 04:27:13,407 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_exit_filters [2019-10-02 04:27:13,407 INFO L130 BoogieDeclarations]: Found specification of procedure fe_send_command [2019-10-02 04:27:13,407 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_probe [2019-10-02 04:27:13,407 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_disconnect [2019-10-02 04:27:13,408 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_driver_init [2019-10-02 04:27:13,408 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_driver_exit [2019-10-02 04:27:13,408 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-10-02 04:27:13,408 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-10-02 04:27:13,408 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 04:27:13,408 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2019-10-02 04:27:13,408 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_put_intf [2019-10-02 04:27:13,408 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_fill_bulk_urb [2019-10-02 04:27:13,409 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_get_dev [2019-10-02 04:27:13,409 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_put_dev [2019-10-02 04:27:13,409 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_get_interface [2019-10-02 04:27:13,409 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_put_interface [2019-10-02 04:27:13,409 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_serial_register [2019-10-02 04:27:13,409 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_serial_deregister [2019-10-02 04:27:13,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-10-02 04:27:13,409 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-10-02 04:27:13,410 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 04:27:13,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 04:27:13,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 04:27:13,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-02 04:27:13,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 04:27:13,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-10-02 04:27:13,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-10-02 04:27:13,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-10-02 04:27:13,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-10-02 04:27:14,950 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2019-10-02 04:27:23,148 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2019-10-02 04:27:26,579 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 04:27:26,579 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-02 04:27:26,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 04:27:26 BoogieIcfgContainer [2019-10-02 04:27:26,582 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 04:27:26,583 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 04:27:26,583 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 04:27:26,586 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 04:27:26,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 04:27:09" (1/3) ... [2019-10-02 04:27:26,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e46efe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 04:27:26, skipping insertion in model container [2019-10-02 04:27:26,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:27:12" (2/3) ... [2019-10-02 04:27:26,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e46efe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 04:27:26, skipping insertion in model container [2019-10-02 04:27:26,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 04:27:26" (3/3) ... [2019-10-02 04:27:26,590 INFO L109 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-entry_point.cil.out.i [2019-10-02 04:27:26,600 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 04:27:26,610 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 04:27:26,625 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 04:27:26,666 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 04:27:26,667 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 04:27:26,667 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 04:27:26,667 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 04:27:26,667 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 04:27:26,668 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 04:27:26,668 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 04:27:26,668 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 04:27:26,668 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 04:27:26,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states. [2019-10-02 04:27:26,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-02 04:27:26,781 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:27:26,782 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:27:26,785 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:27:26,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:27:26,791 INFO L82 PathProgramCache]: Analyzing trace with hash 2036228256, now seen corresponding path program 1 times [2019-10-02 04:27:26,792 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:27:26,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:27:26,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:27:26,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:27:26,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:27:27,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:27:27,644 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 04:27:27,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:27:27,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 04:27:27,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 04:27:27,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 04:27:27,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 04:27:27,669 INFO L87 Difference]: Start difference. First operand 1544 states. Second operand 3 states. [2019-10-02 04:27:30,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:27:30,433 INFO L93 Difference]: Finished difference Result 3999 states and 5185 transitions. [2019-10-02 04:27:30,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 04:27:30,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-10-02 04:27:30,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:27:30,481 INFO L225 Difference]: With dead ends: 3999 [2019-10-02 04:27:30,481 INFO L226 Difference]: Without dead ends: 2628 [2019-10-02 04:27:30,498 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 04:27:30,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2628 states. [2019-10-02 04:27:30,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2628 to 2628. [2019-10-02 04:27:30,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2628 states. [2019-10-02 04:27:30,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2628 states to 2628 states and 3394 transitions. [2019-10-02 04:27:30,816 INFO L78 Accepts]: Start accepts. Automaton has 2628 states and 3394 transitions. Word has length 68 [2019-10-02 04:27:30,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:27:30,817 INFO L475 AbstractCegarLoop]: Abstraction has 2628 states and 3394 transitions. [2019-10-02 04:27:30,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 04:27:30,817 INFO L276 IsEmpty]: Start isEmpty. Operand 2628 states and 3394 transitions. [2019-10-02 04:27:30,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-02 04:27:30,831 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:27:30,832 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:27:30,832 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:27:30,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:27:30,833 INFO L82 PathProgramCache]: Analyzing trace with hash 523127889, now seen corresponding path program 1 times [2019-10-02 04:27:30,833 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:27:30,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:27:30,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:27:30,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:27:30,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:27:30,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:27:31,229 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-02 04:27:31,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:27:31,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 04:27:31,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 04:27:31,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 04:27:31,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 04:27:31,233 INFO L87 Difference]: Start difference. First operand 2628 states and 3394 transitions. Second operand 3 states. [2019-10-02 04:27:31,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:27:31,599 INFO L93 Difference]: Finished difference Result 2654 states and 3426 transitions. [2019-10-02 04:27:31,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 04:27:31,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-10-02 04:27:31,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:27:31,617 INFO L225 Difference]: With dead ends: 2654 [2019-10-02 04:27:31,617 INFO L226 Difference]: Without dead ends: 2641 [2019-10-02 04:27:31,620 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 04:27:31,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2641 states. [2019-10-02 04:27:31,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2641 to 2628. [2019-10-02 04:27:31,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2628 states. [2019-10-02 04:27:31,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2628 states to 2628 states and 3393 transitions. [2019-10-02 04:27:31,732 INFO L78 Accepts]: Start accepts. Automaton has 2628 states and 3393 transitions. Word has length 84 [2019-10-02 04:27:31,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:27:31,733 INFO L475 AbstractCegarLoop]: Abstraction has 2628 states and 3393 transitions. [2019-10-02 04:27:31,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 04:27:31,733 INFO L276 IsEmpty]: Start isEmpty. Operand 2628 states and 3393 transitions. [2019-10-02 04:27:31,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-02 04:27:31,734 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:27:31,735 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:27:31,735 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:27:31,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:27:31,735 INFO L82 PathProgramCache]: Analyzing trace with hash 580386191, now seen corresponding path program 1 times [2019-10-02 04:27:31,736 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:27:31,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:27:31,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:27:31,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:27:31,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:27:31,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:27:32,243 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-02 04:27:32,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:27:32,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 04:27:32,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 04:27:32,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 04:27:32,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 04:27:32,244 INFO L87 Difference]: Start difference. First operand 2628 states and 3393 transitions. Second operand 3 states. [2019-10-02 04:27:32,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:27:32,584 INFO L93 Difference]: Finished difference Result 7823 states and 10430 transitions. [2019-10-02 04:27:32,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 04:27:32,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-10-02 04:27:32,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:27:32,624 INFO L225 Difference]: With dead ends: 7823 [2019-10-02 04:27:32,625 INFO L226 Difference]: Without dead ends: 5225 [2019-10-02 04:27:32,640 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 04:27:32,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5225 states. [2019-10-02 04:27:32,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5225 to 5215. [2019-10-02 04:27:32,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5215 states. [2019-10-02 04:27:32,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5215 states to 5215 states and 6896 transitions. [2019-10-02 04:27:32,900 INFO L78 Accepts]: Start accepts. Automaton has 5215 states and 6896 transitions. Word has length 84 [2019-10-02 04:27:32,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:27:32,901 INFO L475 AbstractCegarLoop]: Abstraction has 5215 states and 6896 transitions. [2019-10-02 04:27:32,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 04:27:32,901 INFO L276 IsEmpty]: Start isEmpty. Operand 5215 states and 6896 transitions. [2019-10-02 04:27:32,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-02 04:27:32,903 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:27:32,903 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:27:32,903 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:27:32,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:27:32,904 INFO L82 PathProgramCache]: Analyzing trace with hash 811444853, now seen corresponding path program 1 times [2019-10-02 04:27:32,904 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:27:32,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:27:32,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:27:32,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:27:32,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:27:33,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:27:33,206 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-02 04:27:33,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:27:33,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 04:27:33,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 04:27:33,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 04:27:33,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 04:27:33,208 INFO L87 Difference]: Start difference. First operand 5215 states and 6896 transitions. Second operand 4 states. [2019-10-02 04:27:33,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:27:33,478 INFO L93 Difference]: Finished difference Result 10418 states and 13780 transitions. [2019-10-02 04:27:33,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 04:27:33,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-10-02 04:27:33,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:27:33,524 INFO L225 Difference]: With dead ends: 10418 [2019-10-02 04:27:33,525 INFO L226 Difference]: Without dead ends: 5232 [2019-10-02 04:27:33,554 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 04:27:33,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5232 states. [2019-10-02 04:27:33,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5232 to 5220. [2019-10-02 04:27:33,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5220 states. [2019-10-02 04:27:33,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5220 states to 5220 states and 6902 transitions. [2019-10-02 04:27:33,854 INFO L78 Accepts]: Start accepts. Automaton has 5220 states and 6902 transitions. Word has length 85 [2019-10-02 04:27:33,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:27:33,855 INFO L475 AbstractCegarLoop]: Abstraction has 5220 states and 6902 transitions. [2019-10-02 04:27:33,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 04:27:33,855 INFO L276 IsEmpty]: Start isEmpty. Operand 5220 states and 6902 transitions. [2019-10-02 04:27:33,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-02 04:27:33,861 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:27:33,861 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:27:33,861 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:27:33,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:27:33,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1148744812, now seen corresponding path program 1 times [2019-10-02 04:27:33,862 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:27:33,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:27:33,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:27:33,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:27:33,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:27:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:27:34,301 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-02 04:27:34,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:27:34,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 04:27:34,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 04:27:34,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 04:27:34,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 04:27:34,303 INFO L87 Difference]: Start difference. First operand 5220 states and 6902 transitions. Second operand 3 states. [2019-10-02 04:27:34,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:27:34,557 INFO L93 Difference]: Finished difference Result 5222 states and 6903 transitions. [2019-10-02 04:27:34,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 04:27:34,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-10-02 04:27:34,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:27:34,596 INFO L225 Difference]: With dead ends: 5222 [2019-10-02 04:27:34,596 INFO L226 Difference]: Without dead ends: 5219 [2019-10-02 04:27:34,600 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 04:27:34,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5219 states. [2019-10-02 04:27:34,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5219 to 5219. [2019-10-02 04:27:34,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5219 states. [2019-10-02 04:27:34,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5219 states to 5219 states and 6900 transitions. [2019-10-02 04:27:34,915 INFO L78 Accepts]: Start accepts. Automaton has 5219 states and 6900 transitions. Word has length 86 [2019-10-02 04:27:34,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:27:34,916 INFO L475 AbstractCegarLoop]: Abstraction has 5219 states and 6900 transitions. [2019-10-02 04:27:34,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 04:27:34,916 INFO L276 IsEmpty]: Start isEmpty. Operand 5219 states and 6900 transitions. [2019-10-02 04:27:34,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-02 04:27:34,921 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:27:34,921 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:27:34,921 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:27:34,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:27:34,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1252003821, now seen corresponding path program 1 times [2019-10-02 04:27:34,922 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:27:34,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:27:34,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:27:34,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:27:34,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:27:35,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:27:35,221 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-02 04:27:35,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:27:35,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 04:27:35,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 04:27:35,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 04:27:35,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 04:27:35,223 INFO L87 Difference]: Start difference. First operand 5219 states and 6900 transitions. Second operand 3 states. [2019-10-02 04:27:35,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:27:35,402 INFO L93 Difference]: Finished difference Result 5221 states and 6901 transitions. [2019-10-02 04:27:35,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 04:27:35,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-10-02 04:27:35,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:27:35,451 INFO L225 Difference]: With dead ends: 5221 [2019-10-02 04:27:35,451 INFO L226 Difference]: Without dead ends: 5218 [2019-10-02 04:27:35,455 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 04:27:35,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5218 states. [2019-10-02 04:27:35,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5218 to 5218. [2019-10-02 04:27:35,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5218 states. [2019-10-02 04:27:35,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5218 states to 5218 states and 6898 transitions. [2019-10-02 04:27:35,762 INFO L78 Accepts]: Start accepts. Automaton has 5218 states and 6898 transitions. Word has length 87 [2019-10-02 04:27:35,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:27:35,764 INFO L475 AbstractCegarLoop]: Abstraction has 5218 states and 6898 transitions. [2019-10-02 04:27:35,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 04:27:35,764 INFO L276 IsEmpty]: Start isEmpty. Operand 5218 states and 6898 transitions. [2019-10-02 04:27:35,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-02 04:27:35,767 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:27:35,767 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:27:35,767 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:27:35,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:27:35,767 INFO L82 PathProgramCache]: Analyzing trace with hash -158060937, now seen corresponding path program 1 times [2019-10-02 04:27:35,768 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:27:35,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:27:35,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:27:35,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:27:35,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:27:35,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:27:36,161 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-02 04:27:36,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:27:36,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 04:27:36,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 04:27:36,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 04:27:36,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 04:27:36,164 INFO L87 Difference]: Start difference. First operand 5218 states and 6898 transitions. Second operand 3 states. [2019-10-02 04:27:36,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:27:36,328 INFO L93 Difference]: Finished difference Result 5220 states and 6899 transitions. [2019-10-02 04:27:36,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 04:27:36,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-10-02 04:27:36,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:27:36,360 INFO L225 Difference]: With dead ends: 5220 [2019-10-02 04:27:36,360 INFO L226 Difference]: Without dead ends: 5217 [2019-10-02 04:27:36,366 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 04:27:36,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5217 states. [2019-10-02 04:27:36,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5217 to 5217. [2019-10-02 04:27:36,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5217 states. [2019-10-02 04:27:36,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5217 states to 5217 states and 6896 transitions. [2019-10-02 04:27:36,636 INFO L78 Accepts]: Start accepts. Automaton has 5217 states and 6896 transitions. Word has length 88 [2019-10-02 04:27:36,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:27:36,637 INFO L475 AbstractCegarLoop]: Abstraction has 5217 states and 6896 transitions. [2019-10-02 04:27:36,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 04:27:36,637 INFO L276 IsEmpty]: Start isEmpty. Operand 5217 states and 6896 transitions. [2019-10-02 04:27:36,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-02 04:27:36,640 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:27:36,640 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:27:36,641 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:27:36,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:27:36,641 INFO L82 PathProgramCache]: Analyzing trace with hash -605565034, now seen corresponding path program 1 times [2019-10-02 04:27:36,641 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:27:36,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:27:36,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:27:36,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:27:36,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:27:36,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:27:36,926 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-02 04:27:36,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:27:36,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 04:27:36,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 04:27:36,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 04:27:36,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 04:27:36,929 INFO L87 Difference]: Start difference. First operand 5217 states and 6896 transitions. Second operand 3 states. [2019-10-02 04:27:37,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:27:37,116 INFO L93 Difference]: Finished difference Result 5219 states and 6897 transitions. [2019-10-02 04:27:37,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 04:27:37,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-10-02 04:27:37,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:27:37,162 INFO L225 Difference]: With dead ends: 5219 [2019-10-02 04:27:37,162 INFO L226 Difference]: Without dead ends: 5197 [2019-10-02 04:27:37,168 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 04:27:37,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5197 states. [2019-10-02 04:27:37,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5197 to 5197. [2019-10-02 04:27:37,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5197 states. [2019-10-02 04:27:37,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5197 states to 5197 states and 6873 transitions. [2019-10-02 04:27:37,423 INFO L78 Accepts]: Start accepts. Automaton has 5197 states and 6873 transitions. Word has length 89 [2019-10-02 04:27:37,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:27:37,424 INFO L475 AbstractCegarLoop]: Abstraction has 5197 states and 6873 transitions. [2019-10-02 04:27:37,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 04:27:37,424 INFO L276 IsEmpty]: Start isEmpty. Operand 5197 states and 6873 transitions. [2019-10-02 04:27:37,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-10-02 04:27:37,436 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:27:37,436 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 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] [2019-10-02 04:27:37,437 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:27:37,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:27:37,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1911133325, now seen corresponding path program 1 times [2019-10-02 04:27:37,437 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:27:37,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:27:37,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:27:37,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:27:37,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:27:37,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:27:37,871 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-10-02 04:27:37,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:27:37,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 04:27:37,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 04:27:37,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 04:27:37,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 04:27:37,873 INFO L87 Difference]: Start difference. First operand 5197 states and 6873 transitions. Second operand 3 states. [2019-10-02 04:27:38,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:27:38,537 INFO L93 Difference]: Finished difference Result 10796 states and 14278 transitions. [2019-10-02 04:27:38,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 04:27:38,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-10-02 04:27:38,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:27:38,574 INFO L225 Difference]: With dead ends: 10796 [2019-10-02 04:27:38,574 INFO L226 Difference]: Without dead ends: 5632 [2019-10-02 04:27:38,602 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 04:27:38,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5632 states. [2019-10-02 04:27:38,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5632 to 5599. [2019-10-02 04:27:38,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5599 states. [2019-10-02 04:27:38,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5599 states to 5599 states and 7403 transitions. [2019-10-02 04:27:38,890 INFO L78 Accepts]: Start accepts. Automaton has 5599 states and 7403 transitions. Word has length 216 [2019-10-02 04:27:38,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:27:38,890 INFO L475 AbstractCegarLoop]: Abstraction has 5599 states and 7403 transitions. [2019-10-02 04:27:38,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 04:27:38,891 INFO L276 IsEmpty]: Start isEmpty. Operand 5599 states and 7403 transitions. [2019-10-02 04:27:38,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-10-02 04:27:38,900 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:27:38,900 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 04:27:38,901 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:27:38,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:27:38,901 INFO L82 PathProgramCache]: Analyzing trace with hash -754541060, now seen corresponding path program 1 times [2019-10-02 04:27:38,901 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:27:38,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:27:38,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:27:38,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:27:38,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:27:39,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:27:39,378 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-10-02 04:27:39,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:27:39,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 04:27:39,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 04:27:39,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 04:27:39,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 04:27:39,380 INFO L87 Difference]: Start difference. First operand 5599 states and 7403 transitions. Second operand 4 states. [2019-10-02 04:27:44,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:27:44,648 INFO L93 Difference]: Finished difference Result 11123 states and 15119 transitions. [2019-10-02 04:27:44,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 04:27:44,648 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 235 [2019-10-02 04:27:44,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:27:44,677 INFO L225 Difference]: With dead ends: 11123 [2019-10-02 04:27:44,677 INFO L226 Difference]: Without dead ends: 5559 [2019-10-02 04:27:44,706 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 04:27:44,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5559 states. [2019-10-02 04:27:44,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5559 to 5559. [2019-10-02 04:27:44,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5559 states. [2019-10-02 04:27:44,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5559 states to 5559 states and 7167 transitions. [2019-10-02 04:27:44,979 INFO L78 Accepts]: Start accepts. Automaton has 5559 states and 7167 transitions. Word has length 235 [2019-10-02 04:27:44,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:27:44,980 INFO L475 AbstractCegarLoop]: Abstraction has 5559 states and 7167 transitions. [2019-10-02 04:27:44,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 04:27:44,980 INFO L276 IsEmpty]: Start isEmpty. Operand 5559 states and 7167 transitions. [2019-10-02 04:27:44,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-10-02 04:27:44,988 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:27:44,989 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 04:27:44,989 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:27:44,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:27:44,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1176584574, now seen corresponding path program 1 times [2019-10-02 04:27:44,990 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:27:44,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:27:45,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:27:45,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:27:45,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:27:45,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:27:45,384 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-10-02 04:27:45,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:27:45,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 04:27:45,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 04:27:45,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 04:27:45,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 04:27:45,386 INFO L87 Difference]: Start difference. First operand 5559 states and 7167 transitions. Second operand 4 states. [2019-10-02 04:27:49,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:27:49,662 INFO L93 Difference]: Finished difference Result 10639 states and 13983 transitions. [2019-10-02 04:27:49,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 04:27:49,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 235 [2019-10-02 04:27:49,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:27:49,684 INFO L225 Difference]: With dead ends: 10639 [2019-10-02 04:27:49,684 INFO L226 Difference]: Without dead ends: 5115 [2019-10-02 04:27:49,707 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 04:27:49,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5115 states. [2019-10-02 04:27:49,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5115 to 5115. [2019-10-02 04:27:49,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5115 states. [2019-10-02 04:27:49,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5115 states to 5115 states and 6613 transitions. [2019-10-02 04:27:49,961 INFO L78 Accepts]: Start accepts. Automaton has 5115 states and 6613 transitions. Word has length 235 [2019-10-02 04:27:49,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:27:49,964 INFO L475 AbstractCegarLoop]: Abstraction has 5115 states and 6613 transitions. [2019-10-02 04:27:49,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 04:27:49,964 INFO L276 IsEmpty]: Start isEmpty. Operand 5115 states and 6613 transitions. [2019-10-02 04:27:49,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-10-02 04:27:49,984 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:27:49,984 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 04:27:49,984 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:27:49,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:27:49,985 INFO L82 PathProgramCache]: Analyzing trace with hash 761045197, now seen corresponding path program 1 times [2019-10-02 04:27:49,985 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:27:49,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:27:49,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:27:50,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:27:50,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:27:50,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:27:50,452 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-02 04:27:50,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:27:50,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 04:27:50,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 04:27:50,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 04:27:50,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 04:27:50,461 INFO L87 Difference]: Start difference. First operand 5115 states and 6613 transitions. Second operand 3 states. [2019-10-02 04:27:51,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:27:51,047 INFO L93 Difference]: Finished difference Result 10211 states and 13453 transitions. [2019-10-02 04:27:51,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 04:27:51,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 290 [2019-10-02 04:27:51,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:27:51,079 INFO L225 Difference]: With dead ends: 10211 [2019-10-02 04:27:51,079 INFO L226 Difference]: Without dead ends: 5131 [2019-10-02 04:27:51,094 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 04:27:51,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5131 states. [2019-10-02 04:27:51,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5131 to 5119. [2019-10-02 04:27:51,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5119 states. [2019-10-02 04:27:51,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5119 states to 5119 states and 6617 transitions. [2019-10-02 04:27:51,310 INFO L78 Accepts]: Start accepts. Automaton has 5119 states and 6617 transitions. Word has length 290 [2019-10-02 04:27:51,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:27:51,311 INFO L475 AbstractCegarLoop]: Abstraction has 5119 states and 6617 transitions. [2019-10-02 04:27:51,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 04:27:51,311 INFO L276 IsEmpty]: Start isEmpty. Operand 5119 states and 6617 transitions. [2019-10-02 04:27:51,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-10-02 04:27:51,330 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:27:51,330 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 04:27:51,331 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:27:51,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:27:51,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1818968236, now seen corresponding path program 1 times [2019-10-02 04:27:51,331 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:27:51,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:27:51,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:27:51,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:27:51,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:27:51,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:27:52,005 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-02 04:27:52,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:27:52,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 04:27:52,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 04:27:52,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 04:27:52,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 04:27:52,010 INFO L87 Difference]: Start difference. First operand 5119 states and 6617 transitions. Second operand 3 states. [2019-10-02 04:27:52,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:27:52,211 INFO L93 Difference]: Finished difference Result 10211 states and 13449 transitions. [2019-10-02 04:27:52,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 04:27:52,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 293 [2019-10-02 04:27:52,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:27:52,244 INFO L225 Difference]: With dead ends: 10211 [2019-10-02 04:27:52,244 INFO L226 Difference]: Without dead ends: 5127 [2019-10-02 04:27:52,259 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 04:27:52,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5127 states. [2019-10-02 04:27:52,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5127 to 5123. [2019-10-02 04:27:52,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5123 states. [2019-10-02 04:27:52,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5123 states to 5123 states and 6621 transitions. [2019-10-02 04:27:52,528 INFO L78 Accepts]: Start accepts. Automaton has 5123 states and 6621 transitions. Word has length 293 [2019-10-02 04:27:52,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:27:52,529 INFO L475 AbstractCegarLoop]: Abstraction has 5123 states and 6621 transitions. [2019-10-02 04:27:52,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 04:27:52,530 INFO L276 IsEmpty]: Start isEmpty. Operand 5123 states and 6621 transitions. [2019-10-02 04:27:52,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-10-02 04:27:52,550 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:27:52,550 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 04:27:52,551 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:27:52,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:27:52,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1697143224, now seen corresponding path program 1 times [2019-10-02 04:27:52,552 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:27:52,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:27:52,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:27:52,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:27:52,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:27:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:27:52,994 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-10-02 04:27:52,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:27:52,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 04:27:52,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 04:27:52,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 04:27:52,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 04:27:52,996 INFO L87 Difference]: Start difference. First operand 5123 states and 6621 transitions. Second operand 7 states. [2019-10-02 04:27:53,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:27:53,236 INFO L93 Difference]: Finished difference Result 10247 states and 13481 transitions. [2019-10-02 04:27:53,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 04:27:53,236 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 295 [2019-10-02 04:27:53,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:27:53,262 INFO L225 Difference]: With dead ends: 10247 [2019-10-02 04:27:53,262 INFO L226 Difference]: Without dead ends: 5159 [2019-10-02 04:27:53,278 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 04:27:53,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5159 states. [2019-10-02 04:27:53,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5159 to 5151. [2019-10-02 04:27:53,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5151 states. [2019-10-02 04:27:53,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5151 states to 5151 states and 6653 transitions. [2019-10-02 04:27:53,489 INFO L78 Accepts]: Start accepts. Automaton has 5151 states and 6653 transitions. Word has length 295 [2019-10-02 04:27:53,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:27:53,491 INFO L475 AbstractCegarLoop]: Abstraction has 5151 states and 6653 transitions. [2019-10-02 04:27:53,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 04:27:53,491 INFO L276 IsEmpty]: Start isEmpty. Operand 5151 states and 6653 transitions. [2019-10-02 04:27:53,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2019-10-02 04:27:53,513 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:27:53,514 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 04:27:53,514 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:27:53,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:27:53,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1032772572, now seen corresponding path program 1 times [2019-10-02 04:27:53,515 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:27:53,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:27:53,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:27:53,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:27:53,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:27:53,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:27:54,024 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-10-02 04:27:54,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:27:54,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 04:27:54,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 04:27:54,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 04:27:54,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 04:27:54,026 INFO L87 Difference]: Start difference. First operand 5151 states and 6653 transitions. Second operand 3 states. [2019-10-02 04:27:54,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:27:54,218 INFO L93 Difference]: Finished difference Result 10283 states and 13543 transitions. [2019-10-02 04:27:54,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 04:27:54,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 345 [2019-10-02 04:27:54,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:27:54,242 INFO L225 Difference]: With dead ends: 10283 [2019-10-02 04:27:54,243 INFO L226 Difference]: Without dead ends: 5167 [2019-10-02 04:27:54,257 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 04:27:54,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5167 states. [2019-10-02 04:27:54,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5167 to 5155. [2019-10-02 04:27:54,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5155 states. [2019-10-02 04:27:54,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5155 states to 5155 states and 6657 transitions. [2019-10-02 04:27:54,490 INFO L78 Accepts]: Start accepts. Automaton has 5155 states and 6657 transitions. Word has length 345 [2019-10-02 04:27:54,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:27:54,490 INFO L475 AbstractCegarLoop]: Abstraction has 5155 states and 6657 transitions. [2019-10-02 04:27:54,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 04:27:54,491 INFO L276 IsEmpty]: Start isEmpty. Operand 5155 states and 6657 transitions. [2019-10-02 04:27:54,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-10-02 04:27:54,513 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:27:54,513 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 04:27:54,513 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:27:54,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:27:54,514 INFO L82 PathProgramCache]: Analyzing trace with hash 263974481, now seen corresponding path program 1 times [2019-10-02 04:27:54,514 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:27:54,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:27:54,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:27:54,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:27:54,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:27:54,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:27:55,197 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-10-02 04:27:55,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:27:55,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 04:27:55,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 04:27:55,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 04:27:55,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 04:27:55,199 INFO L87 Difference]: Start difference. First operand 5155 states and 6657 transitions. Second operand 11 states. [2019-10-02 04:27:55,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:27:55,595 INFO L93 Difference]: Finished difference Result 10367 states and 13613 transitions. [2019-10-02 04:27:55,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 04:27:55,595 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 357 [2019-10-02 04:27:55,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:27:55,621 INFO L225 Difference]: With dead ends: 10367 [2019-10-02 04:27:55,621 INFO L226 Difference]: Without dead ends: 5247 [2019-10-02 04:27:55,634 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 04:27:55,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5247 states. [2019-10-02 04:27:55,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5247 to 5215. [2019-10-02 04:27:55,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5215 states. [2019-10-02 04:27:55,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5215 states to 5215 states and 6737 transitions. [2019-10-02 04:27:55,943 INFO L78 Accepts]: Start accepts. Automaton has 5215 states and 6737 transitions. Word has length 357 [2019-10-02 04:27:55,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:27:55,944 INFO L475 AbstractCegarLoop]: Abstraction has 5215 states and 6737 transitions. [2019-10-02 04:27:55,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 04:27:55,944 INFO L276 IsEmpty]: Start isEmpty. Operand 5215 states and 6737 transitions. [2019-10-02 04:27:55,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-10-02 04:27:55,965 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:27:55,966 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 04:27:55,967 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:27:55,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:27:55,967 INFO L82 PathProgramCache]: Analyzing trace with hash -572820462, now seen corresponding path program 1 times [2019-10-02 04:27:55,967 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:27:55,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:27:55,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:27:55,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:27:55,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:27:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:27:56,525 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-10-02 04:27:56,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:27:56,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 04:27:56,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 04:27:56,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 04:27:56,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 04:27:56,527 INFO L87 Difference]: Start difference. First operand 5215 states and 6737 transitions. Second operand 4 states. [2019-10-02 04:27:56,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:27:56,761 INFO L93 Difference]: Finished difference Result 10411 states and 13705 transitions. [2019-10-02 04:27:56,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 04:27:56,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 357 [2019-10-02 04:27:56,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:27:56,782 INFO L225 Difference]: With dead ends: 10411 [2019-10-02 04:27:56,782 INFO L226 Difference]: Without dead ends: 5215 [2019-10-02 04:27:56,796 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 04:27:56,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5215 states. [2019-10-02 04:27:57,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5215 to 5215. [2019-10-02 04:27:57,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5215 states. [2019-10-02 04:27:57,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5215 states to 5215 states and 6733 transitions. [2019-10-02 04:27:57,056 INFO L78 Accepts]: Start accepts. Automaton has 5215 states and 6733 transitions. Word has length 357 [2019-10-02 04:27:57,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:27:57,057 INFO L475 AbstractCegarLoop]: Abstraction has 5215 states and 6733 transitions. [2019-10-02 04:27:57,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 04:27:57,057 INFO L276 IsEmpty]: Start isEmpty. Operand 5215 states and 6733 transitions. [2019-10-02 04:27:57,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-10-02 04:27:57,075 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:27:57,076 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 04:27:57,076 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:27:57,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:27:57,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1941281072, now seen corresponding path program 1 times [2019-10-02 04:27:57,076 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:27:57,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:27:57,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:27:57,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:27:57,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:27:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:27:57,701 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-10-02 04:27:57,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:27:57,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 04:27:57,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 04:27:57,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 04:27:57,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 04:27:57,702 INFO L87 Difference]: Start difference. First operand 5215 states and 6733 transitions. Second operand 4 states. [2019-10-02 04:27:57,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:27:57,983 INFO L93 Difference]: Finished difference Result 10411 states and 13709 transitions. [2019-10-02 04:27:57,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 04:27:57,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 357 [2019-10-02 04:27:57,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:27:58,007 INFO L225 Difference]: With dead ends: 10411 [2019-10-02 04:27:58,007 INFO L226 Difference]: Without dead ends: 5215 [2019-10-02 04:27:58,023 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 04:27:58,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5215 states. [2019-10-02 04:27:58,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5215 to 5215. [2019-10-02 04:27:58,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5215 states. [2019-10-02 04:27:58,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5215 states to 5215 states and 6729 transitions. [2019-10-02 04:27:58,353 INFO L78 Accepts]: Start accepts. Automaton has 5215 states and 6729 transitions. Word has length 357 [2019-10-02 04:27:58,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:27:58,353 INFO L475 AbstractCegarLoop]: Abstraction has 5215 states and 6729 transitions. [2019-10-02 04:27:58,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 04:27:58,354 INFO L276 IsEmpty]: Start isEmpty. Operand 5215 states and 6729 transitions. [2019-10-02 04:27:58,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-10-02 04:27:58,377 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:27:58,378 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 04:27:58,378 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:27:58,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:27:58,378 INFO L82 PathProgramCache]: Analyzing trace with hash 413104210, now seen corresponding path program 1 times [2019-10-02 04:27:58,378 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:27:58,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:27:58,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:27:58,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:27:58,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:27:58,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:27:58,826 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2019-10-02 04:27:58,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:27:58,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 04:27:58,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 04:27:58,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 04:27:58,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 04:27:58,829 INFO L87 Difference]: Start difference. First operand 5215 states and 6729 transitions. Second operand 4 states. [2019-10-02 04:27:59,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:27:59,034 INFO L93 Difference]: Finished difference Result 10407 states and 13685 transitions. [2019-10-02 04:27:59,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 04:27:59,035 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 357 [2019-10-02 04:27:59,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:27:59,056 INFO L225 Difference]: With dead ends: 10407 [2019-10-02 04:27:59,056 INFO L226 Difference]: Without dead ends: 5219 [2019-10-02 04:27:59,069 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 04:27:59,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5219 states. [2019-10-02 04:27:59,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5219 to 5219. [2019-10-02 04:27:59,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5219 states. [2019-10-02 04:27:59,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5219 states to 5219 states and 6733 transitions. [2019-10-02 04:27:59,292 INFO L78 Accepts]: Start accepts. Automaton has 5219 states and 6733 transitions. Word has length 357 [2019-10-02 04:27:59,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:27:59,292 INFO L475 AbstractCegarLoop]: Abstraction has 5219 states and 6733 transitions. [2019-10-02 04:27:59,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 04:27:59,293 INFO L276 IsEmpty]: Start isEmpty. Operand 5219 states and 6733 transitions. [2019-10-02 04:27:59,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2019-10-02 04:27:59,312 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:27:59,312 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 04:27:59,313 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:27:59,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:27:59,313 INFO L82 PathProgramCache]: Analyzing trace with hash 551169903, now seen corresponding path program 2 times [2019-10-02 04:27:59,313 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:27:59,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:27:59,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:27:59,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:27:59,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:27:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:27:59,844 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-10-02 04:27:59,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 04:27:59,844 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 04:28:00,318 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 04:28:10,479 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 04:28:10,479 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 04:28:10,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 4700 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 04:28:10,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 04:28:10,775 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 35 proven. 1 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-10-02 04:28:10,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 04:28:10,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2019-10-02 04:28:10,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 04:28:10,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 04:28:10,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-02 04:28:10,819 INFO L87 Difference]: Start difference. First operand 5219 states and 6733 transitions. Second operand 7 states. [2019-10-02 04:28:16,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:28:16,930 INFO L93 Difference]: Finished difference Result 20781 states and 27587 transitions. [2019-10-02 04:28:16,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 04:28:16,932 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 358 [2019-10-02 04:28:16,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:28:17,040 INFO L225 Difference]: With dead ends: 20781 [2019-10-02 04:28:17,040 INFO L226 Difference]: Without dead ends: 15573 [2019-10-02 04:28:17,083 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-10-02 04:28:17,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15573 states. [2019-10-02 04:28:18,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15573 to 15555. [2019-10-02 04:28:18,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15555 states. [2019-10-02 04:28:18,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15555 states to 15555 states and 20085 transitions. [2019-10-02 04:28:18,313 INFO L78 Accepts]: Start accepts. Automaton has 15555 states and 20085 transitions. Word has length 358 [2019-10-02 04:28:18,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:28:18,314 INFO L475 AbstractCegarLoop]: Abstraction has 15555 states and 20085 transitions. [2019-10-02 04:28:18,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 04:28:18,315 INFO L276 IsEmpty]: Start isEmpty. Operand 15555 states and 20085 transitions. [2019-10-02 04:28:18,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2019-10-02 04:28:18,357 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:28:18,357 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 04:28:18,358 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:28:18,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:28:18,359 INFO L82 PathProgramCache]: Analyzing trace with hash 402225584, now seen corresponding path program 1 times [2019-10-02 04:28:18,359 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:28:18,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:28:18,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:28:18,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 04:28:18,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:28:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:28:18,981 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-10-02 04:28:18,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:28:18,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 04:28:18,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 04:28:18,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 04:28:18,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 04:28:18,984 INFO L87 Difference]: Start difference. First operand 15555 states and 20085 transitions. Second operand 5 states. [2019-10-02 04:28:20,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:28:20,660 INFO L93 Difference]: Finished difference Result 46075 states and 59473 transitions. [2019-10-02 04:28:20,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 04:28:20,661 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 359 [2019-10-02 04:28:20,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:28:20,867 INFO L225 Difference]: With dead ends: 46075 [2019-10-02 04:28:20,867 INFO L226 Difference]: Without dead ends: 30555 [2019-10-02 04:28:20,954 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 04:28:20,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30555 states. [2019-10-02 04:28:23,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30555 to 15274. [2019-10-02 04:28:23,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15274 states. [2019-10-02 04:28:23,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15274 states to 15274 states and 19703 transitions. [2019-10-02 04:28:23,185 INFO L78 Accepts]: Start accepts. Automaton has 15274 states and 19703 transitions. Word has length 359 [2019-10-02 04:28:23,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:28:23,186 INFO L475 AbstractCegarLoop]: Abstraction has 15274 states and 19703 transitions. [2019-10-02 04:28:23,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 04:28:23,186 INFO L276 IsEmpty]: Start isEmpty. Operand 15274 states and 19703 transitions. [2019-10-02 04:28:23,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-10-02 04:28:23,220 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:28:23,221 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:28:23,221 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:28:23,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:28:23,222 INFO L82 PathProgramCache]: Analyzing trace with hash 507712737, now seen corresponding path program 1 times [2019-10-02 04:28:23,222 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:28:23,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:28:23,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:28:23,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:28:23,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:28:23,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:28:23,602 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-10-02 04:28:23,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:28:23,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 04:28:23,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 04:28:23,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 04:28:23,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 04:28:23,604 INFO L87 Difference]: Start difference. First operand 15274 states and 19703 transitions. Second operand 3 states. [2019-10-02 04:28:26,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:28:26,478 INFO L93 Difference]: Finished difference Result 30513 states and 39365 transitions. [2019-10-02 04:28:26,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 04:28:26,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 375 [2019-10-02 04:28:26,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:28:26,554 INFO L225 Difference]: With dead ends: 30513 [2019-10-02 04:28:26,554 INFO L226 Difference]: Without dead ends: 14890 [2019-10-02 04:28:26,591 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 04:28:26,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14890 states. [2019-10-02 04:28:27,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14890 to 14890. [2019-10-02 04:28:27,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14890 states. [2019-10-02 04:28:27,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14890 states to 14890 states and 19191 transitions. [2019-10-02 04:28:27,469 INFO L78 Accepts]: Start accepts. Automaton has 14890 states and 19191 transitions. Word has length 375 [2019-10-02 04:28:27,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:28:27,470 INFO L475 AbstractCegarLoop]: Abstraction has 14890 states and 19191 transitions. [2019-10-02 04:28:27,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 04:28:27,471 INFO L276 IsEmpty]: Start isEmpty. Operand 14890 states and 19191 transitions. [2019-10-02 04:28:27,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-10-02 04:28:27,508 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:28:27,509 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:28:27,509 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:28:27,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:28:27,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1681181025, now seen corresponding path program 1 times [2019-10-02 04:28:27,510 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:28:27,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:28:27,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:28:27,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:28:27,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:28:27,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:28:28,135 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-10-02 04:28:28,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:28:28,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 04:28:28,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 04:28:28,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 04:28:28,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 04:28:28,137 INFO L87 Difference]: Start difference. First operand 14890 states and 19191 transitions. Second operand 3 states. [2019-10-02 04:28:30,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:28:30,780 INFO L93 Difference]: Finished difference Result 22182 states and 28599 transitions. [2019-10-02 04:28:30,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 04:28:30,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 375 [2019-10-02 04:28:30,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:28:30,803 INFO L225 Difference]: With dead ends: 22182 [2019-10-02 04:28:30,803 INFO L226 Difference]: Without dead ends: 7326 [2019-10-02 04:28:30,830 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 04:28:30,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7326 states. [2019-10-02 04:28:31,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7326 to 7326. [2019-10-02 04:28:31,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7326 states. [2019-10-02 04:28:31,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7326 states to 7326 states and 9447 transitions. [2019-10-02 04:28:31,161 INFO L78 Accepts]: Start accepts. Automaton has 7326 states and 9447 transitions. Word has length 375 [2019-10-02 04:28:31,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:28:31,161 INFO L475 AbstractCegarLoop]: Abstraction has 7326 states and 9447 transitions. [2019-10-02 04:28:31,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 04:28:31,162 INFO L276 IsEmpty]: Start isEmpty. Operand 7326 states and 9447 transitions. [2019-10-02 04:28:31,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2019-10-02 04:28:31,178 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:28:31,179 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 04:28:31,179 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:28:31,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:28:31,180 INFO L82 PathProgramCache]: Analyzing trace with hash -475248035, now seen corresponding path program 1 times [2019-10-02 04:28:31,180 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:28:31,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:28:31,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:28:31,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:28:31,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:28:31,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:28:31,621 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2019-10-02 04:28:31,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:28:31,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 04:28:31,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 04:28:31,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 04:28:31,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 04:28:31,623 INFO L87 Difference]: Start difference. First operand 7326 states and 9447 transitions. Second operand 3 states. [2019-10-02 04:28:34,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:28:34,437 INFO L93 Difference]: Finished difference Result 19195 states and 24768 transitions. [2019-10-02 04:28:34,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 04:28:34,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 537 [2019-10-02 04:28:34,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:28:34,469 INFO L225 Difference]: With dead ends: 19195 [2019-10-02 04:28:34,469 INFO L226 Difference]: Without dead ends: 12033 [2019-10-02 04:28:34,484 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 04:28:34,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12033 states. [2019-10-02 04:28:35,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12033 to 12025. [2019-10-02 04:28:35,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12025 states. [2019-10-02 04:28:35,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12025 states to 12025 states and 15497 transitions. [2019-10-02 04:28:35,231 INFO L78 Accepts]: Start accepts. Automaton has 12025 states and 15497 transitions. Word has length 537 [2019-10-02 04:28:35,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:28:35,232 INFO L475 AbstractCegarLoop]: Abstraction has 12025 states and 15497 transitions. [2019-10-02 04:28:35,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 04:28:35,232 INFO L276 IsEmpty]: Start isEmpty. Operand 12025 states and 15497 transitions. [2019-10-02 04:28:35,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2019-10-02 04:28:35,252 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:28:35,252 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 04:28:35,252 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:28:35,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:28:35,253 INFO L82 PathProgramCache]: Analyzing trace with hash 758123694, now seen corresponding path program 1 times [2019-10-02 04:28:35,253 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:28:35,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:28:35,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:28:35,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:28:35,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:28:35,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:28:35,859 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2019-10-02 04:28:35,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:28:35,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 04:28:35,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 04:28:35,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 04:28:35,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 04:28:35,862 INFO L87 Difference]: Start difference. First operand 12025 states and 15497 transitions. Second operand 7 states. [2019-10-02 04:28:36,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:28:36,269 INFO L93 Difference]: Finished difference Result 23921 states and 31435 transitions. [2019-10-02 04:28:36,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 04:28:36,269 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 395 [2019-10-02 04:28:36,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:28:36,307 INFO L225 Difference]: With dead ends: 23921 [2019-10-02 04:28:36,307 INFO L226 Difference]: Without dead ends: 12095 [2019-10-02 04:28:36,329 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 04:28:36,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12095 states. [2019-10-02 04:28:36,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12095 to 12095. [2019-10-02 04:28:36,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12095 states. [2019-10-02 04:28:36,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12095 states to 12095 states and 15567 transitions. [2019-10-02 04:28:36,727 INFO L78 Accepts]: Start accepts. Automaton has 12095 states and 15567 transitions. Word has length 395 [2019-10-02 04:28:36,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:28:36,727 INFO L475 AbstractCegarLoop]: Abstraction has 12095 states and 15567 transitions. [2019-10-02 04:28:36,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 04:28:36,728 INFO L276 IsEmpty]: Start isEmpty. Operand 12095 states and 15567 transitions. [2019-10-02 04:28:36,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-10-02 04:28:36,746 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:28:36,747 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 04:28:36,747 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:28:36,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:28:36,748 INFO L82 PathProgramCache]: Analyzing trace with hash -675538071, now seen corresponding path program 1 times [2019-10-02 04:28:36,748 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:28:36,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:28:36,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:28:36,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:28:36,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:28:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:28:37,246 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-10-02 04:28:37,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 04:28:37,247 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 04:28:37,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:28:39,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:28:39,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 5025 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 04:28:39,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 04:28:39,334 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-02 04:28:39,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 04:28:39,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-10-02 04:28:39,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 04:28:39,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 04:28:39,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 04:28:39,361 INFO L87 Difference]: Start difference. First operand 12095 states and 15567 transitions. Second operand 7 states. [2019-10-02 04:28:39,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:28:39,792 INFO L93 Difference]: Finished difference Result 24024 states and 31539 transitions. [2019-10-02 04:28:39,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 04:28:39,793 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 421 [2019-10-02 04:28:39,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:28:39,831 INFO L225 Difference]: With dead ends: 24024 [2019-10-02 04:28:39,831 INFO L226 Difference]: Without dead ends: 12108 [2019-10-02 04:28:39,853 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-10-02 04:28:39,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12108 states. [2019-10-02 04:28:40,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12108 to 12105. [2019-10-02 04:28:40,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12105 states. [2019-10-02 04:28:40,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12105 states to 12105 states and 15577 transitions. [2019-10-02 04:28:40,229 INFO L78 Accepts]: Start accepts. Automaton has 12105 states and 15577 transitions. Word has length 421 [2019-10-02 04:28:40,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:28:40,229 INFO L475 AbstractCegarLoop]: Abstraction has 12105 states and 15577 transitions. [2019-10-02 04:28:40,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 04:28:40,230 INFO L276 IsEmpty]: Start isEmpty. Operand 12105 states and 15577 transitions. [2019-10-02 04:28:40,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2019-10-02 04:28:40,242 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:28:40,243 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:28:40,243 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:28:40,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:28:40,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1455115952, now seen corresponding path program 2 times [2019-10-02 04:28:40,243 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:28:40,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:28:40,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:28:40,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:28:40,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:28:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:28:40,705 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-10-02 04:28:40,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 04:28:40,705 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 04:28:42,130 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 04:28:52,545 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 04:28:52,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 04:28:52,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 5031 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 04:28:52,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 04:28:52,792 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 52 proven. 6 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-02 04:28:52,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 04:28:52,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 9 [2019-10-02 04:28:52,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 04:28:52,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 04:28:52,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 04:28:52,825 INFO L87 Difference]: Start difference. First operand 12105 states and 15577 transitions. Second operand 9 states. [2019-10-02 04:28:53,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:28:53,283 INFO L93 Difference]: Finished difference Result 24117 states and 31733 transitions. [2019-10-02 04:28:53,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 04:28:53,283 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 422 [2019-10-02 04:28:53,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:28:53,325 INFO L225 Difference]: With dead ends: 24117 [2019-10-02 04:28:53,325 INFO L226 Difference]: Without dead ends: 12191 [2019-10-02 04:28:53,348 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-10-02 04:28:53,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12191 states. [2019-10-02 04:28:53,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12191 to 12155. [2019-10-02 04:28:53,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12155 states. [2019-10-02 04:28:53,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12155 states to 12155 states and 15642 transitions. [2019-10-02 04:28:53,733 INFO L78 Accepts]: Start accepts. Automaton has 12155 states and 15642 transitions. Word has length 422 [2019-10-02 04:28:53,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:28:53,733 INFO L475 AbstractCegarLoop]: Abstraction has 12155 states and 15642 transitions. [2019-10-02 04:28:53,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 04:28:53,734 INFO L276 IsEmpty]: Start isEmpty. Operand 12155 states and 15642 transitions. [2019-10-02 04:28:53,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2019-10-02 04:28:53,747 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:28:53,748 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 04:28:53,748 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:28:53,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:28:53,749 INFO L82 PathProgramCache]: Analyzing trace with hash -734123222, now seen corresponding path program 1 times [2019-10-02 04:28:53,749 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:28:53,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:28:53,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:28:53,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 04:28:53,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:28:53,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:28:54,212 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-10-02 04:28:54,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:28:54,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 04:28:54,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 04:28:54,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 04:28:54,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 04:28:54,214 INFO L87 Difference]: Start difference. First operand 12155 states and 15642 transitions. Second operand 3 states. [2019-10-02 04:28:54,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:28:54,647 INFO L93 Difference]: Finished difference Result 24151 states and 31665 transitions. [2019-10-02 04:28:54,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 04:28:54,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 494 [2019-10-02 04:28:54,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:28:54,688 INFO L225 Difference]: With dead ends: 24151 [2019-10-02 04:28:54,688 INFO L226 Difference]: Without dead ends: 12195 [2019-10-02 04:28:54,715 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 04:28:54,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12195 states. [2019-10-02 04:28:55,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12195 to 12165. [2019-10-02 04:28:55,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12165 states. [2019-10-02 04:28:55,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12165 states to 12165 states and 15652 transitions. [2019-10-02 04:28:55,312 INFO L78 Accepts]: Start accepts. Automaton has 12165 states and 15652 transitions. Word has length 494 [2019-10-02 04:28:55,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:28:55,313 INFO L475 AbstractCegarLoop]: Abstraction has 12165 states and 15652 transitions. [2019-10-02 04:28:55,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 04:28:55,313 INFO L276 IsEmpty]: Start isEmpty. Operand 12165 states and 15652 transitions. [2019-10-02 04:28:55,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2019-10-02 04:28:55,326 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:28:55,326 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 04:28:55,327 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:28:55,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:28:55,327 INFO L82 PathProgramCache]: Analyzing trace with hash 36231542, now seen corresponding path program 3 times [2019-10-02 04:28:55,327 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:28:55,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:28:55,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:28:55,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:28:55,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:28:55,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:28:55,898 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-10-02 04:28:55,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 04:28:55,898 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 04:28:56,552 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 04:29:25,881 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-02 04:29:25,881 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 04:29:26,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 3877 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-02 04:29:26,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 04:29:26,419 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-10-02 04:29:26,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 04:29:26,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2019-10-02 04:29:26,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 04:29:26,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 04:29:26,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-10-02 04:29:26,468 INFO L87 Difference]: Start difference. First operand 12165 states and 15652 transitions. Second operand 11 states. [2019-10-02 04:29:29,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:29:29,749 INFO L93 Difference]: Finished difference Result 24261 states and 31860 transitions. [2019-10-02 04:29:29,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 04:29:29,750 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 435 [2019-10-02 04:29:29,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:29:29,791 INFO L225 Difference]: With dead ends: 24261 [2019-10-02 04:29:29,791 INFO L226 Difference]: Without dead ends: 12295 [2019-10-02 04:29:29,813 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 431 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2019-10-02 04:29:29,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12295 states. [2019-10-02 04:29:30,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12295 to 12220. [2019-10-02 04:29:30,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12220 states. [2019-10-02 04:29:30,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12220 states to 12220 states and 15697 transitions. [2019-10-02 04:29:30,183 INFO L78 Accepts]: Start accepts. Automaton has 12220 states and 15697 transitions. Word has length 435 [2019-10-02 04:29:30,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:29:30,184 INFO L475 AbstractCegarLoop]: Abstraction has 12220 states and 15697 transitions. [2019-10-02 04:29:30,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 04:29:30,184 INFO L276 IsEmpty]: Start isEmpty. Operand 12220 states and 15697 transitions. [2019-10-02 04:29:30,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2019-10-02 04:29:30,384 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:29:30,384 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 04:29:30,384 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:29:30,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:29:30,385 INFO L82 PathProgramCache]: Analyzing trace with hash -456537259, now seen corresponding path program 1 times [2019-10-02 04:29:30,385 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:29:30,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:29:30,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:29:30,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 04:29:30,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:29:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:29:30,925 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2019-10-02 04:29:30,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:29:30,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 04:29:30,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 04:29:30,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 04:29:30,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 04:29:30,927 INFO L87 Difference]: Start difference. First operand 12220 states and 15697 transitions. Second operand 3 states. [2019-10-02 04:29:31,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:29:31,399 INFO L93 Difference]: Finished difference Result 24451 states and 32045 transitions. [2019-10-02 04:29:31,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 04:29:31,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 475 [2019-10-02 04:29:31,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:29:31,451 INFO L225 Difference]: With dead ends: 24451 [2019-10-02 04:29:31,451 INFO L226 Difference]: Without dead ends: 12430 [2019-10-02 04:29:31,480 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 04:29:31,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12430 states. [2019-10-02 04:29:31,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12430 to 12240. [2019-10-02 04:29:31,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12240 states. [2019-10-02 04:29:31,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12240 states to 12240 states and 15717 transitions. [2019-10-02 04:29:31,859 INFO L78 Accepts]: Start accepts. Automaton has 12240 states and 15717 transitions. Word has length 475 [2019-10-02 04:29:31,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:29:31,859 INFO L475 AbstractCegarLoop]: Abstraction has 12240 states and 15717 transitions. [2019-10-02 04:29:31,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 04:29:31,860 INFO L276 IsEmpty]: Start isEmpty. Operand 12240 states and 15717 transitions. [2019-10-02 04:29:31,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2019-10-02 04:29:31,875 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:29:31,875 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 04:29:31,875 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:29:31,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:29:31,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1163133865, now seen corresponding path program 1 times [2019-10-02 04:29:31,876 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:29:31,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:29:31,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:29:31,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:29:31,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:29:32,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:29:32,576 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2019-10-02 04:29:32,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:29:32,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 04:29:32,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 04:29:32,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 04:29:32,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 04:29:32,578 INFO L87 Difference]: Start difference. First operand 12240 states and 15717 transitions. Second operand 11 states. [2019-10-02 04:29:33,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:29:33,136 INFO L93 Difference]: Finished difference Result 24445 states and 32063 transitions. [2019-10-02 04:29:33,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 04:29:33,136 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 475 [2019-10-02 04:29:33,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:29:33,171 INFO L225 Difference]: With dead ends: 24445 [2019-10-02 04:29:33,171 INFO L226 Difference]: Without dead ends: 12404 [2019-10-02 04:29:33,193 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-02 04:29:33,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12404 states. [2019-10-02 04:29:33,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12404 to 12360. [2019-10-02 04:29:33,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12360 states. [2019-10-02 04:29:33,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12360 states to 12360 states and 15926 transitions. [2019-10-02 04:29:33,630 INFO L78 Accepts]: Start accepts. Automaton has 12360 states and 15926 transitions. Word has length 475 [2019-10-02 04:29:33,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:29:33,631 INFO L475 AbstractCegarLoop]: Abstraction has 12360 states and 15926 transitions. [2019-10-02 04:29:33,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 04:29:33,631 INFO L276 IsEmpty]: Start isEmpty. Operand 12360 states and 15926 transitions. [2019-10-02 04:29:33,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2019-10-02 04:29:33,650 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:29:33,651 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 04:29:33,651 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:29:33,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:29:33,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1458336155, now seen corresponding path program 1 times [2019-10-02 04:29:33,652 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:29:33,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:29:33,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:29:33,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:29:33,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:29:34,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:29:34,510 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-10-02 04:29:34,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:29:34,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 04:29:34,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 04:29:34,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 04:29:34,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 04:29:34,512 INFO L87 Difference]: Start difference. First operand 12360 states and 15926 transitions. Second operand 9 states. [2019-10-02 04:29:34,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:29:34,922 INFO L93 Difference]: Finished difference Result 24749 states and 32726 transitions. [2019-10-02 04:29:34,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 04:29:34,923 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 486 [2019-10-02 04:29:34,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:29:34,967 INFO L225 Difference]: With dead ends: 24749 [2019-10-02 04:29:34,968 INFO L226 Difference]: Without dead ends: 12424 [2019-10-02 04:29:34,993 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 04:29:35,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12424 states. [2019-10-02 04:29:35,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12424 to 12400. [2019-10-02 04:29:35,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12400 states. [2019-10-02 04:29:35,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12400 states to 12400 states and 15966 transitions. [2019-10-02 04:29:35,378 INFO L78 Accepts]: Start accepts. Automaton has 12400 states and 15966 transitions. Word has length 486 [2019-10-02 04:29:35,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:29:35,379 INFO L475 AbstractCegarLoop]: Abstraction has 12400 states and 15966 transitions. [2019-10-02 04:29:35,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 04:29:35,379 INFO L276 IsEmpty]: Start isEmpty. Operand 12400 states and 15966 transitions. [2019-10-02 04:29:35,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2019-10-02 04:29:35,395 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:29:35,395 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 04:29:35,395 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:29:35,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:29:35,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1194639130, now seen corresponding path program 1 times [2019-10-02 04:29:35,396 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:29:35,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:29:35,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:29:35,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:29:35,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:29:35,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:29:35,989 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-10-02 04:29:35,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 04:29:35,990 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 04:29:36,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:29:37,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:29:37,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 5551 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 04:29:37,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 04:29:38,207 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 49 proven. 10 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-10-02 04:29:38,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 04:29:38,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8] total 10 [2019-10-02 04:29:38,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 04:29:38,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 04:29:38,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-10-02 04:29:38,228 INFO L87 Difference]: Start difference. First operand 12400 states and 15966 transitions. Second operand 10 states. [2019-10-02 04:29:38,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:29:38,736 INFO L93 Difference]: Finished difference Result 24725 states and 32464 transitions. [2019-10-02 04:29:38,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 04:29:38,737 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 486 [2019-10-02 04:29:38,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:29:38,787 INFO L225 Difference]: With dead ends: 24725 [2019-10-02 04:29:38,787 INFO L226 Difference]: Without dead ends: 12514 [2019-10-02 04:29:38,816 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 481 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-10-02 04:29:38,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12514 states. [2019-10-02 04:29:39,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12514 to 12435. [2019-10-02 04:29:39,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12435 states. [2019-10-02 04:29:39,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12435 states to 12435 states and 16011 transitions. [2019-10-02 04:29:39,193 INFO L78 Accepts]: Start accepts. Automaton has 12435 states and 16011 transitions. Word has length 486 [2019-10-02 04:29:39,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:29:39,194 INFO L475 AbstractCegarLoop]: Abstraction has 12435 states and 16011 transitions. [2019-10-02 04:29:39,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 04:29:39,194 INFO L276 IsEmpty]: Start isEmpty. Operand 12435 states and 16011 transitions. [2019-10-02 04:29:39,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2019-10-02 04:29:39,210 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:29:39,211 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:29:39,211 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:29:39,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:29:39,211 INFO L82 PathProgramCache]: Analyzing trace with hash 490787947, now seen corresponding path program 1 times [2019-10-02 04:29:39,211 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:29:39,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:29:39,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:29:39,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:29:39,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:29:39,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:29:40,089 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 13 proven. 19 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-10-02 04:29:40,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 04:29:40,089 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 04:29:40,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:29:41,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:29:42,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 5658 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 04:29:42,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 04:29:42,293 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 54 proven. 15 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-10-02 04:29:42,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 04:29:42,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2019-10-02 04:29:42,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 04:29:42,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 04:29:42,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-10-02 04:29:42,314 INFO L87 Difference]: Start difference. First operand 12435 states and 16011 transitions. Second operand 17 states. [2019-10-02 04:30:47,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:30:47,624 INFO L93 Difference]: Finished difference Result 33594 states and 45448 transitions. [2019-10-02 04:30:47,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-10-02 04:30:47,625 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 511 [2019-10-02 04:30:47,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:30:47,686 INFO L225 Difference]: With dead ends: 33594 [2019-10-02 04:30:47,687 INFO L226 Difference]: Without dead ends: 21338 [2019-10-02 04:30:47,712 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 515 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1032 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=541, Invalid=3491, Unknown=0, NotChecked=0, Total=4032 [2019-10-02 04:30:47,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21338 states. [2019-10-02 04:30:48,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21338 to 21170. [2019-10-02 04:30:48,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21170 states. [2019-10-02 04:30:48,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21170 states to 21170 states and 28245 transitions. [2019-10-02 04:30:48,454 INFO L78 Accepts]: Start accepts. Automaton has 21170 states and 28245 transitions. Word has length 511 [2019-10-02 04:30:48,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:30:48,454 INFO L475 AbstractCegarLoop]: Abstraction has 21170 states and 28245 transitions. [2019-10-02 04:30:48,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 04:30:48,455 INFO L276 IsEmpty]: Start isEmpty. Operand 21170 states and 28245 transitions. [2019-10-02 04:30:48,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2019-10-02 04:30:48,481 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:30:48,482 INFO L411 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:30:48,482 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:30:48,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:30:48,483 INFO L82 PathProgramCache]: Analyzing trace with hash -2043779430, now seen corresponding path program 2 times [2019-10-02 04:30:48,483 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:30:48,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:30:48,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:30:48,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:30:48,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:30:48,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:30:49,438 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-10-02 04:30:49,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 04:30:49,438 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 04:30:49,923 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 04:31:00,415 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 04:31:00,415 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 04:31:00,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 5664 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 04:31:00,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 04:31:00,732 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 56 proven. 21 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-10-02 04:31:00,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 04:31:00,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10] total 13 [2019-10-02 04:31:00,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 04:31:00,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 04:31:00,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-10-02 04:31:00,773 INFO L87 Difference]: Start difference. First operand 21170 states and 28245 transitions. Second operand 13 states. [2019-10-02 04:31:01,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:31:01,758 INFO L93 Difference]: Finished difference Result 42306 states and 58499 transitions. [2019-10-02 04:31:01,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 04:31:01,759 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 512 [2019-10-02 04:31:01,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:31:01,828 INFO L225 Difference]: With dead ends: 42306 [2019-10-02 04:31:01,829 INFO L226 Difference]: Without dead ends: 21315 [2019-10-02 04:31:01,875 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 505 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2019-10-02 04:31:01,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21315 states. [2019-10-02 04:31:02,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21315 to 21245. [2019-10-02 04:31:02,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21245 states. [2019-10-02 04:31:02,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21245 states to 21245 states and 28350 transitions. [2019-10-02 04:31:02,993 INFO L78 Accepts]: Start accepts. Automaton has 21245 states and 28350 transitions. Word has length 512 [2019-10-02 04:31:02,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:31:02,994 INFO L475 AbstractCegarLoop]: Abstraction has 21245 states and 28350 transitions. [2019-10-02 04:31:02,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 04:31:02,994 INFO L276 IsEmpty]: Start isEmpty. Operand 21245 states and 28350 transitions. [2019-10-02 04:31:03,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2019-10-02 04:31:03,011 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:31:03,011 INFO L411 BasicCegarLoop]: trace histogram [8, 6, 6, 6, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:31:03,011 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:31:03,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:31:03,012 INFO L82 PathProgramCache]: Analyzing trace with hash -2069376377, now seen corresponding path program 3 times [2019-10-02 04:31:03,012 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:31:03,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:31:03,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:31:03,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 04:31:03,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:31:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:31:03,685 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2019-10-02 04:31:03,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 04:31:03,685 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 04:31:04,165 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 04:31:29,353 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-02 04:31:29,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 04:31:29,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 4370 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-02 04:31:29,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 04:31:29,946 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2019-10-02 04:31:29,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 04:31:29,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 14 [2019-10-02 04:31:29,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 04:31:29,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 04:31:29,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-10-02 04:31:29,977 INFO L87 Difference]: Start difference. First operand 21245 states and 28350 transitions. Second operand 14 states. [2019-10-02 04:31:32,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:31:32,396 INFO L93 Difference]: Finished difference Result 42754 states and 59481 transitions. [2019-10-02 04:31:32,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 04:31:32,396 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 537 [2019-10-02 04:31:32,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:31:32,465 INFO L225 Difference]: With dead ends: 42754 [2019-10-02 04:31:32,465 INFO L226 Difference]: Without dead ends: 21718 [2019-10-02 04:31:32,512 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 530 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-10-02 04:31:32,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21718 states. [2019-10-02 04:31:34,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21718 to 21320. [2019-10-02 04:31:34,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21320 states. [2019-10-02 04:31:34,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21320 states to 21320 states and 28440 transitions. [2019-10-02 04:31:34,782 INFO L78 Accepts]: Start accepts. Automaton has 21320 states and 28440 transitions. Word has length 537 [2019-10-02 04:31:34,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:31:34,783 INFO L475 AbstractCegarLoop]: Abstraction has 21320 states and 28440 transitions. [2019-10-02 04:31:34,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 04:31:34,783 INFO L276 IsEmpty]: Start isEmpty. Operand 21320 states and 28440 transitions. [2019-10-02 04:31:34,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2019-10-02 04:31:34,799 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:31:34,799 INFO L411 BasicCegarLoop]: trace histogram [8, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 04:31:34,800 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:31:34,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:31:34,800 INFO L82 PathProgramCache]: Analyzing trace with hash 543330048, now seen corresponding path program 1 times [2019-10-02 04:31:34,800 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:31:34,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:31:34,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:31:34,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 04:31:34,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:31:35,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:31:35,559 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 13 proven. 15 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-10-02 04:31:35,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 04:31:35,559 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 04:31:36,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:31:37,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:31:37,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 5791 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 04:31:37,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 04:31:37,727 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 80 proven. 28 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2019-10-02 04:31:37,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 04:31:37,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11] total 15 [2019-10-02 04:31:37,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 04:31:37,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 04:31:37,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2019-10-02 04:31:37,750 INFO L87 Difference]: Start difference. First operand 21320 states and 28440 transitions. Second operand 15 states. [2019-10-02 04:31:38,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:31:38,869 INFO L93 Difference]: Finished difference Result 42564 states and 58818 transitions. [2019-10-02 04:31:38,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-02 04:31:38,870 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 570 [2019-10-02 04:31:38,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:31:38,926 INFO L225 Difference]: With dead ends: 42564 [2019-10-02 04:31:38,926 INFO L226 Difference]: Without dead ends: 21423 [2019-10-02 04:31:38,959 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 562 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2019-10-02 04:31:38,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21423 states. [2019-10-02 04:31:39,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21423 to 21395. [2019-10-02 04:31:39,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21395 states. [2019-10-02 04:31:39,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21395 states to 21395 states and 28545 transitions. [2019-10-02 04:31:39,664 INFO L78 Accepts]: Start accepts. Automaton has 21395 states and 28545 transitions. Word has length 570 [2019-10-02 04:31:39,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:31:39,665 INFO L475 AbstractCegarLoop]: Abstraction has 21395 states and 28545 transitions. [2019-10-02 04:31:39,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 04:31:39,665 INFO L276 IsEmpty]: Start isEmpty. Operand 21395 states and 28545 transitions. [2019-10-02 04:31:39,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2019-10-02 04:31:39,683 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:31:39,684 INFO L411 BasicCegarLoop]: trace histogram [9, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:31:39,684 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:31:39,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:31:39,685 INFO L82 PathProgramCache]: Analyzing trace with hash -299571622, now seen corresponding path program 2 times [2019-10-02 04:31:39,685 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:31:39,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:31:39,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:31:39,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:31:39,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:31:39,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:31:40,354 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 33 proven. 36 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-10-02 04:31:40,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 04:31:40,354 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 04:31:40,880 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 04:31:51,583 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 04:31:51,584 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 04:31:51,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 5902 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-02 04:31:51,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 04:31:51,828 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 85 proven. 36 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2019-10-02 04:31:52,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 04:31:52,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-10-02 04:31:52,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 04:31:52,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 04:31:52,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-10-02 04:31:52,080 INFO L87 Difference]: Start difference. First operand 21395 states and 28545 transitions. Second operand 13 states. [2019-10-02 04:31:52,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:31:52,935 INFO L93 Difference]: Finished difference Result 42647 states and 58917 transitions. [2019-10-02 04:31:52,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 04:31:52,936 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 596 [2019-10-02 04:31:52,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:31:53,003 INFO L225 Difference]: With dead ends: 42647 [2019-10-02 04:31:53,003 INFO L226 Difference]: Without dead ends: 21431 [2019-10-02 04:31:53,049 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 616 GetRequests, 596 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=285, Unknown=0, NotChecked=0, Total=462 [2019-10-02 04:31:53,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21431 states. [2019-10-02 04:31:53,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21431 to 21410. [2019-10-02 04:31:53,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21410 states. [2019-10-02 04:31:53,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21410 states to 21410 states and 28560 transitions. [2019-10-02 04:31:53,787 INFO L78 Accepts]: Start accepts. Automaton has 21410 states and 28560 transitions. Word has length 596 [2019-10-02 04:31:53,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:31:53,787 INFO L475 AbstractCegarLoop]: Abstraction has 21410 states and 28560 transitions. [2019-10-02 04:31:53,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 04:31:53,788 INFO L276 IsEmpty]: Start isEmpty. Operand 21410 states and 28560 transitions. [2019-10-02 04:31:53,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2019-10-02 04:31:53,805 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:31:53,805 INFO L411 BasicCegarLoop]: trace histogram [10, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:31:53,806 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:31:53,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:31:53,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1719556045, now seen corresponding path program 3 times [2019-10-02 04:31:53,806 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:31:53,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:31:53,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:31:53,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 04:31:53,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:31:54,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:31:54,593 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 13 proven. 15 refuted. 0 times theorem prover too weak. 423 trivial. 0 not checked. [2019-10-02 04:31:54,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 04:31:54,594 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 04:31:55,041 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 04:32:28,367 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-02 04:32:28,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 04:32:28,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 4471 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 04:32:28,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 04:32:28,775 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 39 proven. 1 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2019-10-02 04:32:28,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 04:32:28,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-10-02 04:32:28,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 04:32:28,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 04:32:28,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-02 04:32:28,812 INFO L87 Difference]: Start difference. First operand 21410 states and 28560 transitions. Second operand 8 states. [2019-10-02 04:32:29,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:32:29,559 INFO L93 Difference]: Finished difference Result 42796 states and 59393 transitions. [2019-10-02 04:32:29,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 04:32:29,560 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 597 [2019-10-02 04:32:29,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:32:29,629 INFO L225 Difference]: With dead ends: 42796 [2019-10-02 04:32:29,629 INFO L226 Difference]: Without dead ends: 21595 [2019-10-02 04:32:29,673 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 596 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-02 04:32:29,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21595 states. [2019-10-02 04:32:30,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21595 to 21550. [2019-10-02 04:32:30,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21550 states. [2019-10-02 04:32:30,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21550 states to 21550 states and 28745 transitions. [2019-10-02 04:32:30,427 INFO L78 Accepts]: Start accepts. Automaton has 21550 states and 28745 transitions. Word has length 597 [2019-10-02 04:32:30,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:32:30,427 INFO L475 AbstractCegarLoop]: Abstraction has 21550 states and 28745 transitions. [2019-10-02 04:32:30,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 04:32:30,428 INFO L276 IsEmpty]: Start isEmpty. Operand 21550 states and 28745 transitions. [2019-10-02 04:32:30,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 617 [2019-10-02 04:32:30,445 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:32:30,446 INFO L411 BasicCegarLoop]: trace histogram [10, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 04:32:30,446 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:32:30,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:32:30,446 INFO L82 PathProgramCache]: Analyzing trace with hash 853737346, now seen corresponding path program 4 times [2019-10-02 04:32:30,447 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:32:30,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:32:30,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:32:30,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 04:32:30,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:32:30,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:32:31,386 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2019-10-02 04:32:31,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 04:32:31,387 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 04:32:31,903 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 04:32:32,632 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 04:32:32,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 04:32:32,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 3652 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 04:32:32,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 04:32:32,810 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 53 proven. 9 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2019-10-02 04:32:32,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 04:32:32,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-10-02 04:32:32,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 04:32:32,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 04:32:32,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 04:32:32,820 INFO L87 Difference]: Start difference. First operand 21550 states and 28745 transitions. Second operand 8 states. [2019-10-02 04:32:34,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:32:34,285 INFO L93 Difference]: Finished difference Result 43131 states and 59863 transitions. [2019-10-02 04:32:34,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 04:32:34,288 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 616 [2019-10-02 04:32:34,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:32:34,355 INFO L225 Difference]: With dead ends: 43131 [2019-10-02 04:32:34,356 INFO L226 Difference]: Without dead ends: 21790 [2019-10-02 04:32:34,399 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 620 GetRequests, 614 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 04:32:34,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21790 states. [2019-10-02 04:32:35,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21790 to 21685. [2019-10-02 04:32:35,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21685 states. [2019-10-02 04:32:35,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21685 states to 21685 states and 28910 transitions. [2019-10-02 04:32:35,403 INFO L78 Accepts]: Start accepts. Automaton has 21685 states and 28910 transitions. Word has length 616 [2019-10-02 04:32:35,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:32:35,404 INFO L475 AbstractCegarLoop]: Abstraction has 21685 states and 28910 transitions. [2019-10-02 04:32:35,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 04:32:35,404 INFO L276 IsEmpty]: Start isEmpty. Operand 21685 states and 28910 transitions. [2019-10-02 04:32:35,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2019-10-02 04:32:35,423 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:32:35,423 INFO L411 BasicCegarLoop]: trace histogram [10, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:32:35,424 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:32:35,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:32:35,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1011578237, now seen corresponding path program 5 times [2019-10-02 04:32:35,425 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:32:35,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:32:35,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:32:35,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 04:32:35,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:32:35,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:32:36,069 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 13 proven. 24 refuted. 0 times theorem prover too weak. 487 trivial. 0 not checked. [2019-10-02 04:32:36,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 04:32:36,069 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 04:32:36,569 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 04:33:01,116 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-10-02 04:33:01,117 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 04:33:01,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 1278 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-02 04:33:01,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 04:33:01,538 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 87 proven. 45 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-10-02 04:33:01,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 04:33:01,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13] total 17 [2019-10-02 04:33:01,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 04:33:01,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 04:33:01,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-10-02 04:33:01,552 INFO L87 Difference]: Start difference. First operand 21685 states and 28910 transitions. Second operand 17 states. [2019-10-02 04:33:04,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:33:04,610 INFO L93 Difference]: Finished difference Result 43305 states and 60000 transitions. [2019-10-02 04:33:04,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-02 04:33:04,610 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 626 [2019-10-02 04:33:04,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:33:04,670 INFO L225 Difference]: With dead ends: 43305 [2019-10-02 04:33:04,670 INFO L226 Difference]: Without dead ends: 21799 [2019-10-02 04:33:04,707 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 641 GetRequests, 616 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=212, Invalid=490, Unknown=0, NotChecked=0, Total=702 [2019-10-02 04:33:04,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21799 states. [2019-10-02 04:33:05,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21799 to 21775. [2019-10-02 04:33:05,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21775 states. [2019-10-02 04:33:05,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21775 states to 21775 states and 29015 transitions. [2019-10-02 04:33:05,449 INFO L78 Accepts]: Start accepts. Automaton has 21775 states and 29015 transitions. Word has length 626 [2019-10-02 04:33:05,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:33:05,449 INFO L475 AbstractCegarLoop]: Abstraction has 21775 states and 29015 transitions. [2019-10-02 04:33:05,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 04:33:05,449 INFO L276 IsEmpty]: Start isEmpty. Operand 21775 states and 29015 transitions. [2019-10-02 04:33:05,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2019-10-02 04:33:05,467 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:33:05,468 INFO L411 BasicCegarLoop]: trace histogram [11, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:33:05,468 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:33:05,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:33:05,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1152710891, now seen corresponding path program 6 times [2019-10-02 04:33:05,468 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:33:05,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:33:05,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:33:05,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 04:33:05,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:33:05,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:33:06,076 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 35 proven. 1 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-10-02 04:33:06,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 04:33:06,077 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 04:33:06,578 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 04:34:01,899 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-10-02 04:34:01,899 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 04:34:02,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 4344 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 04:34:02,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 04:34:02,495 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 88 proven. 1 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2019-10-02 04:34:02,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 04:34:02,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-02 04:34:02,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 04:34:02,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 04:34:02,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 04:34:02,534 INFO L87 Difference]: Start difference. First operand 21775 states and 29015 transitions. Second operand 5 states. [2019-10-02 04:34:03,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:34:03,259 INFO L93 Difference]: Finished difference Result 43521 states and 60243 transitions. [2019-10-02 04:34:03,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 04:34:03,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 632 [2019-10-02 04:34:03,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:34:03,332 INFO L225 Difference]: With dead ends: 43521 [2019-10-02 04:34:03,332 INFO L226 Difference]: Without dead ends: 21955 [2019-10-02 04:34:03,376 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 635 GetRequests, 632 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 04:34:03,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21955 states. [2019-10-02 04:34:04,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21955 to 21895. [2019-10-02 04:34:04,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21895 states. [2019-10-02 04:34:04,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21895 states to 21895 states and 29135 transitions. [2019-10-02 04:34:04,147 INFO L78 Accepts]: Start accepts. Automaton has 21895 states and 29135 transitions. Word has length 632 [2019-10-02 04:34:04,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:34:04,148 INFO L475 AbstractCegarLoop]: Abstraction has 21895 states and 29135 transitions. [2019-10-02 04:34:04,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 04:34:04,148 INFO L276 IsEmpty]: Start isEmpty. Operand 21895 states and 29135 transitions. [2019-10-02 04:34:04,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 641 [2019-10-02 04:34:04,167 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:34:04,168 INFO L411 BasicCegarLoop]: trace histogram [11, 8, 8, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:34:04,168 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:34:04,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:34:04,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1081213333, now seen corresponding path program 7 times [2019-10-02 04:34:04,168 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:34:04,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:34:04,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:34:04,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 04:34:04,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:34:04,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:34:05,360 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 56 proven. 4 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2019-10-02 04:34:05,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 04:34:05,361 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 04:34:05,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:34:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:34:07,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 6108 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-02 04:34:07,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 04:34:07,817 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 89 proven. 55 refuted. 0 times theorem prover too weak. 475 trivial. 0 not checked. [2019-10-02 04:34:07,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 04:34:07,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 14] total 17 [2019-10-02 04:34:07,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 04:34:07,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 04:34:07,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-10-02 04:34:07,839 INFO L87 Difference]: Start difference. First operand 21895 states and 29135 transitions. Second operand 17 states. [2019-10-02 04:34:08,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:34:08,895 INFO L93 Difference]: Finished difference Result 43833 states and 60589 transitions. [2019-10-02 04:34:08,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-02 04:34:08,897 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 640 [2019-10-02 04:34:08,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:34:08,970 INFO L225 Difference]: With dead ends: 43833 [2019-10-02 04:34:08,970 INFO L226 Difference]: Without dead ends: 22117 [2019-10-02 04:34:09,020 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 629 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=243, Invalid=513, Unknown=0, NotChecked=0, Total=756 [2019-10-02 04:34:09,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22117 states. [2019-10-02 04:34:11,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22117 to 22030. [2019-10-02 04:34:11,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22030 states. [2019-10-02 04:34:11,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22030 states to 22030 states and 29270 transitions. [2019-10-02 04:34:11,296 INFO L78 Accepts]: Start accepts. Automaton has 22030 states and 29270 transitions. Word has length 640 [2019-10-02 04:34:11,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:34:11,297 INFO L475 AbstractCegarLoop]: Abstraction has 22030 states and 29270 transitions. [2019-10-02 04:34:11,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 04:34:11,297 INFO L276 IsEmpty]: Start isEmpty. Operand 22030 states and 29270 transitions. [2019-10-02 04:34:11,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2019-10-02 04:34:11,316 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:34:11,316 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:34:11,316 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:34:11,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:34:11,317 INFO L82 PathProgramCache]: Analyzing trace with hash -312352538, now seen corresponding path program 8 times [2019-10-02 04:34:11,317 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:34:11,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:34:11,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:34:11,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:34:11,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:34:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:34:12,615 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 92 proven. 9 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [2019-10-02 04:34:12,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 04:34:12,615 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 04:34:13,162 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 04:34:23,321 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 04:34:23,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 04:34:23,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 6162 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-02 04:34:23,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 04:34:23,994 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 91 proven. 66 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2019-10-02 04:34:24,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 04:34:24,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 15] total 19 [2019-10-02 04:34:24,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 04:34:24,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 04:34:24,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2019-10-02 04:34:24,070 INFO L87 Difference]: Start difference. First operand 22030 states and 29270 transitions. Second operand 19 states. [2019-10-02 04:34:25,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:34:25,414 INFO L93 Difference]: Finished difference Result 44046 states and 60803 transitions. [2019-10-02 04:34:25,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-02 04:34:25,415 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 651 [2019-10-02 04:34:25,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:34:25,483 INFO L225 Difference]: With dead ends: 44046 [2019-10-02 04:34:25,483 INFO L226 Difference]: Without dead ends: 22195 [2019-10-02 04:34:25,535 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 668 GetRequests, 639 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=287, Invalid=643, Unknown=0, NotChecked=0, Total=930 [2019-10-02 04:34:25,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22195 states. [2019-10-02 04:34:26,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22195 to 22165. [2019-10-02 04:34:26,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22165 states. [2019-10-02 04:34:26,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22165 states to 22165 states and 29405 transitions. [2019-10-02 04:34:26,331 INFO L78 Accepts]: Start accepts. Automaton has 22165 states and 29405 transitions. Word has length 651 [2019-10-02 04:34:26,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:34:26,331 INFO L475 AbstractCegarLoop]: Abstraction has 22165 states and 29405 transitions. [2019-10-02 04:34:26,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 04:34:26,331 INFO L276 IsEmpty]: Start isEmpty. Operand 22165 states and 29405 transitions. [2019-10-02 04:34:26,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 661 [2019-10-02 04:34:26,350 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:34:26,351 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 13, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:34:26,351 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:34:26,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:34:26,352 INFO L82 PathProgramCache]: Analyzing trace with hash 378628461, now seen corresponding path program 9 times [2019-10-02 04:34:26,352 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:34:26,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:34:26,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:34:26,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 04:34:26,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:34:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:34:27,817 INFO L134 CoverageAnalysis]: Checked inductivity of 865 backedges. 41 proven. 78 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2019-10-02 04:34:27,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 04:34:27,818 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 04:34:28,344 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 04:35:27,142 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-02 04:35:27,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 04:35:27,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 5667 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 04:35:27,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 04:35:27,592 INFO L134 CoverageAnalysis]: Checked inductivity of 865 backedges. 39 proven. 15 refuted. 0 times theorem prover too weak. 811 trivial. 0 not checked. [2019-10-02 04:35:27,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 04:35:27,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6] total 20 [2019-10-02 04:35:27,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 04:35:27,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 04:35:27,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2019-10-02 04:35:27,633 INFO L87 Difference]: Start difference. First operand 22165 states and 29405 transitions. Second operand 20 states. [2019-10-02 04:35:28,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:35:28,923 INFO L93 Difference]: Finished difference Result 44259 states and 61027 transitions. [2019-10-02 04:35:28,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-02 04:35:28,924 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 660 [2019-10-02 04:35:28,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:35:29,000 INFO L225 Difference]: With dead ends: 44259 [2019-10-02 04:35:29,000 INFO L226 Difference]: Without dead ends: 22273 [2019-10-02 04:35:29,047 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 688 GetRequests, 657 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=329, Invalid=727, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 04:35:29,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22273 states. [2019-10-02 04:35:30,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22273 to 22240. [2019-10-02 04:35:30,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22240 states. [2019-10-02 04:35:30,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22240 states to 22240 states and 29495 transitions. [2019-10-02 04:35:30,140 INFO L78 Accepts]: Start accepts. Automaton has 22240 states and 29495 transitions. Word has length 660 [2019-10-02 04:35:30,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:35:30,141 INFO L475 AbstractCegarLoop]: Abstraction has 22240 states and 29495 transitions. [2019-10-02 04:35:30,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 04:35:30,141 INFO L276 IsEmpty]: Start isEmpty. Operand 22240 states and 29495 transitions. [2019-10-02 04:35:30,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2019-10-02 04:35:30,161 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:35:30,161 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 14, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:35:30,161 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:35:30,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:35:30,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1078564882, now seen corresponding path program 1 times [2019-10-02 04:35:30,162 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:35:30,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:35:30,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:35:30,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 04:35:30,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:35:30,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:35:30,727 INFO L134 CoverageAnalysis]: Checked inductivity of 755 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 742 trivial. 0 not checked. [2019-10-02 04:35:30,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:35:30,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 04:35:30,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 04:35:30,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 04:35:30,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 04:35:30,729 INFO L87 Difference]: Start difference. First operand 22240 states and 29495 transitions. Second operand 4 states. [2019-10-02 04:35:31,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:35:31,543 INFO L93 Difference]: Finished difference Result 44376 states and 61093 transitions. [2019-10-02 04:35:31,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 04:35:31,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 649 [2019-10-02 04:35:31,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:35:31,634 INFO L225 Difference]: With dead ends: 44376 [2019-10-02 04:35:31,634 INFO L226 Difference]: Without dead ends: 22345 [2019-10-02 04:35:31,681 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 04:35:31,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22345 states. [2019-10-02 04:35:32,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22345 to 22345. [2019-10-02 04:35:32,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22345 states. [2019-10-02 04:35:32,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22345 states to 22345 states and 29630 transitions. [2019-10-02 04:35:32,886 INFO L78 Accepts]: Start accepts. Automaton has 22345 states and 29630 transitions. Word has length 649 [2019-10-02 04:35:32,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:35:32,887 INFO L475 AbstractCegarLoop]: Abstraction has 22345 states and 29630 transitions. [2019-10-02 04:35:32,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 04:35:32,887 INFO L276 IsEmpty]: Start isEmpty. Operand 22345 states and 29630 transitions. [2019-10-02 04:35:32,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2019-10-02 04:35:32,918 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:35:32,919 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 14, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:35:32,919 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:35:32,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:35:32,919 INFO L82 PathProgramCache]: Analyzing trace with hash 2080249640, now seen corresponding path program 1 times [2019-10-02 04:35:32,919 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:35:32,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:35:32,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:35:32,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:35:32,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:35:33,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:35:33,640 INFO L134 CoverageAnalysis]: Checked inductivity of 755 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 742 trivial. 0 not checked. [2019-10-02 04:35:33,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:35:33,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 04:35:33,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 04:35:33,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 04:35:33,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 04:35:33,642 INFO L87 Difference]: Start difference. First operand 22345 states and 29630 transitions. Second operand 5 states. [2019-10-02 04:35:34,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:35:34,601 INFO L93 Difference]: Finished difference Result 44616 states and 61378 transitions. [2019-10-02 04:35:34,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 04:35:34,602 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 650 [2019-10-02 04:35:34,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:35:34,674 INFO L225 Difference]: With dead ends: 44616 [2019-10-02 04:35:34,675 INFO L226 Difference]: Without dead ends: 22450 [2019-10-02 04:35:34,719 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-02 04:35:34,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22450 states. [2019-10-02 04:35:37,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22450 to 22450. [2019-10-02 04:35:37,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22450 states. [2019-10-02 04:35:37,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22450 states to 22450 states and 29735 transitions. [2019-10-02 04:35:37,397 INFO L78 Accepts]: Start accepts. Automaton has 22450 states and 29735 transitions. Word has length 650 [2019-10-02 04:35:37,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:35:37,398 INFO L475 AbstractCegarLoop]: Abstraction has 22450 states and 29735 transitions. [2019-10-02 04:35:37,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 04:35:37,398 INFO L276 IsEmpty]: Start isEmpty. Operand 22450 states and 29735 transitions. [2019-10-02 04:35:37,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2019-10-02 04:35:37,416 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:35:37,417 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 14, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:35:37,417 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:35:37,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:35:37,417 INFO L82 PathProgramCache]: Analyzing trace with hash -2111059277, now seen corresponding path program 1 times [2019-10-02 04:35:37,417 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:35:37,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:35:37,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:35:37,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:35:37,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:35:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:35:39,785 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-10-02 04:35:40,168 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-10-02 04:35:40,512 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-10-02 04:35:41,528 INFO L134 CoverageAnalysis]: Checked inductivity of 755 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 740 trivial. 0 not checked. [2019-10-02 04:35:41,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 04:35:41,528 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 04:35:42,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:35:43,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:35:43,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 6360 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 04:35:43,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 04:35:45,013 INFO L134 CoverageAnalysis]: Checked inductivity of 755 backedges. 76 proven. 91 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2019-10-02 04:35:45,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 04:35:45,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 17] total 47 [2019-10-02 04:35:45,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-10-02 04:35:45,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-10-02 04:35:45,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1931, Unknown=0, NotChecked=0, Total=2162 [2019-10-02 04:35:45,035 INFO L87 Difference]: Start difference. First operand 22450 states and 29735 transitions. Second operand 47 states. [2019-10-02 04:36:03,660 WARN L191 SmtUtils]: Spent 360.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-10-02 04:36:12,312 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-10-02 04:36:15,225 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-10-02 04:37:18,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:37:18,231 INFO L93 Difference]: Finished difference Result 49429 states and 70846 transitions. [2019-10-02 04:37:18,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-10-02 04:37:18,231 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 651 [2019-10-02 04:37:18,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:37:18,326 INFO L225 Difference]: With dead ends: 49429 [2019-10-02 04:37:18,327 INFO L226 Difference]: Without dead ends: 27113 [2019-10-02 04:37:18,374 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 742 GetRequests, 655 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1309 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=731, Invalid=6925, Unknown=0, NotChecked=0, Total=7656 [2019-10-02 04:37:18,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27113 states. [2019-10-02 04:37:19,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27113 to 23645. [2019-10-02 04:37:19,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23645 states. [2019-10-02 04:37:19,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23645 states to 23645 states and 32204 transitions. [2019-10-02 04:37:19,486 INFO L78 Accepts]: Start accepts. Automaton has 23645 states and 32204 transitions. Word has length 651 [2019-10-02 04:37:19,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:37:19,486 INFO L475 AbstractCegarLoop]: Abstraction has 23645 states and 32204 transitions. [2019-10-02 04:37:19,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-10-02 04:37:19,486 INFO L276 IsEmpty]: Start isEmpty. Operand 23645 states and 32204 transitions. [2019-10-02 04:37:19,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 655 [2019-10-02 04:37:19,509 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:37:19,509 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 15, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:37:19,509 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:37:19,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:37:19,510 INFO L82 PathProgramCache]: Analyzing trace with hash -328888204, now seen corresponding path program 1 times [2019-10-02 04:37:19,510 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:37:19,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:37:19,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:37:19,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:37:19,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:37:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:37:21,413 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-10-02 04:37:21,761 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-10-02 04:37:22,053 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-10-02 04:37:22,954 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2019-10-02 04:37:22,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 04:37:22,954 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 04:37:23,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:37:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:37:25,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 6371 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-02 04:37:25,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 04:37:26,290 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 78 proven. 105 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2019-10-02 04:37:26,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 04:37:26,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 18] total 45 [2019-10-02 04:37:26,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-10-02 04:37:26,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-10-02 04:37:26,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1749, Unknown=0, NotChecked=0, Total=1980 [2019-10-02 04:37:26,314 INFO L87 Difference]: Start difference. First operand 23645 states and 32204 transitions. Second operand 45 states. [2019-10-02 04:37:40,902 WARN L191 SmtUtils]: Spent 324.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-10-02 04:37:46,787 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-10-02 04:37:48,826 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-10-02 04:38:44,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:38:44,349 INFO L93 Difference]: Finished difference Result 50657 states and 73344 transitions. [2019-10-02 04:38:44,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-10-02 04:38:44,349 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 654 [2019-10-02 04:38:44,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:38:44,444 INFO L225 Difference]: With dead ends: 50657 [2019-10-02 04:38:44,444 INFO L226 Difference]: Without dead ends: 26876 [2019-10-02 04:38:44,503 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 741 GetRequests, 655 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1298 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=739, Invalid=6743, Unknown=0, NotChecked=0, Total=7482 [2019-10-02 04:38:44,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26876 states. [2019-10-02 04:38:45,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26876 to 23420. [2019-10-02 04:38:45,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23420 states. [2019-10-02 04:38:45,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23420 states to 23420 states and 31814 transitions. [2019-10-02 04:38:45,617 INFO L78 Accepts]: Start accepts. Automaton has 23420 states and 31814 transitions. Word has length 654 [2019-10-02 04:38:45,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:38:45,618 INFO L475 AbstractCegarLoop]: Abstraction has 23420 states and 31814 transitions. [2019-10-02 04:38:45,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-10-02 04:38:45,618 INFO L276 IsEmpty]: Start isEmpty. Operand 23420 states and 31814 transitions. [2019-10-02 04:38:45,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 669 [2019-10-02 04:38:45,641 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:38:45,641 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 16, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:38:45,641 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:38:45,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:38:45,642 INFO L82 PathProgramCache]: Analyzing trace with hash 595406138, now seen corresponding path program 10 times [2019-10-02 04:38:45,642 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:38:45,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:38:45,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:38:45,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:38:45,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:38:46,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:38:46,787 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2019-10-02 04:38:47,074 INFO L134 CoverageAnalysis]: Checked inductivity of 932 backedges. 47 proven. 120 refuted. 0 times theorem prover too weak. 765 trivial. 0 not checked. [2019-10-02 04:38:47,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 04:38:47,074 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 04:38:47,583 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 04:38:49,114 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 04:38:49,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 04:38:49,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 6237 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-02 04:38:49,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 04:38:49,328 INFO L134 CoverageAnalysis]: Checked inductivity of 932 backedges. 99 proven. 120 refuted. 0 times theorem prover too weak. 713 trivial. 0 not checked. [2019-10-02 04:38:49,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 04:38:49,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-10-02 04:38:49,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 04:38:49,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 04:38:49,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2019-10-02 04:38:49,352 INFO L87 Difference]: Start difference. First operand 23420 states and 31814 transitions. Second operand 20 states. [2019-10-02 04:38:50,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:38:50,965 INFO L93 Difference]: Finished difference Result 46718 states and 65542 transitions. [2019-10-02 04:38:50,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-02 04:38:50,965 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 668 [2019-10-02 04:38:50,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:38:51,035 INFO L225 Difference]: With dead ends: 46718 [2019-10-02 04:38:51,035 INFO L226 Difference]: Without dead ends: 23477 [2019-10-02 04:38:51,075 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 702 GetRequests, 668 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=478, Invalid=782, Unknown=0, NotChecked=0, Total=1260 [2019-10-02 04:38:51,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23477 states. [2019-10-02 04:38:51,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23477 to 23435. [2019-10-02 04:38:51,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23435 states. [2019-10-02 04:38:52,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23435 states to 23435 states and 31829 transitions. [2019-10-02 04:38:52,031 INFO L78 Accepts]: Start accepts. Automaton has 23435 states and 31829 transitions. Word has length 668 [2019-10-02 04:38:52,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:38:52,031 INFO L475 AbstractCegarLoop]: Abstraction has 23435 states and 31829 transitions. [2019-10-02 04:38:52,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 04:38:52,031 INFO L276 IsEmpty]: Start isEmpty. Operand 23435 states and 31829 transitions. [2019-10-02 04:38:52,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 670 [2019-10-02 04:38:52,052 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:38:52,052 INFO L411 BasicCegarLoop]: trace histogram [17, 16, 16, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:38:52,052 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:38:52,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:38:52,053 INFO L82 PathProgramCache]: Analyzing trace with hash -2062041581, now seen corresponding path program 11 times [2019-10-02 04:38:52,053 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:38:52,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:38:52,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:38:52,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 04:38:52,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:38:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:38:53,551 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 49 proven. 136 refuted. 0 times theorem prover too weak. 765 trivial. 0 not checked. [2019-10-02 04:38:53,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 04:38:53,551 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 04:38:54,153 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1