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-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 23:36:41,171 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 23:36:41,173 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 23:36:41,187 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 23:36:41,188 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 23:36:41,189 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 23:36:41,191 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 23:36:41,193 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 23:36:41,197 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 23:36:41,201 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 23:36:41,205 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 23:36:41,207 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 23:36:41,208 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 23:36:41,213 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 23:36:41,214 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 23:36:41,216 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 23:36:41,219 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 23:36:41,225 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 23:36:41,227 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 23:36:41,233 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 23:36:41,235 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 23:36:41,238 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 23:36:41,239 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 23:36:41,242 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 23:36:41,247 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 23:36:41,248 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 23:36:41,248 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 23:36:41,252 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 23:36:41,254 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 23:36:41,257 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 23:36:41,258 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 23:36:41,260 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 23:36:41,261 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 23:36:41,262 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 23:36:41,268 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 23:36:41,268 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 23:36:41,269 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 23:36:41,269 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 23:36:41,270 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 23:36:41,271 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 23:36:41,272 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 23:36:41,273 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-02 23:36:41,292 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 23:36:41,293 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 23:36:41,293 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-02 23:36:41,293 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-02 23:36:41,294 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-02 23:36:41,294 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-02 23:36:41,295 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-02 23:36:41,295 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-02 23:36:41,295 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-02 23:36:41,295 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-02 23:36:41,296 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 23:36:41,297 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 23:36:41,297 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 23:36:41,297 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 23:36:41,297 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 23:36:41,297 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 23:36:41,298 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 23:36:41,298 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 23:36:41,298 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 23:36:41,298 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 23:36:41,298 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 23:36:41,299 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-02 23:36:41,299 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 23:36:41,299 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 23:36:41,299 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 23:36:41,300 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 23:36:41,300 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-02 23:36:41,300 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 23:36:41,300 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 23:36:41,300 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-02 23:36:41,355 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 23:36:41,381 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 23:36:41,389 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 23:36:41,392 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 23:36:41,393 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 23:36:41,394 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2019-10-02 23:36:41,489 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ed279144/98bae189c3ef406cadfa1761e7fe3880/FLAG2aee389a4 [2019-10-02 23:36:42,391 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 23:36:42,394 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2019-10-02 23:36:42,442 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ed279144/98bae189c3ef406cadfa1761e7fe3880/FLAG2aee389a4 [2019-10-02 23:36:42,881 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ed279144/98bae189c3ef406cadfa1761e7fe3880 [2019-10-02 23:36:42,895 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 23:36:42,896 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 23:36:42,898 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 23:36:42,898 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 23:36:42,903 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 23:36:42,904 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:36:42" (1/1) ... [2019-10-02 23:36:42,908 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57a95ae1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:36:42, skipping insertion in model container [2019-10-02 23:36:42,909 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:36:42" (1/1) ... [2019-10-02 23:36:42,917 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 23:36:43,023 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 23:36:44,217 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 23:36:44,273 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 23:36:44,664 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 23:36:44,803 INFO L192 MainTranslator]: Completed translation [2019-10-02 23:36:44,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:36:44 WrapperNode [2019-10-02 23:36:44,804 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 23:36:44,806 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 23:36:44,806 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 23:36:44,806 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 23:36:44,835 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:36:44" (1/1) ... [2019-10-02 23:36:44,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:36:44" (1/1) ... [2019-10-02 23:36:44,927 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:36:44" (1/1) ... [2019-10-02 23:36:44,931 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:36:44" (1/1) ... [2019-10-02 23:36:45,021 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:36:44" (1/1) ... [2019-10-02 23:36:45,052 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:36:44" (1/1) ... [2019-10-02 23:36:45,062 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:36:44" (1/1) ... [2019-10-02 23:36:45,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 23:36:45,095 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 23:36:45,095 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 23:36:45,096 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 23:36:45,098 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:36:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 23:36:45,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 23:36:45,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 23:36:45,242 INFO L138 BoogieDeclarations]: Found implementation of procedure __le16_to_cpup [2019-10-02 23:36:45,242 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2019-10-02 23:36:45,242 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2019-10-02 23:36:45,243 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2019-10-02 23:36:45,243 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2019-10-02 23:36:45,243 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2019-10-02 23:36:45,244 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_make_path [2019-10-02 23:36:45,244 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register [2019-10-02 23:36:45,244 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_int_urb [2019-10-02 23:36:45,245 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2019-10-02 23:36:45,245 INFO L138 BoogieDeclarations]: Found implementation of procedure input_allocate_device [2019-10-02 23:36:45,246 INFO L138 BoogieDeclarations]: Found implementation of procedure input_get_drvdata [2019-10-02 23:36:45,247 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_drvdata [2019-10-02 23:36:45,248 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_key [2019-10-02 23:36:45,248 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_abs [2019-10-02 23:36:45,248 INFO L138 BoogieDeclarations]: Found implementation of procedure input_sync [2019-10-02 23:36:45,249 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_to_input_id [2019-10-02 23:36:45,249 INFO L138 BoogieDeclarations]: Found implementation of procedure get_unaligned_le16 [2019-10-02 23:36:45,249 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_irq [2019-10-02 23:36:45,249 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_open [2019-10-02 23:36:45,250 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_close [2019-10-02 23:36:45,251 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_probe [2019-10-02 23:36:45,252 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_disconnect [2019-10-02 23:36:45,252 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_init [2019-10-02 23:36:45,252 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_exit [2019-10-02 23:36:45,252 INFO L138 BoogieDeclarations]: Found implementation of procedure init_module [2019-10-02 23:36:45,253 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup_module [2019-10-02 23:36:45,253 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 23:36:45,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2019-10-02 23:36:45,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2019-10-02 23:36:45,254 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2019-10-02 23:36:45,254 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2019-10-02 23:36:45,254 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2019-10-02 23:36:45,255 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2019-10-02 23:36:45,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-10-02 23:36:45,255 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2019-10-02 23:36:45,255 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2019-10-02 23:36:45,255 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2019-10-02 23:36:45,256 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event [2019-10-02 23:36:45,256 INFO L138 BoogieDeclarations]: Found implementation of procedure input_free_device [2019-10-02 23:36:45,257 INFO L138 BoogieDeclarations]: Found implementation of procedure input_register_device [2019-10-02 23:36:45,257 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2019-10-02 23:36:45,257 INFO L138 BoogieDeclarations]: Found implementation of procedure input_unregister_device [2019-10-02 23:36:45,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2019-10-02 23:36:45,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-10-02 23:36:45,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2019-10-02 23:36:45,258 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-10-02 23:36:45,258 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2019-10-02 23:36:45,259 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_deregister [2019-10-02 23:36:45,259 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2019-10-02 23:36:45,259 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register_driver [2019-10-02 23:36:45,259 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2019-10-02 23:36:45,259 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-10-02 23:36:45,260 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-10-02 23:36:45,260 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 23:36:45,260 INFO L130 BoogieDeclarations]: Found specification of procedure __le16_to_cpup [2019-10-02 23:36:45,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 23:36:45,261 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-10-02 23:36:45,261 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2019-10-02 23:36:45,261 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2019-10-02 23:36:45,261 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-10-02 23:36:45,262 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2019-10-02 23:36:45,262 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2019-10-02 23:36:45,263 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2019-10-02 23:36:45,263 INFO L130 BoogieDeclarations]: Found specification of procedure init_module [2019-10-02 23:36:45,263 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup_module [2019-10-02 23:36:45,263 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2019-10-02 23:36:45,264 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2019-10-02 23:36:45,264 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2019-10-02 23:36:45,264 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2019-10-02 23:36:45,264 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2019-10-02 23:36:45,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 23:36:45,266 INFO L130 BoogieDeclarations]: Found specification of procedure usb_make_path [2019-10-02 23:36:45,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 23:36:45,267 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register_driver [2019-10-02 23:36:45,267 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register [2019-10-02 23:36:45,267 INFO L130 BoogieDeclarations]: Found specification of procedure usb_deregister [2019-10-02 23:36:45,268 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_int_urb [2019-10-02 23:36:45,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 23:36:45,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 23:36:45,269 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2019-10-02 23:36:45,269 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2019-10-02 23:36:45,270 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2019-10-02 23:36:45,271 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2019-10-02 23:36:45,271 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2019-10-02 23:36:45,272 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2019-10-02 23:36:45,273 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2019-10-02 23:36:45,273 INFO L130 BoogieDeclarations]: Found specification of procedure input_allocate_device [2019-10-02 23:36:45,273 INFO L130 BoogieDeclarations]: Found specification of procedure input_free_device [2019-10-02 23:36:45,273 INFO L130 BoogieDeclarations]: Found specification of procedure input_get_drvdata [2019-10-02 23:36:45,274 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_drvdata [2019-10-02 23:36:45,274 INFO L130 BoogieDeclarations]: Found specification of procedure input_register_device [2019-10-02 23:36:45,274 INFO L130 BoogieDeclarations]: Found specification of procedure input_unregister_device [2019-10-02 23:36:45,274 INFO L130 BoogieDeclarations]: Found specification of procedure input_event [2019-10-02 23:36:45,274 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_key [2019-10-02 23:36:45,275 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_abs [2019-10-02 23:36:45,275 INFO L130 BoogieDeclarations]: Found specification of procedure input_sync [2019-10-02 23:36:45,275 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2019-10-02 23:36:45,275 INFO L130 BoogieDeclarations]: Found specification of procedure usb_to_input_id [2019-10-02 23:36:45,275 INFO L130 BoogieDeclarations]: Found specification of procedure get_unaligned_le16 [2019-10-02 23:36:45,276 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_irq [2019-10-02 23:36:45,276 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_open [2019-10-02 23:36:45,276 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_close [2019-10-02 23:36:45,276 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_probe [2019-10-02 23:36:45,277 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_disconnect [2019-10-02 23:36:45,277 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_init [2019-10-02 23:36:45,277 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_exit [2019-10-02 23:36:45,277 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-10-02 23:36:45,278 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2019-10-02 23:36:45,278 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-10-02 23:36:45,278 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 23:36:45,278 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 23:36:45,278 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2019-10-02 23:36:45,279 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2019-10-02 23:36:45,280 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2019-10-02 23:36:45,281 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-10-02 23:36:45,281 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-10-02 23:36:45,282 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-02 23:36:45,282 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 23:36:45,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 23:36:45,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 23:36:45,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 23:36:45,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-02 23:36:45,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 23:36:46,187 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 23:36:46,305 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-10-02 23:36:46,305 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-10-02 23:36:46,734 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 23:36:46,832 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-10-02 23:36:46,832 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-10-02 23:36:47,115 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2019-10-02 23:36:47,629 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 23:36:47,629 INFO L283 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-02 23:36:47,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:36:47 BoogieIcfgContainer [2019-10-02 23:36:47,632 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 23:36:47,634 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 23:36:47,635 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 23:36:47,644 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 23:36:47,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:36:42" (1/3) ... [2019-10-02 23:36:47,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e87d809 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:36:47, skipping insertion in model container [2019-10-02 23:36:47,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:36:44" (2/3) ... [2019-10-02 23:36:47,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e87d809 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:36:47, skipping insertion in model container [2019-10-02 23:36:47,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:36:47" (3/3) ... [2019-10-02 23:36:47,662 INFO L109 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2019-10-02 23:36:47,676 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 23:36:47,692 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 23:36:47,714 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 23:36:47,749 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 23:36:47,750 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-02 23:36:47,750 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 23:36:47,750 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 23:36:47,750 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 23:36:47,750 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 23:36:47,750 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 23:36:47,751 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 23:36:47,777 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states. [2019-10-02 23:36:47,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-02 23:36:47,792 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:36:47,793 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:36:47,796 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:36:47,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:36:47,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1845057656, now seen corresponding path program 1 times [2019-10-02 23:36:47,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:36:47,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:36:47,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:36:47,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:36:47,891 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:36:48,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:36:48,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 23:36:48,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:36:48,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:36:48,469 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:36:48,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:36:48,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:36:48,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:36:48,498 INFO L87 Difference]: Start difference. First operand 282 states. Second operand 3 states. [2019-10-02 23:36:48,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:36:48,687 INFO L93 Difference]: Finished difference Result 460 states and 531 transitions. [2019-10-02 23:36:48,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:36:48,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-02 23:36:48,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:36:48,743 INFO L225 Difference]: With dead ends: 460 [2019-10-02 23:36:48,744 INFO L226 Difference]: Without dead ends: 447 [2019-10-02 23:36:48,750 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:36:48,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-10-02 23:36:48,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 443. [2019-10-02 23:36:48,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-10-02 23:36:48,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 510 transitions. [2019-10-02 23:36:48,896 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 510 transitions. Word has length 31 [2019-10-02 23:36:48,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:36:48,898 INFO L475 AbstractCegarLoop]: Abstraction has 443 states and 510 transitions. [2019-10-02 23:36:48,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:36:48,898 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 510 transitions. [2019-10-02 23:36:48,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-02 23:36:48,900 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:36:48,900 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:36:48,900 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:36:48,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:36:48,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1362410536, now seen corresponding path program 1 times [2019-10-02 23:36:48,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:36:48,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:36:48,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:36:48,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:36:48,914 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:36:48,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:36:49,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 23:36:49,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:36:49,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:36:49,119 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:36:49,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:36:49,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:36:49,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:36:49,131 INFO L87 Difference]: Start difference. First operand 443 states and 510 transitions. Second operand 3 states. [2019-10-02 23:36:49,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:36:49,233 INFO L93 Difference]: Finished difference Result 856 states and 990 transitions. [2019-10-02 23:36:49,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:36:49,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-02 23:36:49,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:36:49,242 INFO L225 Difference]: With dead ends: 856 [2019-10-02 23:36:49,243 INFO L226 Difference]: Without dead ends: 846 [2019-10-02 23:36:49,244 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:36:49,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2019-10-02 23:36:49,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 839. [2019-10-02 23:36:49,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2019-10-02 23:36:49,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 971 transitions. [2019-10-02 23:36:49,316 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 971 transitions. Word has length 32 [2019-10-02 23:36:49,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:36:49,317 INFO L475 AbstractCegarLoop]: Abstraction has 839 states and 971 transitions. [2019-10-02 23:36:49,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:36:49,317 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 971 transitions. [2019-10-02 23:36:49,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-02 23:36:49,320 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:36:49,321 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:36:49,321 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:36:49,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:36:49,322 INFO L82 PathProgramCache]: Analyzing trace with hash 318886314, now seen corresponding path program 1 times [2019-10-02 23:36:49,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:36:49,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:36:49,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:36:49,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:36:49,330 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:36:49,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:36:49,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 23:36:49,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:36:49,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 23:36:49,497 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:36:49,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 23:36:49,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 23:36:49,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 23:36:49,498 INFO L87 Difference]: Start difference. First operand 839 states and 971 transitions. Second operand 6 states. [2019-10-02 23:36:49,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:36:49,599 INFO L93 Difference]: Finished difference Result 844 states and 975 transitions. [2019-10-02 23:36:49,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 23:36:49,600 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2019-10-02 23:36:49,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:36:49,611 INFO L225 Difference]: With dead ends: 844 [2019-10-02 23:36:49,611 INFO L226 Difference]: Without dead ends: 839 [2019-10-02 23:36:49,612 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 23:36:49,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2019-10-02 23:36:49,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 839. [2019-10-02 23:36:49,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2019-10-02 23:36:49,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 970 transitions. [2019-10-02 23:36:49,696 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 970 transitions. Word has length 74 [2019-10-02 23:36:49,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:36:49,703 INFO L475 AbstractCegarLoop]: Abstraction has 839 states and 970 transitions. [2019-10-02 23:36:49,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 23:36:49,703 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 970 transitions. [2019-10-02 23:36:49,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-02 23:36:49,711 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:36:49,711 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:36:49,711 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:36:49,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:36:49,712 INFO L82 PathProgramCache]: Analyzing trace with hash 762786988, now seen corresponding path program 1 times [2019-10-02 23:36:49,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:36:49,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:36:49,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:36:49,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:36:49,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:36:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:36:49,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 23:36:49,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:36:49,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:36:49,873 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:36:49,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:36:49,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:36:49,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:36:49,875 INFO L87 Difference]: Start difference. First operand 839 states and 970 transitions. Second operand 3 states. [2019-10-02 23:36:49,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:36:49,930 INFO L93 Difference]: Finished difference Result 875 states and 1017 transitions. [2019-10-02 23:36:49,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:36:49,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-10-02 23:36:49,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:36:49,938 INFO L225 Difference]: With dead ends: 875 [2019-10-02 23:36:49,991 INFO L226 Difference]: Without dead ends: 874 [2019-10-02 23:36:49,992 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:36:49,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-10-02 23:36:50,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2019-10-02 23:36:50,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2019-10-02 23:36:50,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1016 transitions. [2019-10-02 23:36:50,030 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1016 transitions. Word has length 74 [2019-10-02 23:36:50,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:36:50,031 INFO L475 AbstractCegarLoop]: Abstraction has 874 states and 1016 transitions. [2019-10-02 23:36:50,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:36:50,031 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1016 transitions. [2019-10-02 23:36:50,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-02 23:36:50,035 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:36:50,035 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-10-02 23:36:50,036 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:36:50,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:36:50,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1064835193, now seen corresponding path program 1 times [2019-10-02 23:36:50,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:36:50,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:36:50,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:36:50,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:36:50,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:36:50,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:36:50,273 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-02 23:36:50,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:36:50,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 23:36:50,274 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:36:50,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 23:36:50,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 23:36:50,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 23:36:50,275 INFO L87 Difference]: Start difference. First operand 874 states and 1016 transitions. Second operand 5 states. [2019-10-02 23:36:50,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:36:50,311 INFO L93 Difference]: Finished difference Result 602 states and 692 transitions. [2019-10-02 23:36:50,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 23:36:50,312 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2019-10-02 23:36:50,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:36:50,317 INFO L225 Difference]: With dead ends: 602 [2019-10-02 23:36:50,317 INFO L226 Difference]: Without dead ends: 602 [2019-10-02 23:36:50,318 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 23:36:50,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-10-02 23:36:50,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2019-10-02 23:36:50,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-10-02 23:36:50,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 692 transitions. [2019-10-02 23:36:50,342 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 692 transitions. Word has length 129 [2019-10-02 23:36:50,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:36:50,342 INFO L475 AbstractCegarLoop]: Abstraction has 602 states and 692 transitions. [2019-10-02 23:36:50,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 23:36:50,343 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 692 transitions. [2019-10-02 23:36:50,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-02 23:36:50,346 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:36:50,346 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-10-02 23:36:50,347 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:36:50,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:36:50,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1415635130, now seen corresponding path program 1 times [2019-10-02 23:36:50,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:36:50,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:36:50,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:36:50,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:36:50,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:36:50,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:36:50,785 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-02 23:36:50,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:36:50,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 23:36:50,786 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:36:50,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 23:36:50,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 23:36:50,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 23:36:50,789 INFO L87 Difference]: Start difference. First operand 602 states and 692 transitions. Second operand 6 states. [2019-10-02 23:36:53,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:36:53,168 INFO L93 Difference]: Finished difference Result 1090 states and 1275 transitions. [2019-10-02 23:36:53,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 23:36:53,169 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2019-10-02 23:36:53,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:36:53,179 INFO L225 Difference]: With dead ends: 1090 [2019-10-02 23:36:53,179 INFO L226 Difference]: Without dead ends: 1090 [2019-10-02 23:36:53,180 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-02 23:36:53,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2019-10-02 23:36:53,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1051. [2019-10-02 23:36:53,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1051 states. [2019-10-02 23:36:53,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1236 transitions. [2019-10-02 23:36:53,244 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1236 transitions. Word has length 129 [2019-10-02 23:36:53,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:36:53,245 INFO L475 AbstractCegarLoop]: Abstraction has 1051 states and 1236 transitions. [2019-10-02 23:36:53,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 23:36:53,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1236 transitions. [2019-10-02 23:36:53,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-02 23:36:53,249 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:36:53,250 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-10-02 23:36:53,250 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:36:53,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:36:53,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1340956888, now seen corresponding path program 1 times [2019-10-02 23:36:53,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:36:53,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:36:53,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:36:53,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:36:53,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:36:53,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:36:53,493 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 23:36:53,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:36:53,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 23:36:53,494 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:36:53,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 23:36:53,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 23:36:53,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 23:36:53,499 INFO L87 Difference]: Start difference. First operand 1051 states and 1236 transitions. Second operand 5 states. [2019-10-02 23:36:53,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:36:53,544 INFO L93 Difference]: Finished difference Result 1048 states and 1227 transitions. [2019-10-02 23:36:53,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 23:36:53,545 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2019-10-02 23:36:53,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:36:53,555 INFO L225 Difference]: With dead ends: 1048 [2019-10-02 23:36:53,556 INFO L226 Difference]: Without dead ends: 1048 [2019-10-02 23:36:53,556 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 23:36:53,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2019-10-02 23:36:53,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 1048. [2019-10-02 23:36:53,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2019-10-02 23:36:53,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1227 transitions. [2019-10-02 23:36:53,623 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1227 transitions. Word has length 132 [2019-10-02 23:36:53,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:36:53,628 INFO L475 AbstractCegarLoop]: Abstraction has 1048 states and 1227 transitions. [2019-10-02 23:36:53,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 23:36:53,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1227 transitions. [2019-10-02 23:36:53,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-02 23:36:53,638 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:36:53,638 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:36:53,638 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:36:53,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:36:53,639 INFO L82 PathProgramCache]: Analyzing trace with hash -986593187, now seen corresponding path program 1 times [2019-10-02 23:36:53,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:36:53,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:36:53,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:36:53,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:36:53,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:36:53,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:36:54,058 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 23:36:54,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:36:54,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 23:36:54,059 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:36:54,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 23:36:54,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 23:36:54,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 23:36:54,062 INFO L87 Difference]: Start difference. First operand 1048 states and 1227 transitions. Second operand 6 states. [2019-10-02 23:36:54,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:36:54,220 INFO L93 Difference]: Finished difference Result 1070 states and 1264 transitions. [2019-10-02 23:36:54,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 23:36:54,221 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2019-10-02 23:36:54,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:36:54,230 INFO L225 Difference]: With dead ends: 1070 [2019-10-02 23:36:54,230 INFO L226 Difference]: Without dead ends: 1049 [2019-10-02 23:36:54,231 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 23:36:54,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2019-10-02 23:36:54,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 1014. [2019-10-02 23:36:54,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2019-10-02 23:36:54,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1206 transitions. [2019-10-02 23:36:54,283 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1206 transitions. Word has length 149 [2019-10-02 23:36:54,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:36:54,283 INFO L475 AbstractCegarLoop]: Abstraction has 1014 states and 1206 transitions. [2019-10-02 23:36:54,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 23:36:54,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1206 transitions. [2019-10-02 23:36:54,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-02 23:36:54,291 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:36:54,292 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-10-02 23:36:54,292 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:36:54,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:36:54,293 INFO L82 PathProgramCache]: Analyzing trace with hash -8974513, now seen corresponding path program 1 times [2019-10-02 23:36:54,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:36:54,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:36:54,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:36:54,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:36:54,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:36:54,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:36:54,498 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-02 23:36:54,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:36:54,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:36:54,499 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:36:54,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:36:54,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:36:54,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:36:54,501 INFO L87 Difference]: Start difference. First operand 1014 states and 1206 transitions. Second operand 3 states. [2019-10-02 23:36:54,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:36:54,519 INFO L93 Difference]: Finished difference Result 952 states and 1111 transitions. [2019-10-02 23:36:54,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:36:54,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-10-02 23:36:54,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:36:54,528 INFO L225 Difference]: With dead ends: 952 [2019-10-02 23:36:54,529 INFO L226 Difference]: Without dead ends: 952 [2019-10-02 23:36:54,529 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:36:54,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2019-10-02 23:36:54,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 952. [2019-10-02 23:36:54,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2019-10-02 23:36:54,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1111 transitions. [2019-10-02 23:36:54,579 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1111 transitions. Word has length 157 [2019-10-02 23:36:54,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:36:54,580 INFO L475 AbstractCegarLoop]: Abstraction has 952 states and 1111 transitions. [2019-10-02 23:36:54,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:36:54,580 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1111 transitions. [2019-10-02 23:36:54,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-02 23:36:54,584 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:36:54,584 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-10-02 23:36:54,585 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:36:54,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:36:54,585 INFO L82 PathProgramCache]: Analyzing trace with hash 474096884, now seen corresponding path program 1 times [2019-10-02 23:36:54,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:36:54,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:36:54,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:36:54,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:36:54,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:36:54,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:36:54,783 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-02 23:36:54,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:36:54,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 23:36:54,784 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:36:54,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 23:36:54,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 23:36:54,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 23:36:54,786 INFO L87 Difference]: Start difference. First operand 952 states and 1111 transitions. Second operand 5 states. [2019-10-02 23:36:54,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:36:54,834 INFO L93 Difference]: Finished difference Result 960 states and 1116 transitions. [2019-10-02 23:36:54,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 23:36:54,835 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 159 [2019-10-02 23:36:54,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:36:54,843 INFO L225 Difference]: With dead ends: 960 [2019-10-02 23:36:54,844 INFO L226 Difference]: Without dead ends: 960 [2019-10-02 23:36:54,844 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 23:36:54,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2019-10-02 23:36:54,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 960. [2019-10-02 23:36:54,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 960 states. [2019-10-02 23:36:54,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1116 transitions. [2019-10-02 23:36:54,891 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1116 transitions. Word has length 159 [2019-10-02 23:36:54,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:36:54,893 INFO L475 AbstractCegarLoop]: Abstraction has 960 states and 1116 transitions. [2019-10-02 23:36:54,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 23:36:54,895 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1116 transitions. [2019-10-02 23:36:54,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-02 23:36:54,897 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:36:54,897 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-10-02 23:36:54,898 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:36:54,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:36:54,898 INFO L82 PathProgramCache]: Analyzing trace with hash -782323349, now seen corresponding path program 1 times [2019-10-02 23:36:54,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:36:54,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:36:54,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:36:54,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:36:54,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:36:54,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:36:55,360 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-02 23:36:55,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:36:55,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 23:36:55,361 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:36:55,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 23:36:55,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 23:36:55,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 23:36:55,363 INFO L87 Difference]: Start difference. First operand 960 states and 1116 transitions. Second operand 8 states. [2019-10-02 23:36:57,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:36:57,681 INFO L93 Difference]: Finished difference Result 1421 states and 1749 transitions. [2019-10-02 23:36:57,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 23:36:57,682 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 160 [2019-10-02 23:36:57,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:36:57,696 INFO L225 Difference]: With dead ends: 1421 [2019-10-02 23:36:57,696 INFO L226 Difference]: Without dead ends: 1390 [2019-10-02 23:36:57,698 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-10-02 23:36:57,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2019-10-02 23:36:57,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1191. [2019-10-02 23:36:57,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1191 states. [2019-10-02 23:36:57,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1379 transitions. [2019-10-02 23:36:57,777 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 1379 transitions. Word has length 160 [2019-10-02 23:36:57,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:36:57,778 INFO L475 AbstractCegarLoop]: Abstraction has 1191 states and 1379 transitions. [2019-10-02 23:36:57,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 23:36:57,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 1379 transitions. [2019-10-02 23:36:57,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-02 23:36:57,781 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:36:57,782 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:36:57,782 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:36:57,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:36:57,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1069171554, now seen corresponding path program 1 times [2019-10-02 23:36:57,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:36:57,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:36:57,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:36:57,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:36:57,789 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:36:57,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:36:58,063 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-02 23:36:58,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:36:58,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 23:36:58,064 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:36:58,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 23:36:58,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 23:36:58,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 23:36:58,066 INFO L87 Difference]: Start difference. First operand 1191 states and 1379 transitions. Second operand 5 states. [2019-10-02 23:36:58,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:36:58,109 INFO L93 Difference]: Finished difference Result 707 states and 802 transitions. [2019-10-02 23:36:58,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 23:36:58,110 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 187 [2019-10-02 23:36:58,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:36:58,116 INFO L225 Difference]: With dead ends: 707 [2019-10-02 23:36:58,116 INFO L226 Difference]: Without dead ends: 681 [2019-10-02 23:36:58,117 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 23:36:58,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2019-10-02 23:36:58,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 681. [2019-10-02 23:36:58,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 681 states. [2019-10-02 23:36:58,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 776 transitions. [2019-10-02 23:36:58,151 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 776 transitions. Word has length 187 [2019-10-02 23:36:58,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:36:58,151 INFO L475 AbstractCegarLoop]: Abstraction has 681 states and 776 transitions. [2019-10-02 23:36:58,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 23:36:58,152 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 776 transitions. [2019-10-02 23:36:58,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-02 23:36:58,156 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:36:58,156 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:36:58,157 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:36:58,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:36:58,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1039861695, now seen corresponding path program 1 times [2019-10-02 23:36:58,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:36:58,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:36:58,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:36:58,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:36:58,165 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:36:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:36:58,571 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-02 23:36:58,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:36:58,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 23:36:58,573 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:36:58,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 23:36:58,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 23:36:58,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 23:36:58,577 INFO L87 Difference]: Start difference. First operand 681 states and 776 transitions. Second operand 6 states. [2019-10-02 23:37:00,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:37:00,627 INFO L93 Difference]: Finished difference Result 1089 states and 1249 transitions. [2019-10-02 23:37:00,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 23:37:00,628 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 187 [2019-10-02 23:37:00,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:37:00,636 INFO L225 Difference]: With dead ends: 1089 [2019-10-02 23:37:00,636 INFO L226 Difference]: Without dead ends: 1089 [2019-10-02 23:37:00,637 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-02 23:37:00,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2019-10-02 23:37:00,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1042. [2019-10-02 23:37:00,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1042 states. [2019-10-02 23:37:00,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1205 transitions. [2019-10-02 23:37:00,693 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1205 transitions. Word has length 187 [2019-10-02 23:37:00,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:37:00,694 INFO L475 AbstractCegarLoop]: Abstraction has 1042 states and 1205 transitions. [2019-10-02 23:37:00,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 23:37:00,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1205 transitions. [2019-10-02 23:37:00,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-10-02 23:37:00,697 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:37:00,698 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:37:00,698 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:37:00,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:37:00,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1634987359, now seen corresponding path program 1 times [2019-10-02 23:37:00,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:37:00,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:37:00,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:37:00,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:37:00,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:37:00,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:37:00,983 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-02 23:37:00,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:37:00,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 23:37:00,984 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:37:00,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 23:37:00,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 23:37:00,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 23:37:00,986 INFO L87 Difference]: Start difference. First operand 1042 states and 1205 transitions. Second operand 5 states. [2019-10-02 23:37:01,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:37:01,129 INFO L93 Difference]: Finished difference Result 1077 states and 1239 transitions. [2019-10-02 23:37:01,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 23:37:01,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 207 [2019-10-02 23:37:01,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:37:01,137 INFO L225 Difference]: With dead ends: 1077 [2019-10-02 23:37:01,137 INFO L226 Difference]: Without dead ends: 1077 [2019-10-02 23:37:01,138 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 23:37:01,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-10-02 23:37:01,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 1054. [2019-10-02 23:37:01,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2019-10-02 23:37:01,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1216 transitions. [2019-10-02 23:37:01,181 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1216 transitions. Word has length 207 [2019-10-02 23:37:01,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:37:01,182 INFO L475 AbstractCegarLoop]: Abstraction has 1054 states and 1216 transitions. [2019-10-02 23:37:01,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 23:37:01,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1216 transitions. [2019-10-02 23:37:01,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-10-02 23:37:01,185 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:37:01,186 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:37:01,186 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:37:01,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:37:01,187 INFO L82 PathProgramCache]: Analyzing trace with hash 750070294, now seen corresponding path program 1 times [2019-10-02 23:37:01,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:37:01,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:37:01,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:37:01,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:37:01,193 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:37:01,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:37:01,408 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-02 23:37:01,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 23:37:01,409 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 23:37:01,410 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 212 with the following transitions: [2019-10-02 23:37:01,413 INFO L207 CegarAbsIntRunner]: [0], [2], [7], [9], [10], [28], [30], [31], [32], [35], [40], [49], [51], [54], [56], [61], [63], [66], [78], [80], [86], [119], [120], [124], [161], [162], [163], [164], [165], [166], [175], [178], [182], [186], [187], [188], [189], [191], [193], [195], [200], [205], [207], [212], [214], [219], [221], [223], [225], [227], [231], [233], [235], [237], [242], [244], [256], [257], [260], [264], [265], [302], [303], [305], [306], [307], [309], [310], [321], [324], [325], [412], [415], [424], [425], [442], [443], [444], [445], [446], [448], [449], [453], [455], [456], [470], [471], [472], [474], [475], [477], [478], [479], [481], [482], [486], [487], [488], [489], [490], [499], [502], [506], [510], [515], [536], [537], [538], [539], [554], [555], [556], [557], [558], [559], [560], [561], [562], [563], [566], [567], [568], [572], [573], [578], [579], [580], [581], [582], [583], [584], [585], [586], [587], [588], [589], [590], [591], [592], [593], [594], [595], [596], [597], [598], [599], [600], [601], [602], [603], [604], [605], [606], [607], [608], [609], [610], [611], [624], [625], [626], [627], [658], [659], [662], [663], [668], [669], [670], [671], [672], [673], [676], [677], [678], [682], [683], [684] [2019-10-02 23:37:01,484 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 23:37:01,484 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 23:37:01,598 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 23:37:01,600 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 0. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 128 variables. [2019-10-02 23:37:01,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:37:01,607 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 23:37:01,695 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-02 23:37:01,696 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 23:37:01,702 INFO L420 sIntCurrentIteration]: We unified 210 AI predicates to 210 [2019-10-02 23:37:01,702 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 23:37:01,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 23:37:01,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2019-10-02 23:37:01,704 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:37:01,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 23:37:01,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 23:37:01,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 23:37:01,705 INFO L87 Difference]: Start difference. First operand 1054 states and 1216 transitions. Second operand 2 states. [2019-10-02 23:37:01,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:37:01,706 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-02 23:37:01,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 23:37:01,707 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 211 [2019-10-02 23:37:01,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:37:01,707 INFO L225 Difference]: With dead ends: 2 [2019-10-02 23:37:01,707 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 23:37:01,708 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 210 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-02 23:37:01,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 23:37:01,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 23:37:01,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 23:37:01,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 23:37:01,709 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 211 [2019-10-02 23:37:01,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:37:01,709 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 23:37:01,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 23:37:01,709 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 23:37:01,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 23:37:01,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:37:01 BoogieIcfgContainer [2019-10-02 23:37:01,716 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 23:37:01,720 INFO L168 Benchmark]: Toolchain (without parser) took 18822.07 ms. Allocated memory was 131.6 MB in the beginning and 516.9 MB in the end (delta: 385.4 MB). Free memory was 81.8 MB in the beginning and 342.9 MB in the end (delta: -261.1 MB). Peak memory consumption was 124.3 MB. Max. memory is 7.1 GB. [2019-10-02 23:37:01,721 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 131.6 MB. Free memory was 105.7 MB in the beginning and 105.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 23:37:01,722 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1907.32 ms. Allocated memory was 131.6 MB in the beginning and 202.4 MB in the end (delta: 70.8 MB). Free memory was 81.6 MB in the beginning and 115.6 MB in the end (delta: -34.0 MB). Peak memory consumption was 42.0 MB. Max. memory is 7.1 GB. [2019-10-02 23:37:01,723 INFO L168 Benchmark]: Boogie Preprocessor took 288.98 ms. Allocated memory is still 202.4 MB. Free memory was 115.6 MB in the beginning and 108.4 MB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 7.1 GB. [2019-10-02 23:37:01,724 INFO L168 Benchmark]: RCFGBuilder took 2537.12 ms. Allocated memory was 202.4 MB in the beginning and 278.4 MB in the end (delta: 76.0 MB). Free memory was 108.4 MB in the beginning and 222.6 MB in the end (delta: -114.2 MB). Peak memory consumption was 73.1 MB. Max. memory is 7.1 GB. [2019-10-02 23:37:01,725 INFO L168 Benchmark]: TraceAbstraction took 14082.68 ms. Allocated memory was 278.4 MB in the beginning and 516.9 MB in the end (delta: 238.6 MB). Free memory was 222.6 MB in the beginning and 342.9 MB in the end (delta: -120.3 MB). Peak memory consumption was 118.3 MB. Max. memory is 7.1 GB. [2019-10-02 23:37:01,729 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.35 ms. Allocated memory is still 131.6 MB. Free memory was 105.7 MB in the beginning and 105.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1907.32 ms. Allocated memory was 131.6 MB in the beginning and 202.4 MB in the end (delta: 70.8 MB). Free memory was 81.6 MB in the beginning and 115.6 MB in the end (delta: -34.0 MB). Peak memory consumption was 42.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 288.98 ms. Allocated memory is still 202.4 MB. Free memory was 115.6 MB in the beginning and 108.4 MB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2537.12 ms. Allocated memory was 202.4 MB in the beginning and 278.4 MB in the end (delta: 76.0 MB). Free memory was 108.4 MB in the beginning and 222.6 MB in the end (delta: -114.2 MB). Peak memory consumption was 73.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14082.68 ms. Allocated memory was 278.4 MB in the beginning and 516.9 MB in the end (delta: 238.6 MB). Free memory was 222.6 MB in the beginning and 342.9 MB in the end (delta: -120.3 MB). Peak memory consumption was 118.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4037]: 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 56 procedures, 341 locations, 1 error locations. SAFE Result, 13.9s OverallTime, 15 OverallIterations, 4 TraceHistogramMax, 7.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4188 SDtfs, 2553 SDslu, 7835 SDs, 0 SdLazy, 2225 SolverSat, 793 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 307 GetRequests, 252 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1191occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 2.2666666666666666 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 15 MinimizatonAttempts, 354 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 2018 NumberOfCodeBlocks, 2018 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2003 ConstructedInterpolants, 0 QuantifiedInterpolants, 449077 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 428/431 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...