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.0/usb_urb-drivers-media-dvb-ttusb-dec-ttusb_dec.ko.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 04:20:24,130 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 04:20:24,134 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 04:20:24,153 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 04:20:24,154 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 04:20:24,155 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 04:20:24,157 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 04:20:24,167 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 04:20:24,171 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 04:20:24,174 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 04:20:24,177 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 04:20:24,178 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 04:20:24,179 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 04:20:24,180 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 04:20:24,182 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 04:20:24,183 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 04:20:24,184 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 04:20:24,186 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 04:20:24,188 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 04:20:24,193 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 04:20:24,197 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 04:20:24,199 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 04:20:24,202 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 04:20:24,203 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 04:20:24,206 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 04:20:24,206 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 04:20:24,206 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 04:20:24,208 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 04:20:24,209 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 04:20:24,211 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 04:20:24,212 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 04:20:24,212 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 04:20:24,213 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 04:20:24,214 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 04:20:24,216 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 04:20:24,216 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 04:20:24,217 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 04:20:24,217 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 04:20:24,217 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 04:20:24,218 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 04:20:24,218 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 04:20:24,220 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:20:24,256 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 04:20:24,259 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 04:20:24,261 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 04:20:24,261 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 04:20:24,261 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 04:20:24,261 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 04:20:24,261 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 04:20:24,262 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 04:20:24,262 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 04:20:24,262 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 04:20:24,262 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 04:20:24,262 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 04:20:24,263 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 04:20:24,263 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 04:20:24,263 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 04:20:24,265 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 04:20:24,265 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 04:20:24,265 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 04:20:24,265 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 04:20:24,266 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 04:20:24,266 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 04:20:24,266 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 04:20:24,266 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 04:20:24,266 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 04:20:24,267 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 04:20:24,267 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 04:20:24,267 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 04:20:24,267 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 04:20:24,267 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 04:20:24,318 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 04:20:24,335 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 04:20:24,339 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 04:20:24,340 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 04:20:24,341 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 04:20:24,342 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-linux-3.0/usb_urb-drivers-media-dvb-ttusb-dec-ttusb_dec.ko.cil.out.i [2019-10-02 04:20:24,413 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e4843280/bb5ba87f4a25400d98df2f6be23462e8/FLAGbbe6b7a4a [2019-10-02 04:20:25,316 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 04:20:25,316 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-3.0/usb_urb-drivers-media-dvb-ttusb-dec-ttusb_dec.ko.cil.out.i [2019-10-02 04:20:25,375 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e4843280/bb5ba87f4a25400d98df2f6be23462e8/FLAGbbe6b7a4a [2019-10-02 04:20:25,685 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e4843280/bb5ba87f4a25400d98df2f6be23462e8 [2019-10-02 04:20:25,695 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 04:20:25,697 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 04:20:25,698 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 04:20:25,698 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 04:20:25,702 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 04:20:25,703 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 04:20:25" (1/1) ... [2019-10-02 04:20:25,705 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e9f722e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:20:25, skipping insertion in model container [2019-10-02 04:20:25,706 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 04:20:25" (1/1) ... [2019-10-02 04:20:25,714 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 04:20:25,888 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 04:20:28,189 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 04:20:28,279 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 04:20:28,871 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 04:20:29,222 INFO L192 MainTranslator]: Completed translation [2019-10-02 04:20:29,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:20:29 WrapperNode [2019-10-02 04:20:29,224 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 04:20:29,225 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 04:20:29,225 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 04:20:29,225 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 04:20:29,246 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:20:29" (1/1) ... [2019-10-02 04:20:29,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:20:29" (1/1) ... [2019-10-02 04:20:29,374 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:20:29" (1/1) ... [2019-10-02 04:20:29,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:20:29" (1/1) ... [2019-10-02 04:20:29,507 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:20:29" (1/1) ... [2019-10-02 04:20:29,541 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:20:29" (1/1) ... [2019-10-02 04:20:29,583 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:20:29" (1/1) ... [2019-10-02 04:20:29,617 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 04:20:29,618 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 04:20:29,618 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 04:20:29,619 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 04:20:29,620 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:20:29" (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:20:29,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 04:20:29,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 04:20:29,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~~gfp_t~0~TO~$Pointer$ [2019-10-02 04:20:29,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~~dma_addr_t~0~TO~VOID [2019-10-02 04:20:29,710 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:20:29,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2019-10-02 04:20:29,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2019-10-02 04:20:29,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-10-02 04:20:29,712 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2019-10-02 04:20:29,712 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2019-10-02 04:20:29,712 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2019-10-02 04:20:29,713 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2019-10-02 04:20:29,714 INFO L138 BoogieDeclarations]: Found implementation of procedure __arch_swab32 [2019-10-02 04:20:29,714 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2019-10-02 04:20:29,715 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2019-10-02 04:20:29,716 INFO L138 BoogieDeclarations]: Found implementation of procedure arch_local_save_flags [2019-10-02 04:20:29,718 INFO L138 BoogieDeclarations]: Found implementation of procedure arch_irqs_disabled_flags [2019-10-02 04:20:29,719 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2019-10-02 04:20:29,719 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2019-10-02 04:20:29,719 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2019-10-02 04:20:29,720 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2019-10-02 04:20:29,720 INFO L138 BoogieDeclarations]: Found implementation of procedure is_device_dma_capable [2019-10-02 04:20:29,720 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2019-10-02 04:20:29,720 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_alloc_coherent_mask [2019-10-02 04:20:29,721 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_alloc_coherent_gfp_flags [2019-10-02 04:20:29,721 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_alloc_coherent [2019-10-02 04:20:29,721 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_free_coherent [2019-10-02 04:20:29,721 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_alloc_consistent [2019-10-02 04:20:29,722 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_free_consistent [2019-10-02 04:20:29,722 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_schedule [2019-10-02 04:20:29,722 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2019-10-02 04:20:29,722 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2019-10-02 04:20:29,722 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2019-10-02 04:20:29,722 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_make_path [2019-10-02 04:20:29,723 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register [2019-10-02 04:20:29,723 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_int_urb [2019-10-02 04:20:29,723 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2019-10-02 04:20:29,723 INFO L138 BoogieDeclarations]: Found implementation of procedure input_allocate_device [2019-10-02 04:20:29,723 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_key [2019-10-02 04:20:29,723 INFO L138 BoogieDeclarations]: Found implementation of procedure input_sync [2019-10-02 04:20:29,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_handle_irq [2019-10-02 04:20:29,724 INFO L138 BoogieDeclarations]: Found implementation of procedure crc16 [2019-10-02 04:20:29,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_send_command [2019-10-02 04:20:29,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_get_stb_state [2019-10-02 04:20:29,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_audio_pes2ts_cb [2019-10-02 04:20:29,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_video_pes2ts_cb [2019-10-02 04:20:29,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_set_pids [2019-10-02 04:20:29,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_process_pva [2019-10-02 04:20:29,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_process_filter [2019-10-02 04:20:29,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_process_packet [2019-10-02 04:20:29,725 INFO L138 BoogieDeclarations]: Found implementation of procedure swap_bytes [2019-10-02 04:20:29,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_process_urb_frame [2019-10-02 04:20:29,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_process_urb_frame_list [2019-10-02 04:20:29,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_process_urb [2019-10-02 04:20:29,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_setup_urbs [2019-10-02 04:20:29,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_stop_iso_xfer [2019-10-02 04:20:29,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_set_interface [2019-10-02 04:20:29,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_start_iso_xfer [2019-10-02 04:20:29,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_start_ts_feed [2019-10-02 04:20:29,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_start_sec_feed [2019-10-02 04:20:29,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_start_feed [2019-10-02 04:20:29,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_stop_ts_feed [2019-10-02 04:20:29,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_stop_sec_feed [2019-10-02 04:20:29,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_stop_feed [2019-10-02 04:20:29,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_free_iso_urbs [2019-10-02 04:20:29,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_alloc_iso_urbs [2019-10-02 04:20:29,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_init_tasklet [2019-10-02 04:20:29,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_init_rc [2019-10-02 04:20:29,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_init_v_pes [2019-10-02 04:20:29,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_init_usb [2019-10-02 04:20:29,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_boot_dsp [2019-10-02 04:20:29,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_init_stb [2019-10-02 04:20:29,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_init_dvb [2019-10-02 04:20:29,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_exit_dvb [2019-10-02 04:20:29,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_exit_rc [2019-10-02 04:20:29,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_exit_usb [2019-10-02 04:20:29,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_exit_tasklet [2019-10-02 04:20:29,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_init_filters [2019-10-02 04:20:29,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_exit_filters [2019-10-02 04:20:29,732 INFO L138 BoogieDeclarations]: Found implementation of procedure fe_send_command [2019-10-02 04:20:29,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_probe [2019-10-02 04:20:29,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_disconnect [2019-10-02 04:20:29,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_set_model [2019-10-02 04:20:29,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_init [2019-10-02 04:20:29,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_exit [2019-10-02 04:20:29,735 INFO L138 BoogieDeclarations]: Found implementation of procedure init_module [2019-10-02 04:20:29,735 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup_module [2019-10-02 04:20:29,736 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 04:20:29,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2019-10-02 04:20:29,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2019-10-02 04:20:29,737 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2019-10-02 04:20:29,738 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2019-10-02 04:20:29,738 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2019-10-02 04:20:29,738 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2019-10-02 04:20:29,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-10-02 04:20:29,738 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2019-10-02 04:20:29,739 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2019-10-02 04:20:29,739 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2019-10-02 04:20:29,739 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2019-10-02 04:20:29,739 INFO L138 BoogieDeclarations]: Found implementation of procedure __tasklet_schedule [2019-10-02 04:20:29,739 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2019-10-02 04:20:29,739 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_unlock_irqrestore [2019-10-02 04:20:29,740 INFO L138 BoogieDeclarations]: Found implementation of procedure crc32_le [2019-10-02 04:20:29,740 INFO L138 BoogieDeclarations]: Found implementation of procedure debug_dma_alloc_coherent [2019-10-02 04:20:29,740 INFO L138 BoogieDeclarations]: Found implementation of procedure debug_dma_free_coherent [2019-10-02 04:20:29,740 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2019-10-02 04:20:29,740 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2019-10-02 04:20:29,740 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_dmx_init [2019-10-02 04:20:29,740 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_dmx_release [2019-10-02 04:20:29,741 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_dmxdev_init [2019-10-02 04:20:29,741 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_dmxdev_release [2019-10-02 04:20:29,741 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_filter_pes2ts [2019-10-02 04:20:29,741 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_filter_pes2ts_init [2019-10-02 04:20:29,741 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_net_init [2019-10-02 04:20:29,741 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_net_release [2019-10-02 04:20:29,741 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_register_adapter [2019-10-02 04:20:29,742 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_register_frontend [2019-10-02 04:20:29,743 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_unregister_adapter [2019-10-02 04:20:29,743 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_unregister_frontend [2019-10-02 04:20:29,743 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event [2019-10-02 04:20:29,744 INFO L138 BoogieDeclarations]: Found implementation of procedure input_free_device [2019-10-02 04:20:29,745 INFO L138 BoogieDeclarations]: Found implementation of procedure input_register_device [2019-10-02 04:20:29,745 INFO L138 BoogieDeclarations]: Found implementation of procedure input_unregister_device [2019-10-02 04:20:29,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2019-10-02 04:20:29,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-10-02 04:20:29,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2019-10-02 04:20:29,747 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2019-10-02 04:20:29,747 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_interruptible_nested [2019-10-02 04:20:29,747 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2019-10-02 04:20:29,747 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-10-02 04:20:29,747 INFO L138 BoogieDeclarations]: Found implementation of procedure release_firmware [2019-10-02 04:20:29,749 INFO L138 BoogieDeclarations]: Found implementation of procedure request_firmware [2019-10-02 04:20:29,749 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2019-10-02 04:20:29,749 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_init [2019-10-02 04:20:29,749 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_kill [2019-10-02 04:20:29,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusbdecfe_dvbs_attach [2019-10-02 04:20:29,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusbdecfe_dvbt_attach [2019-10-02 04:20:29,750 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2019-10-02 04:20:29,751 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_deregister [2019-10-02 04:20:29,751 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2019-10-02 04:20:29,755 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register_driver [2019-10-02 04:20:29,755 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_interface [2019-10-02 04:20:29,756 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2019-10-02 04:20:29,756 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2019-10-02 04:20:29,762 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-10-02 04:20:29,762 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-10-02 04:20:29,763 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-10-02 04:20:29,763 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-10-02 04:20:29,763 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 04:20:29,763 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2019-10-02 04:20:29,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 04:20:29,764 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2019-10-02 04:20:29,764 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2019-10-02 04:20:29,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 04:20:29,764 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2019-10-02 04:20:29,764 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2019-10-02 04:20:29,765 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2019-10-02 04:20:29,765 INFO L130 BoogieDeclarations]: Found specification of procedure __arch_swab32 [2019-10-02 04:20:29,765 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2019-10-02 04:20:29,765 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2019-10-02 04:20:29,765 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-10-02 04:20:29,766 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2019-10-02 04:20:29,766 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2019-10-02 04:20:29,766 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-10-02 04:20:29,766 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-10-02 04:20:29,766 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2019-10-02 04:20:29,766 INFO L130 BoogieDeclarations]: Found specification of procedure arch_local_save_flags [2019-10-02 04:20:29,766 INFO L130 BoogieDeclarations]: Found specification of procedure arch_irqs_disabled_flags [2019-10-02 04:20:29,767 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2019-10-02 04:20:29,767 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2019-10-02 04:20:29,767 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_unlock_irqrestore [2019-10-02 04:20:29,767 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2019-10-02 04:20:29,767 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2019-10-02 04:20:29,767 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2019-10-02 04:20:29,767 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_interruptible_nested [2019-10-02 04:20:29,768 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2019-10-02 04:20:29,768 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-10-02 04:20:29,768 INFO L130 BoogieDeclarations]: Found specification of procedure init_module [2019-10-02 04:20:29,768 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup_module [2019-10-02 04:20:29,768 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2019-10-02 04:20:29,768 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2019-10-02 04:20:29,768 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2019-10-02 04:20:29,769 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2019-10-02 04:20:29,769 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2019-10-02 04:20:29,769 INFO L130 BoogieDeclarations]: Found specification of procedure is_device_dma_capable [2019-10-02 04:20:29,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 04:20:29,769 INFO L130 BoogieDeclarations]: Found specification of procedure debug_dma_alloc_coherent [2019-10-02 04:20:29,769 INFO L130 BoogieDeclarations]: Found specification of procedure debug_dma_free_coherent [2019-10-02 04:20:29,769 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2019-10-02 04:20:29,770 INFO L130 BoogieDeclarations]: Found specification of procedure dma_alloc_coherent_mask [2019-10-02 04:20:29,770 INFO L130 BoogieDeclarations]: Found specification of procedure dma_alloc_coherent_gfp_flags [2019-10-02 04:20:29,770 INFO L130 BoogieDeclarations]: Found specification of procedure dma_alloc_coherent [2019-10-02 04:20:29,770 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~~gfp_t~0~TO~$Pointer$ [2019-10-02 04:20:29,770 INFO L130 BoogieDeclarations]: Found specification of procedure dma_free_coherent [2019-10-02 04:20:29,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 04:20:29,771 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~~dma_addr_t~0~TO~VOID [2019-10-02 04:20:29,771 INFO L130 BoogieDeclarations]: Found specification of procedure pci_alloc_consistent [2019-10-02 04:20:29,771 INFO L130 BoogieDeclarations]: Found specification of procedure pci_free_consistent [2019-10-02 04:20:29,771 INFO L130 BoogieDeclarations]: Found specification of procedure __tasklet_schedule [2019-10-02 04:20:29,771 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_schedule [2019-10-02 04:20:29,771 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_kill [2019-10-02 04:20:29,771 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_init [2019-10-02 04:20:29,772 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2019-10-02 04:20:29,772 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2019-10-02 04:20:29,772 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2019-10-02 04:20:29,772 INFO L130 BoogieDeclarations]: Found specification of procedure usb_make_path [2019-10-02 04:20:29,772 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register_driver [2019-10-02 04:20:29,772 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register [2019-10-02 04:20:29,772 INFO L130 BoogieDeclarations]: Found specification of procedure usb_deregister [2019-10-02 04:20:29,772 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_int_urb [2019-10-02 04:20:29,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 04:20:29,773 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2019-10-02 04:20:29,773 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2019-10-02 04:20:29,773 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2019-10-02 04:20:29,773 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2019-10-02 04:20:29,773 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2019-10-02 04:20:29,773 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2019-10-02 04:20:29,773 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2019-10-02 04:20:29,774 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_interface [2019-10-02 04:20:29,774 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2019-10-02 04:20:29,774 INFO L130 BoogieDeclarations]: Found specification of procedure request_firmware [2019-10-02 04:20:29,774 INFO L130 BoogieDeclarations]: Found specification of procedure release_firmware [2019-10-02 04:20:29,774 INFO L130 BoogieDeclarations]: Found specification of procedure crc32_le [2019-10-02 04:20:29,774 INFO L130 BoogieDeclarations]: Found specification of procedure input_allocate_device [2019-10-02 04:20:29,774 INFO L130 BoogieDeclarations]: Found specification of procedure input_free_device [2019-10-02 04:20:29,775 INFO L130 BoogieDeclarations]: Found specification of procedure input_register_device [2019-10-02 04:20:29,775 INFO L130 BoogieDeclarations]: Found specification of procedure input_unregister_device [2019-10-02 04:20:29,775 INFO L130 BoogieDeclarations]: Found specification of procedure input_event [2019-10-02 04:20:29,775 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_key [2019-10-02 04:20:29,775 INFO L130 BoogieDeclarations]: Found specification of procedure input_sync [2019-10-02 04:20:29,775 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_register_adapter [2019-10-02 04:20:29,775 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_unregister_adapter [2019-10-02 04:20:29,775 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_dmxdev_init [2019-10-02 04:20:29,776 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_dmxdev_release [2019-10-02 04:20:29,776 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_dmx_init [2019-10-02 04:20:29,776 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_dmx_release [2019-10-02 04:20:29,776 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_filter_pes2ts_init [2019-10-02 04:20:29,776 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_filter_pes2ts [2019-10-02 04:20:29,776 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_register_frontend [2019-10-02 04:20:29,776 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_unregister_frontend [2019-10-02 04:20:29,776 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_net_release [2019-10-02 04:20:29,777 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_net_init [2019-10-02 04:20:29,777 INFO L130 BoogieDeclarations]: Found specification of procedure ttusbdecfe_dvbs_attach [2019-10-02 04:20:29,777 INFO L130 BoogieDeclarations]: Found specification of procedure ttusbdecfe_dvbt_attach [2019-10-02 04:20:29,777 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_set_model [2019-10-02 04:20:29,777 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_handle_irq [2019-10-02 04:20:29,777 INFO L130 BoogieDeclarations]: Found specification of procedure crc16 [2019-10-02 04:20:29,777 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_send_command [2019-10-02 04:20:29,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-10-02 04:20:29,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 04:20:29,778 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_get_stb_state [2019-10-02 04:20:29,778 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_audio_pes2ts_cb [2019-10-02 04:20:29,778 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:20:29,778 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_video_pes2ts_cb [2019-10-02 04:20:29,778 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_set_pids [2019-10-02 04:20:29,778 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_process_pva [2019-10-02 04:20:29,778 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_process_filter [2019-10-02 04:20:29,779 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_process_packet [2019-10-02 04:20:29,779 INFO L130 BoogieDeclarations]: Found specification of procedure swap_bytes [2019-10-02 04:20:29,779 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_process_urb_frame [2019-10-02 04:20:29,779 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_process_urb_frame_list [2019-10-02 04:20:29,779 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_process_urb [2019-10-02 04:20:29,779 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_setup_urbs [2019-10-02 04:20:29,779 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_stop_iso_xfer [2019-10-02 04:20:29,779 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_set_interface [2019-10-02 04:20:29,780 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_start_iso_xfer [2019-10-02 04:20:29,781 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_start_ts_feed [2019-10-02 04:20:29,784 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_start_sec_feed [2019-10-02 04:20:29,784 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_start_feed [2019-10-02 04:20:29,784 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_stop_ts_feed [2019-10-02 04:20:29,785 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_stop_sec_feed [2019-10-02 04:20:29,785 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_stop_feed [2019-10-02 04:20:29,788 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_free_iso_urbs [2019-10-02 04:20:29,788 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_alloc_iso_urbs [2019-10-02 04:20:29,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-10-02 04:20:29,788 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_init_tasklet [2019-10-02 04:20:29,788 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_init_rc [2019-10-02 04:20:29,788 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_init_v_pes [2019-10-02 04:20:29,789 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_init_usb [2019-10-02 04:20:29,789 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_boot_dsp [2019-10-02 04:20:29,789 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_init_stb [2019-10-02 04:20:29,789 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_init_dvb [2019-10-02 04:20:29,789 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2019-10-02 04:20:29,789 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_exit_dvb [2019-10-02 04:20:29,790 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2019-10-02 04:20:29,790 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-10-02 04:20:29,790 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_exit_rc [2019-10-02 04:20:29,790 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_exit_usb [2019-10-02 04:20:29,790 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_exit_tasklet [2019-10-02 04:20:29,790 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_init_filters [2019-10-02 04:20:29,790 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_exit_filters [2019-10-02 04:20:29,790 INFO L130 BoogieDeclarations]: Found specification of procedure fe_send_command [2019-10-02 04:20:29,791 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_probe [2019-10-02 04:20:29,791 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_disconnect [2019-10-02 04:20:29,791 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_init [2019-10-02 04:20:29,791 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_exit [2019-10-02 04:20:29,791 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-10-02 04:20:29,791 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2019-10-02 04:20:29,791 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-10-02 04:20:29,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 04:20:29,792 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 04:20:29,792 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2019-10-02 04:20:29,792 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2019-10-02 04:20:29,792 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2019-10-02 04:20:29,792 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-10-02 04:20:29,792 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-10-02 04:20:29,792 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-10-02 04:20:29,792 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-02 04:20:29,792 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 04:20:29,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 04:20:29,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 04:20:29,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-02 04:20:29,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 04:20:29,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-10-02 04:20:29,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-10-02 04:20:29,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-10-02 04:20:29,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-10-02 04:20:31,788 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 04:20:31,883 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2019-10-02 04:20:31,883 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2019-10-02 04:20:34,737 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 04:20:34,925 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-10-02 04:20:34,926 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-10-02 04:20:35,279 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2019-10-02 04:20:43,744 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 04:20:43,782 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-10-02 04:20:43,782 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-10-02 04:20:43,923 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 04:20:43,969 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume !false; [2019-10-02 04:20:43,970 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##13: assume false; [2019-10-02 04:20:43,970 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint L8641: #res := 0; [2019-10-02 04:20:44,214 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 04:20:44,391 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2019-10-02 04:20:44,392 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2019-10-02 04:20:44,910 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 04:20:45,010 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##39: assume !false; [2019-10-02 04:20:45,010 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume false; [2019-10-02 04:20:45,128 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 04:20:45,187 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-10-02 04:20:45,187 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-10-02 04:20:45,418 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 04:20:45,418 INFO L283 CfgBuilder]: Removed 47 assume(true) statements. [2019-10-02 04:20:45,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 04:20:45 BoogieIcfgContainer [2019-10-02 04:20:45,421 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 04:20:45,423 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 04:20:45,423 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 04:20:45,426 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 04:20:45,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 04:20:25" (1/3) ... [2019-10-02 04:20:45,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b36684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 04:20:45, skipping insertion in model container [2019-10-02 04:20:45,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:20:29" (2/3) ... [2019-10-02 04:20:45,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b36684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 04:20:45, skipping insertion in model container [2019-10-02 04:20:45,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 04:20:45" (3/3) ... [2019-10-02 04:20:45,430 INFO L109 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-media-dvb-ttusb-dec-ttusb_dec.ko.cil.out.i [2019-10-02 04:20:45,441 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 04:20:45,456 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 04:20:45,475 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 04:20:45,530 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 04:20:45,531 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 04:20:45,531 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 04:20:45,531 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 04:20:45,531 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 04:20:45,531 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 04:20:45,532 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 04:20:45,532 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 04:20:45,532 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 04:20:45,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states. [2019-10-02 04:20:45,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-02 04:20:45,594 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:20:45,595 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 04:20:45,597 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:20:45,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:20:45,603 INFO L82 PathProgramCache]: Analyzing trace with hash 236563377, now seen corresponding path program 1 times [2019-10-02 04:20:45,605 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:20:45,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:20:45,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:45,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:20:45,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:46,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:20:46,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 04:20:46,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:20:46,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 04:20:46,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 04:20:46,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 04:20:46,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 04:20:46,621 INFO L87 Difference]: Start difference. First operand 1460 states. Second operand 3 states. [2019-10-02 04:20:46,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:20:46,939 INFO L93 Difference]: Finished difference Result 3781 states and 5308 transitions. [2019-10-02 04:20:46,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 04:20:46,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-02 04:20:46,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:20:47,002 INFO L225 Difference]: With dead ends: 3781 [2019-10-02 04:20:47,002 INFO L226 Difference]: Without dead ends: 2506 [2019-10-02 04:20:47,022 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:20:47,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2019-10-02 04:20:47,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2502. [2019-10-02 04:20:47,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2502 states. [2019-10-02 04:20:47,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2502 states to 2502 states and 3239 transitions. [2019-10-02 04:20:47,316 INFO L78 Accepts]: Start accepts. Automaton has 2502 states and 3239 transitions. Word has length 30 [2019-10-02 04:20:47,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:20:47,317 INFO L475 AbstractCegarLoop]: Abstraction has 2502 states and 3239 transitions. [2019-10-02 04:20:47,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 04:20:47,317 INFO L276 IsEmpty]: Start isEmpty. Operand 2502 states and 3239 transitions. [2019-10-02 04:20:47,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-02 04:20:47,318 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:20:47,318 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 04:20:47,319 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:20:47,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:20:47,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1257087160, now seen corresponding path program 1 times [2019-10-02 04:20:47,319 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:20:47,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:20:47,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:47,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:20:47,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:20:47,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 04:20:47,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:20:47,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 04:20:47,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 04:20:47,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 04:20:47,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 04:20:47,724 INFO L87 Difference]: Start difference. First operand 2502 states and 3239 transitions. Second operand 3 states. [2019-10-02 04:20:47,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:20:47,916 INFO L93 Difference]: Finished difference Result 7451 states and 9739 transitions. [2019-10-02 04:20:47,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 04:20:47,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-02 04:20:47,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:20:47,956 INFO L225 Difference]: With dead ends: 7451 [2019-10-02 04:20:47,956 INFO L226 Difference]: Without dead ends: 4965 [2019-10-02 04:20:47,973 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:20:47,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4965 states. [2019-10-02 04:20:48,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4965 to 4958. [2019-10-02 04:20:48,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4958 states. [2019-10-02 04:20:48,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4958 states to 4958 states and 6466 transitions. [2019-10-02 04:20:48,191 INFO L78 Accepts]: Start accepts. Automaton has 4958 states and 6466 transitions. Word has length 31 [2019-10-02 04:20:48,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:20:48,192 INFO L475 AbstractCegarLoop]: Abstraction has 4958 states and 6466 transitions. [2019-10-02 04:20:48,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 04:20:48,192 INFO L276 IsEmpty]: Start isEmpty. Operand 4958 states and 6466 transitions. [2019-10-02 04:20:48,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-02 04:20:48,197 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:20:48,198 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:48,198 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:20:48,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:20:48,199 INFO L82 PathProgramCache]: Analyzing trace with hash -794338311, now seen corresponding path program 1 times [2019-10-02 04:20:48,199 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:20:48,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:20:48,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:48,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:20:48,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:48,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:20:48,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 04:20:48,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:20:48,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 04:20:48,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 04:20:48,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 04:20:48,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 04:20:48,674 INFO L87 Difference]: Start difference. First operand 4958 states and 6466 transitions. Second operand 5 states. [2019-10-02 04:20:48,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:20:48,941 INFO L93 Difference]: Finished difference Result 9894 states and 12909 transitions. [2019-10-02 04:20:48,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 04:20:48,941 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-10-02 04:20:48,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:20:48,979 INFO L225 Difference]: With dead ends: 9894 [2019-10-02 04:20:48,979 INFO L226 Difference]: Without dead ends: 4958 [2019-10-02 04:20:49,004 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 04:20:49,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4958 states. [2019-10-02 04:20:49,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4958 to 4958. [2019-10-02 04:20:49,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4958 states. [2019-10-02 04:20:49,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4958 states to 4958 states and 6465 transitions. [2019-10-02 04:20:49,200 INFO L78 Accepts]: Start accepts. Automaton has 4958 states and 6465 transitions. Word has length 97 [2019-10-02 04:20:49,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:20:49,201 INFO L475 AbstractCegarLoop]: Abstraction has 4958 states and 6465 transitions. [2019-10-02 04:20:49,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 04:20:49,201 INFO L276 IsEmpty]: Start isEmpty. Operand 4958 states and 6465 transitions. [2019-10-02 04:20:49,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-02 04:20:49,204 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:20:49,204 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:49,204 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:20:49,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:20:49,205 INFO L82 PathProgramCache]: Analyzing trace with hash 314476888, now seen corresponding path program 1 times [2019-10-02 04:20:49,205 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:20:49,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:20:49,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:49,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:20:49,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:49,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:20:49,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 04:20:49,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:20:49,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 04:20:49,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 04:20:49,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 04:20:49,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 04:20:49,543 INFO L87 Difference]: Start difference. First operand 4958 states and 6465 transitions. Second operand 5 states. [2019-10-02 04:20:49,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:20:49,828 INFO L93 Difference]: Finished difference Result 10008 states and 13085 transitions. [2019-10-02 04:20:49,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 04:20:49,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-10-02 04:20:49,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:20:49,862 INFO L225 Difference]: With dead ends: 10008 [2019-10-02 04:20:49,863 INFO L226 Difference]: Without dead ends: 5074 [2019-10-02 04:20:49,884 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-02 04:20:49,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5074 states. [2019-10-02 04:20:50,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5074 to 5029. [2019-10-02 04:20:50,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5029 states. [2019-10-02 04:20:50,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5029 states to 5029 states and 6566 transitions. [2019-10-02 04:20:50,080 INFO L78 Accepts]: Start accepts. Automaton has 5029 states and 6566 transitions. Word has length 97 [2019-10-02 04:20:50,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:20:50,081 INFO L475 AbstractCegarLoop]: Abstraction has 5029 states and 6566 transitions. [2019-10-02 04:20:50,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 04:20:50,081 INFO L276 IsEmpty]: Start isEmpty. Operand 5029 states and 6566 transitions. [2019-10-02 04:20:50,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-02 04:20:50,084 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:20:50,084 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 04:20:50,085 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:20:50,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:20:50,085 INFO L82 PathProgramCache]: Analyzing trace with hash -446864274, now seen corresponding path program 1 times [2019-10-02 04:20:50,085 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:20:50,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:20:50,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:50,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:20:50,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:20:50,509 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 04:20:50,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:20:50,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 04:20:50,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 04:20:50,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 04:20:50,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 04:20:50,511 INFO L87 Difference]: Start difference. First operand 5029 states and 6566 transitions. Second operand 6 states. [2019-10-02 04:21:10,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:21:10,321 INFO L93 Difference]: Finished difference Result 13881 states and 18954 transitions. [2019-10-02 04:21:10,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 04:21:10,322 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2019-10-02 04:21:10,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:21:10,400 INFO L225 Difference]: With dead ends: 13881 [2019-10-02 04:21:10,400 INFO L226 Difference]: Without dead ends: 8878 [2019-10-02 04:21:10,433 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-10-02 04:21:10,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8878 states. [2019-10-02 04:21:11,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8878 to 8424. [2019-10-02 04:21:11,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8424 states. [2019-10-02 04:21:11,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8424 states to 8424 states and 11471 transitions. [2019-10-02 04:21:11,121 INFO L78 Accepts]: Start accepts. Automaton has 8424 states and 11471 transitions. Word has length 140 [2019-10-02 04:21:11,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:21:11,121 INFO L475 AbstractCegarLoop]: Abstraction has 8424 states and 11471 transitions. [2019-10-02 04:21:11,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 04:21:11,122 INFO L276 IsEmpty]: Start isEmpty. Operand 8424 states and 11471 transitions. [2019-10-02 04:21:11,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-02 04:21:11,124 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:21:11,124 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 04:21:11,125 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:21:11,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:21:11,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1070145876, now seen corresponding path program 1 times [2019-10-02 04:21:11,125 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:21:11,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:21:11,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:21:11,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:21:11,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:21:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:21:11,661 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 04:21:11,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:21:11,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 04:21:11,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 04:21:11,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 04:21:11,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 04:21:11,664 INFO L87 Difference]: Start difference. First operand 8424 states and 11471 transitions. Second operand 5 states. [2019-10-02 04:21:25,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:21:25,264 INFO L93 Difference]: Finished difference Result 17529 states and 23986 transitions. [2019-10-02 04:21:25,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 04:21:25,265 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 140 [2019-10-02 04:21:25,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:21:25,325 INFO L225 Difference]: With dead ends: 17529 [2019-10-02 04:21:25,325 INFO L226 Difference]: Without dead ends: 9131 [2019-10-02 04:21:25,359 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 04:21:25,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9131 states. [2019-10-02 04:21:25,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9131 to 8826. [2019-10-02 04:21:25,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8826 states. [2019-10-02 04:21:25,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8826 states to 8826 states and 12019 transitions. [2019-10-02 04:21:25,737 INFO L78 Accepts]: Start accepts. Automaton has 8826 states and 12019 transitions. Word has length 140 [2019-10-02 04:21:25,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:21:25,737 INFO L475 AbstractCegarLoop]: Abstraction has 8826 states and 12019 transitions. [2019-10-02 04:21:25,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 04:21:25,738 INFO L276 IsEmpty]: Start isEmpty. Operand 8826 states and 12019 transitions. [2019-10-02 04:21:25,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-02 04:21:25,745 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:21:25,745 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 04:21:25,746 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:21:25,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:21:25,746 INFO L82 PathProgramCache]: Analyzing trace with hash 677867436, now seen corresponding path program 1 times [2019-10-02 04:21:25,746 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:21:25,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:21:25,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:21:25,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:21:25,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:21:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:21:26,087 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 04:21:26,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:21:26,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 04:21:26,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 04:21:26,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 04:21:26,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 04:21:26,089 INFO L87 Difference]: Start difference. First operand 8826 states and 12019 transitions. Second operand 3 states. [2019-10-02 04:21:26,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:21:26,383 INFO L93 Difference]: Finished difference Result 17691 states and 24689 transitions. [2019-10-02 04:21:26,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 04:21:26,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-10-02 04:21:26,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:21:26,444 INFO L225 Difference]: With dead ends: 17691 [2019-10-02 04:21:26,444 INFO L226 Difference]: Without dead ends: 8891 [2019-10-02 04:21:26,476 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:21:26,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8891 states. [2019-10-02 04:21:26,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8891 to 8852. [2019-10-02 04:21:26,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8852 states. [2019-10-02 04:21:26,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8852 states to 8852 states and 12045 transitions. [2019-10-02 04:21:26,927 INFO L78 Accepts]: Start accepts. Automaton has 8852 states and 12045 transitions. Word has length 147 [2019-10-02 04:21:26,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:21:26,931 INFO L475 AbstractCegarLoop]: Abstraction has 8852 states and 12045 transitions. [2019-10-02 04:21:26,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 04:21:26,931 INFO L276 IsEmpty]: Start isEmpty. Operand 8852 states and 12045 transitions. [2019-10-02 04:21:26,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 04:21:26,938 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:21:26,938 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 04:21:26,939 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:21:26,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:21:26,939 INFO L82 PathProgramCache]: Analyzing trace with hash 474308661, now seen corresponding path program 1 times [2019-10-02 04:21:26,940 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:21:26,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:21:26,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:21:26,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:21:26,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:21:27,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:21:27,472 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-02 04:21:27,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:21:27,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 04:21:27,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 04:21:27,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 04:21:27,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 04:21:27,475 INFO L87 Difference]: Start difference. First operand 8852 states and 12045 transitions. Second operand 5 states. [2019-10-02 04:21:27,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:21:27,720 INFO L93 Difference]: Finished difference Result 15165 states and 21051 transitions. [2019-10-02 04:21:27,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 04:21:27,721 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 158 [2019-10-02 04:21:27,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:21:27,760 INFO L225 Difference]: With dead ends: 15165 [2019-10-02 04:21:27,760 INFO L226 Difference]: Without dead ends: 6729 [2019-10-02 04:21:27,790 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 04:21:27,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6729 states. [2019-10-02 04:21:28,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6729 to 6729. [2019-10-02 04:21:28,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6729 states. [2019-10-02 04:21:28,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6729 states to 6729 states and 9091 transitions. [2019-10-02 04:21:28,243 INFO L78 Accepts]: Start accepts. Automaton has 6729 states and 9091 transitions. Word has length 158 [2019-10-02 04:21:28,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:21:28,244 INFO L475 AbstractCegarLoop]: Abstraction has 6729 states and 9091 transitions. [2019-10-02 04:21:28,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 04:21:28,244 INFO L276 IsEmpty]: Start isEmpty. Operand 6729 states and 9091 transitions. [2019-10-02 04:21:28,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-02 04:21:28,248 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:21:28,248 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-10-02 04:21:28,248 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:21:28,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:21:28,249 INFO L82 PathProgramCache]: Analyzing trace with hash -196661398, now seen corresponding path program 1 times [2019-10-02 04:21:28,249 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:21:28,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:21:28,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:21:28,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:21:28,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:21:28,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:21:28,672 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 04:21:28,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:21:28,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 04:21:28,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 04:21:28,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 04:21:28,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 04:21:28,675 INFO L87 Difference]: Start difference. First operand 6729 states and 9091 transitions. Second operand 5 states. [2019-10-02 04:21:29,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:21:29,478 INFO L93 Difference]: Finished difference Result 6793 states and 9157 transitions. [2019-10-02 04:21:29,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 04:21:29,479 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2019-10-02 04:21:29,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:21:29,516 INFO L225 Difference]: With dead ends: 6793 [2019-10-02 04:21:29,516 INFO L226 Difference]: Without dead ends: 6770 [2019-10-02 04:21:29,521 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:21:29,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6770 states. [2019-10-02 04:21:29,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6770 to 6741. [2019-10-02 04:21:29,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6741 states. [2019-10-02 04:21:29,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6741 states to 6741 states and 9103 transitions. [2019-10-02 04:21:29,841 INFO L78 Accepts]: Start accepts. Automaton has 6741 states and 9103 transitions. Word has length 156 [2019-10-02 04:21:29,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:21:29,842 INFO L475 AbstractCegarLoop]: Abstraction has 6741 states and 9103 transitions. [2019-10-02 04:21:29,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 04:21:29,842 INFO L276 IsEmpty]: Start isEmpty. Operand 6741 states and 9103 transitions. [2019-10-02 04:21:29,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-02 04:21:29,845 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:21:29,845 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:29,846 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:21:29,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:21:29,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1800534010, now seen corresponding path program 1 times [2019-10-02 04:21:29,846 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:21:29,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:21:29,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:21:29,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:21:29,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:21:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:21:30,258 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-02 04:21:30,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:21:30,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 04:21:30,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 04:21:30,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 04:21:30,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 04:21:30,261 INFO L87 Difference]: Start difference. First operand 6741 states and 9103 transitions. Second operand 5 states. [2019-10-02 04:21:38,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:21:38,563 INFO L93 Difference]: Finished difference Result 13575 states and 18717 transitions. [2019-10-02 04:21:38,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 04:21:38,564 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155 [2019-10-02 04:21:38,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:21:38,606 INFO L225 Difference]: With dead ends: 13575 [2019-10-02 04:21:38,606 INFO L226 Difference]: Without dead ends: 6860 [2019-10-02 04:21:38,635 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:21:38,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6860 states. [2019-10-02 04:21:39,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6860 to 6741. [2019-10-02 04:21:39,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6741 states. [2019-10-02 04:21:39,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6741 states to 6741 states and 9099 transitions. [2019-10-02 04:21:39,072 INFO L78 Accepts]: Start accepts. Automaton has 6741 states and 9099 transitions. Word has length 155 [2019-10-02 04:21:39,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:21:39,073 INFO L475 AbstractCegarLoop]: Abstraction has 6741 states and 9099 transitions. [2019-10-02 04:21:39,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 04:21:39,074 INFO L276 IsEmpty]: Start isEmpty. Operand 6741 states and 9099 transitions. [2019-10-02 04:21:39,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-02 04:21:39,076 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:21:39,077 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:39,077 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:21:39,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:21:39,078 INFO L82 PathProgramCache]: Analyzing trace with hash -262193980, now seen corresponding path program 1 times [2019-10-02 04:21:39,078 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:21:39,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:21:39,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:21:39,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:21:39,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:21:39,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:21:39,478 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-02 04:21:39,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:21:39,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 04:21:39,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 04:21:39,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 04:21:39,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 04:21:39,480 INFO L87 Difference]: Start difference. First operand 6741 states and 9099 transitions. Second operand 5 states. [2019-10-02 04:21:42,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:21:42,336 INFO L93 Difference]: Finished difference Result 13092 states and 17651 transitions. [2019-10-02 04:21:42,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 04:21:42,336 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155 [2019-10-02 04:21:42,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:21:42,375 INFO L225 Difference]: With dead ends: 13092 [2019-10-02 04:21:42,376 INFO L226 Difference]: Without dead ends: 6357 [2019-10-02 04:21:42,402 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 04:21:42,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6357 states. [2019-10-02 04:21:42,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6357 to 6308. [2019-10-02 04:21:42,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6308 states. [2019-10-02 04:21:42,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6308 states to 6308 states and 8486 transitions. [2019-10-02 04:21:42,733 INFO L78 Accepts]: Start accepts. Automaton has 6308 states and 8486 transitions. Word has length 155 [2019-10-02 04:21:42,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:21:42,734 INFO L475 AbstractCegarLoop]: Abstraction has 6308 states and 8486 transitions. [2019-10-02 04:21:42,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 04:21:42,735 INFO L276 IsEmpty]: Start isEmpty. Operand 6308 states and 8486 transitions. [2019-10-02 04:21:42,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 04:21:42,739 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:21:42,740 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 04:21:42,740 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:21:42,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:21:42,741 INFO L82 PathProgramCache]: Analyzing trace with hash 485624788, now seen corresponding path program 1 times [2019-10-02 04:21:42,741 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:21:42,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:21:42,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:21:42,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:21:42,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:21:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:21:43,261 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-02 04:21:43,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:21:43,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 04:21:43,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 04:21:43,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 04:21:43,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 04:21:43,263 INFO L87 Difference]: Start difference. First operand 6308 states and 8486 transitions. Second operand 6 states. [2019-10-02 04:22:08,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:22:08,145 INFO L93 Difference]: Finished difference Result 11946 states and 17304 transitions. [2019-10-02 04:22:08,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 04:22:08,146 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 158 [2019-10-02 04:22:08,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:22:08,210 INFO L225 Difference]: With dead ends: 11946 [2019-10-02 04:22:08,210 INFO L226 Difference]: Without dead ends: 11941 [2019-10-02 04:22:08,222 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-02 04:22:08,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11941 states. [2019-10-02 04:22:08,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11941 to 11757. [2019-10-02 04:22:08,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11757 states. [2019-10-02 04:22:08,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11757 states to 11757 states and 16787 transitions. [2019-10-02 04:22:08,801 INFO L78 Accepts]: Start accepts. Automaton has 11757 states and 16787 transitions. Word has length 158 [2019-10-02 04:22:08,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:22:08,802 INFO L475 AbstractCegarLoop]: Abstraction has 11757 states and 16787 transitions. [2019-10-02 04:22:08,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 04:22:08,802 INFO L276 IsEmpty]: Start isEmpty. Operand 11757 states and 16787 transitions. [2019-10-02 04:22:08,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-02 04:22:08,805 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:22:08,805 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-10-02 04:22:08,806 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:22:08,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:22:08,806 INFO L82 PathProgramCache]: Analyzing trace with hash -606959199, now seen corresponding path program 1 times [2019-10-02 04:22:08,806 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:22:08,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:22:08,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:22:08,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:22:08,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:22:08,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:22:09,149 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 04:22:09,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 04:22:09,150 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:22:09,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:22:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:22:10,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 3964 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 04:22:10,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 04:22:10,746 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 04:22:10,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 04:22:10,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2019-10-02 04:22:10,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 04:22:10,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 04:22:10,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 04:22:10,780 INFO L87 Difference]: Start difference. First operand 11757 states and 16787 transitions. Second operand 5 states. [2019-10-02 04:22:11,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:22:11,491 INFO L93 Difference]: Finished difference Result 23442 states and 33495 transitions. [2019-10-02 04:22:11,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 04:22:11,492 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 160 [2019-10-02 04:22:11,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:22:11,578 INFO L225 Difference]: With dead ends: 23442 [2019-10-02 04:22:11,579 INFO L226 Difference]: Without dead ends: 11712 [2019-10-02 04:22:11,642 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 160 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:22:11,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11712 states. [2019-10-02 04:22:12,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11712 to 11712. [2019-10-02 04:22:12,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11712 states. [2019-10-02 04:22:12,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11712 states to 11712 states and 16704 transitions. [2019-10-02 04:22:12,307 INFO L78 Accepts]: Start accepts. Automaton has 11712 states and 16704 transitions. Word has length 160 [2019-10-02 04:22:12,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:22:12,307 INFO L475 AbstractCegarLoop]: Abstraction has 11712 states and 16704 transitions. [2019-10-02 04:22:12,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 04:22:12,308 INFO L276 IsEmpty]: Start isEmpty. Operand 11712 states and 16704 transitions. [2019-10-02 04:22:12,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-10-02 04:22:12,313 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:22:12,314 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 04:22:12,314 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:22:12,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:22:12,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1384632659, now seen corresponding path program 1 times [2019-10-02 04:22:12,315 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:22:12,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:22:12,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:22:12,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:22:12,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:22:12,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:22:12,981 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 04:22:12,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:22:12,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 04:22:12,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 04:22:12,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 04:22:12,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 04:22:12,984 INFO L87 Difference]: Start difference. First operand 11712 states and 16704 transitions. Second operand 7 states. [2019-10-02 04:22:13,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:22:13,519 INFO L93 Difference]: Finished difference Result 23387 states and 34838 transitions. [2019-10-02 04:22:13,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 04:22:13,520 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 186 [2019-10-02 04:22:13,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:22:13,598 INFO L225 Difference]: With dead ends: 23387 [2019-10-02 04:22:13,598 INFO L226 Difference]: Without dead ends: 11747 [2019-10-02 04:22:13,659 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:22:13,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11747 states. [2019-10-02 04:22:14,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11747 to 11747. [2019-10-02 04:22:14,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11747 states. [2019-10-02 04:22:14,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11747 states to 11747 states and 16739 transitions. [2019-10-02 04:22:14,268 INFO L78 Accepts]: Start accepts. Automaton has 11747 states and 16739 transitions. Word has length 186 [2019-10-02 04:22:14,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:22:14,268 INFO L475 AbstractCegarLoop]: Abstraction has 11747 states and 16739 transitions. [2019-10-02 04:22:14,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 04:22:14,269 INFO L276 IsEmpty]: Start isEmpty. Operand 11747 states and 16739 transitions. [2019-10-02 04:22:14,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-10-02 04:22:14,276 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:22:14,277 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:14,277 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:22:14,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:22:14,278 INFO L82 PathProgramCache]: Analyzing trace with hash -232880365, now seen corresponding path program 1 times [2019-10-02 04:22:14,278 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:22:14,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:22:14,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:22:14,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:22:14,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:22:14,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:22:14,722 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-02 04:22:14,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:22:14,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 04:22:14,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 04:22:14,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 04:22:14,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 04:22:14,726 INFO L87 Difference]: Start difference. First operand 11747 states and 16739 transitions. Second operand 6 states. [2019-10-02 04:22:30,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:22:30,412 INFO L93 Difference]: Finished difference Result 24474 states and 36698 transitions. [2019-10-02 04:22:30,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 04:22:30,413 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 203 [2019-10-02 04:22:30,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:22:30,498 INFO L225 Difference]: With dead ends: 24474 [2019-10-02 04:22:30,499 INFO L226 Difference]: Without dead ends: 12799 [2019-10-02 04:22:30,558 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-02 04:22:30,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12799 states. [2019-10-02 04:22:31,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12799 to 12246. [2019-10-02 04:22:31,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12246 states. [2019-10-02 04:22:31,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12246 states to 12246 states and 17486 transitions. [2019-10-02 04:22:31,248 INFO L78 Accepts]: Start accepts. Automaton has 12246 states and 17486 transitions. Word has length 203 [2019-10-02 04:22:31,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:22:31,250 INFO L475 AbstractCegarLoop]: Abstraction has 12246 states and 17486 transitions. [2019-10-02 04:22:31,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 04:22:31,251 INFO L276 IsEmpty]: Start isEmpty. Operand 12246 states and 17486 transitions. [2019-10-02 04:22:31,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-10-02 04:22:31,265 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:22:31,266 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:31,267 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:22:31,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:22:31,267 INFO L82 PathProgramCache]: Analyzing trace with hash 2138858897, now seen corresponding path program 1 times [2019-10-02 04:22:31,267 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:22:31,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:22:31,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:22:31,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:22:31,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:22:31,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:22:31,747 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-02 04:22:31,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:22:31,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 04:22:31,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 04:22:31,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 04:22:31,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 04:22:31,749 INFO L87 Difference]: Start difference. First operand 12246 states and 17486 transitions. Second operand 5 states. [2019-10-02 04:22:32,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:22:32,544 INFO L93 Difference]: Finished difference Result 24530 states and 36551 transitions. [2019-10-02 04:22:32,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 04:22:32,545 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 203 [2019-10-02 04:22:32,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:22:32,626 INFO L225 Difference]: With dead ends: 24530 [2019-10-02 04:22:32,627 INFO L226 Difference]: Without dead ends: 12356 [2019-10-02 04:22:32,680 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 04:22:32,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12356 states. [2019-10-02 04:22:33,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12356 to 12320. [2019-10-02 04:22:33,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12320 states. [2019-10-02 04:22:33,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12320 states to 12320 states and 17617 transitions. [2019-10-02 04:22:33,280 INFO L78 Accepts]: Start accepts. Automaton has 12320 states and 17617 transitions. Word has length 203 [2019-10-02 04:22:33,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:22:33,281 INFO L475 AbstractCegarLoop]: Abstraction has 12320 states and 17617 transitions. [2019-10-02 04:22:33,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 04:22:33,281 INFO L276 IsEmpty]: Start isEmpty. Operand 12320 states and 17617 transitions. [2019-10-02 04:22:33,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-02 04:22:33,291 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:22:33,291 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 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] [2019-10-02 04:22:33,291 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:22:33,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:22:33,292 INFO L82 PathProgramCache]: Analyzing trace with hash 92146612, now seen corresponding path program 1 times [2019-10-02 04:22:33,292 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:22:33,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:22:33,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:22:33,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:22:33,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:22:33,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:22:33,706 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-02 04:22:33,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:22:33,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 04:22:33,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 04:22:33,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 04:22:33,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 04:22:33,708 INFO L87 Difference]: Start difference. First operand 12320 states and 17617 transitions. Second operand 5 states. [2019-10-02 04:22:34,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:22:34,191 INFO L93 Difference]: Finished difference Result 22288 states and 32985 transitions. [2019-10-02 04:22:34,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 04:22:34,192 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 204 [2019-10-02 04:22:34,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:22:34,279 INFO L225 Difference]: With dead ends: 22288 [2019-10-02 04:22:34,280 INFO L226 Difference]: Without dead ends: 12316 [2019-10-02 04:22:34,326 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 04:22:34,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12316 states. [2019-10-02 04:22:34,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12316 to 12316. [2019-10-02 04:22:34,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12316 states. [2019-10-02 04:22:35,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12316 states to 12316 states and 17607 transitions. [2019-10-02 04:22:35,006 INFO L78 Accepts]: Start accepts. Automaton has 12316 states and 17607 transitions. Word has length 204 [2019-10-02 04:22:35,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:22:35,007 INFO L475 AbstractCegarLoop]: Abstraction has 12316 states and 17607 transitions. [2019-10-02 04:22:35,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 04:22:35,007 INFO L276 IsEmpty]: Start isEmpty. Operand 12316 states and 17607 transitions. [2019-10-02 04:22:35,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-10-02 04:22:35,013 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:22:35,014 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-10-02 04:22:35,014 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:22:35,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:22:35,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1633221140, now seen corresponding path program 1 times [2019-10-02 04:22:35,015 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:22:35,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:22:35,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:22:35,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:22:35,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:22:35,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:22:35,400 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 04:22:35,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:22:35,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 04:22:35,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 04:22:35,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 04:22:35,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 04:22:35,406 INFO L87 Difference]: Start difference. First operand 12316 states and 17607 transitions. Second operand 6 states. [2019-10-02 04:22:36,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:22:36,099 INFO L93 Difference]: Finished difference Result 24595 states and 36662 transitions. [2019-10-02 04:22:36,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 04:22:36,100 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 214 [2019-10-02 04:22:36,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:22:36,170 INFO L225 Difference]: With dead ends: 24595 [2019-10-02 04:22:36,171 INFO L226 Difference]: Without dead ends: 12351 [2019-10-02 04:22:36,213 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 04:22:36,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12351 states. [2019-10-02 04:22:36,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12351 to 12341. [2019-10-02 04:22:36,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12341 states. [2019-10-02 04:22:36,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12341 states to 12341 states and 17632 transitions. [2019-10-02 04:22:36,750 INFO L78 Accepts]: Start accepts. Automaton has 12341 states and 17632 transitions. Word has length 214 [2019-10-02 04:22:36,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:22:36,750 INFO L475 AbstractCegarLoop]: Abstraction has 12341 states and 17632 transitions. [2019-10-02 04:22:36,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 04:22:36,751 INFO L276 IsEmpty]: Start isEmpty. Operand 12341 states and 17632 transitions. [2019-10-02 04:22:36,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-10-02 04:22:36,761 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:22:36,761 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-10-02 04:22:36,762 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:22:36,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:22:36,762 INFO L82 PathProgramCache]: Analyzing trace with hash -609207067, now seen corresponding path program 1 times [2019-10-02 04:22:36,762 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:22:36,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:22:36,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:22:36,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:22:36,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:22:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:22:37,140 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 04:22:37,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:22:37,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 04:22:37,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 04:22:37,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 04:22:37,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 04:22:37,143 INFO L87 Difference]: Start difference. First operand 12341 states and 17632 transitions. Second operand 4 states. [2019-10-02 04:22:37,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:22:37,498 INFO L93 Difference]: Finished difference Result 24625 states and 36672 transitions. [2019-10-02 04:22:37,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 04:22:37,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 215 [2019-10-02 04:22:37,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:22:37,558 INFO L225 Difference]: With dead ends: 24625 [2019-10-02 04:22:37,559 INFO L226 Difference]: Without dead ends: 12346 [2019-10-02 04:22:37,607 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:22:37,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12346 states. [2019-10-02 04:22:38,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12346 to 12346. [2019-10-02 04:22:38,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12346 states. [2019-10-02 04:22:38,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12346 states to 12346 states and 17637 transitions. [2019-10-02 04:22:38,135 INFO L78 Accepts]: Start accepts. Automaton has 12346 states and 17637 transitions. Word has length 215 [2019-10-02 04:22:38,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:22:38,136 INFO L475 AbstractCegarLoop]: Abstraction has 12346 states and 17637 transitions. [2019-10-02 04:22:38,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 04:22:38,136 INFO L276 IsEmpty]: Start isEmpty. Operand 12346 states and 17637 transitions. [2019-10-02 04:22:38,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-10-02 04:22:38,142 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:22:38,143 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 04:22:38,143 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:22:38,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:22:38,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1538395129, now seen corresponding path program 1 times [2019-10-02 04:22:38,143 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:22:38,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:22:38,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:22:38,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:22:38,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:22:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:22:38,614 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 04:22:38,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 04:22:38,614 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:22:38,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:22:40,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:22:40,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 4286 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 04:22:40,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 04:22:40,445 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 04:22:40,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 04:22:40,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-02 04:22:40,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 04:22:40,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 04:22:40,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 04:22:40,476 INFO L87 Difference]: Start difference. First operand 12346 states and 17637 transitions. Second operand 6 states. [2019-10-02 04:22:40,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:22:40,773 INFO L93 Difference]: Finished difference Result 24635 states and 36682 transitions. [2019-10-02 04:22:40,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 04:22:40,773 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 216 [2019-10-02 04:22:40,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:22:40,821 INFO L225 Difference]: With dead ends: 24635 [2019-10-02 04:22:40,821 INFO L226 Difference]: Without dead ends: 12351 [2019-10-02 04:22:40,856 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-10-02 04:22:40,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12351 states. [2019-10-02 04:22:41,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12351 to 12351. [2019-10-02 04:22:41,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12351 states. [2019-10-02 04:22:41,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12351 states to 12351 states and 17642 transitions. [2019-10-02 04:22:41,426 INFO L78 Accepts]: Start accepts. Automaton has 12351 states and 17642 transitions. Word has length 216 [2019-10-02 04:22:41,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:22:41,426 INFO L475 AbstractCegarLoop]: Abstraction has 12351 states and 17642 transitions. [2019-10-02 04:22:41,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 04:22:41,427 INFO L276 IsEmpty]: Start isEmpty. Operand 12351 states and 17642 transitions. [2019-10-02 04:22:41,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-10-02 04:22:41,436 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:22:41,437 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 04:22:41,437 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:22:41,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:22:41,437 INFO L82 PathProgramCache]: Analyzing trace with hash -605413531, now seen corresponding path program 2 times [2019-10-02 04:22:41,438 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:22:41,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:22:41,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:22:41,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:22:41,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:22:41,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:22:41,854 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 04:22:41,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 04:22:41,854 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:22:42,239 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 04:22:55,524 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 04:22:55,524 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 04:22:55,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 4292 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 04:22:55,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 04:22:55,691 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 04:22:55,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 04:22:55,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-10-02 04:22:55,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 04:22:55,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 04:22:55,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 04:22:55,729 INFO L87 Difference]: Start difference. First operand 12351 states and 17642 transitions. Second operand 7 states. [2019-10-02 04:22:56,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:22:56,268 INFO L93 Difference]: Finished difference Result 24645 states and 36692 transitions. [2019-10-02 04:22:56,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 04:22:56,268 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 217 [2019-10-02 04:22:56,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:22:56,311 INFO L225 Difference]: With dead ends: 24645 [2019-10-02 04:22:56,311 INFO L226 Difference]: Without dead ends: 12356 [2019-10-02 04:22:56,342 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-02 04:22:56,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12356 states. [2019-10-02 04:22:56,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12356 to 12356. [2019-10-02 04:22:56,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12356 states. [2019-10-02 04:22:56,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12356 states to 12356 states and 17647 transitions. [2019-10-02 04:22:56,774 INFO L78 Accepts]: Start accepts. Automaton has 12356 states and 17647 transitions. Word has length 217 [2019-10-02 04:22:56,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:22:56,775 INFO L475 AbstractCegarLoop]: Abstraction has 12356 states and 17647 transitions. [2019-10-02 04:22:56,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 04:22:56,775 INFO L276 IsEmpty]: Start isEmpty. Operand 12356 states and 17647 transitions. [2019-10-02 04:22:56,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-10-02 04:22:56,780 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:22:56,780 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 04:22:56,780 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:22:56,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:22:56,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1655994745, now seen corresponding path program 3 times [2019-10-02 04:22:56,781 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:22:56,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:22:56,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:22:56,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 04:22:56,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:22:57,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:22:57,370 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 04:22:57,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 04:22:57,370 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:22:57,731 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 04:23:35,266 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-02 04:23:35,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 04:23:35,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 4246 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 04:23:35,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 04:23:35,630 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 04:23:35,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 04:23:35,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-02 04:23:35,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 04:23:35,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 04:23:35,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-02 04:23:35,688 INFO L87 Difference]: Start difference. First operand 12356 states and 17647 transitions. Second operand 8 states. [2019-10-02 04:23:36,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:23:36,066 INFO L93 Difference]: Finished difference Result 24655 states and 36702 transitions. [2019-10-02 04:23:36,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 04:23:36,067 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 218 [2019-10-02 04:23:36,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:23:36,116 INFO L225 Difference]: With dead ends: 24655 [2019-10-02 04:23:36,116 INFO L226 Difference]: Without dead ends: 12361 [2019-10-02 04:23:36,152 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 04:23:36,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12361 states. [2019-10-02 04:23:36,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12361 to 12361. [2019-10-02 04:23:36,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12361 states. [2019-10-02 04:23:36,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12361 states to 12361 states and 17652 transitions. [2019-10-02 04:23:36,533 INFO L78 Accepts]: Start accepts. Automaton has 12361 states and 17652 transitions. Word has length 218 [2019-10-02 04:23:36,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:23:36,533 INFO L475 AbstractCegarLoop]: Abstraction has 12361 states and 17652 transitions. [2019-10-02 04:23:36,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 04:23:36,533 INFO L276 IsEmpty]: Start isEmpty. Operand 12361 states and 17652 transitions. [2019-10-02 04:23:36,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-10-02 04:23:36,538 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:23:36,538 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 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] [2019-10-02 04:23:36,539 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:23:36,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:23:36,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1254792731, now seen corresponding path program 4 times [2019-10-02 04:23:36,539 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:23:36,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:23:36,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:23:36,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 04:23:36,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:23:36,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:23:37,300 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 04:23:37,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 04:23:37,301 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:23:37,672 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 04:23:38,809 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 04:23:38,809 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 04:23:38,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 4304 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 04:23:38,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 04:23:38,913 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 04:23:38,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 04:23:38,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-10-02 04:23:38,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 04:23:38,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 04:23:38,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-10-02 04:23:38,946 INFO L87 Difference]: Start difference. First operand 12361 states and 17652 transitions. Second operand 9 states. [2019-10-02 04:23:39,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:23:39,537 INFO L93 Difference]: Finished difference Result 24665 states and 36712 transitions. [2019-10-02 04:23:39,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 04:23:39,538 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 219 [2019-10-02 04:23:39,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:23:39,617 INFO L225 Difference]: With dead ends: 24665 [2019-10-02 04:23:39,617 INFO L226 Difference]: Without dead ends: 12366 [2019-10-02 04:23:39,680 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-10-02 04:23:39,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12366 states. [2019-10-02 04:23:40,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12366 to 12366. [2019-10-02 04:23:40,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12366 states. [2019-10-02 04:23:40,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12366 states to 12366 states and 17657 transitions. [2019-10-02 04:23:40,196 INFO L78 Accepts]: Start accepts. Automaton has 12366 states and 17657 transitions. Word has length 219 [2019-10-02 04:23:40,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:23:40,197 INFO L475 AbstractCegarLoop]: Abstraction has 12366 states and 17657 transitions. [2019-10-02 04:23:40,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 04:23:40,197 INFO L276 IsEmpty]: Start isEmpty. Operand 12366 states and 17657 transitions. [2019-10-02 04:23:40,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-10-02 04:23:40,202 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:23:40,203 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 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] [2019-10-02 04:23:40,203 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:23:40,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:23:40,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1294891271, now seen corresponding path program 5 times [2019-10-02 04:23:40,203 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:23:40,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:23:40,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:23:40,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 04:23:40,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:23:40,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:23:40,681 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 04:23:40,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 04:23:40,681 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:23:41,082 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 04:23:41,681 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-10-02 04:23:41,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 04:23:41,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 04:23:41,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 04:23:41,741 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 04:23:41,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 04:23:41,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-10-02 04:23:41,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 04:23:41,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 04:23:41,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-10-02 04:23:41,754 INFO L87 Difference]: Start difference. First operand 12366 states and 17657 transitions. Second operand 10 states. [2019-10-02 04:23:42,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:23:42,095 INFO L93 Difference]: Finished difference Result 24675 states and 36722 transitions. [2019-10-02 04:23:42,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 04:23:42,096 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 220 [2019-10-02 04:23:42,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:23:42,401 INFO L225 Difference]: With dead ends: 24675 [2019-10-02 04:23:42,402 INFO L226 Difference]: Without dead ends: 12371 [2019-10-02 04:23:42,429 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-10-02 04:23:42,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12371 states. [2019-10-02 04:23:42,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12371 to 12371. [2019-10-02 04:23:42,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12371 states. [2019-10-02 04:23:42,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12371 states to 12371 states and 17662 transitions. [2019-10-02 04:23:42,781 INFO L78 Accepts]: Start accepts. Automaton has 12371 states and 17662 transitions. Word has length 220 [2019-10-02 04:23:42,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:23:42,782 INFO L475 AbstractCegarLoop]: Abstraction has 12371 states and 17662 transitions. [2019-10-02 04:23:42,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 04:23:42,782 INFO L276 IsEmpty]: Start isEmpty. Operand 12371 states and 17662 transitions. [2019-10-02 04:23:42,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-10-02 04:23:42,788 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:23:42,788 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:42,789 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:23:42,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:23:42,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1662075891, now seen corresponding path program 1 times [2019-10-02 04:23:42,789 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:23:42,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:23:42,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:23:42,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 04:23:42,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:23:42,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:23:45,911 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-02 04:23:45,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:23:45,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-10-02 04:23:45,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 04:23:45,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 04:23:45,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-10-02 04:23:45,912 INFO L87 Difference]: Start difference. First operand 12371 states and 17662 transitions. Second operand 16 states. [2019-10-02 04:24:28,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:24:28,298 INFO L93 Difference]: Finished difference Result 27701 states and 39823 transitions. [2019-10-02 04:24:28,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 04:24:28,299 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 216 [2019-10-02 04:24:28,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:24:28,351 INFO L225 Difference]: With dead ends: 27701 [2019-10-02 04:24:28,351 INFO L226 Difference]: Without dead ends: 15402 [2019-10-02 04:24:28,374 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2019-10-02 04:24:28,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15402 states. [2019-10-02 04:24:28,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15402 to 14785. [2019-10-02 04:24:28,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14785 states. [2019-10-02 04:24:28,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14785 states to 14785 states and 21217 transitions. [2019-10-02 04:24:28,818 INFO L78 Accepts]: Start accepts. Automaton has 14785 states and 21217 transitions. Word has length 216 [2019-10-02 04:24:28,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:24:28,819 INFO L475 AbstractCegarLoop]: Abstraction has 14785 states and 21217 transitions. [2019-10-02 04:24:28,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 04:24:28,819 INFO L276 IsEmpty]: Start isEmpty. Operand 14785 states and 21217 transitions. [2019-10-02 04:24:28,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-10-02 04:24:28,826 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:24:28,827 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:28,827 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:24:28,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:24:28,827 INFO L82 PathProgramCache]: Analyzing trace with hash -749318817, now seen corresponding path program 1 times [2019-10-02 04:24:28,827 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:24:28,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:24:28,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:24:28,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:24:28,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:24:28,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:24:29,118 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-02 04:24:29,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:24:29,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 04:24:29,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 04:24:29,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 04:24:29,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 04:24:29,121 INFO L87 Difference]: Start difference. First operand 14785 states and 21217 transitions. Second operand 4 states. [2019-10-02 04:24:29,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:24:29,759 INFO L93 Difference]: Finished difference Result 29538 states and 44112 transitions. [2019-10-02 04:24:29,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 04:24:29,759 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 219 [2019-10-02 04:24:29,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:24:29,810 INFO L225 Difference]: With dead ends: 29538 [2019-10-02 04:24:29,810 INFO L226 Difference]: Without dead ends: 14825 [2019-10-02 04:24:29,851 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:24:29,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14825 states. [2019-10-02 04:24:30,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14825 to 14825. [2019-10-02 04:24:30,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14825 states. [2019-10-02 04:24:30,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14825 states to 14825 states and 21247 transitions. [2019-10-02 04:24:30,262 INFO L78 Accepts]: Start accepts. Automaton has 14825 states and 21247 transitions. Word has length 219 [2019-10-02 04:24:30,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:24:30,263 INFO L475 AbstractCegarLoop]: Abstraction has 14825 states and 21247 transitions. [2019-10-02 04:24:30,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 04:24:30,263 INFO L276 IsEmpty]: Start isEmpty. Operand 14825 states and 21247 transitions. [2019-10-02 04:24:30,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-10-02 04:24:30,269 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:24:30,269 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:30,269 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:24:30,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:24:30,270 INFO L82 PathProgramCache]: Analyzing trace with hash -473807311, now seen corresponding path program 1 times [2019-10-02 04:24:30,270 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:24:30,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:24:30,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:24:30,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:24:30,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:24:30,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:24:33,981 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-02 04:24:33,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 04:24:33,981 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:24:34,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:24:40,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:24:40,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 4193 conjuncts, 38 conjunts are in the unsatisfiable core [2019-10-02 04:24:40,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 04:24:40,536 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 04:24:40,538 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 160682 treesize of output 160642 [2019-10-02 04:24:40,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 04:24:40,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 04:24:40,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 04:24:40,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 04:24:40,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 04:24:40,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 04:24:40,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 04:24:40,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 04:24:40,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 04:24:40,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 04:24:40,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 04:24:40,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 04:24:40,696 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 04:24:54,735 WARN L191 SmtUtils]: Spent 14.04 s on a formula simplification. DAG size of input: 593 DAG size of output: 481 [2019-10-02 04:24:54,736 INFO L567 ElimStorePlain]: treesize reduction 2241572, result has 0.0 percent of original size [2019-10-02 04:24:54,755 INFO L496 ElimStorePlain]: Start of recursive call 1: 150 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 04:24:54,756 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 151 variables, input treesize:492, output treesize:12 [2019-10-02 04:24:54,773 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-10-02 04:24:54,774 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 04:24:54,797 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 04:24:54,797 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 04:24:54,797 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:8 [2019-10-02 04:24:58,499 WARN L191 SmtUtils]: Spent 1.12 s on a formula simplification that was a NOOP. DAG size: 18 [2019-10-02 04:25:02,922 WARN L191 SmtUtils]: Spent 995.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-10-02 04:25:03,000 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 04:25:03,000 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 48 [2019-10-02 04:25:03,001 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 04:25:03,055 INFO L567 ElimStorePlain]: treesize reduction 18, result has 63.3 percent of original size [2019-10-02 04:25:03,056 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 04:25:03,057 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:25, output treesize:4 [2019-10-02 04:25:08,770 WARN L191 SmtUtils]: Spent 1.40 s on a formula simplification that was a NOOP. DAG size: 28 [2019-10-02 04:25:08,872 INFO L341 Elim1Store]: treesize reduction 53, result has 50.5 percent of original size [2019-10-02 04:25:08,873 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 66 [2019-10-02 04:25:08,874 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 04:25:08,950 INFO L567 ElimStorePlain]: treesize reduction 18, result has 73.1 percent of original size [2019-10-02 04:25:08,951 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 04:25:08,951 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:30, output treesize:4 [2019-10-02 04:25:17,285 WARN L191 SmtUtils]: Spent 1.16 s on a formula simplification that was a NOOP. DAG size: 32 [2019-10-02 04:25:17,449 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 36 [2019-10-02 04:25:17,449 INFO L341 Elim1Store]: treesize reduction 147, result has 32.9 percent of original size [2019-10-02 04:25:17,450 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 84 [2019-10-02 04:25:17,451 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 04:25:17,543 INFO L567 ElimStorePlain]: treesize reduction 18, result has 78.8 percent of original size [2019-10-02 04:25:17,544 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 04:25:17,544 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:35, output treesize:4 [2019-10-02 04:25:29,388 WARN L191 SmtUtils]: Spent 1.65 s on a formula simplification that was a NOOP. DAG size: 36 [2019-10-02 04:25:29,596 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 43 [2019-10-02 04:25:29,596 INFO L341 Elim1Store]: treesize reduction 289, result has 23.7 percent of original size [2019-10-02 04:25:29,597 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 102 [2019-10-02 04:25:29,598 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 04:25:29,713 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-10-02 04:25:29,714 INFO L567 ElimStorePlain]: treesize reduction 18, result has 82.5 percent of original size [2019-10-02 04:25:29,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 04:25:29,716 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:40, output treesize:4 [2019-10-02 04:25:45,405 WARN L191 SmtUtils]: Spent 1.69 s on a formula simplification that was a NOOP. DAG size: 40 [2019-10-02 04:25:45,667 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 50 [2019-10-02 04:25:45,667 INFO L341 Elim1Store]: treesize reduction 486, result has 18.2 percent of original size [2019-10-02 04:25:45,668 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 120 [2019-10-02 04:25:45,669 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 04:25:45,811 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-10-02 04:25:45,811 INFO L567 ElimStorePlain]: treesize reduction 18, result has 85.1 percent of original size [2019-10-02 04:25:45,813 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 04:25:45,813 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:45, output treesize:4 [2019-10-02 04:25:59,543 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 43 [2019-10-02 04:25:59,566 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 04:25:59,612 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 04:25:59,613 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2019-10-02 04:25:59,613 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:75, output treesize:71 [2019-10-02 04:26:29,769 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 50 [2019-10-02 04:26:30,484 WARN L191 SmtUtils]: Spent 696.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 89 [2019-10-02 04:26:30,484 INFO L341 Elim1Store]: treesize reduction 1411, result has 14.5 percent of original size [2019-10-02 04:26:30,485 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 89 treesize of output 271 [2019-10-02 04:26:30,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 04:26:30,487 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 04:26:30,930 WARN L191 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 96 [2019-10-02 04:26:30,930 INFO L567 ElimStorePlain]: treesize reduction 9, result has 96.7 percent of original size [2019-10-02 04:26:30,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 04:26:30,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-10-02 04:26:30,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-10-02 04:26:30,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-10-02 04:26:30,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-10-02 04:26:30,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-10-02 04:26:30,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 04:26:30,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-10-02 04:26:30,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 04:26:30,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-10-02 04:26:30,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-10-02 04:26:30,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-10-02 04:26:30,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-10-02 04:26:30,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-10-02 04:26:30,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 04:26:30,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-10-02 04:26:30,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-10-02 04:26:30,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-10-02 04:26:30,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-10-02 04:26:30,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-10-02 04:26:30,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-10-02 04:26:30,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-10-02 04:26:30,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-10-02 04:26:30,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-10-02 04:26:30,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-10-02 04:26:30,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-10-02 04:26:30,972 INFO L496 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 04:26:30,973 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 10 variables, input treesize:78, output treesize:239 [2019-10-02 04:26:37,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 04:26:37,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 04:26:37,711 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-10-02 04:26:37,712 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 04:26:37,719 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 04:26:37,719 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 04:26:37,720 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:27, output treesize:3 [2019-10-02 04:26:38,183 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 04:26:38,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 04:26:38,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 35 [2019-10-02 04:26:38,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-02 04:26:38,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-02 04:26:38,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1007, Unknown=57, NotChecked=0, Total=1190 [2019-10-02 04:26:38,216 INFO L87 Difference]: Start difference. First operand 14825 states and 21247 transitions. Second operand 35 states. [2019-10-02 04:32:04,132 WARN L191 SmtUtils]: Spent 2.43 s on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-10-02 04:32:48,732 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 23 [2019-10-02 04:33:25,609 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 20