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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--usb--class--cdc-wdm.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:02:26,370 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:02:26,373 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:02:26,387 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:02:26,388 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:02:26,390 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:02:26,392 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:02:26,395 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:02:26,400 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:02:26,402 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:02:26,403 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:02:26,405 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:02:26,408 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:02:26,410 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:02:26,414 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:02:26,417 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:02:26,419 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:02:26,420 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:02:26,422 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:02:26,425 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:02:26,427 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:02:26,428 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:02:26,430 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:02:26,431 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:02:26,435 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:02:26,435 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:02:26,436 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:02:26,437 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:02:26,437 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:02:26,439 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:02:26,439 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:02:26,440 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:02:26,441 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:02:26,442 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:02:26,443 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:02:26,443 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:02:26,444 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:02:26,445 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:02:26,445 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:02:26,446 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:02:26,447 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:02:26,448 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 02:02:26,466 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:02:26,467 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:02:26,467 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:02:26,467 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:02:26,468 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:02:26,469 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:02:26,469 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:02:26,469 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:02:26,469 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:02:26,469 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:02:26,474 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:02:26,474 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:02:26,474 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:02:26,474 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:02:26,475 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:02:26,475 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:02:26,475 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:02:26,475 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:02:26,475 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:02:26,476 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:02:26,476 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:02:26,476 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:02:26,476 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:02:26,477 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:02:26,477 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:02:26,479 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:02:26,479 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:02:26,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:02:26,479 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:02:26,480 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:02:26,550 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:02:26,568 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:02:26,572 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:02:26,574 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:02:26,574 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:02:26,575 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--usb--class--cdc-wdm.ko-entry_point.cil.out.i [2019-10-03 02:02:26,661 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4a2919e2/fc0bef93d3f743299b5b296a106b1e31/FLAG2da3d4ac2 [2019-10-03 02:02:27,761 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:02:27,762 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--usb--class--cdc-wdm.ko-entry_point.cil.out.i [2019-10-03 02:02:27,818 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4a2919e2/fc0bef93d3f743299b5b296a106b1e31/FLAG2da3d4ac2 [2019-10-03 02:02:28,058 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4a2919e2/fc0bef93d3f743299b5b296a106b1e31 [2019-10-03 02:02:28,071 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:02:28,073 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:02:28,075 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:02:28,075 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:02:28,080 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:02:28,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:02:28" (1/1) ... [2019-10-03 02:02:28,085 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b5d4e77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:02:28, skipping insertion in model container [2019-10-03 02:02:28,086 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:02:28" (1/1) ... [2019-10-03 02:02:28,095 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:02:28,255 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:02:31,428 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:02:31,506 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:02:31,887 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:02:32,455 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:02:32,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:02:32 WrapperNode [2019-10-03 02:02:32,457 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:02:32,458 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:02:32,459 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:02:32,459 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:02:32,482 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:02:32" (1/1) ... [2019-10-03 02:02:32,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:02:32" (1/1) ... [2019-10-03 02:02:32,656 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:02:32" (1/1) ... [2019-10-03 02:02:32,661 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:02:32" (1/1) ... [2019-10-03 02:02:32,839 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:02:32" (1/1) ... [2019-10-03 02:02:32,892 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:02:32" (1/1) ... [2019-10-03 02:02:32,940 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:02:32" (1/1) ... [2019-10-03 02:02:32,983 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:02:32,984 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:02:32,984 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:02:32,985 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:02:32,986 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:02:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:02:33,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:02:33,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:02:33,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~$Pointer$~TO~VOID [2019-10-03 02:02:33,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~int [2019-10-03 02:02:33,102 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2019-10-03 02:02:33,102 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2019-10-03 02:02:33,103 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2019-10-03 02:02:33,103 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2019-10-03 02:02:33,103 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2019-10-03 02:02:33,103 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2019-10-03 02:02:33,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-10-03 02:02:33,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-10-03 02:02:33,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2019-10-03 02:02:33,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2019-10-03 02:02:33,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2019-10-03 02:02:33,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ptr [2019-10-03 02:02:33,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2019-10-03 02:02:33,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2019-10-03 02:02:33,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-10-03 02:02:33,108 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2019-10-03 02:02:33,108 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2019-10-03 02:02:33,109 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_irq [2019-10-03 02:02:33,109 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2019-10-03 02:02:33,109 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irq [2019-10-03 02:02:33,110 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2019-10-03 02:02:33,110 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_work [2019-10-03 02:02:33,110 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_work [2019-10-03 02:02:33,111 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2019-10-03 02:02:33,111 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2019-10-03 02:02:33,111 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2019-10-03 02:02:33,111 INFO L138 BoogieDeclarations]: Found implementation of procedure kobject_name [2019-10-03 02:02:33,112 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2019-10-03 02:02:33,112 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2019-10-03 02:02:33,112 INFO L138 BoogieDeclarations]: Found implementation of procedure iminor [2019-10-03 02:02:33,112 INFO L138 BoogieDeclarations]: Found implementation of procedure poll_wait [2019-10-03 02:02:33,113 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_in [2019-10-03 02:02:33,113 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_int [2019-10-03 02:02:33,113 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_is_int_in [2019-10-03 02:02:33,113 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_maxp [2019-10-03 02:02:33,113 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_name [2019-10-03 02:02:33,113 INFO L138 BoogieDeclarations]: Found implementation of procedure pm_runtime_mark_last_busy [2019-10-03 02:02:33,114 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2019-10-03 02:02:33,114 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_mark_last_busy [2019-10-03 02:02:33,114 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_control_urb [2019-10-03 02:02:33,114 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_int_urb [2019-10-03 02:02:33,114 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2019-10-03 02:02:33,115 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_translate_errors [2019-10-03 02:02:33,115 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_find_device [2019-10-03 02:02:33,115 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_find_device_by_minor [2019-10-03 02:02:33,116 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_out_callback [2019-10-03 02:02:33,116 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_in_callback [2019-10-03 02:02:33,116 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_int_callback [2019-10-03 02:02:33,116 INFO L138 BoogieDeclarations]: Found implementation of procedure kill_urbs [2019-10-03 02:02:33,116 INFO L138 BoogieDeclarations]: Found implementation of procedure free_urbs [2019-10-03 02:02:33,116 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-03 02:02:33,117 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_write [2019-10-03 02:02:33,117 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_wdm_read_flag [2019-10-03 02:02:33,117 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_read [2019-10-03 02:02:33,118 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_flush [2019-10-03 02:02:33,118 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_poll [2019-10-03 02:02:33,118 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_open [2019-10-03 02:02:33,118 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_release [2019-10-03 02:02:33,118 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_ioctl [2019-10-03 02:02:33,118 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_rxwork [2019-10-03 02:02:33,119 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_create [2019-10-03 02:02:33,119 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_manage_power [2019-10-03 02:02:33,119 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_probe [2019-10-03 02:02:33,120 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_cdc_wdm_register [2019-10-03 02:02:33,120 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_disconnect [2019-10-03 02:02:33,120 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_suspend [2019-10-03 02:02:33,120 INFO L138 BoogieDeclarations]: Found implementation of procedure recover_from_urb_loss [2019-10-03 02:02:33,120 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_resume [2019-10-03 02:02:33,121 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_pre_reset [2019-10-03 02:02:33,122 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_post_reset [2019-10-03 02:02:33,122 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_driver_init [2019-10-03 02:02:33,122 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_driver_exit [2019-10-03 02:02:33,123 INFO L138 BoogieDeclarations]: Found implementation of procedure call_and_disable_all_1 [2019-10-03 02:02:33,123 INFO L138 BoogieDeclarations]: Found implementation of procedure invoke_work_1 [2019-10-03 02:02:33,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_driver_2 [2019-10-03 02:02:33,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_file_operations_3 [2019-10-03 02:02:33,123 INFO L138 BoogieDeclarations]: Found implementation of procedure call_and_disable_work_1 [2019-10-03 02:02:33,123 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_work_1 [2019-10-03 02:02:33,124 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_work_1 [2019-10-03 02:02:33,124 INFO L138 BoogieDeclarations]: Found implementation of procedure work_init_1 [2019-10-03 02:02:33,124 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:02:33,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ERR_PTR [2019-10-03 02:02:33,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_queue_work_on_5 [2019-10-03 02:02:33,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_queue_delayed_work_on_6 [2019-10-03 02:02:33,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_queue_work_on_7 [2019-10-03 02:02:33,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_flush_workqueue_8 [2019-10-03 02:02:33,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_queue_delayed_work_on_9 [2019-10-03 02:02:33,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_10 [2019-10-03 02:02:33,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_11 [2019-10-03 02:02:33,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_12 [2019-10-03 02:02:33,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_13 [2019-10-03 02:02:33,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_14 [2019-10-03 02:02:33,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_15 [2019-10-03 02:02:33,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_16 [2019-10-03 02:02:33,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_17 [2019-10-03 02:02:33,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_18 [2019-10-03 02:02:33,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_19 [2019-10-03 02:02:33,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_20 [2019-10-03 02:02:33,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_21 [2019-10-03 02:02:33,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_22 [2019-10-03 02:02:33,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_23 [2019-10-03 02:02:33,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_24 [2019-10-03 02:02:33,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_25 [2019-10-03 02:02:33,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_26 [2019-10-03 02:02:33,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_27 [2019-10-03 02:02:33,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_28 [2019-10-03 02:02:33,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_29 [2019-10-03 02:02:33,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_30 [2019-10-03 02:02:33,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_31 [2019-10-03 02:02:33,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_32 [2019-10-03 02:02:33,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_cancel_work_sync_33 [2019-10-03 02:02:33,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_34 [2019-10-03 02:02:33,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_35 [2019-10-03 02:02:33,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_36 [2019-10-03 02:02:33,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_37 [2019-10-03 02:02:33,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_38 [2019-10-03 02:02:33,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_cancel_work_sync_39 [2019-10-03 02:02:33,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_40 [2019-10-03 02:02:33,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_41 [2019-10-03 02:02:33,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_42 [2019-10-03 02:02:33,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_43 [2019-10-03 02:02:33,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_cancel_work_sync_44 [2019-10-03 02:02:33,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_45 [2019-10-03 02:02:33,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_46 [2019-10-03 02:02:33,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_register_driver_47 [2019-10-03 02:02:33,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_deregister_48 [2019-10-03 02:02:33,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-10-03 02:02:33,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_negative [2019-10-03 02:02:33,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2019-10-03 02:02:33,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_err_ptr [2019-10-03 02:02:33,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_ptr_err [2019-10-03 02:02:33,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err_or_null [2019-10-03 02:02:33,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_i_mutex_of_inode [2019-10-03 02:02:33,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_i_mutex_of_inode [2019-10-03 02:02:33,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_i_mutex_of_inode [2019-10-03 02:02:33,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_i_mutex_of_inode [2019-10-03 02:02:33,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_i_mutex_of_inode [2019-10-03 02:02:33,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_i_mutex_of_inode [2019-10-03 02:02:33,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_i_mutex_of_inode [2019-10-03 02:02:33,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_i_mutex_of_inode [2019-10-03 02:02:33,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_trylock_device_i_mutex_of_inode [2019-10-03 02:02:33,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_for_reset_i_mutex_of_inode [2019-10-03 02:02:33,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_unlock_device_i_mutex_of_inode [2019-10-03 02:02:33,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_lock [2019-10-03 02:02:33,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_lock [2019-10-03 02:02:33,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_lock [2019-10-03 02:02:33,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_lock [2019-10-03 02:02:33,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_lock [2019-10-03 02:02:33,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_lock [2019-10-03 02:02:33,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_lock [2019-10-03 02:02:33,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_lock [2019-10-03 02:02:33,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_trylock_device_lock [2019-10-03 02:02:33,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_for_reset_lock [2019-10-03 02:02:33,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_unlock_device_lock [2019-10-03 02:02:33,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_mutex_of_device [2019-10-03 02:02:33,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_mutex_of_device [2019-10-03 02:02:33,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mutex_of_device [2019-10-03 02:02:33,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_mutex_of_device [2019-10-03 02:02:33,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_mutex_of_device [2019-10-03 02:02:33,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_mutex_of_device [2019-10-03 02:02:33,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mutex_of_device [2019-10-03 02:02:33,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_mutex_of_device [2019-10-03 02:02:33,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_trylock_device_mutex_of_device [2019-10-03 02:02:33,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_for_reset_mutex_of_device [2019-10-03 02:02:33,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_unlock_device_mutex_of_device [2019-10-03 02:02:33,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_rlock_of_wdm_device [2019-10-03 02:02:33,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_rlock_of_wdm_device [2019-10-03 02:02:33,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_rlock_of_wdm_device [2019-10-03 02:02:33,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_rlock_of_wdm_device [2019-10-03 02:02:33,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_rlock_of_wdm_device [2019-10-03 02:02:33,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_rlock_of_wdm_device [2019-10-03 02:02:33,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_rlock_of_wdm_device [2019-10-03 02:02:33,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_rlock_of_wdm_device [2019-10-03 02:02:33,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_trylock_device_rlock_of_wdm_device [2019-10-03 02:02:33,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_for_reset_rlock_of_wdm_device [2019-10-03 02:02:33,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_unlock_device_rlock_of_wdm_device [2019-10-03 02:02:33,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_wdm_mutex [2019-10-03 02:02:33,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_wdm_mutex [2019-10-03 02:02:33,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_wdm_mutex [2019-10-03 02:02:33,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_wdm_mutex [2019-10-03 02:02:33,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_wdm_mutex [2019-10-03 02:02:33,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_wdm_mutex [2019-10-03 02:02:33,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_wdm_mutex [2019-10-03 02:02:33,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_wdm_mutex [2019-10-03 02:02:33,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_trylock_device_wdm_mutex [2019-10-03 02:02:33,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_for_reset_wdm_mutex [2019-10-03 02:02:33,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_unlock_device_wdm_mutex [2019-10-03 02:02:33,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_wlock_of_wdm_device [2019-10-03 02:02:33,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_wlock_of_wdm_device [2019-10-03 02:02:33,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_wlock_of_wdm_device [2019-10-03 02:02:33,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_wlock_of_wdm_device [2019-10-03 02:02:33,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_wlock_of_wdm_device [2019-10-03 02:02:33,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_wlock_of_wdm_device [2019-10-03 02:02:33,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_wlock_of_wdm_device [2019-10-03 02:02:33,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_wlock_of_wdm_device [2019-10-03 02:02:33,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_trylock_device_wlock_of_wdm_device [2019-10-03 02:02:33,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_for_reset_wlock_of_wdm_device [2019-10-03 02:02:33,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_unlock_device_wlock_of_wdm_device [2019-10-03 02:02:33,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-10-03 02:02:33,166 INFO L138 BoogieDeclarations]: Found implementation of procedure __copy_from_user_overflow [2019-10-03 02:02:33,166 INFO L138 BoogieDeclarations]: Found implementation of procedure __copy_to_user_overflow [2019-10-03 02:02:33,166 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_dev_dbg [2019-10-03 02:02:33,166 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_pr_debug [2019-10-03 02:02:33,167 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2019-10-03 02:02:33,167 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_work [2019-10-03 02:02:33,167 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2019-10-03 02:02:33,167 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_fault [2019-10-03 02:02:33,167 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_sleep [2019-10-03 02:02:33,167 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2019-10-03 02:02:33,167 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2019-10-03 02:02:33,168 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2019-10-03 02:02:33,168 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2019-10-03 02:02:33,168 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2019-10-03 02:02:33,168 INFO L138 BoogieDeclarations]: Found implementation of procedure _dev_info [2019-10-03 02:02:33,168 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock [2019-10-03 02:02:33,168 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irq [2019-10-03 02:02:33,168 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2019-10-03 02:02:33,169 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_unlock [2019-10-03 02:02:33,169 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_unlock_irq [2019-10-03 02:02:33,169 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_unlock_irqrestore [2019-10-03 02:02:33,169 INFO L138 BoogieDeclarations]: Found implementation of procedure cancel_work_sync [2019-10-03 02:02:33,169 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2019-10-03 02:02:33,169 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2019-10-03 02:02:33,169 INFO L138 BoogieDeclarations]: Found implementation of procedure flush_workqueue [2019-10-03 02:02:33,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-10-03 02:02:33,170 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2019-10-03 02:02:33,170 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_init_map [2019-10-03 02:02:33,170 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2019-10-03 02:02:33,170 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_interruptible [2019-10-03 02:02:33,170 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_trylock [2019-10-03 02:02:33,170 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2019-10-03 02:02:33,171 INFO L138 BoogieDeclarations]: Found implementation of procedure noop_llseek [2019-10-03 02:02:33,171 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait_event [2019-10-03 02:02:33,171 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_delayed_work_on [2019-10-03 02:02:33,171 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_work_on [2019-10-03 02:02:33,171 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule [2019-10-03 02:02:33,171 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2019-10-03 02:02:33,171 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_get_interface [2019-10-03 02:02:33,172 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_put_interface [2019-10-03 02:02:33,172 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_deregister [2019-10-03 02:02:33,172 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_deregister_dev [2019-10-03 02:02:33,172 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2019-10-03 02:02:33,172 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2019-10-03 02:02:33,172 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register_dev [2019-10-03 02:02:33,172 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register_driver [2019-10-03 02:02:33,173 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2019-10-03 02:02:33,173 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-10-03 02:02:33,173 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-10-03 02:02:33,173 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-10-03 02:02:33,173 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-10-03 02:02:33,173 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove [2019-10-03 02:02:33,174 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:02:33,174 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-10-03 02:02:33,174 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2019-10-03 02:02:33,174 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2019-10-03 02:02:33,174 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2019-10-03 02:02:33,174 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2019-10-03 02:02:33,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:02:33,175 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_pr_debug [2019-10-03 02:02:33,175 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_dev_dbg [2019-10-03 02:02:33,175 INFO L130 BoogieDeclarations]: Found specification of procedure __might_sleep [2019-10-03 02:02:33,176 INFO L130 BoogieDeclarations]: Found specification of procedure __might_fault [2019-10-03 02:02:33,180 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_err_ptr [2019-10-03 02:02:33,181 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2019-10-03 02:02:33,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:02:33,181 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2019-10-03 02:02:33,181 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2019-10-03 02:02:33,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:02:33,185 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2019-10-03 02:02:33,185 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-10-03 02:02:33,186 INFO L130 BoogieDeclarations]: Found specification of procedure memmove [2019-10-03 02:02:33,186 INFO L130 BoogieDeclarations]: Found specification of procedure ERR_PTR [2019-10-03 02:02:33,186 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_init_map [2019-10-03 02:02:33,186 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2019-10-03 02:02:33,186 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_trylock [2019-10-03 02:02:33,186 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_15 [2019-10-03 02:02:33,186 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2019-10-03 02:02:33,186 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_11 [2019-10-03 02:02:33,187 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_12 [2019-10-03 02:02:33,187 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_16 [2019-10-03 02:02:33,187 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_18 [2019-10-03 02:02:33,188 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_19 [2019-10-03 02:02:33,188 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_21 [2019-10-03 02:02:33,188 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_24 [2019-10-03 02:02:33,188 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_25 [2019-10-03 02:02:33,188 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_28 [2019-10-03 02:02:33,188 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_29 [2019-10-03 02:02:33,188 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_34 [2019-10-03 02:02:33,189 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_35 [2019-10-03 02:02:33,189 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_36 [2019-10-03 02:02:33,189 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_40 [2019-10-03 02:02:33,189 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_41 [2019-10-03 02:02:33,189 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_45 [2019-10-03 02:02:33,189 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_46 [2019-10-03 02:02:33,189 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:02:33,190 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-03 02:02:33,190 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:02:33,190 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-10-03 02:02:33,190 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-03 02:02:33,190 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-03 02:02:33,190 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-10-03 02:02:33,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:02:33,190 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-10-03 02:02:33,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-10-03 02:02:33,191 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2019-10-03 02:02:33,191 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2019-10-03 02:02:33,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-10-03 02:02:33,191 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2019-10-03 02:02:33,191 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ptr [2019-10-03 02:02:33,191 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2019-10-03 02:02:33,191 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2019-10-03 02:02:33,192 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_interruptible [2019-10-03 02:02:33,192 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_17 [2019-10-03 02:02:33,192 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_20 [2019-10-03 02:02:33,192 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2019-10-03 02:02:33,192 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_10 [2019-10-03 02:02:33,192 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_13 [2019-10-03 02:02:33,192 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_14 [2019-10-03 02:02:33,192 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_22 [2019-10-03 02:02:33,193 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_23 [2019-10-03 02:02:33,193 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_26 [2019-10-03 02:02:33,193 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_27 [2019-10-03 02:02:33,193 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_30 [2019-10-03 02:02:33,193 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_31 [2019-10-03 02:02:33,193 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_32 [2019-10-03 02:02:33,193 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_37 [2019-10-03 02:02:33,193 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_38 [2019-10-03 02:02:33,194 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_42 [2019-10-03 02:02:33,194 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_43 [2019-10-03 02:02:33,194 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_i_mutex_of_inode [2019-10-03 02:02:33,194 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_i_mutex_of_inode [2019-10-03 02:02:33,194 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_lock [2019-10-03 02:02:33,194 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_lock [2019-10-03 02:02:33,194 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mutex_of_device [2019-10-03 02:02:33,195 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_mutex_of_device [2019-10-03 02:02:33,195 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mutex_of_device [2019-10-03 02:02:33,195 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_rlock_of_wdm_device [2019-10-03 02:02:33,195 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_rlock_of_wdm_device [2019-10-03 02:02:33,195 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_rlock_of_wdm_device [2019-10-03 02:02:33,195 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_wdm_mutex [2019-10-03 02:02:33,195 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_wdm_mutex [2019-10-03 02:02:33,195 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_wlock_of_wdm_device [2019-10-03 02:02:33,196 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_wlock_of_wdm_device [2019-10-03 02:02:33,196 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_wlock_of_wdm_device [2019-10-03 02:02:33,196 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2019-10-03 02:02:33,196 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock [2019-10-03 02:02:33,196 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irq [2019-10-03 02:02:33,196 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2019-10-03 02:02:33,196 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_unlock [2019-10-03 02:02:33,196 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_unlock_irq [2019-10-03 02:02:33,197 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_unlock_irqrestore [2019-10-03 02:02:33,197 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2019-10-03 02:02:33,197 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2019-10-03 02:02:33,197 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_irq [2019-10-03 02:02:33,197 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2019-10-03 02:02:33,197 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irq [2019-10-03 02:02:33,197 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2019-10-03 02:02:33,198 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2019-10-03 02:02:33,198 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2019-10-03 02:02:33,198 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait_event [2019-10-03 02:02:33,198 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2019-10-03 02:02:33,198 INFO L130 BoogieDeclarations]: Found specification of procedure __init_work [2019-10-03 02:02:33,198 INFO L130 BoogieDeclarations]: Found specification of procedure queue_work_on [2019-10-03 02:02:33,198 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_queue_work_on_5 [2019-10-03 02:02:33,198 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_queue_work_on_7 [2019-10-03 02:02:33,199 INFO L130 BoogieDeclarations]: Found specification of procedure queue_delayed_work_on [2019-10-03 02:02:33,199 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_queue_delayed_work_on_6 [2019-10-03 02:02:33,199 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_queue_delayed_work_on_9 [2019-10-03 02:02:33,199 INFO L130 BoogieDeclarations]: Found specification of procedure flush_workqueue [2019-10-03 02:02:33,199 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_flush_workqueue_8 [2019-10-03 02:02:33,199 INFO L130 BoogieDeclarations]: Found specification of procedure cancel_work_sync [2019-10-03 02:02:33,199 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_cancel_work_sync_33 [2019-10-03 02:02:33,200 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_cancel_work_sync_39 [2019-10-03 02:02:33,200 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_cancel_work_sync_44 [2019-10-03 02:02:33,200 INFO L130 BoogieDeclarations]: Found specification of procedure queue_work [2019-10-03 02:02:33,200 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_work [2019-10-03 02:02:33,200 INFO L130 BoogieDeclarations]: Found specification of procedure schedule [2019-10-03 02:02:33,200 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-10-03 02:02:33,200 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2019-10-03 02:02:33,200 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2019-10-03 02:02:33,201 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2019-10-03 02:02:33,201 INFO L130 BoogieDeclarations]: Found specification of procedure call_and_disable_all_1 [2019-10-03 02:02:33,201 INFO L130 BoogieDeclarations]: Found specification of procedure invoke_work_1 [2019-10-03 02:02:33,201 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_driver_2 [2019-10-03 02:02:33,201 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_file_operations_3 [2019-10-03 02:02:33,202 INFO L130 BoogieDeclarations]: Found specification of procedure call_and_disable_work_1 [2019-10-03 02:02:33,203 INFO L130 BoogieDeclarations]: Found specification of procedure disable_work_1 [2019-10-03 02:02:33,203 INFO L130 BoogieDeclarations]: Found specification of procedure activate_work_1 [2019-10-03 02:02:33,203 INFO L130 BoogieDeclarations]: Found specification of procedure work_init_1 [2019-10-03 02:02:33,203 INFO L130 BoogieDeclarations]: Found specification of procedure kobject_name [2019-10-03 02:02:33,203 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2019-10-03 02:02:33,203 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2019-10-03 02:02:33,203 INFO L130 BoogieDeclarations]: Found specification of procedure __copy_from_user_overflow [2019-10-03 02:02:33,204 INFO L130 BoogieDeclarations]: Found specification of procedure __copy_to_user_overflow [2019-10-03 02:02:33,204 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2019-10-03 02:02:33,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:02:33,205 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2019-10-03 02:02:33,205 INFO L130 BoogieDeclarations]: Found specification of procedure iminor [2019-10-03 02:02:33,205 INFO L130 BoogieDeclarations]: Found specification of procedure noop_llseek [2019-10-03 02:02:33,205 INFO L130 BoogieDeclarations]: Found specification of procedure poll_wait [2019-10-03 02:02:33,205 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~$Pointer$~TO~VOID [2019-10-03 02:02:33,205 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_in [2019-10-03 02:02:33,205 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_int [2019-10-03 02:02:33,206 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_is_int_in [2019-10-03 02:02:33,206 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_maxp [2019-10-03 02:02:33,206 INFO L130 BoogieDeclarations]: Found specification of procedure dev_name [2019-10-03 02:02:33,206 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2019-10-03 02:02:33,206 INFO L130 BoogieDeclarations]: Found specification of procedure _dev_info [2019-10-03 02:02:33,206 INFO L130 BoogieDeclarations]: Found specification of procedure pm_runtime_mark_last_busy [2019-10-03 02:02:33,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:02:33,206 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2019-10-03 02:02:33,207 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_get_interface [2019-10-03 02:02:33,207 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_put_interface [2019-10-03 02:02:33,207 INFO L130 BoogieDeclarations]: Found specification of procedure usb_mark_last_busy [2019-10-03 02:02:33,207 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register_driver [2019-10-03 02:02:33,207 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_register_driver_47 [2019-10-03 02:02:33,207 INFO L130 BoogieDeclarations]: Found specification of procedure usb_deregister [2019-10-03 02:02:33,207 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_deregister_48 [2019-10-03 02:02:33,207 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register_dev [2019-10-03 02:02:33,208 INFO L130 BoogieDeclarations]: Found specification of procedure usb_deregister_dev [2019-10-03 02:02:33,208 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_control_urb [2019-10-03 02:02:33,210 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_int_urb [2019-10-03 02:02:33,210 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2019-10-03 02:02:33,210 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2019-10-03 02:02:33,210 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2019-10-03 02:02:33,210 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2019-10-03 02:02:33,210 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2019-10-03 02:02:33,211 INFO L130 BoogieDeclarations]: Found specification of procedure usb_translate_errors [2019-10-03 02:02:33,211 INFO L130 BoogieDeclarations]: Found specification of procedure usb_cdc_wdm_register [2019-10-03 02:02:33,211 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_find_device [2019-10-03 02:02:33,211 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_find_device_by_minor [2019-10-03 02:02:33,211 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_out_callback [2019-10-03 02:02:33,211 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_in_callback [2019-10-03 02:02:33,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove [2019-10-03 02:02:33,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:02:33,212 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_int_callback [2019-10-03 02:02:33,212 INFO L130 BoogieDeclarations]: Found specification of procedure kill_urbs [2019-10-03 02:02:33,212 INFO L130 BoogieDeclarations]: Found specification of procedure free_urbs [2019-10-03 02:02:33,212 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-03 02:02:33,212 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_write [2019-10-03 02:02:33,212 INFO L130 BoogieDeclarations]: Found specification of procedure clear_wdm_read_flag [2019-10-03 02:02:33,212 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_read [2019-10-03 02:02:33,212 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_flush [2019-10-03 02:02:33,213 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_poll [2019-10-03 02:02:33,213 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_open [2019-10-03 02:02:33,213 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~int [2019-10-03 02:02:33,213 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_release [2019-10-03 02:02:33,213 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_ioctl [2019-10-03 02:02:33,213 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_rxwork [2019-10-03 02:02:33,213 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_create [2019-10-03 02:02:33,214 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_manage_power [2019-10-03 02:02:33,214 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_probe [2019-10-03 02:02:33,214 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_disconnect [2019-10-03 02:02:33,214 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_suspend [2019-10-03 02:02:33,214 INFO L130 BoogieDeclarations]: Found specification of procedure recover_from_urb_loss [2019-10-03 02:02:33,214 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_resume [2019-10-03 02:02:33,214 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_pre_reset [2019-10-03 02:02:33,214 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_post_reset [2019-10-03 02:02:33,215 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_driver_init [2019-10-03 02:02:33,215 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_driver_exit [2019-10-03 02:02:33,215 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-10-03 02:02:33,215 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-10-03 02:02:33,215 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:02:33,215 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-10-03 02:02:33,215 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_negative [2019-10-03 02:02:33,216 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2019-10-03 02:02:33,216 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_ptr_err [2019-10-03 02:02:33,216 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err_or_null [2019-10-03 02:02:33,216 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_i_mutex_of_inode [2019-10-03 02:02:33,216 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_i_mutex_of_inode [2019-10-03 02:02:33,216 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_i_mutex_of_inode [2019-10-03 02:02:33,216 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_i_mutex_of_inode [2019-10-03 02:02:33,216 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_i_mutex_of_inode [2019-10-03 02:02:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_i_mutex_of_inode [2019-10-03 02:02:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_trylock_device_i_mutex_of_inode [2019-10-03 02:02:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_for_reset_i_mutex_of_inode [2019-10-03 02:02:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_unlock_device_i_mutex_of_inode [2019-10-03 02:02:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_lock [2019-10-03 02:02:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_lock [2019-10-03 02:02:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_lock [2019-10-03 02:02:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_lock [2019-10-03 02:02:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_lock [2019-10-03 02:02:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_lock [2019-10-03 02:02:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_trylock_device_lock [2019-10-03 02:02:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_for_reset_lock [2019-10-03 02:02:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_unlock_device_lock [2019-10-03 02:02:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_mutex_of_device [2019-10-03 02:02:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_mutex_of_device [2019-10-03 02:02:33,219 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_mutex_of_device [2019-10-03 02:02:33,219 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_mutex_of_device [2019-10-03 02:02:33,219 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_mutex_of_device [2019-10-03 02:02:33,219 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_trylock_device_mutex_of_device [2019-10-03 02:02:33,219 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_for_reset_mutex_of_device [2019-10-03 02:02:33,219 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_unlock_device_mutex_of_device [2019-10-03 02:02:33,220 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_rlock_of_wdm_device [2019-10-03 02:02:33,220 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_rlock_of_wdm_device [2019-10-03 02:02:33,220 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_rlock_of_wdm_device [2019-10-03 02:02:33,220 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_rlock_of_wdm_device [2019-10-03 02:02:33,220 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_rlock_of_wdm_device [2019-10-03 02:02:33,220 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_trylock_device_rlock_of_wdm_device [2019-10-03 02:02:33,224 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_for_reset_rlock_of_wdm_device [2019-10-03 02:02:33,225 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_unlock_device_rlock_of_wdm_device [2019-10-03 02:02:33,225 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_wdm_mutex [2019-10-03 02:02:33,225 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_wdm_mutex [2019-10-03 02:02:33,225 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_wdm_mutex [2019-10-03 02:02:33,225 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_wdm_mutex [2019-10-03 02:02:33,226 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_wdm_mutex [2019-10-03 02:02:33,226 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_wdm_mutex [2019-10-03 02:02:33,226 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_trylock_device_wdm_mutex [2019-10-03 02:02:33,226 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_for_reset_wdm_mutex [2019-10-03 02:02:33,226 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_unlock_device_wdm_mutex [2019-10-03 02:02:33,226 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_wlock_of_wdm_device [2019-10-03 02:02:33,226 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_wlock_of_wdm_device [2019-10-03 02:02:33,226 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_wlock_of_wdm_device [2019-10-03 02:02:33,227 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_wlock_of_wdm_device [2019-10-03 02:02:33,227 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_wlock_of_wdm_device [2019-10-03 02:02:33,227 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_trylock_device_wlock_of_wdm_device [2019-10-03 02:02:33,227 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_for_reset_wlock_of_wdm_device [2019-10-03 02:02:33,227 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_unlock_device_wlock_of_wdm_device [2019-10-03 02:02:33,227 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-03 02:02:33,227 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-03 02:02:33,228 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-10-03 02:02:33,228 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:02:33,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:02:33,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:02:33,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-03 02:02:33,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:02:33,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-10-03 02:02:33,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-10-03 02:02:33,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-10-03 02:02:33,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-10-03 02:02:34,635 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2019-10-03 02:02:43,954 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:02:43,955 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-03 02:02:43,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:02:43 BoogieIcfgContainer [2019-10-03 02:02:43,959 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:02:43,963 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:02:43,963 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:02:43,969 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:02:43,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:02:28" (1/3) ... [2019-10-03 02:02:43,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f745e4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:02:43, skipping insertion in model container [2019-10-03 02:02:43,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:02:32" (2/3) ... [2019-10-03 02:02:43,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f745e4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:02:43, skipping insertion in model container [2019-10-03 02:02:43,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:02:43" (3/3) ... [2019-10-03 02:02:43,982 INFO L109 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--usb--class--cdc-wdm.ko-entry_point.cil.out.i [2019-10-03 02:02:44,005 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:02:44,025 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:02:44,060 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:02:44,107 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:02:44,107 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:02:44,107 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:02:44,108 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:02:44,108 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:02:44,108 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:02:44,108 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:02:44,108 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:02:44,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states. [2019-10-03 02:02:44,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-03 02:02:44,219 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:02:44,221 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:02:44,225 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:02:44,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:02:44,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1937319145, now seen corresponding path program 1 times [2019-10-03 02:02:44,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:02:44,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:02:44,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:02:44,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:02:44,407 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:02:45,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:02:45,996 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2019-10-03 02:02:46,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:02:46,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:02:46,001 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:02:46,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:02:46,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:02:46,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:02:46,035 INFO L87 Difference]: Start difference. First operand 1810 states. Second operand 3 states. [2019-10-03 02:02:46,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:02:46,811 INFO L93 Difference]: Finished difference Result 2064 states and 2661 transitions. [2019-10-03 02:02:46,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:02:46,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-10-03 02:02:46,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:02:46,853 INFO L225 Difference]: With dead ends: 2064 [2019-10-03 02:02:46,854 INFO L226 Difference]: Without dead ends: 2039 [2019-10-03 02:02:46,856 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:02:46,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2039 states. [2019-10-03 02:02:47,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2039 to 2005. [2019-10-03 02:02:47,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2005 states. [2019-10-03 02:02:47,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2005 states to 2005 states and 2589 transitions. [2019-10-03 02:02:47,134 INFO L78 Accepts]: Start accepts. Automaton has 2005 states and 2589 transitions. Word has length 212 [2019-10-03 02:02:47,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:02:47,140 INFO L475 AbstractCegarLoop]: Abstraction has 2005 states and 2589 transitions. [2019-10-03 02:02:47,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:02:47,141 INFO L276 IsEmpty]: Start isEmpty. Operand 2005 states and 2589 transitions. [2019-10-03 02:02:47,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-03 02:02:47,158 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:02:47,159 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:02:47,159 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:02:47,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:02:47,160 INFO L82 PathProgramCache]: Analyzing trace with hash 779116830, now seen corresponding path program 1 times [2019-10-03 02:02:47,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:02:47,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:02:47,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:02:47,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:02:47,187 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:02:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:02:47,794 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2019-10-03 02:02:47,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:02:47,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:02:47,795 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:02:47,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:02:47,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:02:47,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:02:47,798 INFO L87 Difference]: Start difference. First operand 2005 states and 2589 transitions. Second operand 3 states. [2019-10-03 02:02:50,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:02:50,375 INFO L93 Difference]: Finished difference Result 3874 states and 5008 transitions. [2019-10-03 02:02:50,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:02:50,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2019-10-03 02:02:50,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:02:50,414 INFO L225 Difference]: With dead ends: 3874 [2019-10-03 02:02:50,414 INFO L226 Difference]: Without dead ends: 3874 [2019-10-03 02:02:50,416 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:02:50,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3874 states. [2019-10-03 02:02:50,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3874 to 3864. [2019-10-03 02:02:50,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3864 states. [2019-10-03 02:02:50,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3864 states to 3864 states and 4999 transitions. [2019-10-03 02:02:50,749 INFO L78 Accepts]: Start accepts. Automaton has 3864 states and 4999 transitions. Word has length 213 [2019-10-03 02:02:50,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:02:50,751 INFO L475 AbstractCegarLoop]: Abstraction has 3864 states and 4999 transitions. [2019-10-03 02:02:50,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:02:50,751 INFO L276 IsEmpty]: Start isEmpty. Operand 3864 states and 4999 transitions. [2019-10-03 02:02:50,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-03 02:02:50,759 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:02:50,760 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:02:50,760 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:02:50,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:02:50,761 INFO L82 PathProgramCache]: Analyzing trace with hash 326678868, now seen corresponding path program 1 times [2019-10-03 02:02:50,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:02:50,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:02:50,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:02:50,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:02:50,781 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:02:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:02:51,915 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2019-10-03 02:02:51,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:02:51,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:02:51,916 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:02:51,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:02:51,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:02:51,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:02:51,918 INFO L87 Difference]: Start difference. First operand 3864 states and 4999 transitions. Second operand 3 states. [2019-10-03 02:02:52,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:02:52,341 INFO L93 Difference]: Finished difference Result 5754 states and 7459 transitions. [2019-10-03 02:02:52,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:02:52,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 238 [2019-10-03 02:02:52,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:02:52,401 INFO L225 Difference]: With dead ends: 5754 [2019-10-03 02:02:52,401 INFO L226 Difference]: Without dead ends: 5754 [2019-10-03 02:02:52,402 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:02:52,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5754 states. [2019-10-03 02:02:52,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5754 to 5704. [2019-10-03 02:02:52,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5704 states. [2019-10-03 02:02:52,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5704 states to 5704 states and 7399 transitions. [2019-10-03 02:02:52,735 INFO L78 Accepts]: Start accepts. Automaton has 5704 states and 7399 transitions. Word has length 238 [2019-10-03 02:02:52,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:02:52,737 INFO L475 AbstractCegarLoop]: Abstraction has 5704 states and 7399 transitions. [2019-10-03 02:02:52,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:02:52,738 INFO L276 IsEmpty]: Start isEmpty. Operand 5704 states and 7399 transitions. [2019-10-03 02:02:52,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-03 02:02:52,742 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:02:52,743 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:02:52,744 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:02:52,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:02:52,745 INFO L82 PathProgramCache]: Analyzing trace with hash 114190117, now seen corresponding path program 1 times [2019-10-03 02:02:52,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:02:52,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:02:52,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:02:52,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:02:52,763 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:02:52,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:02:53,254 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-10-03 02:02:53,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:02:53,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:02:53,255 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:02:53,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:02:53,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:02:53,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:02:53,257 INFO L87 Difference]: Start difference. First operand 5704 states and 7399 transitions. Second operand 3 states. [2019-10-03 02:02:53,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:02:53,336 INFO L93 Difference]: Finished difference Result 5703 states and 7397 transitions. [2019-10-03 02:02:53,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:02:53,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 234 [2019-10-03 02:02:53,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:02:53,385 INFO L225 Difference]: With dead ends: 5703 [2019-10-03 02:02:53,385 INFO L226 Difference]: Without dead ends: 5703 [2019-10-03 02:02:53,386 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:02:53,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5703 states. [2019-10-03 02:02:53,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5703 to 5703. [2019-10-03 02:02:53,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5703 states. [2019-10-03 02:02:53,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5703 states to 5703 states and 7397 transitions. [2019-10-03 02:02:53,685 INFO L78 Accepts]: Start accepts. Automaton has 5703 states and 7397 transitions. Word has length 234 [2019-10-03 02:02:53,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:02:53,686 INFO L475 AbstractCegarLoop]: Abstraction has 5703 states and 7397 transitions. [2019-10-03 02:02:53,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:02:53,686 INFO L276 IsEmpty]: Start isEmpty. Operand 5703 states and 7397 transitions. [2019-10-03 02:02:53,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-10-03 02:02:53,694 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:02:53,695 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:02:53,695 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:02:53,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:02:53,696 INFO L82 PathProgramCache]: Analyzing trace with hash -756013897, now seen corresponding path program 1 times [2019-10-03 02:02:53,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:02:53,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:02:53,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:02:53,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:02:53,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:02:53,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:02:54,563 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-10-03 02:02:54,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:02:54,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:02:54,564 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:02:54,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:02:54,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:02:54,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:02:54,566 INFO L87 Difference]: Start difference. First operand 5703 states and 7397 transitions. Second operand 3 states. [2019-10-03 02:02:54,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:02:54,637 INFO L93 Difference]: Finished difference Result 5702 states and 7395 transitions. [2019-10-03 02:02:54,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:02:54,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-10-03 02:02:54,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:02:54,684 INFO L225 Difference]: With dead ends: 5702 [2019-10-03 02:02:54,685 INFO L226 Difference]: Without dead ends: 5702 [2019-10-03 02:02:54,685 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:02:54,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5702 states. [2019-10-03 02:02:54,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5702 to 5702. [2019-10-03 02:02:54,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5702 states. [2019-10-03 02:02:54,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5702 states to 5702 states and 7395 transitions. [2019-10-03 02:02:54,937 INFO L78 Accepts]: Start accepts. Automaton has 5702 states and 7395 transitions. Word has length 235 [2019-10-03 02:02:54,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:02:54,938 INFO L475 AbstractCegarLoop]: Abstraction has 5702 states and 7395 transitions. [2019-10-03 02:02:54,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:02:54,938 INFO L276 IsEmpty]: Start isEmpty. Operand 5702 states and 7395 transitions. [2019-10-03 02:02:54,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-03 02:02:54,942 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:02:54,943 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:02:54,943 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:02:54,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:02:54,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1962529688, now seen corresponding path program 1 times [2019-10-03 02:02:54,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:02:54,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:02:54,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:02:54,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:02:54,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:02:55,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:02:55,403 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-10-03 02:02:55,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:02:55,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:02:55,404 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:02:55,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:02:55,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:02:55,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:02:55,405 INFO L87 Difference]: Start difference. First operand 5702 states and 7395 transitions. Second operand 3 states. [2019-10-03 02:02:55,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:02:55,477 INFO L93 Difference]: Finished difference Result 5701 states and 7393 transitions. [2019-10-03 02:02:55,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:02:55,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 236 [2019-10-03 02:02:55,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:02:55,523 INFO L225 Difference]: With dead ends: 5701 [2019-10-03 02:02:55,523 INFO L226 Difference]: Without dead ends: 5701 [2019-10-03 02:02:55,524 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:02:55,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5701 states. [2019-10-03 02:02:55,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5701 to 5701. [2019-10-03 02:02:55,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5701 states. [2019-10-03 02:02:55,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5701 states to 5701 states and 7393 transitions. [2019-10-03 02:02:55,748 INFO L78 Accepts]: Start accepts. Automaton has 5701 states and 7393 transitions. Word has length 236 [2019-10-03 02:02:55,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:02:55,749 INFO L475 AbstractCegarLoop]: Abstraction has 5701 states and 7393 transitions. [2019-10-03 02:02:55,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:02:55,750 INFO L276 IsEmpty]: Start isEmpty. Operand 5701 states and 7393 transitions. [2019-10-03 02:02:55,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-10-03 02:02:55,754 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:02:55,754 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:02:55,755 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:02:55,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:02:55,755 INFO L82 PathProgramCache]: Analyzing trace with hash -709808678, now seen corresponding path program 1 times [2019-10-03 02:02:55,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:02:55,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:02:55,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:02:55,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:02:55,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:02:55,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:02:56,381 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-10-03 02:02:56,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:02:56,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:02:56,382 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:02:56,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:02:56,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:02:56,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:02:56,386 INFO L87 Difference]: Start difference. First operand 5701 states and 7393 transitions. Second operand 3 states. [2019-10-03 02:02:56,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:02:56,585 INFO L93 Difference]: Finished difference Result 11001 states and 14295 transitions. [2019-10-03 02:02:56,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:02:56,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 237 [2019-10-03 02:02:56,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:02:56,688 INFO L225 Difference]: With dead ends: 11001 [2019-10-03 02:02:56,688 INFO L226 Difference]: Without dead ends: 11001 [2019-10-03 02:02:56,689 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:02:56,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11001 states. [2019-10-03 02:02:57,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11001 to 10953. [2019-10-03 02:02:57,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10953 states. [2019-10-03 02:02:57,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10953 states to 10953 states and 14245 transitions. [2019-10-03 02:02:57,124 INFO L78 Accepts]: Start accepts. Automaton has 10953 states and 14245 transitions. Word has length 237 [2019-10-03 02:02:57,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:02:57,129 INFO L475 AbstractCegarLoop]: Abstraction has 10953 states and 14245 transitions. [2019-10-03 02:02:57,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:02:57,129 INFO L276 IsEmpty]: Start isEmpty. Operand 10953 states and 14245 transitions. [2019-10-03 02:02:57,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-03 02:02:57,133 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:02:57,134 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:02:57,134 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:02:57,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:02:57,135 INFO L82 PathProgramCache]: Analyzing trace with hash -530158165, now seen corresponding path program 1 times [2019-10-03 02:02:57,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:02:57,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:02:57,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:02:57,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:02:57,155 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:02:57,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:02:57,626 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-10-03 02:02:57,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:02:57,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:02:57,627 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:02:57,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:02:57,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:02:57,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:02:57,629 INFO L87 Difference]: Start difference. First operand 10953 states and 14245 transitions. Second operand 3 states. [2019-10-03 02:02:57,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:02:57,790 INFO L93 Difference]: Finished difference Result 12009 states and 15235 transitions. [2019-10-03 02:02:57,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:02:57,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 238 [2019-10-03 02:02:57,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:02:57,858 INFO L225 Difference]: With dead ends: 12009 [2019-10-03 02:02:57,858 INFO L226 Difference]: Without dead ends: 12009 [2019-10-03 02:02:57,859 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:02:57,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12009 states. [2019-10-03 02:02:58,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12009 to 12003. [2019-10-03 02:02:58,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12003 states. [2019-10-03 02:02:58,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12003 states to 12003 states and 15230 transitions. [2019-10-03 02:02:58,316 INFO L78 Accepts]: Start accepts. Automaton has 12003 states and 15230 transitions. Word has length 238 [2019-10-03 02:02:58,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:02:58,317 INFO L475 AbstractCegarLoop]: Abstraction has 12003 states and 15230 transitions. [2019-10-03 02:02:58,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:02:58,317 INFO L276 IsEmpty]: Start isEmpty. Operand 12003 states and 15230 transitions. [2019-10-03 02:02:58,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-10-03 02:02:58,323 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:02:58,323 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:02:58,324 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:02:58,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:02:58,324 INFO L82 PathProgramCache]: Analyzing trace with hash 744045309, now seen corresponding path program 1 times [2019-10-03 02:02:58,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:02:58,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:02:58,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:02:58,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:02:58,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:02:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:02:58,920 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-10-03 02:02:58,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:02:58,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:02:58,922 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:02:58,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:02:58,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:02:58,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:02:58,924 INFO L87 Difference]: Start difference. First operand 12003 states and 15230 transitions. Second operand 3 states. [2019-10-03 02:02:59,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:02:59,390 INFO L93 Difference]: Finished difference Result 22034 states and 28165 transitions. [2019-10-03 02:02:59,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:02:59,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-10-03 02:02:59,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:02:59,533 INFO L225 Difference]: With dead ends: 22034 [2019-10-03 02:02:59,534 INFO L226 Difference]: Without dead ends: 22014 [2019-10-03 02:02:59,534 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:02:59,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22014 states. [2019-10-03 02:03:00,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22014 to 21821. [2019-10-03 02:03:00,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21821 states. [2019-10-03 02:03:00,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21821 states to 21821 states and 27931 transitions. [2019-10-03 02:03:00,418 INFO L78 Accepts]: Start accepts. Automaton has 21821 states and 27931 transitions. Word has length 239 [2019-10-03 02:03:00,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:03:00,419 INFO L475 AbstractCegarLoop]: Abstraction has 21821 states and 27931 transitions. [2019-10-03 02:03:00,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:03:00,419 INFO L276 IsEmpty]: Start isEmpty. Operand 21821 states and 27931 transitions. [2019-10-03 02:03:00,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-10-03 02:03:00,440 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:03:00,441 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:03:00,442 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:03:00,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:03:00,442 INFO L82 PathProgramCache]: Analyzing trace with hash -736606627, now seen corresponding path program 1 times [2019-10-03 02:03:00,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:03:00,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:03:00,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:03:00,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:03:00,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:03:00,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:03:00,950 INFO L134 CoverageAnalysis]: Checked inductivity of 732 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-10-03 02:03:00,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:03:00,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:03:00,951 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:03:00,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:03:00,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:03:00,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:03:00,952 INFO L87 Difference]: Start difference. First operand 21821 states and 27931 transitions. Second operand 3 states. [2019-10-03 02:03:03,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:03:03,759 INFO L93 Difference]: Finished difference Result 32426 states and 41187 transitions. [2019-10-03 02:03:03,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:03:03,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 303 [2019-10-03 02:03:03,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:03:03,988 INFO L225 Difference]: With dead ends: 32426 [2019-10-03 02:03:03,989 INFO L226 Difference]: Without dead ends: 32426 [2019-10-03 02:03:03,989 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:03:04,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32426 states. [2019-10-03 02:03:05,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32426 to 32331. [2019-10-03 02:03:05,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32331 states. [2019-10-03 02:03:05,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32331 states to 32331 states and 41090 transitions. [2019-10-03 02:03:05,285 INFO L78 Accepts]: Start accepts. Automaton has 32331 states and 41090 transitions. Word has length 303 [2019-10-03 02:03:05,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:03:05,286 INFO L475 AbstractCegarLoop]: Abstraction has 32331 states and 41090 transitions. [2019-10-03 02:03:05,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:03:05,287 INFO L276 IsEmpty]: Start isEmpty. Operand 32331 states and 41090 transitions. [2019-10-03 02:03:05,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-10-03 02:03:05,298 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:03:05,298 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 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] [2019-10-03 02:03:05,299 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:03:05,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:03:05,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1169932098, now seen corresponding path program 1 times [2019-10-03 02:03:05,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:03:05,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:03:05,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:03:05,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:03:05,315 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:03:05,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:03:05,761 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-10-03 02:03:05,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:03:05,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:03:05,762 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:03:05,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:03:05,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:03:05,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:03:05,763 INFO L87 Difference]: Start difference. First operand 32331 states and 41090 transitions. Second operand 3 states. [2019-10-03 02:03:08,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:03:08,424 INFO L93 Difference]: Finished difference Result 16630 states and 21093 transitions. [2019-10-03 02:03:08,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:03:08,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 307 [2019-10-03 02:03:08,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:03:08,517 INFO L225 Difference]: With dead ends: 16630 [2019-10-03 02:03:08,517 INFO L226 Difference]: Without dead ends: 16627 [2019-10-03 02:03:08,519 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:03:08,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16627 states. [2019-10-03 02:03:08,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16627 to 16344. [2019-10-03 02:03:08,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16344 states. [2019-10-03 02:03:08,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16344 states to 16344 states and 20793 transitions. [2019-10-03 02:03:08,989 INFO L78 Accepts]: Start accepts. Automaton has 16344 states and 20793 transitions. Word has length 307 [2019-10-03 02:03:08,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:03:08,990 INFO L475 AbstractCegarLoop]: Abstraction has 16344 states and 20793 transitions. [2019-10-03 02:03:08,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:03:08,991 INFO L276 IsEmpty]: Start isEmpty. Operand 16344 states and 20793 transitions. [2019-10-03 02:03:09,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-10-03 02:03:09,002 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:03:09,003 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 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] [2019-10-03 02:03:09,003 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:03:09,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:03:09,004 INFO L82 PathProgramCache]: Analyzing trace with hash -861206498, now seen corresponding path program 1 times [2019-10-03 02:03:09,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:03:09,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:03:09,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:03:09,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:03:09,020 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:03:09,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:03:09,603 INFO L134 CoverageAnalysis]: Checked inductivity of 732 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 732 trivial. 0 not checked. [2019-10-03 02:03:09,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:03:09,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:03:09,604 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:03:09,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:03:09,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:03:09,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:03:09,608 INFO L87 Difference]: Start difference. First operand 16344 states and 20793 transitions. Second operand 3 states. [2019-10-03 02:03:12,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:03:12,204 INFO L93 Difference]: Finished difference Result 16349 states and 20784 transitions. [2019-10-03 02:03:12,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:03:12,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2019-10-03 02:03:12,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:03:12,289 INFO L225 Difference]: With dead ends: 16349 [2019-10-03 02:03:12,290 INFO L226 Difference]: Without dead ends: 16349 [2019-10-03 02:03:12,290 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:03:12,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16349 states. [2019-10-03 02:03:13,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16349 to 16343. [2019-10-03 02:03:13,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16343 states. [2019-10-03 02:03:13,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16343 states to 16343 states and 20779 transitions. [2019-10-03 02:03:13,594 INFO L78 Accepts]: Start accepts. Automaton has 16343 states and 20779 transitions. Word has length 321 [2019-10-03 02:03:13,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:03:13,595 INFO L475 AbstractCegarLoop]: Abstraction has 16343 states and 20779 transitions. [2019-10-03 02:03:13,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:03:13,595 INFO L276 IsEmpty]: Start isEmpty. Operand 16343 states and 20779 transitions. [2019-10-03 02:03:13,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-10-03 02:03:13,607 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:03:13,607 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:03:13,608 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:03:13,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:03:13,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1791999939, now seen corresponding path program 1 times [2019-10-03 02:03:13,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:03:13,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:03:13,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:03:13,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:03:13,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:03:13,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:03:14,191 INFO L134 CoverageAnalysis]: Checked inductivity of 732 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-10-03 02:03:14,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:03:14,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:03:14,192 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:03:14,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:03:14,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:03:14,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:03:14,194 INFO L87 Difference]: Start difference. First operand 16343 states and 20779 transitions. Second operand 3 states. [2019-10-03 02:03:16,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:03:16,861 INFO L93 Difference]: Finished difference Result 21967 states and 27903 transitions. [2019-10-03 02:03:16,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:03:16,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 333 [2019-10-03 02:03:16,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:03:16,971 INFO L225 Difference]: With dead ends: 21967 [2019-10-03 02:03:16,971 INFO L226 Difference]: Without dead ends: 21967 [2019-10-03 02:03:16,972 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:03:17,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21967 states. [2019-10-03 02:03:17,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21967 to 21851. [2019-10-03 02:03:17,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21851 states. [2019-10-03 02:03:17,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21851 states to 21851 states and 27770 transitions. [2019-10-03 02:03:17,577 INFO L78 Accepts]: Start accepts. Automaton has 21851 states and 27770 transitions. Word has length 333 [2019-10-03 02:03:17,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:03:17,578 INFO L475 AbstractCegarLoop]: Abstraction has 21851 states and 27770 transitions. [2019-10-03 02:03:17,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:03:17,578 INFO L276 IsEmpty]: Start isEmpty. Operand 21851 states and 27770 transitions. [2019-10-03 02:03:17,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2019-10-03 02:03:17,592 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:03:17,592 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:03:17,593 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:03:17,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:03:17,593 INFO L82 PathProgramCache]: Analyzing trace with hash -971694620, now seen corresponding path program 1 times [2019-10-03 02:03:17,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:03:17,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:03:17,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:03:17,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:03:17,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:03:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:03:18,325 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 732 trivial. 0 not checked. [2019-10-03 02:03:18,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:03:18,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:03:18,326 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:03:18,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:03:18,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:03:18,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:03:18,328 INFO L87 Difference]: Start difference. First operand 21851 states and 27770 transitions. Second operand 6 states. [2019-10-03 02:03:21,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:03:21,188 INFO L93 Difference]: Finished difference Result 30353 states and 38452 transitions. [2019-10-03 02:03:21,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:03:21,188 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 349 [2019-10-03 02:03:21,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:03:21,339 INFO L225 Difference]: With dead ends: 30353 [2019-10-03 02:03:21,339 INFO L226 Difference]: Without dead ends: 30353 [2019-10-03 02:03:21,341 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:03:21,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30353 states. [2019-10-03 02:03:22,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30353 to 21911. [2019-10-03 02:03:22,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21911 states. [2019-10-03 02:03:22,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21911 states to 21911 states and 27830 transitions. [2019-10-03 02:03:22,255 INFO L78 Accepts]: Start accepts. Automaton has 21911 states and 27830 transitions. Word has length 349 [2019-10-03 02:03:22,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:03:22,256 INFO L475 AbstractCegarLoop]: Abstraction has 21911 states and 27830 transitions. [2019-10-03 02:03:22,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:03:22,257 INFO L276 IsEmpty]: Start isEmpty. Operand 21911 states and 27830 transitions. [2019-10-03 02:03:22,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-10-03 02:03:22,264 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:03:22,265 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:03:22,265 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:03:22,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:03:22,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1681577484, now seen corresponding path program 1 times [2019-10-03 02:03:22,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:03:22,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:03:22,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:03:22,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:03:22,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:03:22,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:03:22,871 INFO L134 CoverageAnalysis]: Checked inductivity of 732 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 732 trivial. 0 not checked. [2019-10-03 02:03:22,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:03:22,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:03:22,872 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:03:22,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:03:22,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:03:22,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:03:22,874 INFO L87 Difference]: Start difference. First operand 21911 states and 27830 transitions. Second operand 3 states. [2019-10-03 02:03:25,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:03:25,500 INFO L93 Difference]: Finished difference Result 21926 states and 27664 transitions. [2019-10-03 02:03:25,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:03:25,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 357 [2019-10-03 02:03:25,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:03:25,602 INFO L225 Difference]: With dead ends: 21926 [2019-10-03 02:03:25,603 INFO L226 Difference]: Without dead ends: 21926 [2019-10-03 02:03:25,603 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:03:25,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21926 states. [2019-10-03 02:03:26,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21926 to 21765. [2019-10-03 02:03:26,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21765 states. [2019-10-03 02:03:26,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21765 states to 21765 states and 27503 transitions. [2019-10-03 02:03:26,141 INFO L78 Accepts]: Start accepts. Automaton has 21765 states and 27503 transitions. Word has length 357 [2019-10-03 02:03:26,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:03:26,142 INFO L475 AbstractCegarLoop]: Abstraction has 21765 states and 27503 transitions. [2019-10-03 02:03:26,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:03:26,142 INFO L276 IsEmpty]: Start isEmpty. Operand 21765 states and 27503 transitions. [2019-10-03 02:03:26,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-10-03 02:03:26,147 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:03:26,148 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:03:26,148 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:03:26,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:03:26,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1470226571, now seen corresponding path program 1 times [2019-10-03 02:03:26,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:03:26,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:03:26,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:03:26,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:03:26,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:03:26,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:03:26,939 INFO L134 CoverageAnalysis]: Checked inductivity of 732 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 732 trivial. 0 not checked. [2019-10-03 02:03:26,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:03:26,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:03:26,943 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:03:26,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:03:26,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:03:26,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:03:26,945 INFO L87 Difference]: Start difference. First operand 21765 states and 27503 transitions. Second operand 7 states. [2019-10-03 02:03:27,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:03:27,176 INFO L93 Difference]: Finished difference Result 21206 states and 26654 transitions. [2019-10-03 02:03:27,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:03:27,176 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 357 [2019-10-03 02:03:27,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:03:27,261 INFO L225 Difference]: With dead ends: 21206 [2019-10-03 02:03:27,262 INFO L226 Difference]: Without dead ends: 21206 [2019-10-03 02:03:27,262 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:03:27,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21206 states. [2019-10-03 02:03:28,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21206 to 21110. [2019-10-03 02:03:28,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21110 states. [2019-10-03 02:03:28,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21110 states to 21110 states and 26522 transitions. [2019-10-03 02:03:28,706 INFO L78 Accepts]: Start accepts. Automaton has 21110 states and 26522 transitions. Word has length 357 [2019-10-03 02:03:28,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:03:28,707 INFO L475 AbstractCegarLoop]: Abstraction has 21110 states and 26522 transitions. [2019-10-03 02:03:28,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:03:28,707 INFO L276 IsEmpty]: Start isEmpty. Operand 21110 states and 26522 transitions. [2019-10-03 02:03:28,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2019-10-03 02:03:28,717 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:03:28,717 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:03:28,718 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:03:28,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:03:28,718 INFO L82 PathProgramCache]: Analyzing trace with hash 808507987, now seen corresponding path program 1 times [2019-10-03 02:03:28,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:03:28,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:03:28,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:03:28,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:03:28,732 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:03:28,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:03:29,436 INFO L134 CoverageAnalysis]: Checked inductivity of 740 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 732 trivial. 0 not checked. [2019-10-03 02:03:29,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:03:29,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:03:29,437 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:03:29,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:03:29,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:03:29,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:03:29,440 INFO L87 Difference]: Start difference. First operand 21110 states and 26522 transitions. Second operand 7 states. [2019-10-03 02:03:29,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:03:29,665 INFO L93 Difference]: Finished difference Result 21170 states and 26582 transitions. [2019-10-03 02:03:29,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:03:29,666 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 381 [2019-10-03 02:03:29,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:03:29,761 INFO L225 Difference]: With dead ends: 21170 [2019-10-03 02:03:29,761 INFO L226 Difference]: Without dead ends: 21170 [2019-10-03 02:03:29,762 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:03:29,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21170 states. [2019-10-03 02:03:30,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21170 to 21110. [2019-10-03 02:03:30,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21110 states. [2019-10-03 02:03:30,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21110 states to 21110 states and 26498 transitions. [2019-10-03 02:03:30,310 INFO L78 Accepts]: Start accepts. Automaton has 21110 states and 26498 transitions. Word has length 381 [2019-10-03 02:03:30,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:03:30,311 INFO L475 AbstractCegarLoop]: Abstraction has 21110 states and 26498 transitions. [2019-10-03 02:03:30,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:03:30,311 INFO L276 IsEmpty]: Start isEmpty. Operand 21110 states and 26498 transitions. [2019-10-03 02:03:30,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2019-10-03 02:03:30,322 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:03:30,323 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:03:30,323 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:03:30,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:03:30,324 INFO L82 PathProgramCache]: Analyzing trace with hash -478182676, now seen corresponding path program 1 times [2019-10-03 02:03:30,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:03:30,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:03:30,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:03:30,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:03:30,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:03:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:03:31,156 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 732 trivial. 0 not checked. [2019-10-03 02:03:31,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:03:31,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:03:31,157 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:03:31,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:03:31,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:03:31,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:03:31,159 INFO L87 Difference]: Start difference. First operand 21110 states and 26498 transitions. Second operand 9 states. [2019-10-03 02:03:34,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:03:34,671 INFO L93 Difference]: Finished difference Result 29630 states and 37122 transitions. [2019-10-03 02:03:34,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-03 02:03:34,672 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 379 [2019-10-03 02:03:34,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:03:34,780 INFO L225 Difference]: With dead ends: 29630 [2019-10-03 02:03:34,781 INFO L226 Difference]: Without dead ends: 29630 [2019-10-03 02:03:34,781 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2019-10-03 02:03:34,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29630 states. [2019-10-03 02:03:35,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29630 to 21218. [2019-10-03 02:03:35,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21218 states. [2019-10-03 02:03:35,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21218 states to 21218 states and 26654 transitions. [2019-10-03 02:03:35,557 INFO L78 Accepts]: Start accepts. Automaton has 21218 states and 26654 transitions. Word has length 379 [2019-10-03 02:03:35,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:03:35,557 INFO L475 AbstractCegarLoop]: Abstraction has 21218 states and 26654 transitions. [2019-10-03 02:03:35,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:03:35,558 INFO L276 IsEmpty]: Start isEmpty. Operand 21218 states and 26654 transitions. [2019-10-03 02:03:35,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-10-03 02:03:35,564 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:03:35,564 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:03:35,565 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:03:35,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:03:35,565 INFO L82 PathProgramCache]: Analyzing trace with hash 257121958, now seen corresponding path program 1 times [2019-10-03 02:03:35,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:03:35,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:03:35,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:03:35,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:03:35,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:03:35,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:03:36,205 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 742 trivial. 0 not checked. [2019-10-03 02:03:36,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:03:36,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:03:36,206 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:03:36,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:03:36,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:03:36,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:03:36,208 INFO L87 Difference]: Start difference. First operand 21218 states and 26654 transitions. Second operand 3 states. [2019-10-03 02:03:38,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:03:38,781 INFO L93 Difference]: Finished difference Result 16643 states and 20595 transitions. [2019-10-03 02:03:38,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:03:38,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 380 [2019-10-03 02:03:38,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:03:38,841 INFO L225 Difference]: With dead ends: 16643 [2019-10-03 02:03:38,842 INFO L226 Difference]: Without dead ends: 16643 [2019-10-03 02:03:38,842 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:03:38,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16643 states. [2019-10-03 02:03:39,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16643 to 16367. [2019-10-03 02:03:39,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16367 states. [2019-10-03 02:03:39,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16367 states to 16367 states and 20313 transitions. [2019-10-03 02:03:39,104 INFO L78 Accepts]: Start accepts. Automaton has 16367 states and 20313 transitions. Word has length 380 [2019-10-03 02:03:39,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:03:39,105 INFO L475 AbstractCegarLoop]: Abstraction has 16367 states and 20313 transitions. [2019-10-03 02:03:39,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:03:39,105 INFO L276 IsEmpty]: Start isEmpty. Operand 16367 states and 20313 transitions. [2019-10-03 02:03:39,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-10-03 02:03:39,110 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:03:39,111 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:03:39,111 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:03:39,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:03:39,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1780934331, now seen corresponding path program 1 times [2019-10-03 02:03:39,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:03:39,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:03:39,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:03:39,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:03:39,126 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:03:39,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:03:39,895 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 732 trivial. 0 not checked. [2019-10-03 02:03:39,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:03:39,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:03:39,896 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:03:39,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:03:39,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:03:39,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:03:39,897 INFO L87 Difference]: Start difference. First operand 16367 states and 20313 transitions. Second operand 11 states. [2019-10-03 02:03:42,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:03:42,918 INFO L93 Difference]: Finished difference Result 22864 states and 28212 transitions. [2019-10-03 02:03:42,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-03 02:03:42,918 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 380 [2019-10-03 02:03:42,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:03:42,987 INFO L225 Difference]: With dead ends: 22864 [2019-10-03 02:03:42,987 INFO L226 Difference]: Without dead ends: 22864 [2019-10-03 02:03:42,988 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-03 02:03:43,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22864 states. [2019-10-03 02:03:43,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22864 to 16421. [2019-10-03 02:03:43,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16421 states. [2019-10-03 02:03:43,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16421 states to 16421 states and 20376 transitions. [2019-10-03 02:03:43,336 INFO L78 Accepts]: Start accepts. Automaton has 16421 states and 20376 transitions. Word has length 380 [2019-10-03 02:03:43,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:03:43,337 INFO L475 AbstractCegarLoop]: Abstraction has 16421 states and 20376 transitions. [2019-10-03 02:03:43,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:03:43,337 INFO L276 IsEmpty]: Start isEmpty. Operand 16421 states and 20376 transitions. [2019-10-03 02:03:43,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-10-03 02:03:43,342 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:03:43,343 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:03:43,343 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:03:43,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:03:43,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1568324465, now seen corresponding path program 1 times [2019-10-03 02:03:43,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:03:43,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:03:43,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:03:43,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:03:43,357 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:03:43,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:03:44,597 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2019-10-03 02:03:44,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:03:44,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:03:44,598 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:03:44,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:03:44,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:03:44,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:03:44,601 INFO L87 Difference]: Start difference. First operand 16421 states and 20376 transitions. Second operand 11 states. [2019-10-03 02:03:47,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:03:47,578 INFO L93 Difference]: Finished difference Result 22930 states and 28287 transitions. [2019-10-03 02:03:47,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-03 02:03:47,579 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 392 [2019-10-03 02:03:47,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:03:47,648 INFO L225 Difference]: With dead ends: 22930 [2019-10-03 02:03:47,648 INFO L226 Difference]: Without dead ends: 22930 [2019-10-03 02:03:47,648 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-03 02:03:47,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22930 states. [2019-10-03 02:03:47,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22930 to 16403. [2019-10-03 02:03:47,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16403 states. [2019-10-03 02:03:47,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16403 states to 16403 states and 20352 transitions. [2019-10-03 02:03:47,969 INFO L78 Accepts]: Start accepts. Automaton has 16403 states and 20352 transitions. Word has length 392 [2019-10-03 02:03:47,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:03:47,969 INFO L475 AbstractCegarLoop]: Abstraction has 16403 states and 20352 transitions. [2019-10-03 02:03:47,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:03:47,970 INFO L276 IsEmpty]: Start isEmpty. Operand 16403 states and 20352 transitions. [2019-10-03 02:03:47,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2019-10-03 02:03:47,975 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:03:47,976 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:03:47,976 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:03:47,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:03:47,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1154992295, now seen corresponding path program 1 times [2019-10-03 02:03:47,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:03:47,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:03:47,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:03:47,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:03:47,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:03:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:03:48,653 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 751 trivial. 0 not checked. [2019-10-03 02:03:48,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:03:48,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:03:48,654 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:03:48,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:03:48,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:03:48,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:03:48,656 INFO L87 Difference]: Start difference. First operand 16403 states and 20352 transitions. Second operand 7 states. [2019-10-03 02:03:48,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:03:48,855 INFO L93 Difference]: Finished difference Result 16108 states and 19895 transitions. [2019-10-03 02:03:48,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:03:48,856 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 430 [2019-10-03 02:03:48,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:03:48,921 INFO L225 Difference]: With dead ends: 16108 [2019-10-03 02:03:48,921 INFO L226 Difference]: Without dead ends: 16108 [2019-10-03 02:03:48,922 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:03:48,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16108 states. [2019-10-03 02:03:49,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16108 to 16096. [2019-10-03 02:03:49,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16096 states. [2019-10-03 02:03:49,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16096 states to 16096 states and 19880 transitions. [2019-10-03 02:03:49,186 INFO L78 Accepts]: Start accepts. Automaton has 16096 states and 19880 transitions. Word has length 430 [2019-10-03 02:03:49,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:03:49,187 INFO L475 AbstractCegarLoop]: Abstraction has 16096 states and 19880 transitions. [2019-10-03 02:03:49,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:03:49,187 INFO L276 IsEmpty]: Start isEmpty. Operand 16096 states and 19880 transitions. [2019-10-03 02:03:49,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2019-10-03 02:03:49,193 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:03:49,194 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:03:49,195 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:03:49,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:03:49,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1520037824, now seen corresponding path program 1 times [2019-10-03 02:03:49,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:03:49,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:03:49,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:03:49,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:03:49,208 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:03:49,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:03:49,882 INFO L134 CoverageAnalysis]: Checked inductivity of 778 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 751 trivial. 0 not checked. [2019-10-03 02:03:49,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:03:49,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:03:49,884 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:03:49,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:03:49,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:03:49,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:03:49,886 INFO L87 Difference]: Start difference. First operand 16096 states and 19880 transitions. Second operand 7 states. [2019-10-03 02:03:50,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:03:50,099 INFO L93 Difference]: Finished difference Result 11234 states and 13816 transitions. [2019-10-03 02:03:50,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:03:50,100 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 441 [2019-10-03 02:03:50,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:03:50,148 INFO L225 Difference]: With dead ends: 11234 [2019-10-03 02:03:50,149 INFO L226 Difference]: Without dead ends: 11234 [2019-10-03 02:03:50,150 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:03:50,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11234 states. [2019-10-03 02:03:50,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11234 to 11068. [2019-10-03 02:03:50,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11068 states. [2019-10-03 02:03:50,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11068 states to 11068 states and 13554 transitions. [2019-10-03 02:03:50,415 INFO L78 Accepts]: Start accepts. Automaton has 11068 states and 13554 transitions. Word has length 441 [2019-10-03 02:03:50,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:03:50,416 INFO L475 AbstractCegarLoop]: Abstraction has 11068 states and 13554 transitions. [2019-10-03 02:03:50,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:03:50,416 INFO L276 IsEmpty]: Start isEmpty. Operand 11068 states and 13554 transitions. [2019-10-03 02:03:50,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 636 [2019-10-03 02:03:50,436 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:03:50,438 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:03:50,439 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:03:50,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:03:50,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1333951969, now seen corresponding path program 1 times [2019-10-03 02:03:50,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:03:50,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:03:50,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:03:50,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:03:50,452 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:03:50,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:03:51,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1017 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1007 trivial. 0 not checked. [2019-10-03 02:03:51,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:03:51,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:03:51,454 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:03:51,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:03:51,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:03:51,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:03:51,460 INFO L87 Difference]: Start difference. First operand 11068 states and 13554 transitions. Second operand 6 states. [2019-10-03 02:03:51,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:03:51,585 INFO L93 Difference]: Finished difference Result 11140 states and 13650 transitions. [2019-10-03 02:03:51,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:03:51,586 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 635 [2019-10-03 02:03:51,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:03:51,632 INFO L225 Difference]: With dead ends: 11140 [2019-10-03 02:03:51,632 INFO L226 Difference]: Without dead ends: 11140 [2019-10-03 02:03:51,639 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:03:51,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11140 states. [2019-10-03 02:03:51,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11140 to 11098. [2019-10-03 02:03:51,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11098 states. [2019-10-03 02:03:51,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11098 states to 11098 states and 13584 transitions. [2019-10-03 02:03:51,950 INFO L78 Accepts]: Start accepts. Automaton has 11098 states and 13584 transitions. Word has length 635 [2019-10-03 02:03:51,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:03:51,952 INFO L475 AbstractCegarLoop]: Abstraction has 11098 states and 13584 transitions. [2019-10-03 02:03:51,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:03:51,952 INFO L276 IsEmpty]: Start isEmpty. Operand 11098 states and 13584 transitions. [2019-10-03 02:03:51,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2019-10-03 02:03:51,979 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:03:51,980 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:03:51,980 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:03:51,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:03:51,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1240271046, now seen corresponding path program 1 times [2019-10-03 02:03:51,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:03:51,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:03:51,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:03:51,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:03:51,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:03:52,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:03:52,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1017 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1007 trivial. 0 not checked. [2019-10-03 02:03:52,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:03:52,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:03:52,984 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:03:52,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:03:52,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:03:52,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:03:52,986 INFO L87 Difference]: Start difference. First operand 11098 states and 13584 transitions. Second operand 3 states. [2019-10-03 02:03:53,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:03:53,086 INFO L93 Difference]: Finished difference Result 11104 states and 13590 transitions. [2019-10-03 02:03:53,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:03:53,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 641 [2019-10-03 02:03:53,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:03:53,129 INFO L225 Difference]: With dead ends: 11104 [2019-10-03 02:03:53,129 INFO L226 Difference]: Without dead ends: 11104 [2019-10-03 02:03:53,130 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:03:53,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11104 states. [2019-10-03 02:03:53,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11104 to 11104. [2019-10-03 02:03:53,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11104 states. [2019-10-03 02:03:53,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11104 states to 11104 states and 13590 transitions. [2019-10-03 02:03:53,334 INFO L78 Accepts]: Start accepts. Automaton has 11104 states and 13590 transitions. Word has length 641 [2019-10-03 02:03:53,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:03:53,335 INFO L475 AbstractCegarLoop]: Abstraction has 11104 states and 13590 transitions. [2019-10-03 02:03:53,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:03:53,335 INFO L276 IsEmpty]: Start isEmpty. Operand 11104 states and 13590 transitions. [2019-10-03 02:03:53,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2019-10-03 02:03:53,346 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:03:53,347 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:03:53,347 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:03:53,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:03:53,349 INFO L82 PathProgramCache]: Analyzing trace with hash -854408644, now seen corresponding path program 1 times [2019-10-03 02:03:53,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:03:53,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:03:53,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:03:53,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:03:53,360 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:03:53,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:03:54,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1017 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 967 trivial. 0 not checked. [2019-10-03 02:03:54,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:03:54,924 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:03:54,925 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 642 with the following transitions: [2019-10-03 02:03:54,929 INFO L207 CegarAbsIntRunner]: [101], [107], [108], [109], [110], [111], [112], [339], [340], [345], [348], [350], [361], [362], [371], [373], [374], [575], [577], [579], [580], [589], [591], [596], [601], [604], [606], [609], [611], [616], [618], [620], [625], [627], [632], [634], [639], [641], [646], [648], [653], [655], [660], [662], [667], [669], [674], [676], [678], [680], [682], [684], [686], [688], [690], [695], [700], [702], [704], [710], [715], [767], [768], [771], [773], [776], [778], [781], [788], [789], [792], [800], [806], [807], [830], [831], [832], [834], [836], [839], [843], [850], [853], [856], [858], [861], [863], [889], [892], [902], [903], [977], [979], [980], [1149], [1150], [1181], [1182], [1414], [1415], [1501], [1503], [1505], [1506], [1527], [1528], [1529], [1531], [1532], [1535], [1537], [1538], [1639], [1640], [1645], [1647], [1706], [1708], [1709], [1820], [1821], [1822], [1825], [1891], [1948], [1949], [1950], [1951], [1966], [1967], [1978], [1983], [2003], [2005], [2006], [2058], [2060], [2061], [2132], [2133], [2134], [2136], [2169], [2171], [2172], [2291], [2293], [2294], [2310], [2311], [2371], [2373], [2375], [2377], [2379], [2381], [2383], [2385], [2388], [2390], [2392], [2394], [2396], [2398], [2400], [2402], [2404], [2406], [2408], [2420], [2423], [2426], [2438], [2441], [2444], [2446], [2449], [2458], [2477], [2644], [2647], [2650], [2653], [2656], [2658], [2661], [2669], [2672], [2675], [2794], [2796], [2816], [2817], [2818], [2819], [2879], [2881], [2882], [2883], [2888], [2928], [2933], [2935], [2937], [2938], [3047], [3048], [3075], [3077], [3090], [3093], [3094], [3095], [3096], [3097], [3099], [3115], [3118], [3122], [3127], [3128], [3154], [3155], [3166], [3167], [3363], [3364], [3425], [3426], [3427], [3428], [3431], [3432], [3433], [3434], [3435], [3436], [3437], [3438], [3439], [3440], [3441], [3442], [3443], [3444], [3445], [3446], [3447], [3448], [3449], [3450], [3451], [3452], [3453], [3454], [3455], [3456], [3457], [3458], [3459], [3460], [3461], [3462], [3463], [3464], [3465], [3466], [3467], [3468], [3469], [3470], [3471], [3472], [3473], [3474], [3475], [3476], [3477], [3478], [3479], [3480], [3481], [3482], [3483], [3484], [3485], [3486], [3487], [3488], [3489], [3490], [3491], [3492], [3493], [3494], [3495], [3496], [3521], [3522], [3523], [3524], [3525], [3545], [3546], [3547], [3548], [3553], [3554], [3555], [3556], [3557], [3558], [3579], [3609], [3610], [3819], [3820], [3821], [3822], [3835], [3836], [3837], [3838], [3875], [3876], [3909], [3910], [3963], [4039], [4040], [4063], [4064], [4071], [4072], [4113], [4114], [4137], [4138], [4139], [4140], [4141], [4142], [4143], [4144], [4145], [4146], [4147], [4148], [4149], [4150], [4151], [4152], [4153], [4154], [4155], [4156], [4157], [4158], [4159], [4160], [4161], [4162], [4163], [4164], [4165], [4166], [4167], [4168], [4169], [4170], [4171], [4172], [4177], [4178], [4179], [4180], [4209], [4210], [4211], [4237], [4238], [4271], [4272], [4275], [4276], [4333], [4334], [4335], [4336], [4337], [4338], [4385], [4386], [4387] [2019-10-03 02:03:55,007 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:03:55,008 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:03:55,262 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:03:55,265 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 336 root evaluator evaluations with a maximum evaluation depth of 0. Performed 336 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 654 variables. [2019-10-03 02:03:55,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:03:55,274 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:03:55,533 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-03 02:03:55,534 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:03:55,548 INFO L420 sIntCurrentIteration]: We unified 640 AI predicates to 640 [2019-10-03 02:03:55,549 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:03:55,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:03:55,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [11] total 11 [2019-10-03 02:03:55,551 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:03:55,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:03:55,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:03:55,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:03:55,556 INFO L87 Difference]: Start difference. First operand 11104 states and 13590 transitions. Second operand 2 states. [2019-10-03 02:03:55,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:03:55,557 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-03 02:03:55,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:03:55,558 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 641 [2019-10-03 02:03:55,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:03:55,558 INFO L225 Difference]: With dead ends: 2 [2019-10-03 02:03:55,558 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:03:55,559 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 640 GetRequests, 640 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:03:55,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:03:55,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:03:55,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:03:55,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:03:55,560 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 641 [2019-10-03 02:03:55,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:03:55,561 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:03:55,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:03:55,561 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:03:55,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:03:55,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:03:55 BoogieIcfgContainer [2019-10-03 02:03:55,570 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:03:55,574 INFO L168 Benchmark]: Toolchain (without parser) took 87499.32 ms. Allocated memory was 130.5 MB in the beginning and 2.2 GB in the end (delta: 2.1 GB). Free memory was 77.8 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 553.7 MB. Max. memory is 7.1 GB. [2019-10-03 02:03:55,575 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 130.5 MB. Free memory was 104.7 MB in the beginning and 104.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-03 02:03:55,576 INFO L168 Benchmark]: CACSL2BoogieTranslator took 4383.24 ms. Allocated memory was 130.5 MB in the beginning and 277.3 MB in the end (delta: 146.8 MB). Free memory was 77.6 MB in the beginning and 174.7 MB in the end (delta: -97.1 MB). Peak memory consumption was 114.0 MB. Max. memory is 7.1 GB. [2019-10-03 02:03:55,580 INFO L168 Benchmark]: Boogie Preprocessor took 525.26 ms. Allocated memory is still 277.3 MB. Free memory was 174.7 MB in the beginning and 145.1 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 7.1 GB. [2019-10-03 02:03:55,582 INFO L168 Benchmark]: RCFGBuilder took 10975.61 ms. Allocated memory was 277.3 MB in the beginning and 504.9 MB in the end (delta: 227.5 MB). Free memory was 145.1 MB in the beginning and 88.0 MB in the end (delta: 57.2 MB). Peak memory consumption was 315.6 MB. Max. memory is 7.1 GB. [2019-10-03 02:03:55,586 INFO L168 Benchmark]: TraceAbstraction took 71607.52 ms. Allocated memory was 504.9 MB in the beginning and 2.2 GB in the end (delta: 1.7 GB). Free memory was 88.0 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 189.5 MB. Max. memory is 7.1 GB. [2019-10-03 02:03:55,598 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 130.5 MB. Free memory was 104.7 MB in the beginning and 104.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 4383.24 ms. Allocated memory was 130.5 MB in the beginning and 277.3 MB in the end (delta: 146.8 MB). Free memory was 77.6 MB in the beginning and 174.7 MB in the end (delta: -97.1 MB). Peak memory consumption was 114.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 525.26 ms. Allocated memory is still 277.3 MB. Free memory was 174.7 MB in the beginning and 145.1 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 10975.61 ms. Allocated memory was 277.3 MB in the beginning and 504.9 MB in the end (delta: 227.5 MB). Free memory was 145.1 MB in the beginning and 88.0 MB in the end (delta: 57.2 MB). Peak memory consumption was 315.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 71607.52 ms. Allocated memory was 504.9 MB in the beginning and 2.2 GB in the end (delta: 1.7 GB). Free memory was 88.0 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 189.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6454]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 255 procedures, 2048 locations, 1 error locations. SAFE Result, 71.4s OverallTime, 26 OverallIterations, 10 TraceHistogramMax, 36.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 55540 SDtfs, 25118 SDslu, 144006 SDs, 0 SdLazy, 1024 SolverSat, 188 SolverUnsat, 11 SolverUnknown, 0 SolverNotchecked, 27.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 792 GetRequests, 701 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32331occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 2.7703125 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 13.3s AutomataMinimizationTime, 26 MinimizatonAttempts, 31478 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.9s SsaConstructionTime, 4.8s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 9109 NumberOfCodeBlocks, 9109 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 9083 ConstructedInterpolants, 0 QuantifiedInterpolants, 3951933 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 25 PerfectInterpolantSequences, 18227/18267 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...