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-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:44:31,888 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:44:31,890 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:44:31,907 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:44:31,908 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:44:31,909 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:44:31,911 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:44:31,925 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:44:31,927 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:44:31,928 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:44:31,930 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:44:31,931 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:44:31,932 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:44:31,935 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:44:31,938 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:44:31,940 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:44:31,941 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:44:31,946 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:44:31,948 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:44:31,953 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:44:31,957 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:44:31,958 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:44:31,959 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:44:31,960 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:44:31,962 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:44:31,962 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:44:31,962 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:44:31,963 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:44:31,963 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:44:31,964 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:44:31,965 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:44:31,965 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:44:31,966 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:44:31,967 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:44:31,968 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:44:31,968 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:44:31,968 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:44:31,969 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:44:31,969 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:44:31,970 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:44:31,970 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:44:31,971 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-09-20 13:44:31,993 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:44:31,993 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:44:31,994 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:44:31,994 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:44:31,995 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:44:31,995 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:44:31,995 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:44:31,995 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:44:31,996 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:44:31,996 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:44:31,998 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:44:31,998 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:44:31,998 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:44:31,999 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:44:31,999 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:44:31,999 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:44:31,999 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:44:32,000 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:44:32,000 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:44:32,000 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:44:32,001 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:44:32,001 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:44:32,001 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:44:32,001 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:44:32,001 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:44:32,002 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:44:32,002 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:44:32,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:44:32,002 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:44:32,003 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:44:32,046 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:44:32,063 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:44:32,068 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:44:32,070 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:44:32,070 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:44:32,071 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-09-20 13:44:32,132 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/215801633/d78ae81f857549998be0ce2b9cbf1727/FLAGd667b879d [2019-09-20 13:44:32,875 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:44:32,876 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-09-20 13:44:32,922 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/215801633/d78ae81f857549998be0ce2b9cbf1727/FLAGd667b879d [2019-09-20 13:44:32,952 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/215801633/d78ae81f857549998be0ce2b9cbf1727 [2019-09-20 13:44:32,966 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:44:32,967 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:44:32,969 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:44:32,969 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:44:32,974 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:44:32,975 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:44:32" (1/1) ... [2019-09-20 13:44:32,978 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2128dd30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:44:32, skipping insertion in model container [2019-09-20 13:44:32,979 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:44:32" (1/1) ... [2019-09-20 13:44:32,988 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:44:33,091 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:44:34,254 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:44:34,285 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:44:34,538 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:44:34,648 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:44:34,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:44:34 WrapperNode [2019-09-20 13:44:34,650 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:44:34,651 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:44:34,652 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:44:34,652 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:44:34,677 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:44:34" (1/1) ... [2019-09-20 13:44:34,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:44:34" (1/1) ... [2019-09-20 13:44:34,747 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:44:34" (1/1) ... [2019-09-20 13:44:34,748 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:44:34" (1/1) ... [2019-09-20 13:44:34,823 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:44:34" (1/1) ... [2019-09-20 13:44:34,834 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:44:34" (1/1) ... [2019-09-20 13:44:34,846 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:44:34" (1/1) ... [2019-09-20 13:44:34,876 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:44:34,877 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:44:34,877 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:44:34,878 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:44:34,879 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:44:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:44:34,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:44:34,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:44:34,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-09-20 13:44:34,978 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_in [2019-09-20 13:44:34,978 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_int [2019-09-20 13:44:34,978 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_is_int_in [2019-09-20 13:44:34,979 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_make_path [2019-09-20 13:44:34,979 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register [2019-09-20 13:44:34,979 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2019-09-20 13:44:34,979 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_maxpacket [2019-09-20 13:44:34,980 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2019-09-20 13:44:34,980 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2019-09-20 13:44:34,980 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2019-09-20 13:44:34,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-09-20 13:44:34,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-09-20 13:44:34,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2019-09-20 13:44:34,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2019-09-20 13:44:34,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2019-09-20 13:44:34,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ptr [2019-09-20 13:44:34,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2019-09-20 13:44:34,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2019-09-20 13:44:34,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-09-20 13:44:34,982 INFO L138 BoogieDeclarations]: Found implementation of procedure input_allocate_device [2019-09-20 13:44:34,982 INFO L138 BoogieDeclarations]: Found implementation of procedure input_get_drvdata [2019-09-20 13:44:34,983 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_drvdata [2019-09-20 13:44:34,983 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_key [2019-09-20 13:44:34,983 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_abs [2019-09-20 13:44:34,983 INFO L138 BoogieDeclarations]: Found implementation of procedure input_sync [2019-09-20 13:44:34,983 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_to_input_id [2019-09-20 13:44:34,984 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_irq [2019-09-20 13:44:34,984 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_open [2019-09-20 13:44:34,984 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_close [2019-09-20 13:44:34,984 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_probe [2019-09-20 13:44:34,984 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2019-09-20 13:44:34,985 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_init [2019-09-20 13:44:34,985 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_exit [2019-09-20 13:44:34,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_driver_1 [2019-09-20 13:44:34,985 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:44:34,985 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2019-09-20 13:44:34,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_register_driver_2 [2019-09-20 13:44:34,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_3 [2019-09-20 13:44:34,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_4 [2019-09-20 13:44:34,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_alloc_urb_5 [2019-09-20 13:44:34,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_int_urb_6 [2019-09-20 13:44:34,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2019-09-20 13:44:34,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata_8 [2019-09-20 13:44:34,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_free_urb_10 [2019-09-20 13:44:34,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_deregister_11 [2019-09-20 13:44:34,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-09-20 13:44:34,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata [2019-09-20 13:44:34,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata [2019-09-20 13:44:34,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_put_intf [2019-09-20 13:44:34,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2019-09-20 13:44:34,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2019-09-20 13:44:34,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_fill_int_urb [2019-09-20 13:44:34,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_fill_bulk_urb [2019-09-20 13:44:34,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2019-09-20 13:44:34,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_interface_to_usbdev [2019-09-20 13:44:34,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_get_dev [2019-09-20 13:44:34,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_put_dev [2019-09-20 13:44:34,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_get_interface [2019-09-20 13:44:34,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_put_interface [2019-09-20 13:44:34,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_serial_register [2019-09-20 13:44:34,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_serial_deregister [2019-09-20 13:44:34,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-09-20 13:44:34,991 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2019-09-20 13:44:34,991 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2019-09-20 13:44:34,991 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event [2019-09-20 13:44:34,991 INFO L138 BoogieDeclarations]: Found implementation of procedure input_free_device [2019-09-20 13:44:34,991 INFO L138 BoogieDeclarations]: Found implementation of procedure input_register_device [2019-09-20 13:44:34,992 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2019-09-20 13:44:34,992 INFO L138 BoogieDeclarations]: Found implementation of procedure input_unregister_device [2019-09-20 13:44:34,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-09-20 13:44:34,992 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-09-20 13:44:34,992 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2019-09-20 13:44:34,993 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcpy [2019-09-20 13:44:34,993 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2019-09-20 13:44:34,993 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_deregister [2019-09-20 13:44:34,993 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2019-09-20 13:44:34,994 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2019-09-20 13:44:34,994 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register_driver [2019-09-20 13:44:34,994 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2019-09-20 13:44:34,994 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-09-20 13:44:34,994 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-09-20 13:44:34,995 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-09-20 13:44:34,995 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-20 13:44:34,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:44:34,995 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-09-20 13:44:34,995 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_in [2019-09-20 13:44:34,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:44:34,996 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_int [2019-09-20 13:44:34,996 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_is_int_in [2019-09-20 13:44:34,996 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2019-09-20 13:44:34,997 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2019-09-20 13:44:34,997 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-09-20 13:44:34,997 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-09-20 13:44:34,997 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2019-09-20 13:44:34,997 INFO L130 BoogieDeclarations]: Found specification of procedure strlcpy [2019-09-20 13:44:34,998 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2019-09-20 13:44:34,998 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2019-09-20 13:44:34,998 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2019-09-20 13:44:34,998 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata_8 [2019-09-20 13:44:34,998 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2019-09-20 13:44:34,999 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2019-09-20 13:44:34,999 INFO L130 BoogieDeclarations]: Found specification of procedure usb_make_path [2019-09-20 13:44:34,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-20 13:44:34,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:44:35,000 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register_driver [2019-09-20 13:44:35,000 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_register_driver_2 [2019-09-20 13:44:35,000 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register [2019-09-20 13:44:35,000 INFO L130 BoogieDeclarations]: Found specification of procedure usb_deregister [2019-09-20 13:44:35,000 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_deregister_11 [2019-09-20 13:44:35,000 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_int_urb_6 [2019-09-20 13:44:35,001 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_alloc_urb_5 [2019-09-20 13:44:35,001 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_free_urb_10 [2019-09-20 13:44:35,001 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_3 [2019-09-20 13:44:35,001 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_4 [2019-09-20 13:44:35,001 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2019-09-20 13:44:35,002 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2019-09-20 13:44:35,002 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2019-09-20 13:44:35,002 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2019-09-20 13:44:35,002 INFO L130 BoogieDeclarations]: Found specification of procedure usb_maxpacket [2019-09-20 13:44:35,002 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2019-09-20 13:44:35,003 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2019-09-20 13:44:35,003 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_fill_int_urb [2019-09-20 13:44:35,003 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2019-09-20 13:44:35,003 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_interface_to_usbdev [2019-09-20 13:44:35,003 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata [2019-09-20 13:44:35,004 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata [2019-09-20 13:44:35,004 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-09-20 13:44:35,004 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-09-20 13:44:35,004 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2019-09-20 13:44:35,004 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2019-09-20 13:44:35,005 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2019-09-20 13:44:35,005 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:44:35,005 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-20 13:44:35,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:44:35,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-09-20 13:44:35,006 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-20 13:44:35,006 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-20 13:44:35,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:44:35,006 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-09-20 13:44:35,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-20 13:44:35,006 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2019-09-20 13:44:35,007 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2019-09-20 13:44:35,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-09-20 13:44:35,007 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2019-09-20 13:44:35,007 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ptr [2019-09-20 13:44:35,007 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2019-09-20 13:44:35,008 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2019-09-20 13:44:35,008 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_driver_1 [2019-09-20 13:44:35,008 INFO L130 BoogieDeclarations]: Found specification of procedure input_allocate_device [2019-09-20 13:44:35,008 INFO L130 BoogieDeclarations]: Found specification of procedure input_free_device [2019-09-20 13:44:35,008 INFO L130 BoogieDeclarations]: Found specification of procedure input_get_drvdata [2019-09-20 13:44:35,009 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_drvdata [2019-09-20 13:44:35,009 INFO L130 BoogieDeclarations]: Found specification of procedure input_register_device [2019-09-20 13:44:35,009 INFO L130 BoogieDeclarations]: Found specification of procedure input_unregister_device [2019-09-20 13:44:35,009 INFO L130 BoogieDeclarations]: Found specification of procedure input_event [2019-09-20 13:44:35,009 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_key [2019-09-20 13:44:35,009 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_abs [2019-09-20 13:44:35,010 INFO L130 BoogieDeclarations]: Found specification of procedure input_sync [2019-09-20 13:44:35,010 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2019-09-20 13:44:35,010 INFO L130 BoogieDeclarations]: Found specification of procedure usb_to_input_id [2019-09-20 13:44:35,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:44:35,010 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_irq [2019-09-20 13:44:35,010 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_open [2019-09-20 13:44:35,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:44:35,011 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_close [2019-09-20 13:44:35,011 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_probe [2019-09-20 13:44:35,011 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2019-09-20 13:44:35,011 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_init [2019-09-20 13:44:35,011 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_exit [2019-09-20 13:44:35,012 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-09-20 13:44:35,012 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-09-20 13:44:35,012 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:44:35,012 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-09-20 13:44:35,012 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_put_intf [2019-09-20 13:44:35,012 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_fill_bulk_urb [2019-09-20 13:44:35,013 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-09-20 13:44:35,013 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_get_dev [2019-09-20 13:44:35,013 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_put_dev [2019-09-20 13:44:35,013 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_get_interface [2019-09-20 13:44:35,013 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_put_interface [2019-09-20 13:44:35,013 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_serial_register [2019-09-20 13:44:35,014 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_serial_deregister [2019-09-20 13:44:35,014 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-09-20 13:44:35,014 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-20 13:44:35,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:44:35,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:44:35,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-20 13:44:35,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-20 13:44:35,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:44:35,927 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2019-09-20 13:44:37,056 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:44:37,057 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-20 13:44:37,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:44:37 BoogieIcfgContainer [2019-09-20 13:44:37,059 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:44:37,061 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:44:37,061 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:44:37,064 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:44:37,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:44:32" (1/3) ... [2019-09-20 13:44:37,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c50f46d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:44:37, skipping insertion in model container [2019-09-20 13:44:37,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:44:34" (2/3) ... [2019-09-20 13:44:37,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c50f46d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:44:37, skipping insertion in model container [2019-09-20 13:44:37,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:44:37" (3/3) ... [2019-09-20 13:44:37,068 INFO L109 eAbstractionObserver]: Analyzing ICFG linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-09-20 13:44:37,079 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:44:37,094 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:44:37,114 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:44:37,139 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:44:37,139 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:44:37,139 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:44:37,139 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:44:37,139 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:44:37,139 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:44:37,139 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:44:37,139 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:44:37,167 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states. [2019-09-20 13:44:37,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-20 13:44:37,180 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:44:37,181 INFO L407 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] [2019-09-20 13:44:37,183 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:44:37,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:44:37,190 INFO L82 PathProgramCache]: Analyzing trace with hash 881801110, now seen corresponding path program 1 times [2019-09-20 13:44:37,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:44:37,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:44:37,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:44:37,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:44:37,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:44:37,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:44:37,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:44:37,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:44:37,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:44:37,777 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:44:37,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:44:37,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:44:37,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:44:37,801 INFO L87 Difference]: Start difference. First operand 505 states. Second operand 3 states. [2019-09-20 13:44:37,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:44:37,976 INFO L93 Difference]: Finished difference Result 677 states and 801 transitions. [2019-09-20 13:44:37,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:44:37,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-09-20 13:44:37,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:44:38,020 INFO L225 Difference]: With dead ends: 677 [2019-09-20 13:44:38,020 INFO L226 Difference]: Without dead ends: 660 [2019-09-20 13:44:38,023 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:44:38,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2019-09-20 13:44:38,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2019-09-20 13:44:38,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2019-09-20 13:44:38,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 776 transitions. [2019-09-20 13:44:38,152 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 776 transitions. Word has length 44 [2019-09-20 13:44:38,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:44:38,153 INFO L475 AbstractCegarLoop]: Abstraction has 660 states and 776 transitions. [2019-09-20 13:44:38,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:44:38,153 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 776 transitions. [2019-09-20 13:44:38,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-20 13:44:38,158 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:44:38,158 INFO L407 BasicCegarLoop]: trace histogram [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] [2019-09-20 13:44:38,159 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:44:38,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:44:38,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1668223595, now seen corresponding path program 1 times [2019-09-20 13:44:38,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:44:38,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:44:38,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:44:38,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:44:38,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:44:38,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:44:38,448 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-20 13:44:38,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:44:38,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:44:38,449 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:44:38,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:44:38,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:44:38,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:44:38,452 INFO L87 Difference]: Start difference. First operand 660 states and 776 transitions. Second operand 6 states. [2019-09-20 13:44:38,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:44:38,601 INFO L93 Difference]: Finished difference Result 678 states and 796 transitions. [2019-09-20 13:44:38,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:44:38,602 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-09-20 13:44:38,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:44:38,609 INFO L225 Difference]: With dead ends: 678 [2019-09-20 13:44:38,610 INFO L226 Difference]: Without dead ends: 678 [2019-09-20 13:44:38,611 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:44:38,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2019-09-20 13:44:38,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 665. [2019-09-20 13:44:38,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2019-09-20 13:44:38,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 780 transitions. [2019-09-20 13:44:38,662 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 780 transitions. Word has length 72 [2019-09-20 13:44:38,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:44:38,663 INFO L475 AbstractCegarLoop]: Abstraction has 665 states and 780 transitions. [2019-09-20 13:44:38,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:44:38,663 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 780 transitions. [2019-09-20 13:44:38,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-20 13:44:38,675 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:44:38,676 INFO L407 BasicCegarLoop]: trace histogram [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] [2019-09-20 13:44:38,676 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:44:38,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:44:38,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1868420821, now seen corresponding path program 1 times [2019-09-20 13:44:38,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:44:38,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:44:38,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:44:38,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:44:38,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:44:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:44:38,894 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-20 13:44:38,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:44:38,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:44:38,895 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:44:38,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:44:38,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:44:38,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:44:38,897 INFO L87 Difference]: Start difference. First operand 665 states and 780 transitions. Second operand 3 states. [2019-09-20 13:44:38,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:44:38,965 INFO L93 Difference]: Finished difference Result 1308 states and 1546 transitions. [2019-09-20 13:44:38,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:44:38,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-09-20 13:44:38,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:44:38,976 INFO L225 Difference]: With dead ends: 1308 [2019-09-20 13:44:38,976 INFO L226 Difference]: Without dead ends: 1308 [2019-09-20 13:44:38,977 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:44:38,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2019-09-20 13:44:39,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1298. [2019-09-20 13:44:39,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1298 states. [2019-09-20 13:44:39,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 1534 transitions. [2019-09-20 13:44:39,027 INFO L78 Accepts]: Start accepts. Automaton has 1298 states and 1534 transitions. Word has length 72 [2019-09-20 13:44:39,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:44:39,028 INFO L475 AbstractCegarLoop]: Abstraction has 1298 states and 1534 transitions. [2019-09-20 13:44:39,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:44:39,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 1534 transitions. [2019-09-20 13:44:39,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-20 13:44:39,030 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:44:39,030 INFO L407 BasicCegarLoop]: trace histogram [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] [2019-09-20 13:44:39,030 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:44:39,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:44:39,031 INFO L82 PathProgramCache]: Analyzing trace with hash -2086615691, now seen corresponding path program 1 times [2019-09-20 13:44:39,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:44:39,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:44:39,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:44:39,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:44:39,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:44:39,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:44:39,168 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-20 13:44:39,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:44:39,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:44:39,169 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:44:39,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:44:39,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:44:39,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:44:39,170 INFO L87 Difference]: Start difference. First operand 1298 states and 1534 transitions. Second operand 3 states. [2019-09-20 13:44:39,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:44:39,190 INFO L93 Difference]: Finished difference Result 1297 states and 1532 transitions. [2019-09-20 13:44:39,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:44:39,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-20 13:44:39,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:44:39,197 INFO L225 Difference]: With dead ends: 1297 [2019-09-20 13:44:39,198 INFO L226 Difference]: Without dead ends: 1297 [2019-09-20 13:44:39,198 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:44:39,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2019-09-20 13:44:39,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 1297. [2019-09-20 13:44:39,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1297 states. [2019-09-20 13:44:39,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1297 states to 1297 states and 1532 transitions. [2019-09-20 13:44:39,249 INFO L78 Accepts]: Start accepts. Automaton has 1297 states and 1532 transitions. Word has length 73 [2019-09-20 13:44:39,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:44:39,252 INFO L475 AbstractCegarLoop]: Abstraction has 1297 states and 1532 transitions. [2019-09-20 13:44:39,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:44:39,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1297 states and 1532 transitions. [2019-09-20 13:44:39,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-20 13:44:39,253 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:44:39,253 INFO L407 BasicCegarLoop]: trace histogram [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] [2019-09-20 13:44:39,254 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:44:39,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:44:39,254 INFO L82 PathProgramCache]: Analyzing trace with hash -260717202, now seen corresponding path program 1 times [2019-09-20 13:44:39,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:44:39,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:44:39,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:44:39,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:44:39,260 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:44:39,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:44:39,391 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-20 13:44:39,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:44:39,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:44:39,392 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:44:39,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:44:39,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:44:39,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:44:39,394 INFO L87 Difference]: Start difference. First operand 1297 states and 1532 transitions. Second operand 3 states. [2019-09-20 13:44:39,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:44:39,415 INFO L93 Difference]: Finished difference Result 1296 states and 1530 transitions. [2019-09-20 13:44:39,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:44:39,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-20 13:44:39,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:44:39,424 INFO L225 Difference]: With dead ends: 1296 [2019-09-20 13:44:39,424 INFO L226 Difference]: Without dead ends: 1296 [2019-09-20 13:44:39,425 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:44:39,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2019-09-20 13:44:39,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1296. [2019-09-20 13:44:39,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1296 states. [2019-09-20 13:44:39,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1296 states and 1530 transitions. [2019-09-20 13:44:39,474 INFO L78 Accepts]: Start accepts. Automaton has 1296 states and 1530 transitions. Word has length 74 [2019-09-20 13:44:39,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:44:39,482 INFO L475 AbstractCegarLoop]: Abstraction has 1296 states and 1530 transitions. [2019-09-20 13:44:39,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:44:39,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 1530 transitions. [2019-09-20 13:44:39,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-20 13:44:39,485 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:44:39,485 INFO L407 BasicCegarLoop]: trace histogram [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] [2019-09-20 13:44:39,485 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:44:39,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:44:39,486 INFO L82 PathProgramCache]: Analyzing trace with hash 507565976, now seen corresponding path program 1 times [2019-09-20 13:44:39,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:44:39,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:44:39,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:44:39,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:44:39,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:44:39,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:44:39,652 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-20 13:44:39,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:44:39,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:44:39,655 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:44:39,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:44:39,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:44:39,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:44:39,656 INFO L87 Difference]: Start difference. First operand 1296 states and 1530 transitions. Second operand 3 states. [2019-09-20 13:44:39,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:44:39,674 INFO L93 Difference]: Finished difference Result 1295 states and 1528 transitions. [2019-09-20 13:44:39,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:44:39,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-09-20 13:44:39,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:44:39,681 INFO L225 Difference]: With dead ends: 1295 [2019-09-20 13:44:39,681 INFO L226 Difference]: Without dead ends: 1295 [2019-09-20 13:44:39,682 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:44:39,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2019-09-20 13:44:39,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1295. [2019-09-20 13:44:39,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1295 states. [2019-09-20 13:44:39,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1295 states and 1528 transitions. [2019-09-20 13:44:39,720 INFO L78 Accepts]: Start accepts. Automaton has 1295 states and 1528 transitions. Word has length 75 [2019-09-20 13:44:39,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:44:39,721 INFO L475 AbstractCegarLoop]: Abstraction has 1295 states and 1528 transitions. [2019-09-20 13:44:39,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:44:39,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1528 transitions. [2019-09-20 13:44:39,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-20 13:44:39,726 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:44:39,726 INFO L407 BasicCegarLoop]: trace histogram [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] [2019-09-20 13:44:39,726 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:44:39,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:44:39,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1445454415, now seen corresponding path program 1 times [2019-09-20 13:44:39,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:44:39,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:44:39,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:44:39,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:44:39,736 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:44:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:44:39,892 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-20 13:44:39,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:44:39,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:44:39,893 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:44:39,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:44:39,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:44:39,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:44:39,896 INFO L87 Difference]: Start difference. First operand 1295 states and 1528 transitions. Second operand 3 states. [2019-09-20 13:44:39,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:44:39,912 INFO L93 Difference]: Finished difference Result 1294 states and 1526 transitions. [2019-09-20 13:44:39,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:44:39,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-20 13:44:39,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:44:39,919 INFO L225 Difference]: With dead ends: 1294 [2019-09-20 13:44:39,920 INFO L226 Difference]: Without dead ends: 1275 [2019-09-20 13:44:39,920 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:44:39,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2019-09-20 13:44:39,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1275. [2019-09-20 13:44:39,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1275 states. [2019-09-20 13:44:39,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1505 transitions. [2019-09-20 13:44:39,975 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1505 transitions. Word has length 76 [2019-09-20 13:44:39,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:44:39,976 INFO L475 AbstractCegarLoop]: Abstraction has 1275 states and 1505 transitions. [2019-09-20 13:44:39,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:44:39,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1505 transitions. [2019-09-20 13:44:39,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-09-20 13:44:39,987 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:44:39,987 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:44:39,988 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:44:39,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:44:39,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1432264192, now seen corresponding path program 1 times [2019-09-20 13:44:39,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:44:39,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:44:39,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:44:39,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:44:39,999 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:44:40,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:44:40,190 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-20 13:44:40,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:44:40,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:44:40,195 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:44:40,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:44:40,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:44:40,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:44:40,197 INFO L87 Difference]: Start difference. First operand 1275 states and 1505 transitions. Second operand 3 states. [2019-09-20 13:44:40,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:44:40,254 INFO L93 Difference]: Finished difference Result 1362 states and 1622 transitions. [2019-09-20 13:44:40,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:44:40,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 234 [2019-09-20 13:44:40,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:44:40,263 INFO L225 Difference]: With dead ends: 1362 [2019-09-20 13:44:40,263 INFO L226 Difference]: Without dead ends: 1362 [2019-09-20 13:44:40,264 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:44:40,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2019-09-20 13:44:40,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 1325. [2019-09-20 13:44:40,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1325 states. [2019-09-20 13:44:40,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1576 transitions. [2019-09-20 13:44:40,321 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1576 transitions. Word has length 234 [2019-09-20 13:44:40,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:44:40,322 INFO L475 AbstractCegarLoop]: Abstraction has 1325 states and 1576 transitions. [2019-09-20 13:44:40,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:44:40,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1576 transitions. [2019-09-20 13:44:40,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-20 13:44:40,329 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:44:40,329 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:44:40,330 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:44:40,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:44:40,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1327979329, now seen corresponding path program 1 times [2019-09-20 13:44:40,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:44:40,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:44:40,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:44:40,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:44:40,337 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:44:40,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:44:40,702 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-20 13:44:40,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:44:40,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:44:40,703 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:44:40,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:44:40,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:44:40,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:44:40,705 INFO L87 Difference]: Start difference. First operand 1325 states and 1576 transitions. Second operand 6 states. [2019-09-20 13:44:40,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:44:40,766 INFO L93 Difference]: Finished difference Result 1353 states and 1604 transitions. [2019-09-20 13:44:40,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:44:40,766 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 253 [2019-09-20 13:44:40,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:44:40,774 INFO L225 Difference]: With dead ends: 1353 [2019-09-20 13:44:40,774 INFO L226 Difference]: Without dead ends: 1353 [2019-09-20 13:44:40,776 INFO L636 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-09-20 13:44:40,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2019-09-20 13:44:40,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1349. [2019-09-20 13:44:40,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1349 states. [2019-09-20 13:44:40,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 1600 transitions. [2019-09-20 13:44:40,818 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 1600 transitions. Word has length 253 [2019-09-20 13:44:40,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:44:40,819 INFO L475 AbstractCegarLoop]: Abstraction has 1349 states and 1600 transitions. [2019-09-20 13:44:40,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:44:40,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 1600 transitions. [2019-09-20 13:44:40,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-20 13:44:40,825 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:44:40,825 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:44:40,825 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:44:40,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:44:40,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1087512954, now seen corresponding path program 1 times [2019-09-20 13:44:40,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:44:40,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:44:40,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:44:40,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:44:40,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:44:40,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:44:41,110 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-20 13:44:41,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:44:41,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:44:41,111 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:44:41,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:44:41,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:44:41,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:44:41,112 INFO L87 Difference]: Start difference. First operand 1349 states and 1600 transitions. Second operand 6 states. [2019-09-20 13:44:41,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:44:41,314 INFO L93 Difference]: Finished difference Result 2765 states and 3290 transitions. [2019-09-20 13:44:41,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 13:44:41,314 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 259 [2019-09-20 13:44:41,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:44:41,331 INFO L225 Difference]: With dead ends: 2765 [2019-09-20 13:44:41,331 INFO L226 Difference]: Without dead ends: 2765 [2019-09-20 13:44:41,332 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:44:41,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2765 states. [2019-09-20 13:44:41,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2765 to 1389. [2019-09-20 13:44:41,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1389 states. [2019-09-20 13:44:41,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 1654 transitions. [2019-09-20 13:44:41,417 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 1654 transitions. Word has length 259 [2019-09-20 13:44:41,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:44:41,418 INFO L475 AbstractCegarLoop]: Abstraction has 1389 states and 1654 transitions. [2019-09-20 13:44:41,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:44:41,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 1654 transitions. [2019-09-20 13:44:41,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-20 13:44:41,425 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:44:41,425 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:44:41,426 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:44:41,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:44:41,426 INFO L82 PathProgramCache]: Analyzing trace with hash 953499448, now seen corresponding path program 1 times [2019-09-20 13:44:41,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:44:41,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:44:41,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:44:41,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:44:41,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:44:41,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:44:41,913 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-20 13:44:41,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:44:41,914 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:44:41,916 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 260 with the following transitions: [2019-09-20 13:44:41,919 INFO L207 CegarAbsIntRunner]: [20], [21], [25], [26], [27], [28], [34], [35], [46], [47], [48], [50], [54], [56], [60], [62], [64], [66], [68], [73], [75], [80], [82], [85], [174], [176], [180], [181], [182], [183], [240], [241], [250], [253], [255], [256], [258], [260], [263], [266], [273], [274], [275], [277], [278], [299], [300], [363], [364], [370], [371], [372], [374], [377], [379], [382], [389], [390], [391], [393], [396], [400], [401], [402], [403], [404], [406], [407], [429], [431], [432], [433], [434], [435], [451], [453], [459], [462], [466], [468], [479], [481], [482], [483], [484], [485], [487], [489], [491], [494], [497], [500], [503], [505], [510], [543], [546], [549], [552], [555], [557], [561], [564], [567], [569], [572], [580], [613], [614], [636], [638], [640], [641], [658], [659], [663], [665], [666], [669], [670], [672], [673], [674], [676], [677], [747], [749], [750], [751], [753], [754], [774], [776], [777], [784], [786], [787], [790], [838], [840], [846], [848], [849], [864], [865], [866], [867], [868], [869], [870], [871], [872], [873], [874], [875], [876], [877], [878], [879], [912], [913], [914], [915], [916], [917], [928], [929], [930], [931], [932], [933], [956], [957], [960], [961], [962], [963], [964], [965], [966], [967], [980], [981], [988], [989], [992], [993], [998], [999], [1000], [1001], [1002], [1003], [1004], [1005], [1010], [1011], [1012], [1013], [1018], [1022], [1023], [1024], [1025], [1034], [1035], [1036], [1037], [1038], [1039], [1050], [1051], [1052], [1053], [1056], [1057], [1062], [1063], [1064], [1076], [1077], [1078], [1082], [1083] [2019-09-20 13:44:41,980 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-20 13:44:41,981 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-20 13:44:42,069 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-20 13:44:42,070 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 75 root evaluator evaluations with a maximum evaluation depth of 0. Performed 75 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 148 variables. [2019-09-20 13:44:42,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:44:42,077 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-20 13:44:42,170 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-20 13:44:42,170 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-20 13:44:42,179 INFO L420 sIntCurrentIteration]: We unified 258 AI predicates to 258 [2019-09-20 13:44:42,180 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-20 13:44:42,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 13:44:42,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [11] total 11 [2019-09-20 13:44:42,182 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:44:42,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-20 13:44:42,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-20 13:44:42,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 13:44:42,183 INFO L87 Difference]: Start difference. First operand 1389 states and 1654 transitions. Second operand 2 states. [2019-09-20 13:44:42,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:44:42,183 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-20 13:44:42,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-20 13:44:42,184 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 259 [2019-09-20 13:44:42,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:44:42,184 INFO L225 Difference]: With dead ends: 2 [2019-09-20 13:44:42,184 INFO L226 Difference]: Without dead ends: 0 [2019-09-20 13:44:42,185 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 258 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-09-20 13:44:42,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-20 13:44:42,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-20 13:44:42,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-20 13:44:42,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-20 13:44:42,186 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 259 [2019-09-20 13:44:42,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:44:42,186 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-20 13:44:42,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-20 13:44:42,187 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-20 13:44:42,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-20 13:44:42,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:44:42 BoogieIcfgContainer [2019-09-20 13:44:42,193 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 13:44:42,195 INFO L168 Benchmark]: Toolchain (without parser) took 9227.44 ms. Allocated memory was 137.4 MB in the beginning and 489.7 MB in the end (delta: 352.3 MB). Free memory was 77.7 MB in the beginning and 326.4 MB in the end (delta: -248.6 MB). Peak memory consumption was 103.7 MB. Max. memory is 7.1 GB. [2019-09-20 13:44:42,196 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 137.4 MB. Free memory was 102.0 MB in the beginning and 101.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-09-20 13:44:42,198 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1682.29 ms. Allocated memory was 137.4 MB in the beginning and 211.8 MB in the end (delta: 74.4 MB). Free memory was 77.5 MB in the beginning and 129.2 MB in the end (delta: -51.6 MB). Peak memory consumption was 36.6 MB. Max. memory is 7.1 GB. [2019-09-20 13:44:42,200 INFO L168 Benchmark]: Boogie Preprocessor took 225.39 ms. Allocated memory is still 211.8 MB. Free memory was 129.2 MB in the beginning and 120.8 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 7.1 GB. [2019-09-20 13:44:42,205 INFO L168 Benchmark]: RCFGBuilder took 2181.94 ms. Allocated memory was 211.8 MB in the beginning and 278.9 MB in the end (delta: 67.1 MB). Free memory was 120.8 MB in the beginning and 132.1 MB in the end (delta: -11.3 MB). Peak memory consumption was 68.4 MB. Max. memory is 7.1 GB. [2019-09-20 13:44:42,206 INFO L168 Benchmark]: TraceAbstraction took 5132.32 ms. Allocated memory was 278.9 MB in the beginning and 489.7 MB in the end (delta: 210.8 MB). Free memory was 132.1 MB in the beginning and 326.4 MB in the end (delta: -194.3 MB). Peak memory consumption was 16.5 MB. Max. memory is 7.1 GB. [2019-09-20 13:44:42,217 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.20 ms. Allocated memory is still 137.4 MB. Free memory was 102.0 MB in the beginning and 101.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1682.29 ms. Allocated memory was 137.4 MB in the beginning and 211.8 MB in the end (delta: 74.4 MB). Free memory was 77.5 MB in the beginning and 129.2 MB in the end (delta: -51.6 MB). Peak memory consumption was 36.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 225.39 ms. Allocated memory is still 211.8 MB. Free memory was 129.2 MB in the beginning and 120.8 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2181.94 ms. Allocated memory was 211.8 MB in the beginning and 278.9 MB in the end (delta: 67.1 MB). Free memory was 120.8 MB in the beginning and 132.1 MB in the end (delta: -11.3 MB). Peak memory consumption was 68.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5132.32 ms. Allocated memory was 278.9 MB in the beginning and 489.7 MB in the end (delta: 210.8 MB). Free memory was 132.1 MB in the beginning and 326.4 MB in the end (delta: -194.3 MB). Peak memory consumption was 16.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4049]: 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 86 procedures, 550 locations, 1 error locations. SAFE Result, 5.0s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4774 SDtfs, 3281 SDslu, 6970 SDs, 0 SdLazy, 122 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 308 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1389occurred in iteration=10, 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.0930232558139537 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 1440 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1491 NumberOfCodeBlocks, 1491 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1480 ConstructedInterpolants, 0 QuantifiedInterpolants, 352402 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 208/219 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...