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-f4eb214f-m [2019-10-13 21:03:43,118 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:03:43,121 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:03:43,133 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:03:43,133 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:03:43,135 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:03:43,136 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:03:43,138 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:03:43,139 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:03:43,140 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:03:43,141 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:03:43,142 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:03:43,142 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:03:43,143 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:03:43,144 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:03:43,145 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:03:43,146 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:03:43,147 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:03:43,149 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:03:43,151 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:03:43,153 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:03:43,154 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:03:43,157 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:03:43,158 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:03:43,162 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:03:43,162 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:03:43,163 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:03:43,164 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:03:43,164 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:03:43,167 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:03:43,167 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:03:43,168 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:03:43,169 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:03:43,169 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:03:43,172 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:03:43,172 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:03:43,173 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:03:43,173 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:03:43,174 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:03:43,175 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:03:43,178 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:03:43,179 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-13 21:03:43,199 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:03:43,199 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:03:43,201 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:03:43,201 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:03:43,202 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:03:43,202 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:03:43,202 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:03:43,202 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:03:43,202 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:03:43,203 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:03:43,204 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:03:43,204 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:03:43,204 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:03:43,204 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:03:43,205 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:03:43,205 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:03:43,205 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:03:43,205 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:03:43,205 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:03:43,206 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:03:43,206 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:03:43,206 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:03:43,207 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:03:43,207 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:03:43,207 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:03:43,207 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:03:43,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:03:43,208 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:03:43,208 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-13 21:03:43,513 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:03:43,526 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:03:43,530 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:03:43,531 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:03:43,532 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:03:43,532 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-13 21:03:43,608 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a7393718/ec7dd25cc621485b9970534c742f2b1b/FLAG57d1873c6 [2019-10-13 21:03:44,291 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:03:44,292 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-13 21:03:44,317 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a7393718/ec7dd25cc621485b9970534c742f2b1b/FLAG57d1873c6 [2019-10-13 21:03:44,398 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a7393718/ec7dd25cc621485b9970534c742f2b1b [2019-10-13 21:03:44,409 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:03:44,411 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:03:44,412 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:03:44,412 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:03:44,416 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:03:44,417 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:03:44" (1/1) ... [2019-10-13 21:03:44,420 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1273f33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:03:44, skipping insertion in model container [2019-10-13 21:03:44,420 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:03:44" (1/1) ... [2019-10-13 21:03:44,428 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:03:44,528 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:03:45,736 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:03:45,789 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:03:46,086 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:03:46,186 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:03:46,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:03:46 WrapperNode [2019-10-13 21:03:46,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:03:46,189 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:03:46,190 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:03:46,190 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:03:46,205 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:03:46" (1/1) ... [2019-10-13 21:03:46,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:03:46" (1/1) ... [2019-10-13 21:03:46,267 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:03:46" (1/1) ... [2019-10-13 21:03:46,268 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:03:46" (1/1) ... [2019-10-13 21:03:46,356 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:03:46" (1/1) ... [2019-10-13 21:03:46,375 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:03:46" (1/1) ... [2019-10-13 21:03:46,396 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:03:46" (1/1) ... [2019-10-13 21:03:46,419 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:03:46,420 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:03:46,420 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:03:46,420 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:03:46,421 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:03:46" (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-13 21:03:46,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:03:46,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:03:46,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-10-13 21:03:46,500 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_in [2019-10-13 21:03:46,500 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_int [2019-10-13 21:03:46,501 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_is_int_in [2019-10-13 21:03:46,501 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_make_path [2019-10-13 21:03:46,501 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register [2019-10-13 21:03:46,502 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2019-10-13 21:03:46,502 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_maxpacket [2019-10-13 21:03:46,502 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2019-10-13 21:03:46,503 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2019-10-13 21:03:46,503 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2019-10-13 21:03:46,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-10-13 21:03:46,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-10-13 21:03:46,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2019-10-13 21:03:46,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2019-10-13 21:03:46,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2019-10-13 21:03:46,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ptr [2019-10-13 21:03:46,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2019-10-13 21:03:46,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2019-10-13 21:03:46,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-10-13 21:03:46,508 INFO L138 BoogieDeclarations]: Found implementation of procedure input_allocate_device [2019-10-13 21:03:46,508 INFO L138 BoogieDeclarations]: Found implementation of procedure input_get_drvdata [2019-10-13 21:03:46,508 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_drvdata [2019-10-13 21:03:46,508 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_key [2019-10-13 21:03:46,509 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_abs [2019-10-13 21:03:46,509 INFO L138 BoogieDeclarations]: Found implementation of procedure input_sync [2019-10-13 21:03:46,509 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_to_input_id [2019-10-13 21:03:46,509 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_irq [2019-10-13 21:03:46,509 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_open [2019-10-13 21:03:46,510 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_close [2019-10-13 21:03:46,510 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_probe [2019-10-13 21:03:46,511 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2019-10-13 21:03:46,511 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_init [2019-10-13 21:03:46,512 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_exit [2019-10-13 21:03:46,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_driver_1 [2019-10-13 21:03:46,512 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:03:46,512 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2019-10-13 21:03:46,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_register_driver_2 [2019-10-13 21:03:46,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_3 [2019-10-13 21:03:46,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_4 [2019-10-13 21:03:46,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_alloc_urb_5 [2019-10-13 21:03:46,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_int_urb_6 [2019-10-13 21:03:46,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2019-10-13 21:03:46,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata_8 [2019-10-13 21:03:46,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_free_urb_10 [2019-10-13 21:03:46,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_deregister_11 [2019-10-13 21:03:46,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-10-13 21:03:46,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata [2019-10-13 21:03:46,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata [2019-10-13 21:03:46,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_put_intf [2019-10-13 21:03:46,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2019-10-13 21:03:46,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2019-10-13 21:03:46,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_fill_int_urb [2019-10-13 21:03:46,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_fill_bulk_urb [2019-10-13 21:03:46,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2019-10-13 21:03:46,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_interface_to_usbdev [2019-10-13 21:03:46,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_get_dev [2019-10-13 21:03:46,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_put_dev [2019-10-13 21:03:46,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_get_interface [2019-10-13 21:03:46,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_put_interface [2019-10-13 21:03:46,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_serial_register [2019-10-13 21:03:46,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_serial_deregister [2019-10-13 21:03:46,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-10-13 21:03:46,517 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2019-10-13 21:03:46,517 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2019-10-13 21:03:46,518 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event [2019-10-13 21:03:46,518 INFO L138 BoogieDeclarations]: Found implementation of procedure input_free_device [2019-10-13 21:03:46,518 INFO L138 BoogieDeclarations]: Found implementation of procedure input_register_device [2019-10-13 21:03:46,518 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2019-10-13 21:03:46,518 INFO L138 BoogieDeclarations]: Found implementation of procedure input_unregister_device [2019-10-13 21:03:46,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-10-13 21:03:46,519 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-10-13 21:03:46,519 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2019-10-13 21:03:46,520 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcpy [2019-10-13 21:03:46,520 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2019-10-13 21:03:46,520 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2019-10-13 21:03:46,520 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_deregister [2019-10-13 21:03:46,521 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2019-10-13 21:03:46,521 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2019-10-13 21:03:46,521 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2019-10-13 21:03:46,521 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register_driver [2019-10-13 21:03:46,522 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2019-10-13 21:03:46,522 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-10-13 21:03:46,522 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-10-13 21:03:46,523 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-10-13 21:03:46,523 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-10-13 21:03:46,524 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:03:46,524 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-10-13 21:03:46,524 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_in [2019-10-13 21:03:46,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:03:46,524 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_int [2019-10-13 21:03:46,524 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_is_int_in [2019-10-13 21:03:46,525 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2019-10-13 21:03:46,525 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2019-10-13 21:03:46,525 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-10-13 21:03:46,525 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-10-13 21:03:46,525 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2019-10-13 21:03:46,525 INFO L130 BoogieDeclarations]: Found specification of procedure strlcpy [2019-10-13 21:03:46,526 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2019-10-13 21:03:46,526 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2019-10-13 21:03:46,526 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2019-10-13 21:03:46,526 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata_8 [2019-10-13 21:03:46,526 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2019-10-13 21:03:46,526 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2019-10-13 21:03:46,527 INFO L130 BoogieDeclarations]: Found specification of procedure usb_make_path [2019-10-13 21:03:46,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:03:46,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 21:03:46,527 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register_driver [2019-10-13 21:03:46,527 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_register_driver_2 [2019-10-13 21:03:46,527 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register [2019-10-13 21:03:46,528 INFO L130 BoogieDeclarations]: Found specification of procedure usb_deregister [2019-10-13 21:03:46,528 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_deregister_11 [2019-10-13 21:03:46,528 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_int_urb_6 [2019-10-13 21:03:46,528 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2019-10-13 21:03:46,528 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_alloc_urb_5 [2019-10-13 21:03:46,529 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2019-10-13 21:03:46,529 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_free_urb_10 [2019-10-13 21:03:46,529 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_3 [2019-10-13 21:03:46,530 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_4 [2019-10-13 21:03:46,530 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2019-10-13 21:03:46,530 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2019-10-13 21:03:46,530 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2019-10-13 21:03:46,531 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2019-10-13 21:03:46,531 INFO L130 BoogieDeclarations]: Found specification of procedure usb_maxpacket [2019-10-13 21:03:46,532 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2019-10-13 21:03:46,532 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2019-10-13 21:03:46,532 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_fill_int_urb [2019-10-13 21:03:46,532 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2019-10-13 21:03:46,532 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_interface_to_usbdev [2019-10-13 21:03:46,533 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata [2019-10-13 21:03:46,533 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata [2019-10-13 21:03:46,533 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-10-13 21:03:46,533 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-10-13 21:03:46,534 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2019-10-13 21:03:46,534 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2019-10-13 21:03:46,537 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2019-10-13 21:03:46,537 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 21:03:46,538 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-13 21:03:46,538 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:03:46,538 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-10-13 21:03:46,539 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-13 21:03:46,539 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:03:46,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 21:03:46,546 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-10-13 21:03:46,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-10-13 21:03:46,547 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2019-10-13 21:03:46,547 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2019-10-13 21:03:46,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-10-13 21:03:46,548 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2019-10-13 21:03:46,548 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ptr [2019-10-13 21:03:46,548 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2019-10-13 21:03:46,548 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2019-10-13 21:03:46,548 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_driver_1 [2019-10-13 21:03:46,548 INFO L130 BoogieDeclarations]: Found specification of procedure input_allocate_device [2019-10-13 21:03:46,549 INFO L130 BoogieDeclarations]: Found specification of procedure input_free_device [2019-10-13 21:03:46,549 INFO L130 BoogieDeclarations]: Found specification of procedure input_get_drvdata [2019-10-13 21:03:46,549 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_drvdata [2019-10-13 21:03:46,549 INFO L130 BoogieDeclarations]: Found specification of procedure input_register_device [2019-10-13 21:03:46,549 INFO L130 BoogieDeclarations]: Found specification of procedure input_unregister_device [2019-10-13 21:03:46,549 INFO L130 BoogieDeclarations]: Found specification of procedure input_event [2019-10-13 21:03:46,549 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_key [2019-10-13 21:03:46,550 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_abs [2019-10-13 21:03:46,550 INFO L130 BoogieDeclarations]: Found specification of procedure input_sync [2019-10-13 21:03:46,550 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2019-10-13 21:03:46,550 INFO L130 BoogieDeclarations]: Found specification of procedure usb_to_input_id [2019-10-13 21:03:46,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:03:46,550 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_irq [2019-10-13 21:03:46,550 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_open [2019-10-13 21:03:46,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 21:03:46,551 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_close [2019-10-13 21:03:46,551 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_probe [2019-10-13 21:03:46,551 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2019-10-13 21:03:46,551 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_init [2019-10-13 21:03:46,551 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_exit [2019-10-13 21:03:46,551 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-10-13 21:03:46,552 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-10-13 21:03:46,552 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:03:46,552 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-10-13 21:03:46,552 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_put_intf [2019-10-13 21:03:46,552 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_fill_bulk_urb [2019-10-13 21:03:46,552 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-10-13 21:03:46,553 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_get_dev [2019-10-13 21:03:46,553 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_put_dev [2019-10-13 21:03:46,553 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_get_interface [2019-10-13 21:03:46,553 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_put_interface [2019-10-13 21:03:46,553 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_serial_register [2019-10-13 21:03:46,553 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_serial_deregister [2019-10-13 21:03:46,554 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-10-13 21:03:46,554 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 21:03:46,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:03:46,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:03:46,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-13 21:03:46,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-13 21:03:46,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:03:47,205 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2019-10-13 21:03:48,376 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:03:48,377 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 21:03:48,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:03:48 BoogieIcfgContainer [2019-10-13 21:03:48,379 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:03:48,380 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:03:48,381 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:03:48,385 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:03:48,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:03:44" (1/3) ... [2019-10-13 21:03:48,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a53a0cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:03:48, skipping insertion in model container [2019-10-13 21:03:48,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:03:46" (2/3) ... [2019-10-13 21:03:48,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a53a0cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:03:48, skipping insertion in model container [2019-10-13 21:03:48,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:03:48" (3/3) ... [2019-10-13 21:03:48,390 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-13 21:03:48,400 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:03:48,411 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:03:48,422 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:03:48,458 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:03:48,458 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:03:48,459 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:03:48,459 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:03:48,459 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:03:48,459 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:03:48,459 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:03:48,459 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:03:48,495 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states. [2019-10-13 21:03:48,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-13 21:03:48,503 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:03:48,504 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-13 21:03:48,506 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:03:48,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:03:48,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1810453021, now seen corresponding path program 1 times [2019-10-13 21:03:48,521 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:03:48,521 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212785585] [2019-10-13 21:03:48,522 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:03:48,522 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:03:48,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:03:48,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:03:49,042 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-13 21:03:49,043 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212785585] [2019-10-13 21:03:49,044 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:03:49,045 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:03:49,045 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617865284] [2019-10-13 21:03:49,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:03:49,052 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:03:49,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:03:49,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:03:49,070 INFO L87 Difference]: Start difference. First operand 504 states. Second operand 3 states. [2019-10-13 21:03:49,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:03:49,242 INFO L93 Difference]: Finished difference Result 1069 states and 1276 transitions. [2019-10-13 21:03:49,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:03:49,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-13 21:03:49,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:03:49,288 INFO L225 Difference]: With dead ends: 1069 [2019-10-13 21:03:49,288 INFO L226 Difference]: Without dead ends: 678 [2019-10-13 21:03:49,306 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-13 21:03:49,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2019-10-13 21:03:49,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 678. [2019-10-13 21:03:49,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 678 states. [2019-10-13 21:03:49,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 797 transitions. [2019-10-13 21:03:49,483 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 797 transitions. Word has length 43 [2019-10-13 21:03:49,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:03:49,484 INFO L462 AbstractCegarLoop]: Abstraction has 678 states and 797 transitions. [2019-10-13 21:03:49,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:03:49,484 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 797 transitions. [2019-10-13 21:03:49,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-13 21:03:49,497 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:03:49,498 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-13 21:03:49,501 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:03:49,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:03:49,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1648833292, now seen corresponding path program 1 times [2019-10-13 21:03:49,502 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:03:49,502 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764473735] [2019-10-13 21:03:49,502 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:03:49,503 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:03:49,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:03:49,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:03:49,762 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-13 21:03:49,762 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764473735] [2019-10-13 21:03:49,763 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:03:49,763 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:03:49,763 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938900700] [2019-10-13 21:03:49,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:03:49,765 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:03:49,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:03:49,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:03:49,766 INFO L87 Difference]: Start difference. First operand 678 states and 797 transitions. Second operand 6 states. [2019-10-13 21:03:49,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:03:49,892 INFO L93 Difference]: Finished difference Result 1352 states and 1593 transitions. [2019-10-13 21:03:49,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:03:49,893 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-10-13 21:03:49,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:03:49,897 INFO L225 Difference]: With dead ends: 1352 [2019-10-13 21:03:49,898 INFO L226 Difference]: Without dead ends: 694 [2019-10-13 21:03:49,901 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-13 21:03:49,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2019-10-13 21:03:49,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 683. [2019-10-13 21:03:49,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 683 states. [2019-10-13 21:03:49,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 801 transitions. [2019-10-13 21:03:49,936 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 801 transitions. Word has length 70 [2019-10-13 21:03:49,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:03:49,937 INFO L462 AbstractCegarLoop]: Abstraction has 683 states and 801 transitions. [2019-10-13 21:03:49,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:03:49,937 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 801 transitions. [2019-10-13 21:03:49,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-13 21:03:49,939 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:03:49,939 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-13 21:03:49,939 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:03:49,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:03:49,940 INFO L82 PathProgramCache]: Analyzing trace with hash -890510412, now seen corresponding path program 1 times [2019-10-13 21:03:49,940 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:03:49,940 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714925119] [2019-10-13 21:03:49,941 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:03:49,941 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:03:49,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:03:50,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:03:50,108 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-13 21:03:50,109 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714925119] [2019-10-13 21:03:50,109 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:03:50,109 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:03:50,109 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005787766] [2019-10-13 21:03:50,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:03:50,110 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:03:50,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:03:50,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:03:50,111 INFO L87 Difference]: Start difference. First operand 683 states and 801 transitions. Second operand 3 states. [2019-10-13 21:03:50,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:03:50,189 INFO L93 Difference]: Finished difference Result 2002 states and 2372 transitions. [2019-10-13 21:03:50,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:03:50,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-10-13 21:03:50,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:03:50,199 INFO L225 Difference]: With dead ends: 2002 [2019-10-13 21:03:50,199 INFO L226 Difference]: Without dead ends: 1339 [2019-10-13 21:03:50,201 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-13 21:03:50,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2019-10-13 21:03:50,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1337. [2019-10-13 21:03:50,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-10-13 21:03:50,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1573 transitions. [2019-10-13 21:03:50,259 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1573 transitions. Word has length 70 [2019-10-13 21:03:50,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:03:50,260 INFO L462 AbstractCegarLoop]: Abstraction has 1337 states and 1573 transitions. [2019-10-13 21:03:50,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:03:50,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1573 transitions. [2019-10-13 21:03:50,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-13 21:03:50,262 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:03:50,262 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-13 21:03:50,262 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:03:50,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:03:50,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1836161467, now seen corresponding path program 1 times [2019-10-13 21:03:50,263 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:03:50,263 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688400447] [2019-10-13 21:03:50,263 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:03:50,263 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:03:50,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:03:50,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:03:50,373 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-13 21:03:50,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688400447] [2019-10-13 21:03:50,374 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:03:50,374 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:03:50,374 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331095642] [2019-10-13 21:03:50,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:03:50,375 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:03:50,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:03:50,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:03:50,376 INFO L87 Difference]: Start difference. First operand 1337 states and 1573 transitions. Second operand 3 states. [2019-10-13 21:03:50,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:03:50,418 INFO L93 Difference]: Finished difference Result 1339 states and 1574 transitions. [2019-10-13 21:03:50,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:03:50,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-10-13 21:03:50,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:03:50,425 INFO L225 Difference]: With dead ends: 1339 [2019-10-13 21:03:50,425 INFO L226 Difference]: Without dead ends: 1336 [2019-10-13 21:03:50,426 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-13 21:03:50,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2019-10-13 21:03:50,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1336. [2019-10-13 21:03:50,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1336 states. [2019-10-13 21:03:50,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 1571 transitions. [2019-10-13 21:03:50,494 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 1571 transitions. Word has length 71 [2019-10-13 21:03:50,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:03:50,495 INFO L462 AbstractCegarLoop]: Abstraction has 1336 states and 1571 transitions. [2019-10-13 21:03:50,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:03:50,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 1571 transitions. [2019-10-13 21:03:50,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-13 21:03:50,497 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:03:50,497 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-13 21:03:50,497 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:03:50,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:03:50,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1086568233, now seen corresponding path program 1 times [2019-10-13 21:03:50,498 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:03:50,498 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958162471] [2019-10-13 21:03:50,498 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:03:50,498 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:03:50,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:03:50,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:03:50,692 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-13 21:03:50,693 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958162471] [2019-10-13 21:03:50,693 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:03:50,693 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:03:50,693 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167560552] [2019-10-13 21:03:50,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:03:50,694 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:03:50,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:03:50,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:03:50,695 INFO L87 Difference]: Start difference. First operand 1336 states and 1571 transitions. Second operand 3 states. [2019-10-13 21:03:50,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:03:50,740 INFO L93 Difference]: Finished difference Result 1338 states and 1572 transitions. [2019-10-13 21:03:50,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:03:50,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-10-13 21:03:50,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:03:50,747 INFO L225 Difference]: With dead ends: 1338 [2019-10-13 21:03:50,748 INFO L226 Difference]: Without dead ends: 1335 [2019-10-13 21:03:50,748 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-13 21:03:50,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2019-10-13 21:03:50,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1335. [2019-10-13 21:03:50,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1335 states. [2019-10-13 21:03:50,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1335 states to 1335 states and 1569 transitions. [2019-10-13 21:03:50,813 INFO L78 Accepts]: Start accepts. Automaton has 1335 states and 1569 transitions. Word has length 72 [2019-10-13 21:03:50,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:03:50,814 INFO L462 AbstractCegarLoop]: Abstraction has 1335 states and 1569 transitions. [2019-10-13 21:03:50,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:03:50,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 1569 transitions. [2019-10-13 21:03:50,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-13 21:03:50,815 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:03:50,815 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-13 21:03:50,816 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:03:50,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:03:50,816 INFO L82 PathProgramCache]: Analyzing trace with hash 675990408, now seen corresponding path program 1 times [2019-10-13 21:03:50,816 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:03:50,816 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221357343] [2019-10-13 21:03:50,817 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:03:50,817 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:03:50,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:03:50,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:03:50,907 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-13 21:03:50,908 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221357343] [2019-10-13 21:03:50,908 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:03:50,908 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:03:50,908 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962771485] [2019-10-13 21:03:50,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:03:50,909 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:03:50,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:03:50,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:03:50,910 INFO L87 Difference]: Start difference. First operand 1335 states and 1569 transitions. Second operand 3 states. [2019-10-13 21:03:50,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:03:50,954 INFO L93 Difference]: Finished difference Result 1337 states and 1570 transitions. [2019-10-13 21:03:50,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:03:50,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-10-13 21:03:50,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:03:50,961 INFO L225 Difference]: With dead ends: 1337 [2019-10-13 21:03:50,961 INFO L226 Difference]: Without dead ends: 1316 [2019-10-13 21:03:50,962 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-13 21:03:50,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2019-10-13 21:03:51,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 1316. [2019-10-13 21:03:51,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1316 states. [2019-10-13 21:03:51,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1547 transitions. [2019-10-13 21:03:51,029 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1547 transitions. Word has length 73 [2019-10-13 21:03:51,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:03:51,029 INFO L462 AbstractCegarLoop]: Abstraction has 1316 states and 1547 transitions. [2019-10-13 21:03:51,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:03:51,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1547 transitions. [2019-10-13 21:03:51,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-10-13 21:03:51,034 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:03:51,035 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-13 21:03:51,035 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:03:51,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:03:51,035 INFO L82 PathProgramCache]: Analyzing trace with hash 870207449, now seen corresponding path program 1 times [2019-10-13 21:03:51,035 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:03:51,036 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018051168] [2019-10-13 21:03:51,036 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:03:51,036 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:03:51,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:03:51,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:03:51,247 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-13 21:03:51,248 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018051168] [2019-10-13 21:03:51,248 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:03:51,248 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:03:51,248 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008011996] [2019-10-13 21:03:51,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:03:51,249 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:03:51,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:03:51,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:03:51,250 INFO L87 Difference]: Start difference. First operand 1316 states and 1547 transitions. Second operand 3 states. [2019-10-13 21:03:51,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:03:51,343 INFO L93 Difference]: Finished difference Result 2699 states and 3195 transitions. [2019-10-13 21:03:51,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:03:51,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-10-13 21:03:51,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:03:51,350 INFO L225 Difference]: With dead ends: 2699 [2019-10-13 21:03:51,350 INFO L226 Difference]: Without dead ends: 1403 [2019-10-13 21:03:51,354 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-13 21:03:51,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2019-10-13 21:03:51,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 1366. [2019-10-13 21:03:51,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1366 states. [2019-10-13 21:03:51,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 1618 transitions. [2019-10-13 21:03:51,425 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 1618 transitions. Word has length 229 [2019-10-13 21:03:51,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:03:51,425 INFO L462 AbstractCegarLoop]: Abstraction has 1366 states and 1618 transitions. [2019-10-13 21:03:51,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:03:51,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1618 transitions. [2019-10-13 21:03:51,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-10-13 21:03:51,434 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:03:51,434 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-13 21:03:51,435 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:03:51,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:03:51,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1880002846, now seen corresponding path program 1 times [2019-10-13 21:03:51,435 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:03:51,436 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436968817] [2019-10-13 21:03:51,436 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:03:51,436 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:03:51,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:03:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:03:51,677 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-13 21:03:51,678 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436968817] [2019-10-13 21:03:51,678 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:03:51,678 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:03:51,678 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94729265] [2019-10-13 21:03:51,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:03:51,679 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:03:51,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:03:51,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:03:51,680 INFO L87 Difference]: Start difference. First operand 1366 states and 1618 transitions. Second operand 6 states. [2019-10-13 21:03:51,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:03:51,800 INFO L93 Difference]: Finished difference Result 2740 states and 3254 transitions. [2019-10-13 21:03:51,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:03:51,801 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 248 [2019-10-13 21:03:51,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:03:51,819 INFO L225 Difference]: With dead ends: 2740 [2019-10-13 21:03:51,819 INFO L226 Difference]: Without dead ends: 1394 [2019-10-13 21:03:51,826 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-13 21:03:51,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2019-10-13 21:03:51,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1390. [2019-10-13 21:03:51,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1390 states. [2019-10-13 21:03:51,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 1642 transitions. [2019-10-13 21:03:51,911 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 1642 transitions. Word has length 248 [2019-10-13 21:03:51,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:03:51,912 INFO L462 AbstractCegarLoop]: Abstraction has 1390 states and 1642 transitions. [2019-10-13 21:03:51,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:03:51,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1642 transitions. [2019-10-13 21:03:51,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-10-13 21:03:51,918 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:03:51,918 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-13 21:03:51,918 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:03:51,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:03:51,919 INFO L82 PathProgramCache]: Analyzing trace with hash -569313577, now seen corresponding path program 1 times [2019-10-13 21:03:51,919 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:03:51,919 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068956187] [2019-10-13 21:03:51,919 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:03:51,920 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:03:51,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:03:52,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:03:52,156 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-13 21:03:52,157 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068956187] [2019-10-13 21:03:52,157 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:03:52,158 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:03:52,158 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595903071] [2019-10-13 21:03:52,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:03:52,159 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:03:52,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:03:52,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:03:52,160 INFO L87 Difference]: Start difference. First operand 1390 states and 1642 transitions. Second operand 6 states. [2019-10-13 21:03:52,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:03:52,440 INFO L93 Difference]: Finished difference Result 4218 states and 5002 transitions. [2019-10-13 21:03:52,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 21:03:52,441 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 254 [2019-10-13 21:03:52,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:03:52,456 INFO L225 Difference]: With dead ends: 4218 [2019-10-13 21:03:52,457 INFO L226 Difference]: Without dead ends: 2848 [2019-10-13 21:03:52,462 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:03:52,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2848 states. [2019-10-13 21:03:52,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2848 to 1430. [2019-10-13 21:03:52,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1430 states. [2019-10-13 21:03:52,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 1696 transitions. [2019-10-13 21:03:52,603 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 1696 transitions. Word has length 254 [2019-10-13 21:03:52,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:03:52,604 INFO L462 AbstractCegarLoop]: Abstraction has 1430 states and 1696 transitions. [2019-10-13 21:03:52,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:03:52,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 1696 transitions. [2019-10-13 21:03:52,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-10-13 21:03:52,609 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:03:52,610 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-13 21:03:52,610 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:03:52,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:03:52,610 INFO L82 PathProgramCache]: Analyzing trace with hash -703327083, now seen corresponding path program 1 times [2019-10-13 21:03:52,611 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:03:52,611 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429446511] [2019-10-13 21:03:52,611 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:03:52,611 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:03:52,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:03:52,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:03:52,944 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-13 21:03:52,944 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429446511] [2019-10-13 21:03:52,944 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425399942] [2019-10-13 21:03:52,945 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-13 21:03:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:03:53,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 1854 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-13 21:03:53,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:03:53,723 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-13 21:03:53,724 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:03:54,376 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-13 21:03:54,376 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:03:54,377 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [11] total 18 [2019-10-13 21:03:54,377 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112361445] [2019-10-13 21:03:54,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:03:54,379 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:03:54,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:03:54,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:03:54,380 INFO L87 Difference]: Start difference. First operand 1430 states and 1696 transitions. Second operand 9 states. [2019-10-13 21:03:54,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:03:54,602 INFO L93 Difference]: Finished difference Result 2160 states and 2562 transitions. [2019-10-13 21:03:54,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:03:54,602 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 254 [2019-10-13 21:03:54,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:03:54,610 INFO L225 Difference]: With dead ends: 2160 [2019-10-13 21:03:54,611 INFO L226 Difference]: Without dead ends: 1444 [2019-10-13 21:03:54,613 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-13 21:03:54,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2019-10-13 21:03:54,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1440. [2019-10-13 21:03:54,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1440 states. [2019-10-13 21:03:54,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 1704 transitions. [2019-10-13 21:03:54,701 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 1704 transitions. Word has length 254 [2019-10-13 21:03:54,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:03:54,704 INFO L462 AbstractCegarLoop]: Abstraction has 1440 states and 1704 transitions. [2019-10-13 21:03:54,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:03:54,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 1704 transitions. [2019-10-13 21:03:54,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-10-13 21:03:54,711 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:03:54,712 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-13 21:03:54,920 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:03:54,920 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:03:54,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:03:54,921 INFO L82 PathProgramCache]: Analyzing trace with hash 439873160, now seen corresponding path program 1 times [2019-10-13 21:03:54,921 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:03:54,921 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707780961] [2019-10-13 21:03:54,921 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:03:54,921 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:03:54,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:03:55,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:03:55,408 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-13 21:03:55,409 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707780961] [2019-10-13 21:03:55,409 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538801681] [2019-10-13 21:03:55,409 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-13 21:03:55,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:03:55,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 2199 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:03:56,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:03:56,200 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-13 21:03:56,201 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:03:56,580 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-13 21:03:56,581 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:03:56,581 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [11] total 13 [2019-10-13 21:03:56,581 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681950991] [2019-10-13 21:03:56,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:03:56,583 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:03:56,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:03:56,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:03:56,584 INFO L87 Difference]: Start difference. First operand 1440 states and 1704 transitions. Second operand 4 states. [2019-10-13 21:03:57,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:03:57,150 INFO L93 Difference]: Finished difference Result 4272 states and 5063 transitions. [2019-10-13 21:03:57,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:03:57,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 310 [2019-10-13 21:03:57,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:03:57,172 INFO L225 Difference]: With dead ends: 4272 [2019-10-13 21:03:57,172 INFO L226 Difference]: Without dead ends: 4254 [2019-10-13 21:03:57,175 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 631 GetRequests, 617 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:03:57,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4254 states. [2019-10-13 21:03:57,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4254 to 4240. [2019-10-13 21:03:57,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4240 states. [2019-10-13 21:03:57,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4240 states to 4240 states and 5032 transitions. [2019-10-13 21:03:57,406 INFO L78 Accepts]: Start accepts. Automaton has 4240 states and 5032 transitions. Word has length 310 [2019-10-13 21:03:57,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:03:57,407 INFO L462 AbstractCegarLoop]: Abstraction has 4240 states and 5032 transitions. [2019-10-13 21:03:57,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:03:57,408 INFO L276 IsEmpty]: Start isEmpty. Operand 4240 states and 5032 transitions. [2019-10-13 21:03:57,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-10-13 21:03:57,423 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:03:57,423 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-13 21:03:57,631 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:03:57,631 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:03:57,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:03:57,632 INFO L82 PathProgramCache]: Analyzing trace with hash 305859654, now seen corresponding path program 1 times [2019-10-13 21:03:57,632 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:03:57,632 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733095887] [2019-10-13 21:03:57,632 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:03:57,633 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:03:57,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:03:57,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:03:57,859 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-13 21:03:57,860 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733095887] [2019-10-13 21:03:57,860 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:03:57,860 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:03:57,861 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60506001] [2019-10-13 21:03:57,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:03:57,861 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:03:57,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:03:57,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:03:57,862 INFO L87 Difference]: Start difference. First operand 4240 states and 5032 transitions. Second operand 5 states. [2019-10-13 21:03:58,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:03:58,247 INFO L93 Difference]: Finished difference Result 12740 states and 15128 transitions. [2019-10-13 21:03:58,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:03:58,248 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 310 [2019-10-13 21:03:58,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:03:58,288 INFO L225 Difference]: With dead ends: 12740 [2019-10-13 21:03:58,288 INFO L226 Difference]: Without dead ends: 8520 [2019-10-13 21:03:58,304 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-13 21:03:58,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8520 states. [2019-10-13 21:03:58,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8520 to 4280. [2019-10-13 21:03:58,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4280 states. [2019-10-13 21:03:58,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4280 states to 4280 states and 5078 transitions. [2019-10-13 21:03:58,630 INFO L78 Accepts]: Start accepts. Automaton has 4280 states and 5078 transitions. Word has length 310 [2019-10-13 21:03:58,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:03:58,632 INFO L462 AbstractCegarLoop]: Abstraction has 4280 states and 5078 transitions. [2019-10-13 21:03:58,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:03:58,632 INFO L276 IsEmpty]: Start isEmpty. Operand 4280 states and 5078 transitions. [2019-10-13 21:03:58,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-10-13 21:03:58,646 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:03:58,647 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-13 21:03:58,647 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:03:58,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:03:58,648 INFO L82 PathProgramCache]: Analyzing trace with hash -952552992, now seen corresponding path program 1 times [2019-10-13 21:03:58,648 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:03:58,648 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130993823] [2019-10-13 21:03:58,649 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:03:58,649 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:03:58,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:03:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:03:59,056 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-13 21:03:59,056 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130993823] [2019-10-13 21:03:59,057 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073698439] [2019-10-13 21:03:59,057 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-13 21:03:59,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:03:59,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 2205 conjuncts, 106 conjunts are in the unsatisfiable core [2019-10-13 21:03:59,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:03:59,662 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-13 21:03:59,662 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 21:03:59,666 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:03:59,666 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 21:03:59,666 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:7, output treesize:6 [2019-10-13 21:04:01,817 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-13 21:04:02,469 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-13 21:04:02,519 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:04:02,520 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-13 21:04:02,520 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 21:04:02,542 INFO L567 ElimStorePlain]: treesize reduction 15, result has 53.1 percent of original size [2019-10-13 21:04:02,543 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-13 21:04:02,543 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:17 [2019-10-13 21:04:03,099 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-13 21:04:03,099 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 21:04:03,108 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:04:03,109 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-13 21:04:03,109 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:1 [2019-10-13 21:04:03,118 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-13 21:04:03,132 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:04:03,132 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-13 21:04:03,133 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:34 [2019-10-13 21:04:04,286 WARN L191 SmtUtils]: Spent 611.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-10-13 21:04:04,302 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-13 21:04:04,321 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:04:04,325 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-13 21:04:04,338 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:04:04,339 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-13 21:04:04,339 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:41 [2019-10-13 21:04:11,182 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 31 [2019-10-13 21:04:11,234 INFO L341 Elim1Store]: treesize reduction 199, result has 12.3 percent of original size [2019-10-13 21:04:11,235 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-13 21:04:11,236 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 21:04:11,244 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:04:11,245 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-13 21:04:11,246 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:34, output treesize:1 [2019-10-13 21:04:11,299 INFO L341 Elim1Store]: treesize reduction 199, result has 12.3 percent of original size [2019-10-13 21:04:11,299 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-13 21:04:11,300 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 21:04:11,306 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:04:11,306 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-13 21:04:11,307 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:34, output treesize:1 [2019-10-13 21:04:11,320 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-13 21:04:11,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:04:11,345 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-13 21:04:11,361 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:04:11,362 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-13 21:04:11,362 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:75, output treesize:79 [2019-10-13 21:04:23,020 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 40