java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--libertas--usb8xxx.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 16:05:30,020 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 16:05:30,023 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 16:05:30,036 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 16:05:30,036 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 16:05:30,037 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 16:05:30,038 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 16:05:30,040 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 16:05:30,053 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 16:05:30,054 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 16:05:30,055 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 16:05:30,056 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 16:05:30,057 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 16:05:30,060 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 16:05:30,061 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 16:05:30,062 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 16:05:30,063 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 16:05:30,064 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 16:05:30,068 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 16:05:30,071 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 16:05:30,075 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 16:05:30,076 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 16:05:30,077 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 16:05:30,079 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 16:05:30,082 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 16:05:30,082 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 16:05:30,082 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 16:05:30,085 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 16:05:30,086 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 16:05:30,088 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 16:05:30,088 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 16:05:30,090 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 16:05:30,091 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 16:05:30,092 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 16:05:30,096 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 16:05:30,097 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 16:05:30,097 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 16:05:30,097 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 16:05:30,098 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 16:05:30,099 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 16:05:30,100 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 16:05:30,101 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 16:05:30,133 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 16:05:30,134 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 16:05:30,136 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 16:05:30,136 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 16:05:30,136 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 16:05:30,136 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 16:05:30,136 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 16:05:30,137 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 16:05:30,137 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 16:05:30,137 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 16:05:30,138 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 16:05:30,139 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 16:05:30,139 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 16:05:30,139 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 16:05:30,139 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 16:05:30,140 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 16:05:30,140 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 16:05:30,140 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 16:05:30,140 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 16:05:30,140 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 16:05:30,141 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 16:05:30,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 16:05:30,141 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 16:05:30,141 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 16:05:30,142 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 16:05:30,142 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 16:05:30,142 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 16:05:30,142 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 16:05:30,142 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 16:05:30,194 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 16:05:30,213 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 16:05:30,216 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 16:05:30,218 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 16:05:30,218 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 16:05:30,219 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--libertas--usb8xxx.ko-entry_point.cil.out.i [2019-09-08 16:05:30,275 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/609b113c4/000b037fd20b47ddb6dfc1c0a5736ff2/FLAG4b19a677c [2019-09-08 16:05:31,039 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 16:05:31,040 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--libertas--usb8xxx.ko-entry_point.cil.out.i [2019-09-08 16:05:31,083 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/609b113c4/000b037fd20b47ddb6dfc1c0a5736ff2/FLAG4b19a677c [2019-09-08 16:05:31,292 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/609b113c4/000b037fd20b47ddb6dfc1c0a5736ff2 [2019-09-08 16:05:31,303 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 16:05:31,304 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 16:05:31,305 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 16:05:31,305 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 16:05:31,309 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 16:05:31,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:05:31" (1/1) ... [2019-09-08 16:05:31,313 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43c65dd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:05:31, skipping insertion in model container [2019-09-08 16:05:31,313 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:05:31" (1/1) ... [2019-09-08 16:05:31,321 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 16:05:31,509 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 16:05:33,182 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 16:05:33,212 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 16:05:33,847 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 16:05:34,005 INFO L192 MainTranslator]: Completed translation [2019-09-08 16:05:34,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:05:34 WrapperNode [2019-09-08 16:05:34,007 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 16:05:34,008 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 16:05:34,008 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 16:05:34,008 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 16:05:34,026 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:05:34" (1/1) ... [2019-09-08 16:05:34,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:05:34" (1/1) ... [2019-09-08 16:05:34,094 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:05:34" (1/1) ... [2019-09-08 16:05:34,094 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:05:34" (1/1) ... [2019-09-08 16:05:34,211 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:05:34" (1/1) ... [2019-09-08 16:05:34,239 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:05:34" (1/1) ... [2019-09-08 16:05:34,273 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:05:34" (1/1) ... [2019-09-08 16:05:34,307 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 16:05:34,307 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 16:05:34,308 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 16:05:34,308 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 16:05:34,309 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:05:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 16:05:34,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 16:05:34,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 16:05:34,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-09-08 16:05:34,381 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_num [2019-09-08 16:05:34,383 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_in [2019-09-08 16:05:34,383 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_out [2019-09-08 16:05:34,383 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_bulk [2019-09-08 16:05:34,383 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_is_bulk_in [2019-09-08 16:05:34,384 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_is_bulk_out [2019-09-08 16:05:34,384 INFO L138 BoogieDeclarations]: Found implementation of procedure variable_test_bit [2019-09-08 16:05:34,384 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2019-09-08 16:05:34,385 INFO L138 BoogieDeclarations]: Found implementation of procedure current_thread_info [2019-09-08 16:05:34,386 INFO L138 BoogieDeclarations]: Found implementation of procedure test_ti_thread_flag [2019-09-08 16:05:34,386 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2019-09-08 16:05:34,388 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2019-09-08 16:05:34,388 INFO L138 BoogieDeclarations]: Found implementation of procedure kobject_name [2019-09-08 16:05:34,390 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_name [2019-09-08 16:05:34,391 INFO L138 BoogieDeclarations]: Found implementation of procedure test_tsk_thread_flag [2019-09-08 16:05:34,391 INFO L138 BoogieDeclarations]: Found implementation of procedure signal_pending [2019-09-08 16:05:34,392 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2019-09-08 16:05:34,392 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2019-09-08 16:05:34,392 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2019-09-08 16:05:34,392 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2019-09-08 16:05:34,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-09-08 16:05:34,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-09-08 16:05:34,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2019-09-08 16:05:34,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ptr [2019-09-08 16:05:34,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2019-09-08 16:05:34,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-09-08 16:05:34,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2019-09-08 16:05:34,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-09-08 16:05:34,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_trap [2019-09-08 16:05:34,394 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reserve [2019-09-08 16:05:34,394 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_alloc_skb [2019-09-08 16:05:34,395 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_alloc_skb [2019-09-08 16:05:34,395 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_write_bulk_callback [2019-09-08 16:05:34,395 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_free [2019-09-08 16:05:34,395 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_setup_firmware [2019-09-08 16:05:34,395 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_fw_timeo [2019-09-08 16:05:34,395 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_probe [2019-09-08 16:05:34,396 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_disconnect [2019-09-08 16:05:34,396 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_send_fw_pkt [2019-09-08 16:05:34,396 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_reset_device [2019-09-08 16:05:34,396 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_tx_block [2019-09-08 16:05:34,396 INFO L138 BoogieDeclarations]: Found implementation of procedure __if_usb_submit_rx_urb [2019-09-08 16:05:34,397 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_submit_rx_urb_fwload [2019-09-08 16:05:34,397 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_submit_rx_urb [2019-09-08 16:05:34,397 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_receive_fwload [2019-09-08 16:05:34,397 INFO L138 BoogieDeclarations]: Found implementation of procedure process_cmdtypedata [2019-09-08 16:05:34,397 INFO L138 BoogieDeclarations]: Found implementation of procedure process_cmdrequest [2019-09-08 16:05:34,397 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_receive [2019-09-08 16:05:34,398 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_host_to_card [2019-09-08 16:05:34,398 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_issue_boot_command [2019-09-08 16:05:34,398 INFO L138 BoogieDeclarations]: Found implementation of procedure check_fwfile_format [2019-09-08 16:05:34,398 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_prog_firmware [2019-09-08 16:05:34,398 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_suspend [2019-09-08 16:05:34,398 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_resume [2019-09-08 16:05:34,398 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_driver_init [2019-09-08 16:05:34,399 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_driver_exit [2019-09-08 16:05:34,399 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_suitable_timer_1 [2019-09-08 16:05:34,399 INFO L138 BoogieDeclarations]: Found implementation of procedure timer_init_1 [2019-09-08 16:05:34,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_driver_2 [2019-09-08 16:05:34,399 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_pending_timer_1 [2019-09-08 16:05:34,399 INFO L138 BoogieDeclarations]: Found implementation of procedure choose_timer_1 [2019-09-08 16:05:34,399 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_1 [2019-09-08 16:05:34,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_timer_1 [2019-09-08 16:05:34,400 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_timer_1 [2019-09-08 16:05:34,400 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 16:05:34,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_del_timer_1 [2019-09-08 16:05:34,402 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2019-09-08 16:05:34,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_free_urb_3 [2019-09-08 16:05:34,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_free_urb_4 [2019-09-08 16:05:34,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_alloc_urb_5 [2019-09-08 16:05:34,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_alloc_urb_6 [2019-09-08 16:05:34,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_dev_7 [2019-09-08 16:05:34,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_8 [2019-09-08 16:05:34,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata_9 [2019-09-08 16:05:34,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_put_dev_11 [2019-09-08 16:05:34,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_bulk_urb_12 [2019-09-08 16:05:34,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_13 [2019-09-08 16:05:34,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_15 [2019-09-08 16:05:34,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mod_timer_16 [2019-09-08 16:05:34,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_del_timer_sync_17 [2019-09-08 16:05:34,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_register_driver_20 [2019-09-08 16:05:34,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_deregister_21 [2019-09-08 16:05:34,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2019-09-08 16:05:34,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata [2019-09-08 16:05:34,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata [2019-09-08 16:05:34,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_put_intf [2019-09-08 16:05:34,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2019-09-08 16:05:34,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2019-09-08 16:05:34,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_fill_int_urb [2019-09-08 16:05:34,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_fill_bulk_urb [2019-09-08 16:05:34,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2019-09-08 16:05:34,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_interface_to_usbdev [2019-09-08 16:05:34,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_get_dev [2019-09-08 16:05:34,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_put_dev [2019-09-08 16:05:34,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_get_interface [2019-09-08 16:05:34,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_put_interface [2019-09-08 16:05:34,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_serial_register [2019-09-08 16:05:34,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_serial_deregister [2019-09-08 16:05:34,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-09-08 16:05:34,408 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2019-09-08 16:05:34,409 INFO L138 BoogieDeclarations]: Found implementation of procedure __lbs_cmd [2019-09-08 16:05:34,409 INFO L138 BoogieDeclarations]: Found implementation of procedure __netdev_alloc_skb [2019-09-08 16:05:34,409 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2019-09-08 16:05:34,409 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock [2019-09-08 16:05:34,409 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_unlock [2019-09-08 16:05:34,409 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2019-09-08 16:05:34,410 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2019-09-08 16:05:34,410 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2019-09-08 16:05:34,410 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree_skb [2019-09-08 16:05:34,410 INFO L138 BoogieDeclarations]: Found implementation of procedure kmemdup [2019-09-08 16:05:34,410 INFO L138 BoogieDeclarations]: Found implementation of procedure lbs_add_card [2019-09-08 16:05:34,410 INFO L138 BoogieDeclarations]: Found implementation of procedure lbs_get_firmware_async [2019-09-08 16:05:34,411 INFO L138 BoogieDeclarations]: Found implementation of procedure lbs_host_sleep_cfg [2019-09-08 16:05:34,411 INFO L138 BoogieDeclarations]: Found implementation of procedure lbs_host_to_card_done [2019-09-08 16:05:34,411 INFO L138 BoogieDeclarations]: Found implementation of procedure lbs_notify_command_response [2019-09-08 16:05:34,411 INFO L138 BoogieDeclarations]: Found implementation of procedure lbs_process_rxed_packet [2019-09-08 16:05:34,412 INFO L138 BoogieDeclarations]: Found implementation of procedure lbs_queue_event [2019-09-08 16:05:34,412 INFO L138 BoogieDeclarations]: Found implementation of procedure lbs_remove_card [2019-09-08 16:05:34,412 INFO L138 BoogieDeclarations]: Found implementation of procedure lbs_resume [2019-09-08 16:05:34,412 INFO L138 BoogieDeclarations]: Found implementation of procedure lbs_send_tx_feedback [2019-09-08 16:05:34,413 INFO L138 BoogieDeclarations]: Found implementation of procedure lbs_start_card [2019-09-08 16:05:34,413 INFO L138 BoogieDeclarations]: Found implementation of procedure lbs_stop_card [2019-09-08 16:05:34,414 INFO L138 BoogieDeclarations]: Found implementation of procedure lbs_suspend [2019-09-08 16:05:34,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-09-08 16:05:34,414 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2019-09-08 16:05:34,414 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2019-09-08 16:05:34,414 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep_interruptible [2019-09-08 16:05:34,414 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_info [2019-09-08 16:05:34,415 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait [2019-09-08 16:05:34,415 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-09-08 16:05:34,415 INFO L138 BoogieDeclarations]: Found implementation of procedure release_firmware [2019-09-08 16:05:34,415 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule [2019-09-08 16:05:34,415 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_pull [2019-09-08 16:05:34,416 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2019-09-08 16:05:34,416 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_deregister [2019-09-08 16:05:34,416 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2019-09-08 16:05:34,417 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register_driver [2019-09-08 16:05:34,420 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_reset_device [2019-09-08 16:05:34,420 INFO L138 BoogieDeclarations]: Found implementation of procedure autoremove_wake_function [2019-09-08 16:05:34,420 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-09-08 16:05:34,421 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-09-08 16:05:34,427 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-09-08 16:05:34,427 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-08 16:05:34,427 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-08 16:05:34,428 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 16:05:34,428 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-09-08 16:05:34,428 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-08 16:05:34,428 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-09-08 16:05:34,428 INFO L130 BoogieDeclarations]: Found specification of procedure kmemdup [2019-09-08 16:05:34,428 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_num [2019-09-08 16:05:34,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 16:05:34,428 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_in [2019-09-08 16:05:34,429 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_out [2019-09-08 16:05:34,429 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_bulk [2019-09-08 16:05:34,429 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_is_bulk_in [2019-09-08 16:05:34,429 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_is_bulk_out [2019-09-08 16:05:34,430 INFO L130 BoogieDeclarations]: Found specification of procedure variable_test_bit [2019-09-08 16:05:34,430 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-09-08 16:05:34,430 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2019-09-08 16:05:34,431 INFO L130 BoogieDeclarations]: Found specification of procedure msleep_interruptible [2019-09-08 16:05:34,431 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2019-09-08 16:05:34,431 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2019-09-08 16:05:34,431 INFO L130 BoogieDeclarations]: Found specification of procedure current_thread_info [2019-09-08 16:05:34,431 INFO L130 BoogieDeclarations]: Found specification of procedure test_ti_thread_flag [2019-09-08 16:05:34,431 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock [2019-09-08 16:05:34,431 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_unlock [2019-09-08 16:05:34,431 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2019-09-08 16:05:34,432 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2019-09-08 16:05:34,432 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2019-09-08 16:05:34,432 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_del_timer_1 [2019-09-08 16:05:34,432 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2019-09-08 16:05:34,432 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mod_timer_16 [2019-09-08 16:05:34,432 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2019-09-08 16:05:34,432 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_del_timer_sync_17 [2019-09-08 16:05:34,432 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2019-09-08 16:05:34,433 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2019-09-08 16:05:34,433 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait [2019-09-08 16:05:34,433 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2019-09-08 16:05:34,433 INFO L130 BoogieDeclarations]: Found specification of procedure autoremove_wake_function [2019-09-08 16:05:34,433 INFO L130 BoogieDeclarations]: Found specification of procedure kobject_name [2019-09-08 16:05:34,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 16:05:34,433 INFO L130 BoogieDeclarations]: Found specification of procedure dev_name [2019-09-08 16:05:34,433 INFO L130 BoogieDeclarations]: Found specification of procedure schedule [2019-09-08 16:05:34,434 INFO L130 BoogieDeclarations]: Found specification of procedure test_tsk_thread_flag [2019-09-08 16:05:34,434 INFO L130 BoogieDeclarations]: Found specification of procedure signal_pending [2019-09-08 16:05:34,434 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata_9 [2019-09-08 16:05:34,434 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_8 [2019-09-08 16:05:34,434 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2019-09-08 16:05:34,434 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_dev_7 [2019-09-08 16:05:34,434 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_put_dev_11 [2019-09-08 16:05:34,435 INFO L130 BoogieDeclarations]: Found specification of procedure usb_reset_device [2019-09-08 16:05:34,435 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register_driver [2019-09-08 16:05:34,435 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_register_driver_20 [2019-09-08 16:05:34,436 INFO L130 BoogieDeclarations]: Found specification of procedure usb_deregister [2019-09-08 16:05:34,436 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_deregister_21 [2019-09-08 16:05:34,436 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_bulk_urb_12 [2019-09-08 16:05:34,436 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_alloc_urb_5 [2019-09-08 16:05:34,436 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_alloc_urb_6 [2019-09-08 16:05:34,436 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_free_urb_3 [2019-09-08 16:05:34,437 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_free_urb_4 [2019-09-08 16:05:34,437 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_13 [2019-09-08 16:05:34,437 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_15 [2019-09-08 16:05:34,437 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2019-09-08 16:05:34,437 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2019-09-08 16:05:34,437 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2019-09-08 16:05:34,437 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2019-09-08 16:05:34,437 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_fill_bulk_urb [2019-09-08 16:05:34,438 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2019-09-08 16:05:34,438 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_interface_to_usbdev [2019-09-08 16:05:34,438 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_get_dev [2019-09-08 16:05:34,438 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_put_dev [2019-09-08 16:05:34,438 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata [2019-09-08 16:05:34,438 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata [2019-09-08 16:05:34,438 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-09-08 16:05:34,438 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-09-08 16:05:34,439 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2019-09-08 16:05:34,439 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2019-09-08 16:05:34,439 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2019-09-08 16:05:34,439 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 16:05:34,439 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-08 16:05:34,439 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 16:05:34,439 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-09-08 16:05:34,439 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-08 16:05:34,440 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 16:05:34,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 16:05:34,440 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-09-08 16:05:34,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-08 16:05:34,440 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2019-09-08 16:05:34,440 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ptr [2019-09-08 16:05:34,440 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2019-09-08 16:05:34,440 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-09-08 16:05:34,440 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2019-09-08 16:05:34,441 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_trap [2019-09-08 16:05:34,441 INFO L130 BoogieDeclarations]: Found specification of procedure activate_suitable_timer_1 [2019-09-08 16:05:34,441 INFO L130 BoogieDeclarations]: Found specification of procedure timer_init_1 [2019-09-08 16:05:34,441 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_driver_2 [2019-09-08 16:05:34,441 INFO L130 BoogieDeclarations]: Found specification of procedure activate_pending_timer_1 [2019-09-08 16:05:34,441 INFO L130 BoogieDeclarations]: Found specification of procedure choose_timer_1 [2019-09-08 16:05:34,441 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_1 [2019-09-08 16:05:34,441 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_timer_1 [2019-09-08 16:05:34,442 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_timer_1 [2019-09-08 16:05:34,442 INFO L130 BoogieDeclarations]: Found specification of procedure release_firmware [2019-09-08 16:05:34,442 INFO L130 BoogieDeclarations]: Found specification of procedure kfree_skb [2019-09-08 16:05:34,442 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2019-09-08 16:05:34,442 INFO L130 BoogieDeclarations]: Found specification of procedure skb_pull [2019-09-08 16:05:34,442 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reserve [2019-09-08 16:05:34,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 16:05:34,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 16:05:34,443 INFO L130 BoogieDeclarations]: Found specification of procedure __netdev_alloc_skb [2019-09-08 16:05:34,443 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_alloc_skb [2019-09-08 16:05:34,443 INFO L130 BoogieDeclarations]: Found specification of procedure dev_alloc_skb [2019-09-08 16:05:34,443 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_info [2019-09-08 16:05:34,443 INFO L130 BoogieDeclarations]: Found specification of procedure lbs_send_tx_feedback [2019-09-08 16:05:34,443 INFO L130 BoogieDeclarations]: Found specification of procedure lbs_process_rxed_packet [2019-09-08 16:05:34,443 INFO L130 BoogieDeclarations]: Found specification of procedure lbs_add_card [2019-09-08 16:05:34,443 INFO L130 BoogieDeclarations]: Found specification of procedure lbs_remove_card [2019-09-08 16:05:34,444 INFO L130 BoogieDeclarations]: Found specification of procedure lbs_start_card [2019-09-08 16:05:34,444 INFO L130 BoogieDeclarations]: Found specification of procedure lbs_stop_card [2019-09-08 16:05:34,444 INFO L130 BoogieDeclarations]: Found specification of procedure lbs_host_to_card_done [2019-09-08 16:05:34,444 INFO L130 BoogieDeclarations]: Found specification of procedure lbs_suspend [2019-09-08 16:05:34,444 INFO L130 BoogieDeclarations]: Found specification of procedure lbs_resume [2019-09-08 16:05:34,444 INFO L130 BoogieDeclarations]: Found specification of procedure lbs_queue_event [2019-09-08 16:05:34,444 INFO L130 BoogieDeclarations]: Found specification of procedure lbs_notify_command_response [2019-09-08 16:05:34,445 INFO L130 BoogieDeclarations]: Found specification of procedure lbs_get_firmware_async [2019-09-08 16:05:34,449 INFO L130 BoogieDeclarations]: Found specification of procedure __lbs_cmd [2019-09-08 16:05:34,450 INFO L130 BoogieDeclarations]: Found specification of procedure lbs_cmd_copyback [2019-09-08 16:05:34,450 INFO L130 BoogieDeclarations]: Found specification of procedure lbs_host_sleep_cfg [2019-09-08 16:05:34,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 16:05:34,450 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_receive [2019-09-08 16:05:34,452 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_receive_fwload [2019-09-08 16:05:34,453 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_prog_firmware [2019-09-08 16:05:34,453 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_host_to_card [2019-09-08 16:05:34,453 INFO L130 BoogieDeclarations]: Found specification of procedure usb_tx_block [2019-09-08 16:05:34,453 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_free [2019-09-08 16:05:34,453 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_submit_rx_urb [2019-09-08 16:05:34,453 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_reset_device [2019-09-08 16:05:34,453 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_write_bulk_callback [2019-09-08 16:05:34,453 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_setup_firmware [2019-09-08 16:05:34,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 16:05:34,454 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_fw_timeo [2019-09-08 16:05:34,454 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_probe [2019-09-08 16:05:34,454 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_disconnect [2019-09-08 16:05:34,454 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_send_fw_pkt [2019-09-08 16:05:34,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-08 16:05:34,454 INFO L130 BoogieDeclarations]: Found specification of procedure __if_usb_submit_rx_urb [2019-09-08 16:05:34,454 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_submit_rx_urb_fwload [2019-09-08 16:05:34,454 INFO L130 BoogieDeclarations]: Found specification of procedure process_cmdtypedata [2019-09-08 16:05:34,455 INFO L130 BoogieDeclarations]: Found specification of procedure process_cmdrequest [2019-09-08 16:05:34,455 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_issue_boot_command [2019-09-08 16:05:34,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-09-08 16:05:34,455 INFO L130 BoogieDeclarations]: Found specification of procedure check_fwfile_format [2019-09-08 16:05:34,455 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_suspend [2019-09-08 16:05:34,455 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_resume [2019-09-08 16:05:34,455 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_driver_init [2019-09-08 16:05:34,455 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_driver_exit [2019-09-08 16:05:34,455 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-09-08 16:05:34,456 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-09-08 16:05:34,456 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 16:05:34,456 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2019-09-08 16:05:34,456 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_put_intf [2019-09-08 16:05:34,456 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_fill_int_urb [2019-09-08 16:05:34,456 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-09-08 16:05:34,456 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_get_interface [2019-09-08 16:05:34,456 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_put_interface [2019-09-08 16:05:34,457 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_serial_register [2019-09-08 16:05:34,457 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_serial_deregister [2019-09-08 16:05:34,457 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-09-08 16:05:34,457 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 16:05:34,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 16:05:34,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 16:05:34,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-08 16:05:34,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 16:05:34,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-08 16:05:34,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-08 16:05:34,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-08 16:05:34,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-08 16:05:35,725 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2019-09-08 16:05:42,432 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2019-09-08 16:05:43,849 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 16:05:43,850 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 16:05:43,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:05:43 BoogieIcfgContainer [2019-09-08 16:05:43,852 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 16:05:43,853 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 16:05:43,853 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 16:05:43,856 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 16:05:43,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 04:05:31" (1/3) ... [2019-09-08 16:05:43,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5280dc5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:05:43, skipping insertion in model container [2019-09-08 16:05:43,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:05:34" (2/3) ... [2019-09-08 16:05:43,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5280dc5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:05:43, skipping insertion in model container [2019-09-08 16:05:43,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:05:43" (3/3) ... [2019-09-08 16:05:43,859 INFO L109 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--libertas--usb8xxx.ko-entry_point.cil.out.i [2019-09-08 16:05:43,869 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 16:05:43,880 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 16:05:43,896 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 16:05:43,936 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 16:05:43,937 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 16:05:43,937 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 16:05:43,937 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 16:05:43,937 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 16:05:43,937 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 16:05:43,937 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 16:05:43,937 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 16:05:43,937 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 16:05:43,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states. [2019-09-08 16:05:43,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-08 16:05:43,988 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:05:43,989 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 16:05:43,992 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:05:43,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:05:43,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1927517647, now seen corresponding path program 1 times [2019-09-08 16:05:43,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:05:44,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:05:44,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:05:44,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:05:44,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:05:44,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:05:44,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 16:05:44,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:05:44,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:05:44,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:05:44,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:05:44,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:05:44,962 INFO L87 Difference]: Start difference. First operand 1309 states. Second operand 3 states. [2019-09-08 16:05:47,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:05:47,686 INFO L93 Difference]: Finished difference Result 3070 states and 4102 transitions. [2019-09-08 16:05:47,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:05:47,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-09-08 16:05:47,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:05:47,741 INFO L225 Difference]: With dead ends: 3070 [2019-09-08 16:05:47,741 INFO L226 Difference]: Without dead ends: 2007 [2019-09-08 16:05:47,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:05:47,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2007 states. [2019-09-08 16:05:47,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2007 to 2007. [2019-09-08 16:05:47,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2007 states. [2019-09-08 16:05:47,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 2007 states and 2667 transitions. [2019-09-08 16:05:47,981 INFO L78 Accepts]: Start accepts. Automaton has 2007 states and 2667 transitions. Word has length 49 [2019-09-08 16:05:47,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:05:47,981 INFO L475 AbstractCegarLoop]: Abstraction has 2007 states and 2667 transitions. [2019-09-08 16:05:47,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:05:47,982 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 2667 transitions. [2019-09-08 16:05:47,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-08 16:05:47,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:05:47,988 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 16:05:47,988 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:05:47,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:05:47,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1401368064, now seen corresponding path program 1 times [2019-09-08 16:05:47,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:05:47,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:05:47,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:05:47,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:05:47,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:05:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:05:48,414 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 16:05:48,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:05:48,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:05:48,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:05:48,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:05:48,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:05:48,420 INFO L87 Difference]: Start difference. First operand 2007 states and 2667 transitions. Second operand 3 states. [2019-09-08 16:05:48,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:05:48,861 INFO L93 Difference]: Finished difference Result 2033 states and 2699 transitions. [2019-09-08 16:05:48,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:05:48,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-09-08 16:05:48,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:05:48,882 INFO L225 Difference]: With dead ends: 2033 [2019-09-08 16:05:48,882 INFO L226 Difference]: Without dead ends: 2020 [2019-09-08 16:05:48,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:05:48,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2020 states. [2019-09-08 16:05:48,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2020 to 2007. [2019-09-08 16:05:48,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2007 states. [2019-09-08 16:05:49,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 2007 states and 2666 transitions. [2019-09-08 16:05:49,001 INFO L78 Accepts]: Start accepts. Automaton has 2007 states and 2666 transitions. Word has length 65 [2019-09-08 16:05:49,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:05:49,002 INFO L475 AbstractCegarLoop]: Abstraction has 2007 states and 2666 transitions. [2019-09-08 16:05:49,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:05:49,002 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 2666 transitions. [2019-09-08 16:05:49,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-08 16:05:49,008 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:05:49,009 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 16:05:49,009 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:05:49,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:05:49,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1458626366, now seen corresponding path program 1 times [2019-09-08 16:05:49,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:05:49,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:05:49,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:05:49,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:05:49,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:05:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:05:49,381 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 16:05:49,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:05:49,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:05:49,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:05:49,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:05:49,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:05:49,383 INFO L87 Difference]: Start difference. First operand 2007 states and 2666 transitions. Second operand 3 states. [2019-09-08 16:05:49,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:05:49,566 INFO L93 Difference]: Finished difference Result 5958 states and 8125 transitions. [2019-09-08 16:05:49,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:05:49,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-09-08 16:05:49,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:05:49,592 INFO L225 Difference]: With dead ends: 5958 [2019-09-08 16:05:49,593 INFO L226 Difference]: Without dead ends: 3982 [2019-09-08 16:05:49,602 INFO L628 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-09-08 16:05:49,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3982 states. [2019-09-08 16:05:49,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3982 to 3972. [2019-09-08 16:05:49,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3972 states. [2019-09-08 16:05:49,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3972 states to 3972 states and 5357 transitions. [2019-09-08 16:05:49,785 INFO L78 Accepts]: Start accepts. Automaton has 3972 states and 5357 transitions. Word has length 65 [2019-09-08 16:05:49,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:05:49,786 INFO L475 AbstractCegarLoop]: Abstraction has 3972 states and 5357 transitions. [2019-09-08 16:05:49,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:05:49,787 INFO L276 IsEmpty]: Start isEmpty. Operand 3972 states and 5357 transitions. [2019-09-08 16:05:49,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 16:05:49,788 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:05:49,788 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 16:05:49,789 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:05:49,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:05:49,789 INFO L82 PathProgramCache]: Analyzing trace with hash -2027835311, now seen corresponding path program 1 times [2019-09-08 16:05:49,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:05:49,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:05:49,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:05:49,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:05:49,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:05:49,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:05:50,068 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 16:05:50,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:05:50,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:05:50,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:05:50,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:05:50,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:05:50,069 INFO L87 Difference]: Start difference. First operand 3972 states and 5357 transitions. Second operand 3 states. [2019-09-08 16:05:50,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:05:50,401 INFO L93 Difference]: Finished difference Result 11845 states and 16484 transitions. [2019-09-08 16:05:50,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:05:50,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-08 16:05:50,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:05:50,455 INFO L225 Difference]: With dead ends: 11845 [2019-09-08 16:05:50,456 INFO L226 Difference]: Without dead ends: 7904 [2019-09-08 16:05:50,480 INFO L628 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-09-08 16:05:50,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7904 states. [2019-09-08 16:05:50,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7904 to 7895. [2019-09-08 16:05:50,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7895 states. [2019-09-08 16:05:51,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7895 states to 7895 states and 10827 transitions. [2019-09-08 16:05:51,825 INFO L78 Accepts]: Start accepts. Automaton has 7895 states and 10827 transitions. Word has length 66 [2019-09-08 16:05:51,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:05:51,826 INFO L475 AbstractCegarLoop]: Abstraction has 7895 states and 10827 transitions. [2019-09-08 16:05:51,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:05:51,826 INFO L276 IsEmpty]: Start isEmpty. Operand 7895 states and 10827 transitions. [2019-09-08 16:05:51,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 16:05:51,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:05:51,830 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 16:05:51,830 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:05:51,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:05:51,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1561007265, now seen corresponding path program 1 times [2019-09-08 16:05:51,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:05:51,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:05:51,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:05:51,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:05:51,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:05:51,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:05:52,146 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 16:05:52,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:05:52,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:05:52,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:05:52,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:05:52,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:05:52,150 INFO L87 Difference]: Start difference. First operand 7895 states and 10827 transitions. Second operand 3 states. [2019-09-08 16:05:52,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:05:52,385 INFO L93 Difference]: Finished difference Result 7902 states and 10833 transitions. [2019-09-08 16:05:52,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:05:52,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-08 16:05:52,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:05:52,439 INFO L225 Difference]: With dead ends: 7902 [2019-09-08 16:05:52,439 INFO L226 Difference]: Without dead ends: 7899 [2019-09-08 16:05:52,446 INFO L628 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-09-08 16:05:52,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7899 states. [2019-09-08 16:05:52,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7899 to 7896. [2019-09-08 16:05:52,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7896 states. [2019-09-08 16:05:52,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7896 states to 7896 states and 10828 transitions. [2019-09-08 16:05:52,885 INFO L78 Accepts]: Start accepts. Automaton has 7896 states and 10828 transitions. Word has length 67 [2019-09-08 16:05:52,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:05:52,886 INFO L475 AbstractCegarLoop]: Abstraction has 7896 states and 10828 transitions. [2019-09-08 16:05:52,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:05:52,886 INFO L276 IsEmpty]: Start isEmpty. Operand 7896 states and 10828 transitions. [2019-09-08 16:05:52,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 16:05:52,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:05:52,888 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 16:05:52,889 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:05:52,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:05:52,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1145982292, now seen corresponding path program 1 times [2019-09-08 16:05:52,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:05:52,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:05:52,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:05:52,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:05:52,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:05:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:05:53,169 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 16:05:53,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:05:53,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:05:53,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:05:53,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:05:53,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:05:53,170 INFO L87 Difference]: Start difference. First operand 7896 states and 10828 transitions. Second operand 3 states. [2019-09-08 16:05:53,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:05:53,348 INFO L93 Difference]: Finished difference Result 7898 states and 10829 transitions. [2019-09-08 16:05:53,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:05:53,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-08 16:05:53,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:05:53,406 INFO L225 Difference]: With dead ends: 7898 [2019-09-08 16:05:53,407 INFO L226 Difference]: Without dead ends: 7895 [2019-09-08 16:05:53,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:05:53,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7895 states. [2019-09-08 16:05:53,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7895 to 7895. [2019-09-08 16:05:53,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7895 states. [2019-09-08 16:05:53,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7895 states to 7895 states and 10826 transitions. [2019-09-08 16:05:53,879 INFO L78 Accepts]: Start accepts. Automaton has 7895 states and 10826 transitions. Word has length 68 [2019-09-08 16:05:53,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:05:53,880 INFO L475 AbstractCegarLoop]: Abstraction has 7895 states and 10826 transitions. [2019-09-08 16:05:53,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:05:53,880 INFO L276 IsEmpty]: Start isEmpty. Operand 7895 states and 10826 transitions. [2019-09-08 16:05:53,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 16:05:53,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:05:53,881 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 16:05:53,882 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:05:53,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:05:53,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1165114884, now seen corresponding path program 1 times [2019-09-08 16:05:53,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:05:53,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:05:53,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:05:53,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:05:53,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:05:53,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:05:54,158 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 16:05:54,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:05:54,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:05:54,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:05:54,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:05:54,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:05:54,161 INFO L87 Difference]: Start difference. First operand 7895 states and 10826 transitions. Second operand 3 states. [2019-09-08 16:05:54,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:05:54,361 INFO L93 Difference]: Finished difference Result 7897 states and 10827 transitions. [2019-09-08 16:05:54,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:05:54,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-08 16:05:54,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:05:54,413 INFO L225 Difference]: With dead ends: 7897 [2019-09-08 16:05:54,414 INFO L226 Difference]: Without dead ends: 7875 [2019-09-08 16:05:54,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:05:54,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7875 states. [2019-09-08 16:05:54,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7875 to 7875. [2019-09-08 16:05:54,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7875 states. [2019-09-08 16:05:54,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7875 states to 7875 states and 10802 transitions. [2019-09-08 16:05:54,751 INFO L78 Accepts]: Start accepts. Automaton has 7875 states and 10802 transitions. Word has length 69 [2019-09-08 16:05:54,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:05:54,752 INFO L475 AbstractCegarLoop]: Abstraction has 7875 states and 10802 transitions. [2019-09-08 16:05:54,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:05:54,752 INFO L276 IsEmpty]: Start isEmpty. Operand 7875 states and 10802 transitions. [2019-09-08 16:05:54,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-08 16:05:54,771 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:05:54,771 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 16:05:54,771 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:05:54,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:05:54,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1626659108, now seen corresponding path program 1 times [2019-09-08 16:05:54,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:05:54,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:05:54,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:05:54,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:05:54,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:05:54,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:05:55,042 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 16:05:55,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:05:55,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:05:55,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:05:55,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:05:55,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:05:55,044 INFO L87 Difference]: Start difference. First operand 7875 states and 10802 transitions. Second operand 3 states. [2019-09-08 16:05:55,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:05:55,685 INFO L93 Difference]: Finished difference Result 16280 states and 22366 transitions. [2019-09-08 16:05:55,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:05:55,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2019-09-08 16:05:55,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:05:55,727 INFO L225 Difference]: With dead ends: 16280 [2019-09-08 16:05:55,728 INFO L226 Difference]: Without dead ends: 8436 [2019-09-08 16:05:55,762 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:05:55,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8436 states. [2019-09-08 16:05:56,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8436 to 8359. [2019-09-08 16:05:56,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8359 states. [2019-09-08 16:05:56,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8359 states to 8359 states and 11497 transitions. [2019-09-08 16:05:56,247 INFO L78 Accepts]: Start accepts. Automaton has 8359 states and 11497 transitions. Word has length 203 [2019-09-08 16:05:56,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:05:56,248 INFO L475 AbstractCegarLoop]: Abstraction has 8359 states and 11497 transitions. [2019-09-08 16:05:56,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:05:56,248 INFO L276 IsEmpty]: Start isEmpty. Operand 8359 states and 11497 transitions. [2019-09-08 16:05:56,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-08 16:05:56,266 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:05:56,267 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 16:05:56,267 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:05:56,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:05:56,267 INFO L82 PathProgramCache]: Analyzing trace with hash 160702738, now seen corresponding path program 1 times [2019-09-08 16:05:56,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:05:56,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:05:56,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:05:56,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:05:56,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:05:56,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:05:56,564 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 16:05:56,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:05:56,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:05:56,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:05:56,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:05:56,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:05:56,566 INFO L87 Difference]: Start difference. First operand 8359 states and 11497 transitions. Second operand 3 states. [2019-09-08 16:05:56,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:05:56,823 INFO L93 Difference]: Finished difference Result 16695 states and 23009 transitions. [2019-09-08 16:05:56,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:05:56,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 222 [2019-09-08 16:05:56,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:05:56,865 INFO L225 Difference]: With dead ends: 16695 [2019-09-08 16:05:56,866 INFO L226 Difference]: Without dead ends: 8367 [2019-09-08 16:05:56,902 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:05:56,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8367 states. [2019-09-08 16:05:57,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8367 to 8367. [2019-09-08 16:05:57,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8367 states. [2019-09-08 16:05:57,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8367 states to 8367 states and 11505 transitions. [2019-09-08 16:05:57,227 INFO L78 Accepts]: Start accepts. Automaton has 8367 states and 11505 transitions. Word has length 222 [2019-09-08 16:05:57,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:05:57,228 INFO L475 AbstractCegarLoop]: Abstraction has 8367 states and 11505 transitions. [2019-09-08 16:05:57,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:05:57,228 INFO L276 IsEmpty]: Start isEmpty. Operand 8367 states and 11505 transitions. [2019-09-08 16:05:57,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-08 16:05:57,245 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:05:57,246 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 16:05:57,246 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:05:57,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:05:57,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1761773844, now seen corresponding path program 1 times [2019-09-08 16:05:57,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:05:57,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:05:57,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:05:57,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:05:57,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:05:57,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:05:57,905 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 16:05:57,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:05:57,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 16:05:57,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 16:05:57,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 16:05:57,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 16:05:57,907 INFO L87 Difference]: Start difference. First operand 8367 states and 11505 transitions. Second operand 11 states. [2019-09-08 16:05:58,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:05:58,393 INFO L93 Difference]: Finished difference Result 16831 states and 23153 transitions. [2019-09-08 16:05:58,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 16:05:58,393 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 222 [2019-09-08 16:05:58,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:05:58,430 INFO L225 Difference]: With dead ends: 16831 [2019-09-08 16:05:58,431 INFO L226 Difference]: Without dead ends: 8495 [2019-09-08 16:05:58,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 16:05:58,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8495 states. [2019-09-08 16:05:58,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8495 to 8495. [2019-09-08 16:05:58,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8495 states. [2019-09-08 16:05:58,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8495 states to 8495 states and 11641 transitions. [2019-09-08 16:05:58,817 INFO L78 Accepts]: Start accepts. Automaton has 8495 states and 11641 transitions. Word has length 222 [2019-09-08 16:05:58,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:05:58,818 INFO L475 AbstractCegarLoop]: Abstraction has 8495 states and 11641 transitions. [2019-09-08 16:05:58,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 16:05:58,818 INFO L276 IsEmpty]: Start isEmpty. Operand 8495 states and 11641 transitions. [2019-09-08 16:05:58,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-08 16:05:58,832 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:05:58,833 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 16:05:58,833 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:05:58,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:05:58,833 INFO L82 PathProgramCache]: Analyzing trace with hash -602962603, now seen corresponding path program 1 times [2019-09-08 16:05:58,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:05:58,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:05:58,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:05:58,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:05:58,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:05:59,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:05:59,515 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 16:05:59,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:05:59,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 16:05:59,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 16:05:59,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 16:05:59,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 16:05:59,518 INFO L87 Difference]: Start difference. First operand 8495 states and 11641 transitions. Second operand 6 states. [2019-09-08 16:06:02,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:06:02,958 INFO L93 Difference]: Finished difference Result 25535 states and 35061 transitions. [2019-09-08 16:06:02,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 16:06:02,959 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 222 [2019-09-08 16:06:02,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:06:03,040 INFO L225 Difference]: With dead ends: 25535 [2019-09-08 16:06:03,041 INFO L226 Difference]: Without dead ends: 17071 [2019-09-08 16:06:03,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-09-08 16:06:03,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17071 states. [2019-09-08 16:06:03,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17071 to 8559. [2019-09-08 16:06:03,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8559 states. [2019-09-08 16:06:03,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8559 states to 8559 states and 11751 transitions. [2019-09-08 16:06:03,756 INFO L78 Accepts]: Start accepts. Automaton has 8559 states and 11751 transitions. Word has length 222 [2019-09-08 16:06:03,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:06:03,757 INFO L475 AbstractCegarLoop]: Abstraction has 8559 states and 11751 transitions. [2019-09-08 16:06:03,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 16:06:03,757 INFO L276 IsEmpty]: Start isEmpty. Operand 8559 states and 11751 transitions. [2019-09-08 16:06:03,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-08 16:06:03,771 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:06:03,771 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 16:06:03,772 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:06:03,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:06:03,772 INFO L82 PathProgramCache]: Analyzing trace with hash -736976109, now seen corresponding path program 1 times [2019-09-08 16:06:03,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:06:03,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:06:03,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:06:03,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:06:03,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:06:04,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:06:04,200 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 16:06:04,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:06:04,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 16:06:04,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 16:06:04,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 16:06:04,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 16:06:04,208 INFO L87 Difference]: Start difference. First operand 8559 states and 11751 transitions. Second operand 4 states. [2019-09-08 16:06:04,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:06:04,508 INFO L93 Difference]: Finished difference Result 17096 states and 23479 transitions. [2019-09-08 16:06:04,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 16:06:04,509 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 222 [2019-09-08 16:06:04,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:06:04,552 INFO L225 Difference]: With dead ends: 17096 [2019-09-08 16:06:04,553 INFO L226 Difference]: Without dead ends: 8560 [2019-09-08 16:06:04,574 INFO L628 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-09-08 16:06:04,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8560 states. [2019-09-08 16:06:04,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8560 to 8560. [2019-09-08 16:06:04,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8560 states. [2019-09-08 16:06:04,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8560 states to 8560 states and 11752 transitions. [2019-09-08 16:06:04,960 INFO L78 Accepts]: Start accepts. Automaton has 8560 states and 11752 transitions. Word has length 222 [2019-09-08 16:06:04,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:06:04,961 INFO L475 AbstractCegarLoop]: Abstraction has 8560 states and 11752 transitions. [2019-09-08 16:06:04,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 16:06:04,961 INFO L276 IsEmpty]: Start isEmpty. Operand 8560 states and 11752 transitions. [2019-09-08 16:06:04,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-09-08 16:06:04,975 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:06:04,975 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 16:06:04,975 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:06:04,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:06:04,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1740383133, now seen corresponding path program 1 times [2019-09-08 16:06:04,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:06:04,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:06:04,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:06:04,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:06:04,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:06:05,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:06:05,425 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 16:06:05,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:06:05,426 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:06:05,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:06:06,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:06:06,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 5137 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 16:06:06,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:06:07,055 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 16:06:07,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:06:07,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-09-08 16:06:07,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 16:06:07,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 16:06:07,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-08 16:06:07,082 INFO L87 Difference]: Start difference. First operand 8560 states and 11752 transitions. Second operand 8 states. [2019-09-08 16:06:07,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:06:07,460 INFO L93 Difference]: Finished difference Result 17097 states and 23480 transitions. [2019-09-08 16:06:07,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 16:06:07,461 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 223 [2019-09-08 16:06:07,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:06:07,512 INFO L225 Difference]: With dead ends: 17097 [2019-09-08 16:06:07,512 INFO L226 Difference]: Without dead ends: 8561 [2019-09-08 16:06:07,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-08 16:06:07,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8561 states. [2019-09-08 16:06:08,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8561 to 8561. [2019-09-08 16:06:08,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8561 states. [2019-09-08 16:06:08,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8561 states to 8561 states and 11753 transitions. [2019-09-08 16:06:08,041 INFO L78 Accepts]: Start accepts. Automaton has 8561 states and 11753 transitions. Word has length 223 [2019-09-08 16:06:08,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:06:08,042 INFO L475 AbstractCegarLoop]: Abstraction has 8561 states and 11753 transitions. [2019-09-08 16:06:08,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 16:06:08,042 INFO L276 IsEmpty]: Start isEmpty. Operand 8561 states and 11753 transitions. [2019-09-08 16:06:08,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-09-08 16:06:08,055 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:06:08,055 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 16:06:08,056 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:06:08,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:06:08,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1513737491, now seen corresponding path program 2 times [2019-09-08 16:06:08,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:06:08,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:06:08,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:06:08,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:06:08,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:06:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:06:08,628 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 16:06:08,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:06:08,628 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 16:06:08,661 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:06:22,907 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 16:06:22,907 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:06:22,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 5143 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 16:06:23,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:06:23,108 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 16:06:23,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:06:23,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-09-08 16:06:23,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 16:06:23,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 16:06:23,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-09-08 16:06:23,153 INFO L87 Difference]: Start difference. First operand 8561 states and 11753 transitions. Second operand 10 states. [2019-09-08 16:06:23,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:06:23,491 INFO L93 Difference]: Finished difference Result 17098 states and 23481 transitions. [2019-09-08 16:06:23,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 16:06:23,492 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 224 [2019-09-08 16:06:23,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:06:23,529 INFO L225 Difference]: With dead ends: 17098 [2019-09-08 16:06:23,529 INFO L226 Difference]: Without dead ends: 8562 [2019-09-08 16:06:23,550 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-09-08 16:06:23,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8562 states. [2019-09-08 16:06:23,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8562 to 8562. [2019-09-08 16:06:23,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8562 states. [2019-09-08 16:06:23,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8562 states to 8562 states and 11754 transitions. [2019-09-08 16:06:23,922 INFO L78 Accepts]: Start accepts. Automaton has 8562 states and 11754 transitions. Word has length 224 [2019-09-08 16:06:23,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:06:23,924 INFO L475 AbstractCegarLoop]: Abstraction has 8562 states and 11754 transitions. [2019-09-08 16:06:23,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 16:06:23,924 INFO L276 IsEmpty]: Start isEmpty. Operand 8562 states and 11754 transitions. [2019-09-08 16:06:23,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-08 16:06:23,938 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:06:23,938 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 16:06:23,939 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:06:23,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:06:23,939 INFO L82 PathProgramCache]: Analyzing trace with hash -687738269, now seen corresponding path program 3 times [2019-09-08 16:06:23,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:06:23,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:06:23,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:06:23,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:06:23,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:06:24,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:06:24,430 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 16:06:24,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:06:24,430 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:06:24,475 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 16:07:02,066 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-08 16:07:02,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:07:02,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 5149 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 16:07:02,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:07:02,555 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 16:07:02,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:07:02,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-09-08 16:07:02,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 16:07:02,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 16:07:02,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-09-08 16:07:02,596 INFO L87 Difference]: Start difference. First operand 8562 states and 11754 transitions. Second operand 12 states. [2019-09-08 16:07:03,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:07:03,517 INFO L93 Difference]: Finished difference Result 17099 states and 23482 transitions. [2019-09-08 16:07:03,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 16:07:03,518 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 225 [2019-09-08 16:07:03,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:07:03,561 INFO L225 Difference]: With dead ends: 17099 [2019-09-08 16:07:03,561 INFO L226 Difference]: Without dead ends: 8563 [2019-09-08 16:07:03,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-09-08 16:07:03,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8563 states. [2019-09-08 16:07:03,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8563 to 8563. [2019-09-08 16:07:03,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8563 states. [2019-09-08 16:07:03,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8563 states to 8563 states and 11755 transitions. [2019-09-08 16:07:03,972 INFO L78 Accepts]: Start accepts. Automaton has 8563 states and 11755 transitions. Word has length 225 [2019-09-08 16:07:03,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:07:03,973 INFO L475 AbstractCegarLoop]: Abstraction has 8563 states and 11755 transitions. [2019-09-08 16:07:03,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 16:07:03,973 INFO L276 IsEmpty]: Start isEmpty. Operand 8563 states and 11755 transitions. [2019-09-08 16:07:03,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-09-08 16:07:03,985 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:07:03,986 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 16:07:03,986 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:07:03,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:07:03,986 INFO L82 PathProgramCache]: Analyzing trace with hash -214010093, now seen corresponding path program 4 times [2019-09-08 16:07:03,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:07:03,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:07:03,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:07:03,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:07:03,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:07:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:07:04,946 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-08 16:07:04,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:07:04,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 16:07:04,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 16:07:04,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 16:07:04,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 16:07:04,949 INFO L87 Difference]: Start difference. First operand 8563 states and 11755 transitions. Second operand 8 states. [2019-09-08 16:07:08,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:07:08,326 INFO L93 Difference]: Finished difference Result 17097 states and 23494 transitions. [2019-09-08 16:07:08,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 16:07:08,327 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 226 [2019-09-08 16:07:08,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:07:08,365 INFO L225 Difference]: With dead ends: 17097 [2019-09-08 16:07:08,365 INFO L226 Difference]: Without dead ends: 8569 [2019-09-08 16:07:08,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-08 16:07:08,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8569 states. [2019-09-08 16:07:08,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8569 to 8532. [2019-09-08 16:07:08,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8532 states. [2019-09-08 16:07:08,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8532 states to 8532 states and 11715 transitions. [2019-09-08 16:07:08,783 INFO L78 Accepts]: Start accepts. Automaton has 8532 states and 11715 transitions. Word has length 226 [2019-09-08 16:07:08,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:07:08,784 INFO L475 AbstractCegarLoop]: Abstraction has 8532 states and 11715 transitions. [2019-09-08 16:07:08,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 16:07:08,784 INFO L276 IsEmpty]: Start isEmpty. Operand 8532 states and 11715 transitions. [2019-09-08 16:07:08,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-08 16:07:08,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:07:08,800 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 16:07:08,801 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:07:08,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:07:08,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1725427653, now seen corresponding path program 1 times [2019-09-08 16:07:08,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:07:08,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:07:08,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:07:08,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:07:08,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:07:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:07:09,313 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 16:07:09,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:07:09,314 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 16:07:09,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:07:22,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2019-09-08 16:07:23,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 16:07:23,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-08 16:07:23,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 16:07:23,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 16:07:23,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 16:07:23,129 INFO L87 Difference]: Start difference. First operand 8532 states and 11715 transitions. Second operand 10 states. [2019-09-08 16:07:44,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:07:44,670 INFO L93 Difference]: Finished difference Result 20672 states and 28495 transitions. [2019-09-08 16:07:44,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 16:07:44,671 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 249 [2019-09-08 16:07:44,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:07:44,723 INFO L225 Difference]: With dead ends: 20672 [2019-09-08 16:07:44,724 INFO L226 Difference]: Without dead ends: 12175 [2019-09-08 16:07:44,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2019-09-08 16:07:44,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12175 states. [2019-09-08 16:07:45,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12175 to 11800. [2019-09-08 16:07:45,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11800 states. [2019-09-08 16:07:45,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11800 states to 11800 states and 16165 transitions. [2019-09-08 16:07:45,321 INFO L78 Accepts]: Start accepts. Automaton has 11800 states and 16165 transitions. Word has length 249 [2019-09-08 16:07:45,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:07:45,322 INFO L475 AbstractCegarLoop]: Abstraction has 11800 states and 16165 transitions. [2019-09-08 16:07:45,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 16:07:45,322 INFO L276 IsEmpty]: Start isEmpty. Operand 11800 states and 16165 transitions. [2019-09-08 16:07:45,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-08 16:07:45,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:07:45,338 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 16:07:45,339 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:07:45,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:07:45,339 INFO L82 PathProgramCache]: Analyzing trace with hash -109338667, now seen corresponding path program 2 times [2019-09-08 16:07:45,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:07:45,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:07:45,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:07:45,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:07:45,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:07:45,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:07:46,205 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 16:07:46,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:07:46,206 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:07:46,239 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 16:08:11,731 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 16:08:11,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2019-09-08 16:08:12,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 16:08:12,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-09-08 16:08:12,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 16:08:12,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 16:08:12,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 16:08:12,138 INFO L87 Difference]: Start difference. First operand 11800 states and 16165 transitions. Second operand 9 states. [2019-09-08 16:08:30,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:08:30,471 INFO L93 Difference]: Finished difference Result 23773 states and 32642 transitions. [2019-09-08 16:08:30,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 16:08:30,471 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 249 [2019-09-08 16:08:30,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:08:30,516 INFO L225 Difference]: With dead ends: 23773 [2019-09-08 16:08:30,516 INFO L226 Difference]: Without dead ends: 12008 [2019-09-08 16:08:30,548 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2019-09-08 16:08:30,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12008 states. [2019-09-08 16:08:31,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12008 to 11806. [2019-09-08 16:08:31,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11806 states. [2019-09-08 16:08:31,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11806 states to 11806 states and 16159 transitions. [2019-09-08 16:08:31,184 INFO L78 Accepts]: Start accepts. Automaton has 11806 states and 16159 transitions. Word has length 249 [2019-09-08 16:08:31,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:08:31,184 INFO L475 AbstractCegarLoop]: Abstraction has 11806 states and 16159 transitions. [2019-09-08 16:08:31,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 16:08:31,185 INFO L276 IsEmpty]: Start isEmpty. Operand 11806 states and 16159 transitions. [2019-09-08 16:08:31,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-08 16:08:31,195 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:08:31,196 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 16:08:31,196 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:08:31,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:08:31,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1362326058, now seen corresponding path program 1 times [2019-09-08 16:08:31,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:08:31,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:08:31,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:08:31,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:08:31,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:08:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:08:31,846 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-09-08 16:08:31,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:08:31,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 16:08:31,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 16:08:31,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 16:08:31,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 16:08:31,849 INFO L87 Difference]: Start difference. First operand 11806 states and 16159 transitions. Second operand 8 states. [2019-09-08 16:08:35,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:08:35,196 INFO L93 Difference]: Finished difference Result 23523 states and 32214 transitions. [2019-09-08 16:08:35,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 16:08:35,197 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 250 [2019-09-08 16:08:35,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:08:35,235 INFO L225 Difference]: With dead ends: 23523 [2019-09-08 16:08:35,236 INFO L226 Difference]: Without dead ends: 11752 [2019-09-08 16:08:35,265 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-08 16:08:35,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11752 states. [2019-09-08 16:08:35,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11752 to 11716. [2019-09-08 16:08:35,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11716 states. [2019-09-08 16:08:35,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11716 states to 11716 states and 16021 transitions. [2019-09-08 16:08:35,880 INFO L78 Accepts]: Start accepts. Automaton has 11716 states and 16021 transitions. Word has length 250 [2019-09-08 16:08:35,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:08:35,881 INFO L475 AbstractCegarLoop]: Abstraction has 11716 states and 16021 transitions. [2019-09-08 16:08:35,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 16:08:35,881 INFO L276 IsEmpty]: Start isEmpty. Operand 11716 states and 16021 transitions. [2019-09-08 16:08:35,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-09-08 16:08:35,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:08:35,892 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 16:08:35,892 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:08:35,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:08:35,892 INFO L82 PathProgramCache]: Analyzing trace with hash -2065665754, now seen corresponding path program 1 times [2019-09-08 16:08:35,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:08:35,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:08:35,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:08:35,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:08:35,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:08:36,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:08:36,516 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-09-08 16:08:36,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:08:36,517 INFO L223 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-09-08 16:08:36,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:08:37,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:08:37,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 5404 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 16:08:37,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:08:38,056 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-09-08 16:08:38,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 16:08:38,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2019-09-08 16:08:38,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 16:08:38,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 16:08:38,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 16:08:38,083 INFO L87 Difference]: Start difference. First operand 11716 states and 16021 transitions. Second operand 5 states. [2019-09-08 16:08:45,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:08:45,398 INFO L93 Difference]: Finished difference Result 46718 states and 63932 transitions. [2019-09-08 16:08:45,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 16:08:45,399 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 266 [2019-09-08 16:08:45,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:08:45,531 INFO L225 Difference]: With dead ends: 46718 [2019-09-08 16:08:45,531 INFO L226 Difference]: Without dead ends: 46681 [2019-09-08 16:08:45,548 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 16:08:45,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46681 states. [2019-09-08 16:08:46,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46681 to 34988. [2019-09-08 16:08:46,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34988 states. [2019-09-08 16:08:46,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34988 states to 34988 states and 47893 transitions. [2019-09-08 16:08:46,950 INFO L78 Accepts]: Start accepts. Automaton has 34988 states and 47893 transitions. Word has length 266 [2019-09-08 16:08:46,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:08:46,951 INFO L475 AbstractCegarLoop]: Abstraction has 34988 states and 47893 transitions. [2019-09-08 16:08:46,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 16:08:46,951 INFO L276 IsEmpty]: Start isEmpty. Operand 34988 states and 47893 transitions. [2019-09-08 16:08:46,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-09-08 16:08:46,963 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:08:46,963 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 16:08:46,963 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:08:46,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:08:46,964 INFO L82 PathProgramCache]: Analyzing trace with hash 2095288036, now seen corresponding path program 1 times [2019-09-08 16:08:46,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:08:46,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:08:46,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:08:46,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:08:46,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:08:47,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:08:47,293 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-09-08 16:08:47,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:08:47,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 16:08:47,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 16:08:47,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 16:08:47,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 16:08:47,295 INFO L87 Difference]: Start difference. First operand 34988 states and 47893 transitions. Second operand 5 states. [2019-09-08 16:08:49,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:08:49,629 INFO L93 Difference]: Finished difference Result 104978 states and 143737 transitions. [2019-09-08 16:08:49,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 16:08:49,629 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 266 [2019-09-08 16:08:49,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:08:49,908 INFO L225 Difference]: With dead ends: 104978 [2019-09-08 16:08:49,908 INFO L226 Difference]: Without dead ends: 70025 [2019-09-08 16:08:49,990 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 16:08:50,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70025 states. [2019-09-08 16:08:53,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70025 to 35052. [2019-09-08 16:08:53,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35052 states. [2019-09-08 16:08:53,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35052 states to 35052 states and 47987 transitions. [2019-09-08 16:08:53,605 INFO L78 Accepts]: Start accepts. Automaton has 35052 states and 47987 transitions. Word has length 266 [2019-09-08 16:08:53,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:08:53,605 INFO L475 AbstractCegarLoop]: Abstraction has 35052 states and 47987 transitions. [2019-09-08 16:08:53,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 16:08:53,606 INFO L276 IsEmpty]: Start isEmpty. Operand 35052 states and 47987 transitions. [2019-09-08 16:08:53,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-09-08 16:08:53,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:08:53,617 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 16:08:53,617 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:08:53,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:08:53,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1261700650, now seen corresponding path program 1 times [2019-09-08 16:08:53,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:08:53,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:08:53,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:08:53,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:08:53,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:08:55,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:08:55,917 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-09-08 16:08:55,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:08:55,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 16:08:55,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 16:08:55,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 16:08:55,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 16:08:55,919 INFO L87 Difference]: Start difference. First operand 35052 states and 47987 transitions. Second operand 4 states. [2019-09-08 16:08:57,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:08:57,074 INFO L93 Difference]: Finished difference Result 70141 states and 96339 transitions. [2019-09-08 16:08:57,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 16:08:57,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 266 [2019-09-08 16:08:57,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:08:57,211 INFO L225 Difference]: With dead ends: 70141 [2019-09-08 16:08:57,211 INFO L226 Difference]: Without dead ends: 35052 [2019-09-08 16:08:57,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 16:08:57,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35052 states. [2019-09-08 16:08:58,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35052 to 35052. [2019-09-08 16:08:58,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35052 states. [2019-09-08 16:08:59,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35052 states to 35052 states and 47963 transitions. [2019-09-08 16:08:59,023 INFO L78 Accepts]: Start accepts. Automaton has 35052 states and 47963 transitions. Word has length 266 [2019-09-08 16:08:59,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:08:59,024 INFO L475 AbstractCegarLoop]: Abstraction has 35052 states and 47963 transitions. [2019-09-08 16:08:59,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 16:08:59,024 INFO L276 IsEmpty]: Start isEmpty. Operand 35052 states and 47963 transitions. [2019-09-08 16:08:59,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-09-08 16:08:59,039 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:08:59,040 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 16:08:59,040 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:08:59,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:08:59,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1696006800, now seen corresponding path program 1 times [2019-09-08 16:08:59,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:08:59,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:08:59,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:08:59,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:08:59,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:09:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:09:31,063 WARN L188 SmtUtils]: Spent 1.62 s on a formula simplification that was a NOOP. DAG size: 31 [2019-09-08 16:09:37,263 WARN L188 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 38 [2019-09-08 16:09:42,449 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-08 16:09:42,653 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-08 16:09:48,716 WARN L188 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-09-08 16:09:57,883 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 17 proven. 12 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 16:09:57,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:09:57,883 INFO L223 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-09-08 16:09:57,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:10:11,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2019-09-08 16:10:11,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 16:10:11,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-09-08 16:10:11,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-08 16:10:11,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-08 16:10:11,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1088, Unknown=7, NotChecked=0, Total=1190 [2019-09-08 16:10:11,490 INFO L87 Difference]: Start difference. First operand 35052 states and 47963 transitions. Second operand 35 states. [2019-09-08 16:10:50,626 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-09-08 16:11:17,497 WARN L188 SmtUtils]: Spent 659.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-09-08 16:11:56,464 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-09-08 16:12:06,318 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-09-08 16:12:21,223 WARN L188 SmtUtils]: Spent 2.12 s on a formula simplification that was a NOOP. DAG size: 50 [2019-09-08 16:12:35,798 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-09-08 16:12:52,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:12:52,645 INFO L93 Difference]: Finished difference Result 93519 states and 129349 transitions. [2019-09-08 16:12:52,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-08 16:12:52,646 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 271 [2019-09-08 16:12:52,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:12:52,911 INFO L225 Difference]: With dead ends: 93519 [2019-09-08 16:12:52,911 INFO L226 Difference]: Without dead ends: 58502 [2019-09-08 16:12:53,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1713 ImplicationChecksByTransitivity, 57.8s TimeCoverageRelationStatistics Valid=531, Invalid=6594, Unknown=15, NotChecked=0, Total=7140 [2019-09-08 16:12:53,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58502 states. [2019-09-08 16:12:55,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58502 to 54042. [2019-09-08 16:12:55,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54042 states. [2019-09-08 16:12:55,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54042 states to 54042 states and 74177 transitions. [2019-09-08 16:12:55,806 INFO L78 Accepts]: Start accepts. Automaton has 54042 states and 74177 transitions. Word has length 271 [2019-09-08 16:12:55,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:12:55,807 INFO L475 AbstractCegarLoop]: Abstraction has 54042 states and 74177 transitions. [2019-09-08 16:12:55,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-08 16:12:55,807 INFO L276 IsEmpty]: Start isEmpty. Operand 54042 states and 74177 transitions. [2019-09-08 16:12:55,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-09-08 16:12:55,825 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:12:55,826 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 16:12:55,826 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:12:55,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:12:55,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1352275001, now seen corresponding path program 1 times [2019-09-08 16:12:55,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:12:55,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:12:55,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:12:55,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:12:55,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:13:05,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:13:11,168 WARN L188 SmtUtils]: Spent 1.15 s on a formula simplification that was a NOOP. DAG size: 38 [2019-09-08 16:13:12,105 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-08 16:13:12,311 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-08 16:13:12,721 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-08 16:13:15,556 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-08 16:13:15,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:13:15,556 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:13:15,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:13:28,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2019-09-08 16:13:29,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 16:13:29,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-09-08 16:13:29,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-08 16:13:29,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-08 16:13:29,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=795, Unknown=2, NotChecked=0, Total=870 [2019-09-08 16:13:29,324 INFO L87 Difference]: Start difference. First operand 54042 states and 74177 transitions. Second operand 30 states. [2019-09-08 16:14:12,061 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2019-09-08 16:14:14,282 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-09-08 16:14:31,902 WARN L188 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 48 DAG size of output: 35 [2019-09-08 16:14:54,492 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-09-08 16:15:01,069 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-09-08 16:15:07,175 WARN L188 SmtUtils]: Spent 2.40 s on a formula simplification that was a NOOP. DAG size: 52 [2019-09-08 16:15:14,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:15:14,106 INFO L93 Difference]: Finished difference Result 112407 states and 155581 transitions. [2019-09-08 16:15:14,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-08 16:15:14,106 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 272 [2019-09-08 16:15:14,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:15:14,362 INFO L225 Difference]: With dead ends: 112407 [2019-09-08 16:15:14,362 INFO L226 Difference]: Without dead ends: 58400 [2019-09-08 16:15:14,470 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 838 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=366, Invalid=3921, Unknown=3, NotChecked=0, Total=4290 [2019-09-08 16:15:14,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58400 states. [2019-09-08 16:15:17,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58400 to 54090. [2019-09-08 16:15:17,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54090 states. [2019-09-08 16:15:17,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54090 states to 54090 states and 74327 transitions. [2019-09-08 16:15:17,245 INFO L78 Accepts]: Start accepts. Automaton has 54090 states and 74327 transitions. Word has length 272 [2019-09-08 16:15:17,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:15:17,246 INFO L475 AbstractCegarLoop]: Abstraction has 54090 states and 74327 transitions. [2019-09-08 16:15:17,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-08 16:15:17,246 INFO L276 IsEmpty]: Start isEmpty. Operand 54090 states and 74327 transitions. [2019-09-08 16:15:17,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-09-08 16:15:17,267 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:15:17,267 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 16:15:17,268 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:15:17,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:15:17,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1784325341, now seen corresponding path program 1 times [2019-09-08 16:15:17,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:15:17,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:15:17,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:15:17,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:15:17,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:15:17,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:15:17,533 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-08 16:15:17,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:15:17,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:15:17,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:15:17,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:15:17,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:15:17,534 INFO L87 Difference]: Start difference. First operand 54090 states and 74327 transitions. Second operand 3 states. [2019-09-08 16:15:19,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:15:19,786 INFO L93 Difference]: Finished difference Result 108229 states and 156075 transitions. [2019-09-08 16:15:19,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:15:19,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 287 [2019-09-08 16:15:19,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:15:20,050 INFO L225 Difference]: With dead ends: 108229 [2019-09-08 16:15:20,051 INFO L226 Difference]: Without dead ends: 54174 [2019-09-08 16:15:20,207 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:15:20,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54174 states. [2019-09-08 16:15:22,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54174 to 54090. [2019-09-08 16:15:22,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54090 states. [2019-09-08 16:15:22,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54090 states to 54090 states and 74075 transitions. [2019-09-08 16:15:22,892 INFO L78 Accepts]: Start accepts. Automaton has 54090 states and 74075 transitions. Word has length 287 [2019-09-08 16:15:22,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:15:22,893 INFO L475 AbstractCegarLoop]: Abstraction has 54090 states and 74075 transitions. [2019-09-08 16:15:22,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:15:22,893 INFO L276 IsEmpty]: Start isEmpty. Operand 54090 states and 74075 transitions. [2019-09-08 16:15:22,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-09-08 16:15:22,913 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:15:22,913 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 16:15:22,913 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:15:22,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:15:22,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1222059696, now seen corresponding path program 1 times [2019-09-08 16:15:22,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:15:22,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:15:22,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:15:22,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:15:22,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:15:49,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:16:00,795 WARN L188 SmtUtils]: Spent 8.59 s on a formula simplification that was a NOOP. DAG size: 38 [2019-09-08 16:16:01,816 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-08 16:16:02,084 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-08 16:16:03,878 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-09-08 16:16:08,538 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-08 16:16:08,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:16:08,539 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:16:08,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:16:21,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2019-09-08 16:16:22,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 16:16:22,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-09-08 16:16:22,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-08 16:16:22,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-08 16:16:22,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=796, Unknown=1, NotChecked=0, Total=870 [2019-09-08 16:16:22,206 INFO L87 Difference]: Start difference. First operand 54090 states and 74075 transitions. Second operand 30 states. [2019-09-08 16:17:01,724 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2019-09-08 16:17:01,960 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-09-08 16:17:22,543 WARN L188 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 48 DAG size of output: 35 [2019-09-08 16:17:36,865 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-09-08 16:17:41,592 WARN L188 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-09-08 16:17:52,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:17:52,581 INFO L93 Difference]: Finished difference Result 112371 states and 154963 transitions. [2019-09-08 16:17:52,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-08 16:17:52,588 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 290 [2019-09-08 16:17:52,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:17:52,822 INFO L225 Difference]: With dead ends: 112371 [2019-09-08 16:17:52,822 INFO L226 Difference]: Without dead ends: 58316 [2019-09-08 16:17:52,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 800 ImplicationChecksByTransitivity, 23.9s TimeCoverageRelationStatistics Valid=355, Invalid=3804, Unknown=1, NotChecked=0, Total=4160 [2019-09-08 16:17:52,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58316 states. [2019-09-08 16:17:55,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58316 to 54042. [2019-09-08 16:17:55,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54042 states. [2019-09-08 16:17:55,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54042 states to 54042 states and 73913 transitions. [2019-09-08 16:17:55,352 INFO L78 Accepts]: Start accepts. Automaton has 54042 states and 73913 transitions. Word has length 290 [2019-09-08 16:17:55,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:17:55,352 INFO L475 AbstractCegarLoop]: Abstraction has 54042 states and 73913 transitions. [2019-09-08 16:17:55,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-08 16:17:55,352 INFO L276 IsEmpty]: Start isEmpty. Operand 54042 states and 73913 transitions. [2019-09-08 16:17:55,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-09-08 16:17:55,370 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:17:55,370 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 16:17:55,371 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:17:55,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:17:55,371 INFO L82 PathProgramCache]: Analyzing trace with hash 773069958, now seen corresponding path program 1 times [2019-09-08 16:17:55,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:17:55,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:17:55,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:17:55,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:17:55,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:17:55,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:17:55,744 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-09-08 16:17:55,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:17:55,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:17:55,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:17:55,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:17:55,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:17:55,745 INFO L87 Difference]: Start difference. First operand 54042 states and 73913 transitions. Second operand 3 states. [2019-09-08 16:18:00,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:18:00,532 INFO L93 Difference]: Finished difference Result 108049 states and 147789 transitions. [2019-09-08 16:18:00,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:18:00,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 288 [2019-09-08 16:18:00,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:18:00,737 INFO L225 Difference]: With dead ends: 108049 [2019-09-08 16:18:00,737 INFO L226 Difference]: Without dead ends: 53676 [2019-09-08 16:18:00,842 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:18:00,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53676 states. [2019-09-08 16:18:03,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53676 to 53432. [2019-09-08 16:18:03,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53432 states. [2019-09-08 16:18:03,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53432 states to 53432 states and 73025 transitions. [2019-09-08 16:18:03,521 INFO L78 Accepts]: Start accepts. Automaton has 53432 states and 73025 transitions. Word has length 288 [2019-09-08 16:18:03,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:18:03,522 INFO L475 AbstractCegarLoop]: Abstraction has 53432 states and 73025 transitions. [2019-09-08 16:18:03,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:18:03,522 INFO L276 IsEmpty]: Start isEmpty. Operand 53432 states and 73025 transitions. [2019-09-08 16:18:03,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-09-08 16:18:03,540 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:18:03,540 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 16:18:03,540 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:18:03,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:18:03,541 INFO L82 PathProgramCache]: Analyzing trace with hash 109077640, now seen corresponding path program 1 times [2019-09-08 16:18:03,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:18:03,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:18:03,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:18:03,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:18:03,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:18:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:18:03,856 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-09-08 16:18:03,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:18:03,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:18:03,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:18:03,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:18:03,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:18:03,859 INFO L87 Difference]: Start difference. First operand 53432 states and 73025 transitions. Second operand 3 states. [2019-09-08 16:18:07,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:18:07,965 INFO L93 Difference]: Finished difference Result 79741 states and 109028 transitions. [2019-09-08 16:18:07,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:18:07,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 288 [2019-09-08 16:18:07,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:18:08,054 INFO L225 Difference]: With dead ends: 79741 [2019-09-08 16:18:08,054 INFO L226 Difference]: Without dead ends: 26343 [2019-09-08 16:18:08,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:18:08,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26343 states. [2019-09-08 16:18:09,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26343 to 26343. [2019-09-08 16:18:09,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26343 states. [2019-09-08 16:18:09,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26343 states to 26343 states and 36038 transitions. [2019-09-08 16:18:09,219 INFO L78 Accepts]: Start accepts. Automaton has 26343 states and 36038 transitions. Word has length 288 [2019-09-08 16:18:09,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:18:09,220 INFO L475 AbstractCegarLoop]: Abstraction has 26343 states and 36038 transitions. [2019-09-08 16:18:09,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:18:09,220 INFO L276 IsEmpty]: Start isEmpty. Operand 26343 states and 36038 transitions. [2019-09-08 16:18:09,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-08 16:18:09,229 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:18:09,229 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 16:18:09,230 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:18:09,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:18:09,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1357232528, now seen corresponding path program 1 times [2019-09-08 16:18:09,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:18:09,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:18:09,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:18:09,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:18:09,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:18:09,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:18:09,875 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-09-08 16:18:09,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:18:09,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 16:18:09,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 16:18:09,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 16:18:09,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 16:18:09,879 INFO L87 Difference]: Start difference. First operand 26343 states and 36038 transitions. Second operand 9 states. [2019-09-08 16:18:11,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:18:11,327 INFO L93 Difference]: Finished difference Result 52653 states and 72195 transitions. [2019-09-08 16:18:11,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 16:18:11,327 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 314 [2019-09-08 16:18:11,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:18:11,410 INFO L225 Difference]: With dead ends: 52653 [2019-09-08 16:18:11,410 INFO L226 Difference]: Without dead ends: 26439 [2019-09-08 16:18:11,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 16:18:11,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26439 states. [2019-09-08 16:18:12,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26439 to 26439. [2019-09-08 16:18:12,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26439 states. [2019-09-08 16:18:12,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26439 states to 26439 states and 36134 transitions. [2019-09-08 16:18:12,523 INFO L78 Accepts]: Start accepts. Automaton has 26439 states and 36134 transitions. Word has length 314 [2019-09-08 16:18:12,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:18:12,523 INFO L475 AbstractCegarLoop]: Abstraction has 26439 states and 36134 transitions. [2019-09-08 16:18:12,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 16:18:12,523 INFO L276 IsEmpty]: Start isEmpty. Operand 26439 states and 36134 transitions. [2019-09-08 16:18:12,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-09-08 16:18:12,532 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:18:12,532 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 16:18:12,532 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:18:12,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:18:12,533 INFO L82 PathProgramCache]: Analyzing trace with hash -177276072, now seen corresponding path program 1 times [2019-09-08 16:18:12,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:18:12,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:18:12,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:18:12,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:18:12,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:18:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:18:24,019 WARN L188 SmtUtils]: Spent 5.67 s on a formula simplification that was a NOOP. DAG size: 42 [2019-09-08 16:18:32,727 WARN L188 SmtUtils]: Spent 4.27 s on a formula simplification that was a NOOP. DAG size: 46 [2019-09-08 16:18:39,320 WARN L188 SmtUtils]: Spent 6.44 s on a formula simplification that was a NOOP. DAG size: 43 [2019-09-08 16:18:41,582 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2019-09-08 16:18:41,762 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2019-09-08 16:18:46,499 WARN L188 SmtUtils]: Spent 4.46 s on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-09-08 16:18:47,703 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-08 16:18:48,409 WARN L188 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50