java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:02:44,451 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:02:44,454 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:02:44,472 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:02:44,472 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:02:44,475 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:02:44,477 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:02:44,486 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:02:44,490 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:02:44,493 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:02:44,496 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:02:44,498 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:02:44,498 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:02:44,500 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:02:44,503 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:02:44,504 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:02:44,506 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:02:44,507 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:02:44,509 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:02:44,515 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:02:44,519 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:02:44,520 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:02:44,523 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:02:44,524 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:02:44,526 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:02:44,526 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:02:44,526 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:02:44,528 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:02:44,529 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:02:44,530 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:02:44,531 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:02:44,533 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:02:44,533 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:02:44,534 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:02:44,535 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:02:44,536 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:02:44,536 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:02:44,537 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:02:44,537 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:02:44,539 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:02:44,540 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:02:44,541 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:02:44,568 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:02:44,568 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:02:44,569 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:02:44,570 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:02:44,570 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:02:44,571 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:02:44,572 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:02:44,572 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:02:44,572 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:02:44,572 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:02:44,572 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:02:44,573 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:02:44,573 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:02:44,573 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:02:44,574 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:02:44,574 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:02:44,575 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:02:44,575 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:02:44,575 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:02:44,575 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:02:44,576 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:02:44,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:02:44,576 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:02:44,576 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:02:44,577 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:02:44,577 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:02:44,577 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:02:44,577 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:02:44,577 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:02:44,889 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:02:44,910 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:02:44,913 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:02:44,915 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:02:44,915 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:02:44,916 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_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-10-15 01:02:44,992 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88c7c25fb/d66d2e559c4a4dbfb6eeed25bec4026f/FLAG6ab2be862 [2019-10-15 01:02:45,805 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:02:45,807 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-10-15 01:02:45,840 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88c7c25fb/d66d2e559c4a4dbfb6eeed25bec4026f/FLAG6ab2be862 [2019-10-15 01:02:45,924 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88c7c25fb/d66d2e559c4a4dbfb6eeed25bec4026f [2019-10-15 01:02:45,938 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:02:45,939 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:02:45,940 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:02:45,941 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:02:45,943 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:02:45,944 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:02:45" (1/1) ... [2019-10-15 01:02:45,946 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ac258e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:02:45, skipping insertion in model container [2019-10-15 01:02:45,947 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:02:45" (1/1) ... [2019-10-15 01:02:45,952 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:02:46,048 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:02:47,282 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:02:47,337 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:02:47,643 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:02:47,736 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:02:47,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:02:47 WrapperNode [2019-10-15 01:02:47,737 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:02:47,738 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:02:47,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:02:47,739 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:02:47,755 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:02:47" (1/1) ... [2019-10-15 01:02:47,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:02:47" (1/1) ... [2019-10-15 01:02:47,818 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:02:47" (1/1) ... [2019-10-15 01:02:47,819 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:02:47" (1/1) ... [2019-10-15 01:02:47,878 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:02:47" (1/1) ... [2019-10-15 01:02:47,894 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:02:47" (1/1) ... [2019-10-15 01:02:47,904 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:02:47" (1/1) ... [2019-10-15 01:02:47,930 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:02:47,930 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:02:47,930 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:02:47,931 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:02:47,932 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:02:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:02:47,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:02:47,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:02:47,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-10-15 01:02:47,990 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_in [2019-10-15 01:02:47,991 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_int [2019-10-15 01:02:47,991 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_is_int_in [2019-10-15 01:02:47,991 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_make_path [2019-10-15 01:02:47,991 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register [2019-10-15 01:02:47,992 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2019-10-15 01:02:47,992 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_maxpacket [2019-10-15 01:02:47,992 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2019-10-15 01:02:47,992 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2019-10-15 01:02:47,992 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2019-10-15 01:02:47,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-10-15 01:02:47,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-10-15 01:02:47,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2019-10-15 01:02:47,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2019-10-15 01:02:47,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2019-10-15 01:02:47,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ptr [2019-10-15 01:02:47,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2019-10-15 01:02:47,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2019-10-15 01:02:47,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-10-15 01:02:47,995 INFO L138 BoogieDeclarations]: Found implementation of procedure input_allocate_device [2019-10-15 01:02:47,995 INFO L138 BoogieDeclarations]: Found implementation of procedure input_get_drvdata [2019-10-15 01:02:47,995 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_drvdata [2019-10-15 01:02:47,995 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_key [2019-10-15 01:02:47,995 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_abs [2019-10-15 01:02:47,995 INFO L138 BoogieDeclarations]: Found implementation of procedure input_sync [2019-10-15 01:02:47,996 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_to_input_id [2019-10-15 01:02:47,996 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_irq [2019-10-15 01:02:47,996 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_open [2019-10-15 01:02:47,996 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_close [2019-10-15 01:02:47,996 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_probe [2019-10-15 01:02:47,996 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2019-10-15 01:02:47,996 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_init [2019-10-15 01:02:47,996 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_exit [2019-10-15 01:02:47,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_driver_1 [2019-10-15 01:02:47,997 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:02:47,997 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2019-10-15 01:02:47,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_register_driver_2 [2019-10-15 01:02:47,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_3 [2019-10-15 01:02:47,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_4 [2019-10-15 01:02:47,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_alloc_urb_5 [2019-10-15 01:02:47,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_int_urb_6 [2019-10-15 01:02:47,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2019-10-15 01:02:47,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata_8 [2019-10-15 01:02:47,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_free_urb_10 [2019-10-15 01:02:47,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_deregister_11 [2019-10-15 01:02:47,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-10-15 01:02:47,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata [2019-10-15 01:02:47,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata [2019-10-15 01:02:47,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_put_intf [2019-10-15 01:02:48,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2019-10-15 01:02:48,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2019-10-15 01:02:48,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_fill_int_urb [2019-10-15 01:02:48,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_fill_bulk_urb [2019-10-15 01:02:48,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2019-10-15 01:02:48,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_interface_to_usbdev [2019-10-15 01:02:48,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_get_dev [2019-10-15 01:02:48,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_put_dev [2019-10-15 01:02:48,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_get_interface [2019-10-15 01:02:48,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_put_interface [2019-10-15 01:02:48,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_serial_register [2019-10-15 01:02:48,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_serial_deregister [2019-10-15 01:02:48,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-10-15 01:02:48,002 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2019-10-15 01:02:48,002 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2019-10-15 01:02:48,002 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event [2019-10-15 01:02:48,003 INFO L138 BoogieDeclarations]: Found implementation of procedure input_free_device [2019-10-15 01:02:48,003 INFO L138 BoogieDeclarations]: Found implementation of procedure input_register_device [2019-10-15 01:02:48,003 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2019-10-15 01:02:48,003 INFO L138 BoogieDeclarations]: Found implementation of procedure input_unregister_device [2019-10-15 01:02:48,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-10-15 01:02:48,003 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-10-15 01:02:48,004 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2019-10-15 01:02:48,004 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcpy [2019-10-15 01:02:48,004 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2019-10-15 01:02:48,004 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2019-10-15 01:02:48,004 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_deregister [2019-10-15 01:02:48,005 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2019-10-15 01:02:48,005 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2019-10-15 01:02:48,005 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2019-10-15 01:02:48,005 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register_driver [2019-10-15 01:02:48,005 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2019-10-15 01:02:48,006 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-10-15 01:02:48,006 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-10-15 01:02:48,006 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-10-15 01:02:48,006 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-10-15 01:02:48,006 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:02:48,007 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-10-15 01:02:48,007 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_in [2019-10-15 01:02:48,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:02:48,007 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_int [2019-10-15 01:02:48,007 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_is_int_in [2019-10-15 01:02:48,007 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2019-10-15 01:02:48,008 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2019-10-15 01:02:48,008 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-10-15 01:02:48,008 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-10-15 01:02:48,008 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2019-10-15 01:02:48,008 INFO L130 BoogieDeclarations]: Found specification of procedure strlcpy [2019-10-15 01:02:48,008 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2019-10-15 01:02:48,009 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2019-10-15 01:02:48,009 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2019-10-15 01:02:48,009 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata_8 [2019-10-15 01:02:48,009 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2019-10-15 01:02:48,009 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2019-10-15 01:02:48,010 INFO L130 BoogieDeclarations]: Found specification of procedure usb_make_path [2019-10-15 01:02:48,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 01:02:48,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 01:02:48,010 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register_driver [2019-10-15 01:02:48,010 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_register_driver_2 [2019-10-15 01:02:48,010 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register [2019-10-15 01:02:48,011 INFO L130 BoogieDeclarations]: Found specification of procedure usb_deregister [2019-10-15 01:02:48,011 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_deregister_11 [2019-10-15 01:02:48,011 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_int_urb_6 [2019-10-15 01:02:48,011 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2019-10-15 01:02:48,011 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_alloc_urb_5 [2019-10-15 01:02:48,012 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2019-10-15 01:02:48,012 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_free_urb_10 [2019-10-15 01:02:48,012 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_3 [2019-10-15 01:02:48,012 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_4 [2019-10-15 01:02:48,012 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2019-10-15 01:02:48,013 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2019-10-15 01:02:48,013 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2019-10-15 01:02:48,013 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2019-10-15 01:02:48,013 INFO L130 BoogieDeclarations]: Found specification of procedure usb_maxpacket [2019-10-15 01:02:48,013 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2019-10-15 01:02:48,013 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2019-10-15 01:02:48,014 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_fill_int_urb [2019-10-15 01:02:48,014 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2019-10-15 01:02:48,014 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_interface_to_usbdev [2019-10-15 01:02:48,014 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata [2019-10-15 01:02:48,014 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata [2019-10-15 01:02:48,015 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-10-15 01:02:48,015 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-10-15 01:02:48,015 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2019-10-15 01:02:48,015 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2019-10-15 01:02:48,015 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2019-10-15 01:02:48,016 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 01:02:48,016 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-15 01:02:48,016 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:02:48,016 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-10-15 01:02:48,016 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-15 01:02:48,016 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:02:48,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 01:02:48,017 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-10-15 01:02:48,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-10-15 01:02:48,017 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2019-10-15 01:02:48,017 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2019-10-15 01:02:48,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-10-15 01:02:48,018 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2019-10-15 01:02:48,018 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ptr [2019-10-15 01:02:48,018 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2019-10-15 01:02:48,018 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2019-10-15 01:02:48,018 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_driver_1 [2019-10-15 01:02:48,019 INFO L130 BoogieDeclarations]: Found specification of procedure input_allocate_device [2019-10-15 01:02:48,019 INFO L130 BoogieDeclarations]: Found specification of procedure input_free_device [2019-10-15 01:02:48,019 INFO L130 BoogieDeclarations]: Found specification of procedure input_get_drvdata [2019-10-15 01:02:48,019 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_drvdata [2019-10-15 01:02:48,019 INFO L130 BoogieDeclarations]: Found specification of procedure input_register_device [2019-10-15 01:02:48,019 INFO L130 BoogieDeclarations]: Found specification of procedure input_unregister_device [2019-10-15 01:02:48,020 INFO L130 BoogieDeclarations]: Found specification of procedure input_event [2019-10-15 01:02:48,020 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_key [2019-10-15 01:02:48,020 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_abs [2019-10-15 01:02:48,020 INFO L130 BoogieDeclarations]: Found specification of procedure input_sync [2019-10-15 01:02:48,020 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2019-10-15 01:02:48,020 INFO L130 BoogieDeclarations]: Found specification of procedure usb_to_input_id [2019-10-15 01:02:48,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:02:48,021 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_irq [2019-10-15 01:02:48,021 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_open [2019-10-15 01:02:48,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 01:02:48,021 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_close [2019-10-15 01:02:48,021 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_probe [2019-10-15 01:02:48,022 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2019-10-15 01:02:48,022 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_init [2019-10-15 01:02:48,022 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_exit [2019-10-15 01:02:48,022 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-10-15 01:02:48,022 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-10-15 01:02:48,022 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:02:48,023 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-10-15 01:02:48,023 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_put_intf [2019-10-15 01:02:48,023 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_fill_bulk_urb [2019-10-15 01:02:48,023 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-10-15 01:02:48,023 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_get_dev [2019-10-15 01:02:48,023 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_put_dev [2019-10-15 01:02:48,024 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_get_interface [2019-10-15 01:02:48,024 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_put_interface [2019-10-15 01:02:48,024 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_serial_register [2019-10-15 01:02:48,024 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_serial_deregister [2019-10-15 01:02:48,024 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-10-15 01:02:48,024 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 01:02:48,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:02:48,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:02:48,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-15 01:02:48,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-15 01:02:48,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:02:48,573 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2019-10-15 01:02:49,775 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:02:49,775 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 01:02:49,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:02:49 BoogieIcfgContainer [2019-10-15 01:02:49,777 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:02:49,778 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:02:49,778 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:02:49,782 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:02:49,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:02:45" (1/3) ... [2019-10-15 01:02:49,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4335e82e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:02:49, skipping insertion in model container [2019-10-15 01:02:49,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:02:47" (2/3) ... [2019-10-15 01:02:49,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4335e82e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:02:49, skipping insertion in model container [2019-10-15 01:02:49,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:02:49" (3/3) ... [2019-10-15 01:02:49,785 INFO L109 eAbstractionObserver]: Analyzing ICFG linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-10-15 01:02:49,796 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:02:49,808 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:02:49,820 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:02:49,859 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:02:49,859 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:02:49,859 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:02:49,859 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:02:49,859 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:02:49,859 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:02:49,860 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:02:49,860 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:02:49,889 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states. [2019-10-15 01:02:49,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-15 01:02:49,898 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:02:49,899 INFO L380 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] [2019-10-15 01:02:49,902 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:02:49,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:02:49,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1810453021, now seen corresponding path program 1 times [2019-10-15 01:02:49,917 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:02:49,917 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450453515] [2019-10-15 01:02:49,917 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:02:49,917 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:02:49,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:02:50,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:02:50,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:02:50,489 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450453515] [2019-10-15 01:02:50,490 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:02:50,490 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:02:50,493 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853499020] [2019-10-15 01:02:50,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:02:50,502 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:02:50,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:02:50,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:02:50,523 INFO L87 Difference]: Start difference. First operand 504 states. Second operand 3 states. [2019-10-15 01:02:50,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:02:50,762 INFO L93 Difference]: Finished difference Result 1069 states and 1276 transitions. [2019-10-15 01:02:50,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:02:50,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-15 01:02:50,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:02:50,797 INFO L225 Difference]: With dead ends: 1069 [2019-10-15 01:02:50,797 INFO L226 Difference]: Without dead ends: 678 [2019-10-15 01:02:50,804 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:02:50,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2019-10-15 01:02:50,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 678. [2019-10-15 01:02:50,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 678 states. [2019-10-15 01:02:50,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 797 transitions. [2019-10-15 01:02:50,920 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 797 transitions. Word has length 43 [2019-10-15 01:02:50,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:02:50,921 INFO L462 AbstractCegarLoop]: Abstraction has 678 states and 797 transitions. [2019-10-15 01:02:50,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:02:50,921 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 797 transitions. [2019-10-15 01:02:50,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-15 01:02:50,926 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:02:50,927 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:02:50,927 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:02:50,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:02:50,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1648833292, now seen corresponding path program 1 times [2019-10-15 01:02:50,928 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:02:50,928 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333285064] [2019-10-15 01:02:50,928 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:02:50,929 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:02:50,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:02:50,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:02:51,133 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:02:51,133 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333285064] [2019-10-15 01:02:51,134 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:02:51,134 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:02:51,134 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372680080] [2019-10-15 01:02:51,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:02:51,138 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:02:51,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:02:51,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:02:51,139 INFO L87 Difference]: Start difference. First operand 678 states and 797 transitions. Second operand 6 states. [2019-10-15 01:02:51,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:02:51,268 INFO L93 Difference]: Finished difference Result 1352 states and 1593 transitions. [2019-10-15 01:02:51,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:02:51,269 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-10-15 01:02:51,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:02:51,275 INFO L225 Difference]: With dead ends: 1352 [2019-10-15 01:02:51,275 INFO L226 Difference]: Without dead ends: 694 [2019-10-15 01:02:51,278 INFO L600 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-10-15 01:02:51,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2019-10-15 01:02:51,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 683. [2019-10-15 01:02:51,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 683 states. [2019-10-15 01:02:51,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 801 transitions. [2019-10-15 01:02:51,345 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 801 transitions. Word has length 70 [2019-10-15 01:02:51,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:02:51,347 INFO L462 AbstractCegarLoop]: Abstraction has 683 states and 801 transitions. [2019-10-15 01:02:51,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:02:51,348 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 801 transitions. [2019-10-15 01:02:51,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-15 01:02:51,358 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:02:51,358 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:02:51,359 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:02:51,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:02:51,359 INFO L82 PathProgramCache]: Analyzing trace with hash -890510412, now seen corresponding path program 1 times [2019-10-15 01:02:51,359 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:02:51,360 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497653977] [2019-10-15 01:02:51,360 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:02:51,360 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:02:51,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:02:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:02:51,549 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:02:51,550 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497653977] [2019-10-15 01:02:51,550 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:02:51,550 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:02:51,550 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705884406] [2019-10-15 01:02:51,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:02:51,551 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:02:51,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:02:51,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:02:51,552 INFO L87 Difference]: Start difference. First operand 683 states and 801 transitions. Second operand 3 states. [2019-10-15 01:02:51,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:02:51,621 INFO L93 Difference]: Finished difference Result 2002 states and 2372 transitions. [2019-10-15 01:02:51,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:02:51,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-10-15 01:02:51,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:02:51,632 INFO L225 Difference]: With dead ends: 2002 [2019-10-15 01:02:51,632 INFO L226 Difference]: Without dead ends: 1339 [2019-10-15 01:02:51,635 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:02:51,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2019-10-15 01:02:51,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1337. [2019-10-15 01:02:51,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-10-15 01:02:51,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1573 transitions. [2019-10-15 01:02:51,705 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1573 transitions. Word has length 70 [2019-10-15 01:02:51,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:02:51,706 INFO L462 AbstractCegarLoop]: Abstraction has 1337 states and 1573 transitions. [2019-10-15 01:02:51,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:02:51,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1573 transitions. [2019-10-15 01:02:51,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-15 01:02:51,707 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:02:51,708 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:02:51,708 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:02:51,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:02:51,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1836161467, now seen corresponding path program 1 times [2019-10-15 01:02:51,709 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:02:51,709 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984432472] [2019-10-15 01:02:51,709 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:02:51,709 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:02:51,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:02:51,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:02:51,815 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:02:51,816 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984432472] [2019-10-15 01:02:51,816 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:02:51,816 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:02:51,816 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730827720] [2019-10-15 01:02:51,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:02:51,817 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:02:51,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:02:51,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:02:51,818 INFO L87 Difference]: Start difference. First operand 1337 states and 1573 transitions. Second operand 3 states. [2019-10-15 01:02:51,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:02:51,857 INFO L93 Difference]: Finished difference Result 1339 states and 1574 transitions. [2019-10-15 01:02:51,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:02:51,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-10-15 01:02:51,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:02:51,865 INFO L225 Difference]: With dead ends: 1339 [2019-10-15 01:02:51,866 INFO L226 Difference]: Without dead ends: 1336 [2019-10-15 01:02:51,867 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:02:51,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2019-10-15 01:02:51,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1336. [2019-10-15 01:02:51,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1336 states. [2019-10-15 01:02:51,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 1571 transitions. [2019-10-15 01:02:51,933 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 1571 transitions. Word has length 71 [2019-10-15 01:02:51,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:02:51,934 INFO L462 AbstractCegarLoop]: Abstraction has 1336 states and 1571 transitions. [2019-10-15 01:02:51,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:02:51,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 1571 transitions. [2019-10-15 01:02:51,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-15 01:02:51,935 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:02:51,936 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:02:51,936 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:02:51,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:02:51,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1086568233, now seen corresponding path program 1 times [2019-10-15 01:02:51,937 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:02:51,937 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761218316] [2019-10-15 01:02:51,937 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:02:51,937 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:02:51,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:02:52,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:02:52,111 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:02:52,111 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761218316] [2019-10-15 01:02:52,112 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:02:52,112 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:02:52,112 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766651219] [2019-10-15 01:02:52,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:02:52,113 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:02:52,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:02:52,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:02:52,114 INFO L87 Difference]: Start difference. First operand 1336 states and 1571 transitions. Second operand 3 states. [2019-10-15 01:02:52,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:02:52,165 INFO L93 Difference]: Finished difference Result 1338 states and 1572 transitions. [2019-10-15 01:02:52,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:02:52,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-10-15 01:02:52,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:02:52,174 INFO L225 Difference]: With dead ends: 1338 [2019-10-15 01:02:52,174 INFO L226 Difference]: Without dead ends: 1335 [2019-10-15 01:02:52,176 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:02:52,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2019-10-15 01:02:52,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1335. [2019-10-15 01:02:52,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1335 states. [2019-10-15 01:02:52,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1335 states to 1335 states and 1569 transitions. [2019-10-15 01:02:52,258 INFO L78 Accepts]: Start accepts. Automaton has 1335 states and 1569 transitions. Word has length 72 [2019-10-15 01:02:52,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:02:52,260 INFO L462 AbstractCegarLoop]: Abstraction has 1335 states and 1569 transitions. [2019-10-15 01:02:52,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:02:52,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 1569 transitions. [2019-10-15 01:02:52,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-15 01:02:52,263 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:02:52,263 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:02:52,263 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:02:52,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:02:52,264 INFO L82 PathProgramCache]: Analyzing trace with hash 675990408, now seen corresponding path program 1 times [2019-10-15 01:02:52,264 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:02:52,265 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985187815] [2019-10-15 01:02:52,265 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:02:52,265 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:02:52,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:02:52,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:02:52,428 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:02:52,430 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985187815] [2019-10-15 01:02:52,431 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:02:52,431 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:02:52,432 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025170408] [2019-10-15 01:02:52,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:02:52,433 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:02:52,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:02:52,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:02:52,433 INFO L87 Difference]: Start difference. First operand 1335 states and 1569 transitions. Second operand 3 states. [2019-10-15 01:02:52,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:02:52,479 INFO L93 Difference]: Finished difference Result 1337 states and 1570 transitions. [2019-10-15 01:02:52,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:02:52,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-10-15 01:02:52,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:02:52,495 INFO L225 Difference]: With dead ends: 1337 [2019-10-15 01:02:52,495 INFO L226 Difference]: Without dead ends: 1316 [2019-10-15 01:02:52,498 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:02:52,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2019-10-15 01:02:52,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 1316. [2019-10-15 01:02:52,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1316 states. [2019-10-15 01:02:52,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1547 transitions. [2019-10-15 01:02:52,583 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1547 transitions. Word has length 73 [2019-10-15 01:02:52,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:02:52,584 INFO L462 AbstractCegarLoop]: Abstraction has 1316 states and 1547 transitions. [2019-10-15 01:02:52,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:02:52,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1547 transitions. [2019-10-15 01:02:52,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-10-15 01:02:52,592 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:02:52,593 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:02:52,593 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:02:52,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:02:52,593 INFO L82 PathProgramCache]: Analyzing trace with hash 870207449, now seen corresponding path program 1 times [2019-10-15 01:02:52,594 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:02:52,594 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539971735] [2019-10-15 01:02:52,594 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:02:52,594 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:02:52,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:02:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:02:52,789 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-15 01:02:52,789 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539971735] [2019-10-15 01:02:52,789 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:02:52,790 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:02:52,790 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77980286] [2019-10-15 01:02:52,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:02:52,791 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:02:52,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:02:52,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:02:52,791 INFO L87 Difference]: Start difference. First operand 1316 states and 1547 transitions. Second operand 3 states. [2019-10-15 01:02:52,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:02:52,884 INFO L93 Difference]: Finished difference Result 2699 states and 3195 transitions. [2019-10-15 01:02:52,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:02:52,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-10-15 01:02:52,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:02:52,892 INFO L225 Difference]: With dead ends: 2699 [2019-10-15 01:02:52,892 INFO L226 Difference]: Without dead ends: 1403 [2019-10-15 01:02:52,896 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:02:52,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2019-10-15 01:02:52,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 1366. [2019-10-15 01:02:52,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1366 states. [2019-10-15 01:02:52,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 1618 transitions. [2019-10-15 01:02:52,970 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 1618 transitions. Word has length 229 [2019-10-15 01:02:52,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:02:52,971 INFO L462 AbstractCegarLoop]: Abstraction has 1366 states and 1618 transitions. [2019-10-15 01:02:52,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:02:52,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1618 transitions. [2019-10-15 01:02:52,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-10-15 01:02:52,978 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:02:52,979 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:02:52,979 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:02:52,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:02:52,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1880002846, now seen corresponding path program 1 times [2019-10-15 01:02:52,980 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:02:52,980 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996608672] [2019-10-15 01:02:52,980 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:02:52,980 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:02:52,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:02:53,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:02:53,212 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-15 01:02:53,212 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996608672] [2019-10-15 01:02:53,212 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:02:53,213 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:02:53,213 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737526024] [2019-10-15 01:02:53,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:02:53,214 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:02:53,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:02:53,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:02:53,214 INFO L87 Difference]: Start difference. First operand 1366 states and 1618 transitions. Second operand 6 states. [2019-10-15 01:02:53,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:02:53,329 INFO L93 Difference]: Finished difference Result 2740 states and 3254 transitions. [2019-10-15 01:02:53,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:02:53,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 248 [2019-10-15 01:02:53,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:02:53,341 INFO L225 Difference]: With dead ends: 2740 [2019-10-15 01:02:53,342 INFO L226 Difference]: Without dead ends: 1394 [2019-10-15 01:02:53,347 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:02:53,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2019-10-15 01:02:53,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1390. [2019-10-15 01:02:53,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1390 states. [2019-10-15 01:02:53,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 1642 transitions. [2019-10-15 01:02:53,429 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 1642 transitions. Word has length 248 [2019-10-15 01:02:53,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:02:53,430 INFO L462 AbstractCegarLoop]: Abstraction has 1390 states and 1642 transitions. [2019-10-15 01:02:53,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:02:53,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1642 transitions. [2019-10-15 01:02:53,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-10-15 01:02:53,436 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:02:53,437 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:02:53,437 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:02:53,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:02:53,438 INFO L82 PathProgramCache]: Analyzing trace with hash -569313577, now seen corresponding path program 1 times [2019-10-15 01:02:53,438 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:02:53,438 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486344706] [2019-10-15 01:02:53,438 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:02:53,438 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:02:53,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:02:53,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:02:53,671 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-15 01:02:53,672 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486344706] [2019-10-15 01:02:53,672 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:02:53,672 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:02:53,673 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787359951] [2019-10-15 01:02:53,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:02:53,674 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:02:53,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:02:53,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:02:53,675 INFO L87 Difference]: Start difference. First operand 1390 states and 1642 transitions. Second operand 6 states. [2019-10-15 01:02:54,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:02:54,022 INFO L93 Difference]: Finished difference Result 4218 states and 5002 transitions. [2019-10-15 01:02:54,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 01:02:54,023 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 254 [2019-10-15 01:02:54,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:02:54,041 INFO L225 Difference]: With dead ends: 4218 [2019-10-15 01:02:54,042 INFO L226 Difference]: Without dead ends: 2848 [2019-10-15 01:02:54,048 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:02:54,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2848 states. [2019-10-15 01:02:54,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2848 to 1430. [2019-10-15 01:02:54,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1430 states. [2019-10-15 01:02:54,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 1696 transitions. [2019-10-15 01:02:54,165 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 1696 transitions. Word has length 254 [2019-10-15 01:02:54,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:02:54,165 INFO L462 AbstractCegarLoop]: Abstraction has 1430 states and 1696 transitions. [2019-10-15 01:02:54,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:02:54,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 1696 transitions. [2019-10-15 01:02:54,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-10-15 01:02:54,171 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:02:54,172 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:02:54,172 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:02:54,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:02:54,173 INFO L82 PathProgramCache]: Analyzing trace with hash -703327083, now seen corresponding path program 1 times [2019-10-15 01:02:54,173 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:02:54,173 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36146096] [2019-10-15 01:02:54,173 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:02:54,173 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:02:54,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:02:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:02:54,564 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-15 01:02:54,564 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36146096] [2019-10-15 01:02:54,565 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974483434] [2019-10-15 01:02:54,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:02:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:02:55,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 1854 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-15 01:02:55,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:02:55,421 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-15 01:02:55,421 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:02:56,153 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-15 01:02:56,154 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:02:56,154 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [11] total 18 [2019-10-15 01:02:56,155 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638458386] [2019-10-15 01:02:56,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:02:56,157 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:02:56,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:02:56,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:02:56,157 INFO L87 Difference]: Start difference. First operand 1430 states and 1696 transitions. Second operand 9 states. [2019-10-15 01:02:56,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:02:56,355 INFO L93 Difference]: Finished difference Result 2160 states and 2562 transitions. [2019-10-15 01:02:56,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:02:56,356 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 254 [2019-10-15 01:02:56,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:02:56,366 INFO L225 Difference]: With dead ends: 2160 [2019-10-15 01:02:56,367 INFO L226 Difference]: Without dead ends: 1444 [2019-10-15 01:02:56,369 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 501 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2019-10-15 01:02:56,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2019-10-15 01:02:56,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1440. [2019-10-15 01:02:56,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1440 states. [2019-10-15 01:02:56,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 1704 transitions. [2019-10-15 01:02:56,475 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 1704 transitions. Word has length 254 [2019-10-15 01:02:56,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:02:56,477 INFO L462 AbstractCegarLoop]: Abstraction has 1440 states and 1704 transitions. [2019-10-15 01:02:56,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:02:56,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 1704 transitions. [2019-10-15 01:02:56,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-10-15 01:02:56,486 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:02:56,486 INFO L380 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:02:56,701 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:02:56,702 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:02:56,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:02:56,703 INFO L82 PathProgramCache]: Analyzing trace with hash 439873160, now seen corresponding path program 1 times [2019-10-15 01:02:56,703 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:02:56,703 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106018132] [2019-10-15 01:02:56,703 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:02:56,704 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:02:56,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:02:56,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:02:57,169 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-15 01:02:57,170 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106018132] [2019-10-15 01:02:57,170 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963019972] [2019-10-15 01:02:57,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:02:57,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:02:57,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 2199 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:02:57,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:02:57,785 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 01:02:57,785 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:02:58,221 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-15 01:02:58,222 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:02:58,223 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [11] total 13 [2019-10-15 01:02:58,223 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116272378] [2019-10-15 01:02:58,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:02:58,226 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:02:58,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:02:58,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:02:58,227 INFO L87 Difference]: Start difference. First operand 1440 states and 1704 transitions. Second operand 4 states. [2019-10-15 01:02:58,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:02:58,737 INFO L93 Difference]: Finished difference Result 4272 states and 5063 transitions. [2019-10-15 01:02:58,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:02:58,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 310 [2019-10-15 01:02:58,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:02:58,765 INFO L225 Difference]: With dead ends: 4272 [2019-10-15 01:02:58,766 INFO L226 Difference]: Without dead ends: 4254 [2019-10-15 01:02:58,769 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 631 GetRequests, 617 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:02:58,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4254 states. [2019-10-15 01:02:59,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4254 to 4240. [2019-10-15 01:02:59,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4240 states. [2019-10-15 01:02:59,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4240 states to 4240 states and 5032 transitions. [2019-10-15 01:02:59,024 INFO L78 Accepts]: Start accepts. Automaton has 4240 states and 5032 transitions. Word has length 310 [2019-10-15 01:02:59,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:02:59,025 INFO L462 AbstractCegarLoop]: Abstraction has 4240 states and 5032 transitions. [2019-10-15 01:02:59,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:02:59,026 INFO L276 IsEmpty]: Start isEmpty. Operand 4240 states and 5032 transitions. [2019-10-15 01:02:59,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-10-15 01:02:59,036 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:02:59,036 INFO L380 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:02:59,244 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:02:59,244 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:02:59,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:02:59,245 INFO L82 PathProgramCache]: Analyzing trace with hash 305859654, now seen corresponding path program 1 times [2019-10-15 01:02:59,245 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:02:59,246 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178261603] [2019-10-15 01:02:59,246 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:02:59,246 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:02:59,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:02:59,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:02:59,547 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-15 01:02:59,547 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178261603] [2019-10-15 01:02:59,547 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:02:59,548 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:02:59,548 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628076425] [2019-10-15 01:02:59,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:02:59,549 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:02:59,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:02:59,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:02:59,549 INFO L87 Difference]: Start difference. First operand 4240 states and 5032 transitions. Second operand 5 states. [2019-10-15 01:02:59,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:02:59,904 INFO L93 Difference]: Finished difference Result 12740 states and 15128 transitions. [2019-10-15 01:02:59,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:02:59,904 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 310 [2019-10-15 01:02:59,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:02:59,950 INFO L225 Difference]: With dead ends: 12740 [2019-10-15 01:02:59,950 INFO L226 Difference]: Without dead ends: 8520 [2019-10-15 01:02:59,964 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:02:59,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8520 states. [2019-10-15 01:03:00,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8520 to 4280. [2019-10-15 01:03:00,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4280 states. [2019-10-15 01:03:00,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4280 states to 4280 states and 5078 transitions. [2019-10-15 01:03:00,296 INFO L78 Accepts]: Start accepts. Automaton has 4280 states and 5078 transitions. Word has length 310 [2019-10-15 01:03:00,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:03:00,298 INFO L462 AbstractCegarLoop]: Abstraction has 4280 states and 5078 transitions. [2019-10-15 01:03:00,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:03:00,299 INFO L276 IsEmpty]: Start isEmpty. Operand 4280 states and 5078 transitions. [2019-10-15 01:03:00,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-10-15 01:03:00,311 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:03:00,311 INFO L380 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:03:00,312 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:03:00,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:03:00,312 INFO L82 PathProgramCache]: Analyzing trace with hash -952552992, now seen corresponding path program 1 times [2019-10-15 01:03:00,312 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:03:00,312 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490191014] [2019-10-15 01:03:00,313 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:03:00,313 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:03:00,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:03:00,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:03:00,745 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-15 01:03:00,745 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490191014] [2019-10-15 01:03:00,745 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726290422] [2019-10-15 01:03:00,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:03:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:03:01,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 2205 conjuncts, 106 conjunts are in the unsatisfiable core [2019-10-15 01:03:01,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:03:01,341 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2019-10-15 01:03:01,341 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 01:03:01,347 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:03:01,348 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-15 01:03:01,348 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:7, output treesize:6 [2019-10-15 01:03:03,492 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~ldvarg0~0.base_BEFORE_CALL_1 Int)) (and (not (= 0 v_main_~ldvarg0~0.base_BEFORE_CALL_1)) (= (select |c_#memory_int| v_main_~ldvarg0~0.base_BEFORE_CALL_1) ((as const (Array Int Int)) 0)))) is different from true [2019-10-15 01:03:04,159 WARN L860 $PredicateComparison]: unable to prove that (exists ((|#Ultimate.meminit_#ptr.base| Int)) (= (store |c_old(#memory_int)| |#Ultimate.meminit_#ptr.base| ((as const (Array Int Int)) 0)) |c_#memory_int|)) is different from true [2019-10-15 01:03:04,191 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:03:04,191 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 31 [2019-10-15 01:03:04,192 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 01:03:04,215 INFO L567 ElimStorePlain]: treesize reduction 15, result has 53.1 percent of original size [2019-10-15 01:03:04,216 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-15 01:03:04,216 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:17 [2019-10-15 01:03:04,689 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2019-10-15 01:03:04,690 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 01:03:04,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:03:04,691 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-15 01:03:04,691 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:1 [2019-10-15 01:03:04,704 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-15 01:03:04,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:03:04,715 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-15 01:03:04,715 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:34 [2019-10-15 01:03:05,901 WARN L191 SmtUtils]: Spent 610.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-10-15 01:03:05,913 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-15 01:03:05,929 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:03:05,931 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-15 01:03:05,942 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:03:05,943 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-15 01:03:05,943 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:41 [2019-10-15 01:03:12,529 WARN L191 SmtUtils]: Spent 1.72 s on a formula simplification that was a NOOP. DAG size: 31 [2019-10-15 01:03:12,586 INFO L341 Elim1Store]: treesize reduction 199, result has 12.3 percent of original size [2019-10-15 01:03:12,587 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 28 [2019-10-15 01:03:12,587 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 01:03:12,594 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:03:12,595 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-15 01:03:12,595 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:34, output treesize:1 [2019-10-15 01:03:12,644 INFO L341 Elim1Store]: treesize reduction 199, result has 12.3 percent of original size [2019-10-15 01:03:12,644 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 28 [2019-10-15 01:03:12,644 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 01:03:12,650 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:03:12,651 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-15 01:03:12,651 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:34, output treesize:1 [2019-10-15 01:03:12,663 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-15 01:03:12,684 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:03:12,687 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-15 01:03:12,701 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:03:12,702 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-10-15 01:03:12,702 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:75, output treesize:79 [2019-10-15 01:03:23,620 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 40