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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 22:07:42,553 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 22:07:42,555 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 22:07:42,574 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 22:07:42,575 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 22:07:42,577 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 22:07:42,579 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 22:07:42,589 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 22:07:42,594 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 22:07:42,598 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 22:07:42,600 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 22:07:42,601 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 22:07:42,601 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 22:07:42,603 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 22:07:42,606 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 22:07:42,607 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 22:07:42,609 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 22:07:42,610 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 22:07:42,612 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 22:07:42,616 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 22:07:42,621 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 22:07:42,624 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 22:07:42,628 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 22:07:42,629 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 22:07:42,632 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 22:07:42,632 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 22:07:42,632 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 22:07:42,634 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 22:07:42,635 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 22:07:42,636 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 22:07:42,637 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 22:07:42,638 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 22:07:42,639 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 22:07:42,640 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 22:07:42,642 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 22:07:42,642 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 22:07:42,643 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 22:07:42,643 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 22:07:42,643 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 22:07:42,644 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 22:07:42,645 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 22:07:42,646 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 22:07:42,681 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 22:07:42,681 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 22:07:42,687 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 22:07:42,688 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 22:07:42,688 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 22:07:42,688 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 22:07:42,688 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 22:07:42,688 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 22:07:42,689 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 22:07:42,689 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 22:07:42,692 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 22:07:42,692 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 22:07:42,692 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 22:07:42,693 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 22:07:42,693 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 22:07:42,693 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 22:07:42,693 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 22:07:42,693 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 22:07:42,693 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 22:07:42,694 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 22:07:42,694 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 22:07:42,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 22:07:42,694 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 22:07:42,695 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 22:07:42,695 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 22:07:42,695 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 22:07:42,695 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 22:07:42,695 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 22:07:42,696 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 22:07:43,005 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 22:07:43,020 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 22:07:43,024 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 22:07:43,025 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 22:07:43,026 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 22:07:43,027 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2019-10-13 22:07:43,100 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17a5c0eaf/8b6f9ad82c684282a65adb61643cc124/FLAGb55d58b77 [2019-10-13 22:07:43,890 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 22:07:43,890 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2019-10-13 22:07:43,928 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17a5c0eaf/8b6f9ad82c684282a65adb61643cc124/FLAGb55d58b77 [2019-10-13 22:07:44,443 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17a5c0eaf/8b6f9ad82c684282a65adb61643cc124 [2019-10-13 22:07:44,454 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 22:07:44,456 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 22:07:44,457 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 22:07:44,458 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 22:07:44,463 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 22:07:44,464 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:07:44" (1/1) ... [2019-10-13 22:07:44,467 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43089c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:07:44, skipping insertion in model container [2019-10-13 22:07:44,467 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:07:44" (1/1) ... [2019-10-13 22:07:44,476 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 22:07:44,580 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 22:07:45,609 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 22:07:45,661 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 22:07:45,903 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 22:07:46,033 INFO L192 MainTranslator]: Completed translation [2019-10-13 22:07:46,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:07:46 WrapperNode [2019-10-13 22:07:46,034 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 22:07:46,035 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 22:07:46,035 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 22:07:46,035 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 22:07:46,058 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:07:46" (1/1) ... [2019-10-13 22:07:46,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:07:46" (1/1) ... [2019-10-13 22:07:46,134 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:07:46" (1/1) ... [2019-10-13 22:07:46,135 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:07:46" (1/1) ... [2019-10-13 22:07:46,207 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:07:46" (1/1) ... [2019-10-13 22:07:46,219 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:07:46" (1/1) ... [2019-10-13 22:07:46,232 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:07:46" (1/1) ... [2019-10-13 22:07:46,247 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 22:07:46,247 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 22:07:46,248 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 22:07:46,248 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 22:07:46,249 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:07: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 22:07:46,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 22:07:46,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 22:07:46,342 INFO L138 BoogieDeclarations]: Found implementation of procedure __le16_to_cpup [2019-10-13 22:07:46,342 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2019-10-13 22:07:46,342 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2019-10-13 22:07:46,343 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2019-10-13 22:07:46,344 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2019-10-13 22:07:46,344 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2019-10-13 22:07:46,345 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_make_path [2019-10-13 22:07:46,345 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register [2019-10-13 22:07:46,345 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_int_urb [2019-10-13 22:07:46,346 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2019-10-13 22:07:46,346 INFO L138 BoogieDeclarations]: Found implementation of procedure input_allocate_device [2019-10-13 22:07:46,347 INFO L138 BoogieDeclarations]: Found implementation of procedure input_get_drvdata [2019-10-13 22:07:46,347 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_drvdata [2019-10-13 22:07:46,347 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_key [2019-10-13 22:07:46,350 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_abs [2019-10-13 22:07:46,350 INFO L138 BoogieDeclarations]: Found implementation of procedure input_sync [2019-10-13 22:07:46,350 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_to_input_id [2019-10-13 22:07:46,350 INFO L138 BoogieDeclarations]: Found implementation of procedure get_unaligned_le16 [2019-10-13 22:07:46,351 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_irq [2019-10-13 22:07:46,351 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_open [2019-10-13 22:07:46,351 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_close [2019-10-13 22:07:46,351 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_probe [2019-10-13 22:07:46,351 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_disconnect [2019-10-13 22:07:46,351 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_init [2019-10-13 22:07:46,352 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_exit [2019-10-13 22:07:46,352 INFO L138 BoogieDeclarations]: Found implementation of procedure init_module [2019-10-13 22:07:46,352 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup_module [2019-10-13 22:07:46,352 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 22:07:46,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2019-10-13 22:07:46,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2019-10-13 22:07:46,353 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2019-10-13 22:07:46,353 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2019-10-13 22:07:46,353 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2019-10-13 22:07:46,353 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2019-10-13 22:07:46,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-10-13 22:07:46,355 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2019-10-13 22:07:46,355 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2019-10-13 22:07:46,355 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2019-10-13 22:07:46,355 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event [2019-10-13 22:07:46,355 INFO L138 BoogieDeclarations]: Found implementation of procedure input_free_device [2019-10-13 22:07:46,355 INFO L138 BoogieDeclarations]: Found implementation of procedure input_register_device [2019-10-13 22:07:46,356 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2019-10-13 22:07:46,356 INFO L138 BoogieDeclarations]: Found implementation of procedure input_unregister_device [2019-10-13 22:07:46,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2019-10-13 22:07:46,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-10-13 22:07:46,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2019-10-13 22:07:46,356 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-10-13 22:07:46,357 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2019-10-13 22:07:46,357 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_deregister [2019-10-13 22:07:46,357 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2019-10-13 22:07:46,357 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register_driver [2019-10-13 22:07:46,357 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2019-10-13 22:07:46,358 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-10-13 22:07:46,358 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-10-13 22:07:46,358 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 22:07:46,358 INFO L130 BoogieDeclarations]: Found specification of procedure __le16_to_cpup [2019-10-13 22:07:46,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 22:07:46,359 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-10-13 22:07:46,360 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2019-10-13 22:07:46,360 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2019-10-13 22:07:46,360 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-10-13 22:07:46,360 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2019-10-13 22:07:46,360 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2019-10-13 22:07:46,361 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2019-10-13 22:07:46,361 INFO L130 BoogieDeclarations]: Found specification of procedure init_module [2019-10-13 22:07:46,361 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup_module [2019-10-13 22:07:46,361 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2019-10-13 22:07:46,361 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2019-10-13 22:07:46,362 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2019-10-13 22:07:46,362 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2019-10-13 22:07:46,362 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2019-10-13 22:07:46,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 22:07:46,363 INFO L130 BoogieDeclarations]: Found specification of procedure usb_make_path [2019-10-13 22:07:46,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 22:07:46,364 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register_driver [2019-10-13 22:07:46,364 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register [2019-10-13 22:07:46,364 INFO L130 BoogieDeclarations]: Found specification of procedure usb_deregister [2019-10-13 22:07:46,365 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_int_urb [2019-10-13 22:07:46,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 22:07:46,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 22:07:46,366 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2019-10-13 22:07:46,366 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2019-10-13 22:07:46,366 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2019-10-13 22:07:46,367 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2019-10-13 22:07:46,367 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2019-10-13 22:07:46,368 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2019-10-13 22:07:46,368 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2019-10-13 22:07:46,368 INFO L130 BoogieDeclarations]: Found specification of procedure input_allocate_device [2019-10-13 22:07:46,369 INFO L130 BoogieDeclarations]: Found specification of procedure input_free_device [2019-10-13 22:07:46,369 INFO L130 BoogieDeclarations]: Found specification of procedure input_get_drvdata [2019-10-13 22:07:46,369 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_drvdata [2019-10-13 22:07:46,369 INFO L130 BoogieDeclarations]: Found specification of procedure input_register_device [2019-10-13 22:07:46,369 INFO L130 BoogieDeclarations]: Found specification of procedure input_unregister_device [2019-10-13 22:07:46,370 INFO L130 BoogieDeclarations]: Found specification of procedure input_event [2019-10-13 22:07:46,370 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_key [2019-10-13 22:07:46,370 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_abs [2019-10-13 22:07:46,370 INFO L130 BoogieDeclarations]: Found specification of procedure input_sync [2019-10-13 22:07:46,370 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2019-10-13 22:07:46,371 INFO L130 BoogieDeclarations]: Found specification of procedure usb_to_input_id [2019-10-13 22:07:46,371 INFO L130 BoogieDeclarations]: Found specification of procedure get_unaligned_le16 [2019-10-13 22:07:46,371 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_irq [2019-10-13 22:07:46,371 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_open [2019-10-13 22:07:46,372 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_close [2019-10-13 22:07:46,372 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_probe [2019-10-13 22:07:46,372 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_disconnect [2019-10-13 22:07:46,372 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_init [2019-10-13 22:07:46,372 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_exit [2019-10-13 22:07:46,373 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-10-13 22:07:46,373 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2019-10-13 22:07:46,373 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-10-13 22:07:46,373 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 22:07:46,373 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 22:07:46,373 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2019-10-13 22:07:46,374 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2019-10-13 22:07:46,374 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2019-10-13 22:07:46,374 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-10-13 22:07:46,375 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-10-13 22:07:46,375 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-13 22:07:46,375 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 22:07:46,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 22:07:46,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 22:07:46,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-13 22:07:46,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-13 22:07:46,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 22:07:47,162 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 22:07:47,209 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-10-13 22:07:47,210 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-10-13 22:07:47,524 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 22:07:47,585 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-10-13 22:07:47,585 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-10-13 22:07:47,793 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2019-10-13 22:07:48,941 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 22:07:48,942 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-13 22:07:48,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:07:48 BoogieIcfgContainer [2019-10-13 22:07:48,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 22:07:48,945 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 22:07:48,945 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 22:07:48,948 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 22:07:48,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:07:44" (1/3) ... [2019-10-13 22:07:48,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13891903 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:07:48, skipping insertion in model container [2019-10-13 22:07:48,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:07:46" (2/3) ... [2019-10-13 22:07:48,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13891903 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:07:48, skipping insertion in model container [2019-10-13 22:07:48,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:07:48" (3/3) ... [2019-10-13 22:07:48,952 INFO L109 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2019-10-13 22:07:48,961 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 22:07:48,970 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 22:07:48,982 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 22:07:49,010 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 22:07:49,011 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 22:07:49,011 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 22:07:49,011 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 22:07:49,011 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 22:07:49,011 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 22:07:49,011 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 22:07:49,012 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 22:07:49,036 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states. [2019-10-13 22:07:49,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 22:07:49,043 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:07:49,044 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] [2019-10-13 22:07:49,046 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:07:49,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:07:49,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1838643444, now seen corresponding path program 1 times [2019-10-13 22:07:49,062 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:07:49,062 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966575468] [2019-10-13 22:07:49,063 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:07:49,063 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:07:49,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:07:49,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:07:49,578 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 22:07:49,578 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966575468] [2019-10-13 22:07:49,579 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:07:49,579 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 22:07:49,580 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152316156] [2019-10-13 22:07:49,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 22:07:49,585 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:07:49,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 22:07:49,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 22:07:49,602 INFO L87 Difference]: Start difference. First operand 231 states. Second operand 3 states. [2019-10-13 22:07:49,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:07:49,757 INFO L93 Difference]: Finished difference Result 528 states and 654 transitions. [2019-10-13 22:07:49,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 22:07:49,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-13 22:07:49,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:07:49,796 INFO L225 Difference]: With dead ends: 528 [2019-10-13 22:07:49,796 INFO L226 Difference]: Without dead ends: 327 [2019-10-13 22:07:49,809 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 22:07:49,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-10-13 22:07:49,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 322. [2019-10-13 22:07:49,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-10-13 22:07:49,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 370 transitions. [2019-10-13 22:07:49,963 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 370 transitions. Word has length 25 [2019-10-13 22:07:49,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:07:49,964 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 370 transitions. [2019-10-13 22:07:49,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 22:07:49,964 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 370 transitions. [2019-10-13 22:07:49,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 22:07:49,965 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:07:49,965 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] [2019-10-13 22:07:49,966 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:07:49,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:07:49,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1163173868, now seen corresponding path program 1 times [2019-10-13 22:07:49,966 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:07:49,967 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819148158] [2019-10-13 22:07:49,967 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:07:49,967 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:07:49,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:07:50,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:07:50,158 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 22:07:50,159 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819148158] [2019-10-13 22:07:50,159 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:07:50,159 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 22:07:50,160 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812039064] [2019-10-13 22:07:50,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 22:07:50,215 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:07:50,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 22:07:50,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 22:07:50,216 INFO L87 Difference]: Start difference. First operand 322 states and 370 transitions. Second operand 3 states. [2019-10-13 22:07:50,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:07:50,273 INFO L93 Difference]: Finished difference Result 741 states and 856 transitions. [2019-10-13 22:07:50,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 22:07:50,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-13 22:07:50,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:07:50,278 INFO L225 Difference]: With dead ends: 741 [2019-10-13 22:07:50,279 INFO L226 Difference]: Without dead ends: 431 [2019-10-13 22:07:50,280 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 22:07:50,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-10-13 22:07:50,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 425. [2019-10-13 22:07:50,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-10-13 22:07:50,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 488 transitions. [2019-10-13 22:07:50,332 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 488 transitions. Word has length 26 [2019-10-13 22:07:50,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:07:50,333 INFO L462 AbstractCegarLoop]: Abstraction has 425 states and 488 transitions. [2019-10-13 22:07:50,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 22:07:50,333 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 488 transitions. [2019-10-13 22:07:50,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-13 22:07:50,338 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:07:50,338 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:07:50,338 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:07:50,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:07:50,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1952461806, now seen corresponding path program 1 times [2019-10-13 22:07:50,339 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:07:50,339 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512809017] [2019-10-13 22:07:50,339 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:07:50,340 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:07:50,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:07:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:07:50,448 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 22:07:50,448 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512809017] [2019-10-13 22:07:50,449 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:07:50,449 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 22:07:50,449 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940835174] [2019-10-13 22:07:50,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 22:07:50,450 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:07:50,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 22:07:50,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 22:07:50,452 INFO L87 Difference]: Start difference. First operand 425 states and 488 transitions. Second operand 3 states. [2019-10-13 22:07:50,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:07:50,515 INFO L93 Difference]: Finished difference Result 853 states and 996 transitions. [2019-10-13 22:07:50,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 22:07:50,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-10-13 22:07:50,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:07:50,522 INFO L225 Difference]: With dead ends: 853 [2019-10-13 22:07:50,523 INFO L226 Difference]: Without dead ends: 448 [2019-10-13 22:07:50,526 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 22:07:50,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2019-10-13 22:07:50,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 448. [2019-10-13 22:07:50,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-10-13 22:07:50,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 519 transitions. [2019-10-13 22:07:50,571 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 519 transitions. Word has length 61 [2019-10-13 22:07:50,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:07:50,578 INFO L462 AbstractCegarLoop]: Abstraction has 448 states and 519 transitions. [2019-10-13 22:07:50,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 22:07:50,579 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 519 transitions. [2019-10-13 22:07:50,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-13 22:07:50,585 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:07:50,586 INFO L380 BasicCegarLoop]: trace histogram [3, 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] [2019-10-13 22:07:50,586 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:07:50,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:07:50,587 INFO L82 PathProgramCache]: Analyzing trace with hash -119762277, now seen corresponding path program 1 times [2019-10-13 22:07:50,588 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:07:50,588 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098356865] [2019-10-13 22:07:50,588 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:07:50,588 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:07:50,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:07:50,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:07:50,846 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 22:07:50,846 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098356865] [2019-10-13 22:07:50,847 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:07:50,847 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 22:07:50,847 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835682404] [2019-10-13 22:07:50,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 22:07:50,848 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:07:50,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 22:07:50,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-13 22:07:50,849 INFO L87 Difference]: Start difference. First operand 448 states and 519 transitions. Second operand 7 states. [2019-10-13 22:07:51,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:07:51,954 INFO L93 Difference]: Finished difference Result 794 states and 922 transitions. [2019-10-13 22:07:51,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 22:07:51,954 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 108 [2019-10-13 22:07:51,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:07:51,958 INFO L225 Difference]: With dead ends: 794 [2019-10-13 22:07:51,958 INFO L226 Difference]: Without dead ends: 467 [2019-10-13 22:07:51,960 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-13 22:07:51,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2019-10-13 22:07:51,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 344. [2019-10-13 22:07:51,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-10-13 22:07:51,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 394 transitions. [2019-10-13 22:07:51,979 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 394 transitions. Word has length 108 [2019-10-13 22:07:51,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:07:51,980 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 394 transitions. [2019-10-13 22:07:51,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 22:07:51,980 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 394 transitions. [2019-10-13 22:07:51,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 22:07:51,982 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:07:51,983 INFO L380 BasicCegarLoop]: trace histogram [4, 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] [2019-10-13 22:07:51,983 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:07:51,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:07:51,983 INFO L82 PathProgramCache]: Analyzing trace with hash -864977968, now seen corresponding path program 1 times [2019-10-13 22:07:51,984 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:07:51,984 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822926281] [2019-10-13 22:07:51,984 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:07:51,984 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:07:51,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:07:52,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:07:52,251 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-13 22:07:52,252 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822926281] [2019-10-13 22:07:52,252 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:07:52,252 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 22:07:52,252 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547391790] [2019-10-13 22:07:52,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 22:07:52,253 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:07:52,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 22:07:52,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 22:07:52,254 INFO L87 Difference]: Start difference. First operand 344 states and 394 transitions. Second operand 8 states. [2019-10-13 22:07:54,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:07:54,373 INFO L93 Difference]: Finished difference Result 687 states and 798 transitions. [2019-10-13 22:07:54,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 22:07:54,374 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 106 [2019-10-13 22:07:54,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:07:54,379 INFO L225 Difference]: With dead ends: 687 [2019-10-13 22:07:54,379 INFO L226 Difference]: Without dead ends: 684 [2019-10-13 22:07:54,380 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-10-13 22:07:54,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2019-10-13 22:07:54,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 648. [2019-10-13 22:07:54,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-10-13 22:07:54,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 755 transitions. [2019-10-13 22:07:54,420 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 755 transitions. Word has length 106 [2019-10-13 22:07:54,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:07:54,421 INFO L462 AbstractCegarLoop]: Abstraction has 648 states and 755 transitions. [2019-10-13 22:07:54,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 22:07:54,421 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 755 transitions. [2019-10-13 22:07:54,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-13 22:07:54,423 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:07:54,424 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:07:54,424 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:07:54,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:07:54,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1389176690, now seen corresponding path program 1 times [2019-10-13 22:07:54,425 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:07:54,425 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703827898] [2019-10-13 22:07:54,425 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:07:54,425 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:07:54,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:07:54,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:07:54,605 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 22:07:54,606 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703827898] [2019-10-13 22:07:54,606 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:07:54,606 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 22:07:54,606 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061672143] [2019-10-13 22:07:54,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 22:07:54,607 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:07:54,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 22:07:54,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 22:07:54,608 INFO L87 Difference]: Start difference. First operand 648 states and 755 transitions. Second operand 6 states. [2019-10-13 22:07:54,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:07:54,688 INFO L93 Difference]: Finished difference Result 1145 states and 1343 transitions. [2019-10-13 22:07:54,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 22:07:54,689 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 122 [2019-10-13 22:07:54,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:07:54,694 INFO L225 Difference]: With dead ends: 1145 [2019-10-13 22:07:54,694 INFO L226 Difference]: Without dead ends: 490 [2019-10-13 22:07:54,696 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 22:07:54,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-10-13 22:07:54,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 472. [2019-10-13 22:07:54,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-10-13 22:07:54,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 558 transitions. [2019-10-13 22:07:54,726 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 558 transitions. Word has length 122 [2019-10-13 22:07:54,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:07:54,726 INFO L462 AbstractCegarLoop]: Abstraction has 472 states and 558 transitions. [2019-10-13 22:07:54,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 22:07:54,726 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 558 transitions. [2019-10-13 22:07:54,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-13 22:07:54,728 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:07:54,728 INFO L380 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:07:54,729 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:07:54,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:07:54,729 INFO L82 PathProgramCache]: Analyzing trace with hash -582616881, now seen corresponding path program 1 times [2019-10-13 22:07:54,729 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:07:54,729 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574549018] [2019-10-13 22:07:54,730 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:07:54,730 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:07:54,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:07:54,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:07:54,863 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-13 22:07:54,863 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574549018] [2019-10-13 22:07:54,863 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:07:54,863 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 22:07:54,864 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196771322] [2019-10-13 22:07:54,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 22:07:54,864 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:07:54,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 22:07:54,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 22:07:54,865 INFO L87 Difference]: Start difference. First operand 472 states and 558 transitions. Second operand 3 states. [2019-10-13 22:07:54,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:07:54,891 INFO L93 Difference]: Finished difference Result 840 states and 1004 transitions. [2019-10-13 22:07:54,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 22:07:54,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-10-13 22:07:54,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:07:54,895 INFO L225 Difference]: With dead ends: 840 [2019-10-13 22:07:54,896 INFO L226 Difference]: Without dead ends: 446 [2019-10-13 22:07:54,897 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 22:07:54,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-10-13 22:07:54,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446. [2019-10-13 22:07:54,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-10-13 22:07:54,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 517 transitions. [2019-10-13 22:07:54,922 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 517 transitions. Word has length 130 [2019-10-13 22:07:54,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:07:54,923 INFO L462 AbstractCegarLoop]: Abstraction has 446 states and 517 transitions. [2019-10-13 22:07:54,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 22:07:54,923 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 517 transitions. [2019-10-13 22:07:54,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-13 22:07:54,925 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:07:54,925 INFO L380 BasicCegarLoop]: trace histogram [4, 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] [2019-10-13 22:07:54,925 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:07:54,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:07:54,926 INFO L82 PathProgramCache]: Analyzing trace with hash 703227700, now seen corresponding path program 1 times [2019-10-13 22:07:54,926 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:07:54,926 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084917877] [2019-10-13 22:07:54,926 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:07:54,927 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:07:54,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:07:54,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:07:55,127 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-13 22:07:55,128 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084917877] [2019-10-13 22:07:55,128 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:07:55,129 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 22:07:55,129 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089490678] [2019-10-13 22:07:55,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 22:07:55,130 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:07:55,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 22:07:55,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-13 22:07:55,132 INFO L87 Difference]: Start difference. First operand 446 states and 517 transitions. Second operand 7 states. [2019-10-13 22:07:56,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:07:56,054 INFO L93 Difference]: Finished difference Result 481 states and 557 transitions. [2019-10-13 22:07:56,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 22:07:56,058 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 132 [2019-10-13 22:07:56,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:07:56,064 INFO L225 Difference]: With dead ends: 481 [2019-10-13 22:07:56,064 INFO L226 Difference]: Without dead ends: 478 [2019-10-13 22:07:56,065 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-13 22:07:56,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-10-13 22:07:56,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 459. [2019-10-13 22:07:56,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2019-10-13 22:07:56,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 530 transitions. [2019-10-13 22:07:56,095 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 530 transitions. Word has length 132 [2019-10-13 22:07:56,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:07:56,096 INFO L462 AbstractCegarLoop]: Abstraction has 459 states and 530 transitions. [2019-10-13 22:07:56,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 22:07:56,096 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 530 transitions. [2019-10-13 22:07:56,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-13 22:07:56,098 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:07:56,098 INFO L380 BasicCegarLoop]: trace histogram [4, 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] [2019-10-13 22:07:56,099 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:07:56,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:07:56,099 INFO L82 PathProgramCache]: Analyzing trace with hash 325024172, now seen corresponding path program 1 times [2019-10-13 22:07:56,099 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:07:56,100 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040758262] [2019-10-13 22:07:56,100 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:07:56,100 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:07:56,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:07:56,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:07:56,451 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-13 22:07:56,453 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040758262] [2019-10-13 22:07:56,454 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:07:56,454 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 22:07:56,454 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29235441] [2019-10-13 22:07:56,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 22:07:56,455 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:07:56,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 22:07:56,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-13 22:07:56,456 INFO L87 Difference]: Start difference. First operand 459 states and 530 transitions. Second operand 8 states. [2019-10-13 22:07:58,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:07:58,251 INFO L93 Difference]: Finished difference Result 954 states and 1139 transitions. [2019-10-13 22:07:58,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 22:07:58,253 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 133 [2019-10-13 22:07:58,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:07:58,261 INFO L225 Difference]: With dead ends: 954 [2019-10-13 22:07:58,261 INFO L226 Difference]: Without dead ends: 735 [2019-10-13 22:07:58,262 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-10-13 22:07:58,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2019-10-13 22:07:58,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 687. [2019-10-13 22:07:58,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2019-10-13 22:07:58,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 819 transitions. [2019-10-13 22:07:58,317 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 819 transitions. Word has length 133 [2019-10-13 22:07:58,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:07:58,319 INFO L462 AbstractCegarLoop]: Abstraction has 687 states and 819 transitions. [2019-10-13 22:07:58,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 22:07:58,319 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 819 transitions. [2019-10-13 22:07:58,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-13 22:07:58,322 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:07:58,322 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:07:58,322 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:07:58,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:07:58,323 INFO L82 PathProgramCache]: Analyzing trace with hash 2093508702, now seen corresponding path program 1 times [2019-10-13 22:07:58,323 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:07:58,324 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114265240] [2019-10-13 22:07:58,324 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:07:58,324 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:07:58,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:07:58,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:07:58,713 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-13 22:07:58,713 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114265240] [2019-10-13 22:07:58,714 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:07:58,715 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 22:07:58,715 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107183726] [2019-10-13 22:07:58,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 22:07:58,717 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:07:58,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 22:07:58,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 22:07:58,723 INFO L87 Difference]: Start difference. First operand 687 states and 819 transitions. Second operand 8 states. [2019-10-13 22:08:00,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:08:00,825 INFO L93 Difference]: Finished difference Result 1167 states and 1408 transitions. [2019-10-13 22:08:00,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 22:08:00,826 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 148 [2019-10-13 22:08:00,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:08:00,836 INFO L225 Difference]: With dead ends: 1167 [2019-10-13 22:08:00,837 INFO L226 Difference]: Without dead ends: 1160 [2019-10-13 22:08:00,840 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-10-13 22:08:00,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2019-10-13 22:08:00,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1111. [2019-10-13 22:08:00,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2019-10-13 22:08:00,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1344 transitions. [2019-10-13 22:08:00,910 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1344 transitions. Word has length 148 [2019-10-13 22:08:00,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:08:00,911 INFO L462 AbstractCegarLoop]: Abstraction has 1111 states and 1344 transitions. [2019-10-13 22:08:00,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 22:08:00,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1344 transitions. [2019-10-13 22:08:00,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-13 22:08:00,913 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:08:00,913 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 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] [2019-10-13 22:08:00,914 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:08:00,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:08:00,914 INFO L82 PathProgramCache]: Analyzing trace with hash 2062722488, now seen corresponding path program 1 times [2019-10-13 22:08:00,914 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:08:00,915 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806849083] [2019-10-13 22:08:00,915 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:08:00,915 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:08:00,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:08:00,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:08:01,058 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-13 22:08:01,058 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806849083] [2019-10-13 22:08:01,059 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:08:01,059 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 22:08:01,059 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709869041] [2019-10-13 22:08:01,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 22:08:01,060 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:08:01,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 22:08:01,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 22:08:01,060 INFO L87 Difference]: Start difference. First operand 1111 states and 1344 transitions. Second operand 5 states. [2019-10-13 22:08:01,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:08:01,156 INFO L93 Difference]: Finished difference Result 1163 states and 1398 transitions. [2019-10-13 22:08:01,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 22:08:01,156 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 165 [2019-10-13 22:08:01,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:08:01,165 INFO L225 Difference]: With dead ends: 1163 [2019-10-13 22:08:01,166 INFO L226 Difference]: Without dead ends: 1142 [2019-10-13 22:08:01,167 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 22:08:01,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2019-10-13 22:08:01,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1121. [2019-10-13 22:08:01,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1121 states. [2019-10-13 22:08:01,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1350 transitions. [2019-10-13 22:08:01,252 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1350 transitions. Word has length 165 [2019-10-13 22:08:01,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:08:01,253 INFO L462 AbstractCegarLoop]: Abstraction has 1121 states and 1350 transitions. [2019-10-13 22:08:01,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 22:08:01,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1350 transitions. [2019-10-13 22:08:01,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-13 22:08:01,257 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:08:01,258 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:08:01,258 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:08:01,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:08:01,259 INFO L82 PathProgramCache]: Analyzing trace with hash 888062377, now seen corresponding path program 1 times [2019-10-13 22:08:01,259 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:08:01,259 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699072831] [2019-10-13 22:08:01,259 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:08:01,259 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:08:01,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:08:01,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:08:01,439 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-13 22:08:01,439 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699072831] [2019-10-13 22:08:01,440 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107156236] [2019-10-13 22:08:01,440 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 22:08:01,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:08:01,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 1486 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 22:08:01,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:08:01,961 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-13 22:08:01,962 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:08:02,242 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-13 22:08:02,243 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 22:08:02,243 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 5 [2019-10-13 22:08:02,243 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105667845] [2019-10-13 22:08:02,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 22:08:02,244 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:08:02,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 22:08:02,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 22:08:02,244 INFO L87 Difference]: Start difference. First operand 1121 states and 1350 transitions. Second operand 4 states. [2019-10-13 22:08:02,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:08:02,332 INFO L93 Difference]: Finished difference Result 1868 states and 2217 transitions. [2019-10-13 22:08:02,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 22:08:02,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-10-13 22:08:02,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:08:02,338 INFO L225 Difference]: With dead ends: 1868 [2019-10-13 22:08:02,339 INFO L226 Difference]: Without dead ends: 842 [2019-10-13 22:08:02,342 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 334 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 22:08:02,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2019-10-13 22:08:02,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 826. [2019-10-13 22:08:02,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 826 states. [2019-10-13 22:08:02,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 944 transitions. [2019-10-13 22:08:02,404 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 944 transitions. Word has length 168 [2019-10-13 22:08:02,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:08:02,405 INFO L462 AbstractCegarLoop]: Abstraction has 826 states and 944 transitions. [2019-10-13 22:08:02,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 22:08:02,406 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 944 transitions. [2019-10-13 22:08:02,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-13 22:08:02,408 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:08:02,408 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:08:02,624 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:08:02,624 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:08:02,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:08:02,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1788904068, now seen corresponding path program 1 times [2019-10-13 22:08:02,625 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:08:02,625 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888395082] [2019-10-13 22:08:02,625 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:08:02,625 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:08:02,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:08:02,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:08:02,794 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-13 22:08:02,795 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888395082] [2019-10-13 22:08:02,795 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:08:02,795 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 22:08:02,795 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619740941] [2019-10-13 22:08:02,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 22:08:02,797 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:08:02,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 22:08:02,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 22:08:02,798 INFO L87 Difference]: Start difference. First operand 826 states and 944 transitions. Second operand 3 states. [2019-10-13 22:08:02,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:08:02,838 INFO L93 Difference]: Finished difference Result 1103 states and 1263 transitions. [2019-10-13 22:08:02,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 22:08:02,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-10-13 22:08:02,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:08:02,843 INFO L225 Difference]: With dead ends: 1103 [2019-10-13 22:08:02,843 INFO L226 Difference]: Without dead ends: 509 [2019-10-13 22:08:02,845 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 22:08:02,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2019-10-13 22:08:02,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2019-10-13 22:08:02,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-10-13 22:08:02,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 568 transitions. [2019-10-13 22:08:02,878 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 568 transitions. Word has length 183 [2019-10-13 22:08:02,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:08:02,879 INFO L462 AbstractCegarLoop]: Abstraction has 509 states and 568 transitions. [2019-10-13 22:08:02,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 22:08:02,880 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 568 transitions. [2019-10-13 22:08:02,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-13 22:08:02,882 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:08:02,882 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:08:02,883 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:08:02,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:08:02,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1236126625, now seen corresponding path program 1 times [2019-10-13 22:08:02,884 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:08:02,884 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253895620] [2019-10-13 22:08:02,884 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:08:02,884 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:08:02,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:08:03,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:08:03,519 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-13 22:08:03,519 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253895620] [2019-10-13 22:08:03,519 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:08:03,520 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 22:08:03,520 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866344507] [2019-10-13 22:08:03,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 22:08:03,522 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:08:03,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 22:08:03,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-13 22:08:03,522 INFO L87 Difference]: Start difference. First operand 509 states and 568 transitions. Second operand 8 states. [2019-10-13 22:08:04,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:08:04,640 INFO L93 Difference]: Finished difference Result 554 states and 609 transitions. [2019-10-13 22:08:04,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 22:08:04,640 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 185 [2019-10-13 22:08:04,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:08:04,644 INFO L225 Difference]: With dead ends: 554 [2019-10-13 22:08:04,644 INFO L226 Difference]: Without dead ends: 532 [2019-10-13 22:08:04,645 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-10-13 22:08:04,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-10-13 22:08:04,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 501. [2019-10-13 22:08:04,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-10-13 22:08:04,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 557 transitions. [2019-10-13 22:08:04,674 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 557 transitions. Word has length 185 [2019-10-13 22:08:04,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:08:04,675 INFO L462 AbstractCegarLoop]: Abstraction has 501 states and 557 transitions. [2019-10-13 22:08:04,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 22:08:04,675 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 557 transitions. [2019-10-13 22:08:04,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-10-13 22:08:04,678 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:08:04,678 INFO L380 BasicCegarLoop]: trace histogram [5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:08:04,678 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:08:04,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:08:04,679 INFO L82 PathProgramCache]: Analyzing trace with hash 302984622, now seen corresponding path program 1 times [2019-10-13 22:08:04,679 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:08:04,680 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576409438] [2019-10-13 22:08:04,680 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:08:04,680 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:08:04,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:08:04,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:08:04,954 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-10-13 22:08:04,955 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576409438] [2019-10-13 22:08:04,955 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:08:04,955 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 22:08:04,955 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271298784] [2019-10-13 22:08:04,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 22:08:04,958 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:08:04,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 22:08:04,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 22:08:04,963 INFO L87 Difference]: Start difference. First operand 501 states and 557 transitions. Second operand 6 states. [2019-10-13 22:08:05,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:08:05,037 INFO L93 Difference]: Finished difference Result 742 states and 825 transitions. [2019-10-13 22:08:05,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 22:08:05,038 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 215 [2019-10-13 22:08:05,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:08:05,041 INFO L225 Difference]: With dead ends: 742 [2019-10-13 22:08:05,041 INFO L226 Difference]: Without dead ends: 424 [2019-10-13 22:08:05,044 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 22:08:05,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-10-13 22:08:05,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 401. [2019-10-13 22:08:05,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2019-10-13 22:08:05,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 439 transitions. [2019-10-13 22:08:05,067 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 439 transitions. Word has length 215 [2019-10-13 22:08:05,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:08:05,067 INFO L462 AbstractCegarLoop]: Abstraction has 401 states and 439 transitions. [2019-10-13 22:08:05,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 22:08:05,068 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 439 transitions. [2019-10-13 22:08:05,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-10-13 22:08:05,070 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:08:05,071 INFO L380 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:08:05,071 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:08:05,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:08:05,072 INFO L82 PathProgramCache]: Analyzing trace with hash 808510366, now seen corresponding path program 1 times [2019-10-13 22:08:05,072 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:08:05,072 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188661905] [2019-10-13 22:08:05,072 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:08:05,072 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:08:05,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:08:05,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:08:05,590 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-13 22:08:05,590 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188661905] [2019-10-13 22:08:05,590 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107030333] [2019-10-13 22:08:05,590 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 22:08:05,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:08:05,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 1724 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-13 22:08:05,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:08:06,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:08:06,143 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-13 22:08:06,143 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:08:06,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:08:06,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:08:06,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:08:06,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:08:06,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:08:06,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:08:06,711 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 25 [2019-10-13 22:08:06,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 22:08:06,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:08:06,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:08:06,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:08:06,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:08:06,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:08:06,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:08:06,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:08:06,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:08:07,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:08:07,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:08:07,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:08:07,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:08:07,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:08:07,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:08:07,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:08:07,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:08:07,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:08:07,229 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 25 [2019-10-13 22:08:07,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:08:07,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 22:08:07,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:08:07,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:08:07,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:08:07,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:08:07,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:08:07,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:08:07,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:08:07,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:08:07,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:08:07,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:08:07,500 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-13 22:08:07,501 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1176103287] [2019-10-13 22:08:07,537 INFO L162 IcfgInterpreter]: Started Sifa with 186 locations of interest [2019-10-13 22:08:07,537 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:08:07,545 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:08:07,553 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:08:07,554 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:08:08,335 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 828 [2019-10-13 22:08:08,761 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 857 [2019-10-13 22:08:11,337 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 867 [2019-10-13 22:08:11,679 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 877 [2019-10-13 22:08:12,098 WARN L191 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 915 [2019-10-13 22:08:12,867 WARN L191 SmtUtils]: Spent 608.00 ms on a formula simplification that was a NOOP. DAG size: 966 [2019-10-13 22:08:14,044 WARN L191 SmtUtils]: Spent 456.00 ms on a formula simplification that was a NOOP. DAG size: 957 [2019-10-13 22:08:14,376 WARN L191 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 957 [2019-10-13 22:08:14,791 WARN L191 SmtUtils]: Spent 407.00 ms on a formula simplification that was a NOOP. DAG size: 957 [2019-10-13 22:08:15,135 WARN L191 SmtUtils]: Spent 327.00 ms on a formula simplification that was a NOOP. DAG size: 1001 [2019-10-13 22:08:15,487 WARN L191 SmtUtils]: Spent 342.00 ms on a formula simplification that was a NOOP. DAG size: 1001 [2019-10-13 22:08:15,785 WARN L191 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 1001