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-consumption/32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pg.ko-main.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 05:57:38,507 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 05:57:38,509 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 05:57:38,522 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 05:57:38,522 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 05:57:38,523 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 05:57:38,525 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 05:57:38,527 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 05:57:38,528 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 05:57:38,529 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 05:57:38,530 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 05:57:38,531 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 05:57:38,532 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 05:57:38,533 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 05:57:38,533 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 05:57:38,535 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 05:57:38,535 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 05:57:38,536 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 05:57:38,541 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 05:57:38,545 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 05:57:38,547 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 05:57:38,552 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 05:57:38,553 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 05:57:38,554 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 05:57:38,559 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 05:57:38,559 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 05:57:38,559 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 05:57:38,560 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 05:57:38,561 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 05:57:38,562 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 05:57:38,562 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 05:57:38,563 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 05:57:38,565 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 05:57:38,565 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 05:57:38,566 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 05:57:38,566 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 05:57:38,567 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 05:57:38,567 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 05:57:38,567 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 05:57:38,568 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 05:57:38,569 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 05:57:38,570 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-07 05:57:38,584 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 05:57:38,584 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 05:57:38,585 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 05:57:38,586 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 05:57:38,586 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 05:57:38,586 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 05:57:38,586 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 05:57:38,587 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 05:57:38,587 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 05:57:38,587 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 05:57:38,587 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 05:57:38,587 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 05:57:38,588 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 05:57:38,588 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 05:57:38,588 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 05:57:38,588 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 05:57:38,588 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 05:57:38,589 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 05:57:38,589 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 05:57:38,589 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 05:57:38,589 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 05:57:38,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 05:57:38,590 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 05:57:38,590 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 05:57:38,590 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 05:57:38,590 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 05:57:38,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 05:57:38,591 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 05:57:38,591 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-07 05:57:38,896 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 05:57:38,917 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 05:57:38,920 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 05:57:38,921 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 05:57:38,921 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 05:57:38,922 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pg.ko-main.cil.out.i [2019-10-07 05:57:39,014 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a198ff61/3dbd9200f4d141738e34742dfe1b4c62/FLAG846297a3b [2019-10-07 05:57:39,703 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 05:57:39,704 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pg.ko-main.cil.out.i [2019-10-07 05:57:39,757 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a198ff61/3dbd9200f4d141738e34742dfe1b4c62/FLAG846297a3b [2019-10-07 05:57:39,804 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a198ff61/3dbd9200f4d141738e34742dfe1b4c62 [2019-10-07 05:57:39,814 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 05:57:39,816 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 05:57:39,817 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 05:57:39,817 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 05:57:39,821 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 05:57:39,822 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 05:57:39" (1/1) ... [2019-10-07 05:57:39,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cee1a4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:57:39, skipping insertion in model container [2019-10-07 05:57:39,825 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 05:57:39" (1/1) ... [2019-10-07 05:57:39,833 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 05:57:39,926 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 05:57:41,262 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 05:57:41,324 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 05:57:41,583 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 05:57:41,717 INFO L192 MainTranslator]: Completed translation [2019-10-07 05:57:41,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:57:41 WrapperNode [2019-10-07 05:57:41,718 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 05:57:41,719 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 05:57:41,720 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 05:57:41,720 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 05:57:41,743 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:57:41" (1/1) ... [2019-10-07 05:57:41,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:57:41" (1/1) ... [2019-10-07 05:57:41,841 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:57:41" (1/1) ... [2019-10-07 05:57:41,842 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:57:41" (1/1) ... [2019-10-07 05:57:41,933 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:57:41" (1/1) ... [2019-10-07 05:57:41,948 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:57:41" (1/1) ... [2019-10-07 05:57:41,964 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:57:41" (1/1) ... [2019-10-07 05:57:42,006 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 05:57:42,006 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 05:57:42,007 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 05:57:42,007 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 05:57:42,010 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:57:41" (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-07 05:57:42,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 05:57:42,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 05:57:42,116 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2019-10-07 05:57:42,117 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2019-10-07 05:57:42,117 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2019-10-07 05:57:42,117 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2019-10-07 05:57:42,118 INFO L138 BoogieDeclarations]: Found implementation of procedure iminor [2019-10-07 05:57:42,118 INFO L138 BoogieDeclarations]: Found implementation of procedure register_chrdev [2019-10-07 05:57:42,118 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_chrdev [2019-10-07 05:57:42,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2019-10-07 05:57:42,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-10-07 05:57:42,119 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2019-10-07 05:57:42,119 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2019-10-07 05:57:42,119 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2019-10-07 05:57:42,120 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2019-10-07 05:57:42,120 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_init_units [2019-10-07 05:57:42,120 INFO L138 BoogieDeclarations]: Found implementation of procedure status_reg [2019-10-07 05:57:42,120 INFO L138 BoogieDeclarations]: Found implementation of procedure read_reg [2019-10-07 05:57:42,121 INFO L138 BoogieDeclarations]: Found implementation of procedure write_reg [2019-10-07 05:57:42,121 INFO L138 BoogieDeclarations]: Found implementation of procedure DRIVE [2019-10-07 05:57:42,121 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_sleep [2019-10-07 05:57:42,121 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_wait [2019-10-07 05:57:42,122 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_command [2019-10-07 05:57:42,122 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_completion [2019-10-07 05:57:42,122 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_reset [2019-10-07 05:57:42,122 INFO L138 BoogieDeclarations]: Found implementation of procedure xs [2019-10-07 05:57:42,123 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_identify [2019-10-07 05:57:42,123 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_probe [2019-10-07 05:57:42,123 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_detect [2019-10-07 05:57:42,123 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_open [2019-10-07 05:57:42,123 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_release [2019-10-07 05:57:42,124 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_write [2019-10-07 05:57:42,124 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_read [2019-10-07 05:57:42,124 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_init [2019-10-07 05:57:42,124 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_exit [2019-10-07 05:57:42,124 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 05:57:42,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_1 [2019-10-07 05:57:42,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_2 [2019-10-07 05:57:42,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_3 [2019-10-07 05:57:42,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_4 [2019-10-07 05:57:42,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_5 [2019-10-07 05:57:42,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_6 [2019-10-07 05:57:42,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_7 [2019-10-07 05:57:42,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_8 [2019-10-07 05:57:42,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_9 [2019-10-07 05:57:42,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_register_chrdev_10 [2019-10-07 05:57:42,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_unregister_chrdev_11 [2019-10-07 05:57:42,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-10-07 05:57:42,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-10-07 05:57:42,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_trap [2019-10-07 05:57:42,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_cred_guard_mutex_of_signal_struct [2019-10-07 05:57:42,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_cred_guard_mutex_of_signal_struct [2019-10-07 05:57:42,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_cred_guard_mutex_of_signal_struct [2019-10-07 05:57:42,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_cred_guard_mutex_of_signal_struct [2019-10-07 05:57:42,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_cred_guard_mutex_of_signal_struct [2019-10-07 05:57:42,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_cred_guard_mutex_of_signal_struct [2019-10-07 05:57:42,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_cred_guard_mutex_of_signal_struct [2019-10-07 05:57:42,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_lock [2019-10-07 05:57:42,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_lock [2019-10-07 05:57:42,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_lock [2019-10-07 05:57:42,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_lock [2019-10-07 05:57:42,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_lock [2019-10-07 05:57:42,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_lock [2019-10-07 05:57:42,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_lock [2019-10-07 05:57:42,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_mutex_of_device [2019-10-07 05:57:42,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_mutex_of_device [2019-10-07 05:57:42,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mutex_of_device [2019-10-07 05:57:42,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_mutex_of_device [2019-10-07 05:57:42,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_mutex_of_device [2019-10-07 05:57:42,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_mutex_of_device [2019-10-07 05:57:42,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mutex_of_device [2019-10-07 05:57:42,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_pg_mutex [2019-10-07 05:57:42,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_pg_mutex [2019-10-07 05:57:42,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_pg_mutex [2019-10-07 05:57:42,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_pg_mutex [2019-10-07 05:57:42,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_pg_mutex [2019-10-07 05:57:42,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_pg_mutex [2019-10-07 05:57:42,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_pg_mutex [2019-10-07 05:57:42,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-10-07 05:57:42,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-10-07 05:57:42,133 INFO L138 BoogieDeclarations]: Found implementation of procedure __class_create [2019-10-07 05:57:42,133 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2019-10-07 05:57:42,133 INFO L138 BoogieDeclarations]: Found implementation of procedure __register_chrdev [2019-10-07 05:57:42,134 INFO L138 BoogieDeclarations]: Found implementation of procedure __unregister_chrdev [2019-10-07 05:57:42,134 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2019-10-07 05:57:42,134 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2019-10-07 05:57:42,134 INFO L138 BoogieDeclarations]: Found implementation of procedure class_destroy [2019-10-07 05:57:42,134 INFO L138 BoogieDeclarations]: Found implementation of procedure device_create [2019-10-07 05:57:42,135 INFO L138 BoogieDeclarations]: Found implementation of procedure device_destroy [2019-10-07 05:57:42,135 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2019-10-07 05:57:42,135 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2019-10-07 05:57:42,135 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_trylock [2019-10-07 05:57:42,135 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2019-10-07 05:57:42,136 INFO L138 BoogieDeclarations]: Found implementation of procedure noop_llseek [2019-10-07 05:57:42,136 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_connect [2019-10-07 05:57:42,136 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_disconnect [2019-10-07 05:57:42,136 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_init [2019-10-07 05:57:42,136 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_read_block [2019-10-07 05:57:42,136 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_read_regr [2019-10-07 05:57:42,137 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_release [2019-10-07 05:57:42,137 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_write_block [2019-10-07 05:57:42,137 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_write_regr [2019-10-07 05:57:42,137 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-10-07 05:57:42,137 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_timeout_interruptible [2019-10-07 05:57:42,138 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_fmt [2019-10-07 05:57:42,138 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-10-07 05:57:42,138 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-10-07 05:57:42,138 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-10-07 05:57:42,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 05:57:42,139 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 05:57:42,139 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-10-07 05:57:42,139 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2019-10-07 05:57:42,139 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2019-10-07 05:57:42,139 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-10-07 05:57:42,140 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2019-10-07 05:57:42,140 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2019-10-07 05:57:42,140 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-10-07 05:57:42,140 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2019-10-07 05:57:42,140 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_fmt [2019-10-07 05:57:42,198 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2019-10-07 05:57:42,199 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2019-10-07 05:57:42,199 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_trylock [2019-10-07 05:57:42,199 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_4 [2019-10-07 05:57:42,199 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2019-10-07 05:57:42,199 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_2 [2019-10-07 05:57:42,199 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_5 [2019-10-07 05:57:42,200 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_7 [2019-10-07 05:57:42,200 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_9 [2019-10-07 05:57:42,200 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2019-10-07 05:57:42,200 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_1 [2019-10-07 05:57:42,200 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_3 [2019-10-07 05:57:42,200 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_6 [2019-10-07 05:57:42,201 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_8 [2019-10-07 05:57:42,201 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_cred_guard_mutex_of_signal_struct [2019-10-07 05:57:42,201 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_cred_guard_mutex_of_signal_struct [2019-10-07 05:57:42,201 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_lock [2019-10-07 05:57:42,201 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_lock [2019-10-07 05:57:42,202 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mutex_of_device [2019-10-07 05:57:42,202 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_mutex_of_device [2019-10-07 05:57:42,202 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mutex_of_device [2019-10-07 05:57:42,202 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_pg_mutex [2019-10-07 05:57:42,202 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_pg_mutex [2019-10-07 05:57:42,202 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 05:57:42,203 INFO L130 BoogieDeclarations]: Found specification of procedure iminor [2019-10-07 05:57:42,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 05:57:42,203 INFO L130 BoogieDeclarations]: Found specification of procedure __register_chrdev [2019-10-07 05:57:42,203 INFO L130 BoogieDeclarations]: Found specification of procedure __unregister_chrdev [2019-10-07 05:57:42,203 INFO L130 BoogieDeclarations]: Found specification of procedure register_chrdev [2019-10-07 05:57:42,203 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_register_chrdev_10 [2019-10-07 05:57:42,204 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_chrdev [2019-10-07 05:57:42,204 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_unregister_chrdev_11 [2019-10-07 05:57:42,204 INFO L130 BoogieDeclarations]: Found specification of procedure noop_llseek [2019-10-07 05:57:42,204 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2019-10-07 05:57:42,204 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-10-07 05:57:42,204 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-07 05:57:42,205 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-07 05:57:42,205 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2019-10-07 05:57:42,205 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-10-07 05:57:42,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-07 05:57:42,205 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2019-10-07 05:57:42,205 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2019-10-07 05:57:42,206 INFO L130 BoogieDeclarations]: Found specification of procedure __class_create [2019-10-07 05:57:42,206 INFO L130 BoogieDeclarations]: Found specification of procedure class_destroy [2019-10-07 05:57:42,206 INFO L130 BoogieDeclarations]: Found specification of procedure device_create [2019-10-07 05:57:42,206 INFO L130 BoogieDeclarations]: Found specification of procedure device_destroy [2019-10-07 05:57:42,206 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_timeout_interruptible [2019-10-07 05:57:42,206 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2019-10-07 05:57:42,207 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2019-10-07 05:57:42,207 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2019-10-07 05:57:42,207 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2019-10-07 05:57:42,207 INFO L130 BoogieDeclarations]: Found specification of procedure pi_init [2019-10-07 05:57:42,207 INFO L130 BoogieDeclarations]: Found specification of procedure pi_release [2019-10-07 05:57:42,208 INFO L130 BoogieDeclarations]: Found specification of procedure pi_write_regr [2019-10-07 05:57:42,208 INFO L130 BoogieDeclarations]: Found specification of procedure pi_read_regr [2019-10-07 05:57:42,208 INFO L130 BoogieDeclarations]: Found specification of procedure pi_write_block [2019-10-07 05:57:42,208 INFO L130 BoogieDeclarations]: Found specification of procedure pi_read_block [2019-10-07 05:57:42,209 INFO L130 BoogieDeclarations]: Found specification of procedure pi_connect [2019-10-07 05:57:42,209 INFO L130 BoogieDeclarations]: Found specification of procedure pi_disconnect [2019-10-07 05:57:42,209 INFO L130 BoogieDeclarations]: Found specification of procedure pg_open [2019-10-07 05:57:42,209 INFO L130 BoogieDeclarations]: Found specification of procedure pg_release [2019-10-07 05:57:42,209 INFO L130 BoogieDeclarations]: Found specification of procedure pg_read [2019-10-07 05:57:42,210 INFO L130 BoogieDeclarations]: Found specification of procedure pg_write [2019-10-07 05:57:42,210 INFO L130 BoogieDeclarations]: Found specification of procedure pg_detect [2019-10-07 05:57:42,210 INFO L130 BoogieDeclarations]: Found specification of procedure pg_identify [2019-10-07 05:57:42,210 INFO L130 BoogieDeclarations]: Found specification of procedure pg_init_units [2019-10-07 05:57:42,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-07 05:57:42,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-07 05:57:42,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 05:57:42,211 INFO L130 BoogieDeclarations]: Found specification of procedure status_reg [2019-10-07 05:57:42,211 INFO L130 BoogieDeclarations]: Found specification of procedure read_reg [2019-10-07 05:57:42,212 INFO L130 BoogieDeclarations]: Found specification of procedure write_reg [2019-10-07 05:57:42,212 INFO L130 BoogieDeclarations]: Found specification of procedure DRIVE [2019-10-07 05:57:42,212 INFO L130 BoogieDeclarations]: Found specification of procedure pg_sleep [2019-10-07 05:57:42,212 INFO L130 BoogieDeclarations]: Found specification of procedure pg_wait [2019-10-07 05:57:42,212 INFO L130 BoogieDeclarations]: Found specification of procedure pg_command [2019-10-07 05:57:42,213 INFO L130 BoogieDeclarations]: Found specification of procedure pg_completion [2019-10-07 05:57:42,213 INFO L130 BoogieDeclarations]: Found specification of procedure pg_reset [2019-10-07 05:57:42,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 05:57:42,213 INFO L130 BoogieDeclarations]: Found specification of procedure xs [2019-10-07 05:57:42,214 INFO L130 BoogieDeclarations]: Found specification of procedure pg_probe [2019-10-07 05:57:42,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-10-07 05:57:42,214 INFO L130 BoogieDeclarations]: Found specification of procedure pg_init [2019-10-07 05:57:42,214 INFO L130 BoogieDeclarations]: Found specification of procedure pg_exit [2019-10-07 05:57:42,214 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-10-07 05:57:42,215 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-10-07 05:57:42,215 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 05:57:42,215 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-10-07 05:57:42,215 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_trap [2019-10-07 05:57:42,216 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_cred_guard_mutex_of_signal_struct [2019-10-07 05:57:42,216 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_cred_guard_mutex_of_signal_struct [2019-10-07 05:57:42,216 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_cred_guard_mutex_of_signal_struct [2019-10-07 05:57:42,216 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_cred_guard_mutex_of_signal_struct [2019-10-07 05:57:42,216 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_cred_guard_mutex_of_signal_struct [2019-10-07 05:57:42,216 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_lock [2019-10-07 05:57:42,217 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_lock [2019-10-07 05:57:42,217 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_lock [2019-10-07 05:57:42,217 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_lock [2019-10-07 05:57:42,217 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_lock [2019-10-07 05:57:42,217 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_mutex_of_device [2019-10-07 05:57:42,218 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_mutex_of_device [2019-10-07 05:57:42,218 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_mutex_of_device [2019-10-07 05:57:42,218 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_mutex_of_device [2019-10-07 05:57:42,218 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_pg_mutex [2019-10-07 05:57:42,218 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_pg_mutex [2019-10-07 05:57:42,219 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_pg_mutex [2019-10-07 05:57:42,219 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_pg_mutex [2019-10-07 05:57:42,219 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_pg_mutex [2019-10-07 05:57:42,219 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-10-07 05:57:42,220 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-10-07 05:57:42,220 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-07 05:57:42,220 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-07 05:57:42,220 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-07 05:57:42,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 05:57:42,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-07 05:57:42,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-07 05:57:42,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 05:57:47,037 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 05:57:47,037 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-07 05:57:47,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 05:57:47 BoogieIcfgContainer [2019-10-07 05:57:47,039 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 05:57:47,041 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 05:57:47,041 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 05:57:47,046 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 05:57:47,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 05:57:39" (1/3) ... [2019-10-07 05:57:47,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bc4dca9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 05:57:47, skipping insertion in model container [2019-10-07 05:57:47,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:57:41" (2/3) ... [2019-10-07 05:57:47,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bc4dca9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 05:57:47, skipping insertion in model container [2019-10-07 05:57:47,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 05:57:47" (3/3) ... [2019-10-07 05:57:47,050 INFO L109 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pg.ko-main.cil.out.i [2019-10-07 05:57:47,063 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 05:57:47,075 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 05:57:47,091 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 05:57:47,127 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 05:57:47,127 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 05:57:47,127 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 05:57:47,127 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 05:57:47,128 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 05:57:47,128 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 05:57:47,128 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 05:57:47,128 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 05:57:47,164 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states. [2019-10-07 05:57:47,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-07 05:57:47,175 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 05:57:47,177 INFO L385 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] [2019-10-07 05:57:47,179 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 05:57:47,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 05:57:47,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1809528212, now seen corresponding path program 1 times [2019-10-07 05:57:47,199 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 05:57:47,200 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:57:47,200 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:57:47,201 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:57:47,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 05:57:47,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 05:57:47,824 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-07 05:57:47,824 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:57:47,827 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 05:57:47,827 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 05:57:47,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 05:57:47,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 05:57:47,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 05:57:47,851 INFO L87 Difference]: Start difference. First operand 552 states. Second operand 4 states. [2019-10-07 05:57:48,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 05:57:48,762 INFO L93 Difference]: Finished difference Result 958 states and 1262 transitions. [2019-10-07 05:57:48,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 05:57:48,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-10-07 05:57:48,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 05:57:48,786 INFO L225 Difference]: With dead ends: 958 [2019-10-07 05:57:48,787 INFO L226 Difference]: Without dead ends: 477 [2019-10-07 05:57:48,796 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 05:57:48,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-10-07 05:57:48,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2019-10-07 05:57:48,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-10-07 05:57:48,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 618 transitions. [2019-10-07 05:57:48,897 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 618 transitions. Word has length 27 [2019-10-07 05:57:48,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 05:57:48,898 INFO L462 AbstractCegarLoop]: Abstraction has 477 states and 618 transitions. [2019-10-07 05:57:48,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 05:57:48,898 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 618 transitions. [2019-10-07 05:57:48,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-07 05:57:48,902 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 05:57:48,902 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 05:57:48,902 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 05:57:48,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 05:57:48,903 INFO L82 PathProgramCache]: Analyzing trace with hash -196163103, now seen corresponding path program 1 times [2019-10-07 05:57:48,903 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 05:57:48,903 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:57:48,903 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:57:48,904 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:57:48,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 05:57:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 05:57:49,078 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-07 05:57:49,079 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:57:49,080 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 05:57:49,081 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 05:57:49,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 05:57:49,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 05:57:49,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 05:57:49,089 INFO L87 Difference]: Start difference. First operand 477 states and 618 transitions. Second operand 3 states. [2019-10-07 05:57:49,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 05:57:49,417 INFO L93 Difference]: Finished difference Result 1202 states and 1566 transitions. [2019-10-07 05:57:49,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 05:57:49,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-07 05:57:49,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 05:57:49,424 INFO L225 Difference]: With dead ends: 1202 [2019-10-07 05:57:49,425 INFO L226 Difference]: Without dead ends: 734 [2019-10-07 05:57:49,428 INFO L606 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-07 05:57:49,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2019-10-07 05:57:49,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 692. [2019-10-07 05:57:49,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 692 states. [2019-10-07 05:57:49,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 907 transitions. [2019-10-07 05:57:49,514 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 907 transitions. Word has length 31 [2019-10-07 05:57:49,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 05:57:49,514 INFO L462 AbstractCegarLoop]: Abstraction has 692 states and 907 transitions. [2019-10-07 05:57:49,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 05:57:49,515 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 907 transitions. [2019-10-07 05:57:49,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-07 05:57:49,517 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 05:57:49,517 INFO L385 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] [2019-10-07 05:57:49,517 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 05:57:49,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 05:57:49,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1571763004, now seen corresponding path program 1 times [2019-10-07 05:57:49,518 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 05:57:49,518 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:57:49,518 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:57:49,518 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:57:49,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 05:57:49,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 05:57:49,634 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-07 05:57:49,635 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:57:49,635 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 05:57:49,635 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 05:57:49,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 05:57:49,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 05:57:49,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 05:57:49,637 INFO L87 Difference]: Start difference. First operand 692 states and 907 transitions. Second operand 3 states. [2019-10-07 05:57:49,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 05:57:49,708 INFO L93 Difference]: Finished difference Result 1381 states and 1821 transitions. [2019-10-07 05:57:49,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 05:57:49,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-10-07 05:57:49,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 05:57:49,714 INFO L225 Difference]: With dead ends: 1381 [2019-10-07 05:57:49,715 INFO L226 Difference]: Without dead ends: 698 [2019-10-07 05:57:49,718 INFO L606 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-07 05:57:49,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2019-10-07 05:57:49,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 694. [2019-10-07 05:57:49,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2019-10-07 05:57:49,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 909 transitions. [2019-10-07 05:57:49,778 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 909 transitions. Word has length 38 [2019-10-07 05:57:49,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 05:57:49,779 INFO L462 AbstractCegarLoop]: Abstraction has 694 states and 909 transitions. [2019-10-07 05:57:49,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 05:57:49,779 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 909 transitions. [2019-10-07 05:57:49,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-07 05:57:49,785 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 05:57:49,786 INFO L385 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] [2019-10-07 05:57:49,786 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 05:57:49,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 05:57:49,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1304531917, now seen corresponding path program 1 times [2019-10-07 05:57:49,787 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 05:57:49,787 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:57:49,787 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:57:49,787 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:57:49,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 05:57:49,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 05:57:49,947 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-07 05:57:49,947 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:57:49,948 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 05:57:49,948 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 05:57:49,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 05:57:49,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 05:57:49,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 05:57:49,951 INFO L87 Difference]: Start difference. First operand 694 states and 909 transitions. Second operand 3 states. [2019-10-07 05:57:50,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 05:57:50,269 INFO L93 Difference]: Finished difference Result 1548 states and 2025 transitions. [2019-10-07 05:57:50,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 05:57:50,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-10-07 05:57:50,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 05:57:50,276 INFO L225 Difference]: With dead ends: 1548 [2019-10-07 05:57:50,276 INFO L226 Difference]: Without dead ends: 863 [2019-10-07 05:57:50,279 INFO L606 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-07 05:57:50,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2019-10-07 05:57:50,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 863. [2019-10-07 05:57:50,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2019-10-07 05:57:50,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1122 transitions. [2019-10-07 05:57:50,341 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1122 transitions. Word has length 40 [2019-10-07 05:57:50,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 05:57:50,342 INFO L462 AbstractCegarLoop]: Abstraction has 863 states and 1122 transitions. [2019-10-07 05:57:50,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 05:57:50,342 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1122 transitions. [2019-10-07 05:57:50,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-07 05:57:50,344 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 05:57:50,345 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 05:57:50,345 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 05:57:50,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 05:57:50,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1084538513, now seen corresponding path program 1 times [2019-10-07 05:57:50,346 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 05:57:50,346 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:57:50,346 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:57:50,346 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:57:50,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 05:57:50,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 05:57:50,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 05:57:50,503 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:57:50,503 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 05:57:50,503 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 05:57:50,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 05:57:50,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 05:57:50,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 05:57:50,504 INFO L87 Difference]: Start difference. First operand 863 states and 1122 transitions. Second operand 3 states. [2019-10-07 05:57:50,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 05:57:50,690 INFO L93 Difference]: Finished difference Result 865 states and 1123 transitions. [2019-10-07 05:57:50,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 05:57:50,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-07 05:57:50,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 05:57:50,697 INFO L225 Difference]: With dead ends: 865 [2019-10-07 05:57:50,697 INFO L226 Difference]: Without dead ends: 862 [2019-10-07 05:57:50,698 INFO L606 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-07 05:57:50,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2019-10-07 05:57:50,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 862. [2019-10-07 05:57:50,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 862 states. [2019-10-07 05:57:50,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1120 transitions. [2019-10-07 05:57:50,761 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1120 transitions. Word has length 43 [2019-10-07 05:57:50,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 05:57:50,762 INFO L462 AbstractCegarLoop]: Abstraction has 862 states and 1120 transitions. [2019-10-07 05:57:50,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 05:57:50,762 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1120 transitions. [2019-10-07 05:57:50,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-07 05:57:50,763 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 05:57:50,763 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 05:57:50,764 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 05:57:50,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 05:57:50,764 INFO L82 PathProgramCache]: Analyzing trace with hash 738650742, now seen corresponding path program 1 times [2019-10-07 05:57:50,765 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 05:57:50,765 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:57:50,765 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:57:50,765 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:57:50,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 05:57:50,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 05:57:50,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 05:57:50,988 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:57:50,988 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 05:57:50,988 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 05:57:50,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 05:57:50,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 05:57:50,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 05:57:50,989 INFO L87 Difference]: Start difference. First operand 862 states and 1120 transitions. Second operand 3 states. [2019-10-07 05:57:51,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 05:57:51,185 INFO L93 Difference]: Finished difference Result 864 states and 1121 transitions. [2019-10-07 05:57:51,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 05:57:51,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-10-07 05:57:51,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 05:57:51,192 INFO L225 Difference]: With dead ends: 864 [2019-10-07 05:57:51,192 INFO L226 Difference]: Without dead ends: 861 [2019-10-07 05:57:51,193 INFO L606 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-07 05:57:51,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2019-10-07 05:57:51,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 861. [2019-10-07 05:57:51,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861 states. [2019-10-07 05:57:51,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1118 transitions. [2019-10-07 05:57:51,248 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1118 transitions. Word has length 44 [2019-10-07 05:57:51,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 05:57:51,249 INFO L462 AbstractCegarLoop]: Abstraction has 861 states and 1118 transitions. [2019-10-07 05:57:51,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 05:57:51,249 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1118 transitions. [2019-10-07 05:57:51,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-07 05:57:51,250 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 05:57:51,250 INFO L385 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] [2019-10-07 05:57:51,251 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 05:57:51,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 05:57:51,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1422947666, now seen corresponding path program 1 times [2019-10-07 05:57:51,251 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 05:57:51,251 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:57:51,251 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:57:51,252 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:57:51,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 05:57:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 05:57:51,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 05:57:51,364 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:57:51,364 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 05:57:51,365 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 05:57:51,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 05:57:51,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 05:57:51,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 05:57:51,366 INFO L87 Difference]: Start difference. First operand 861 states and 1118 transitions. Second operand 3 states. [2019-10-07 05:57:51,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 05:57:51,656 INFO L93 Difference]: Finished difference Result 863 states and 1119 transitions. [2019-10-07 05:57:51,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 05:57:51,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-10-07 05:57:51,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 05:57:51,665 INFO L225 Difference]: With dead ends: 863 [2019-10-07 05:57:51,666 INFO L226 Difference]: Without dead ends: 860 [2019-10-07 05:57:51,667 INFO L606 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-07 05:57:51,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2019-10-07 05:57:51,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 860. [2019-10-07 05:57:51,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 860 states. [2019-10-07 05:57:51,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1116 transitions. [2019-10-07 05:57:51,741 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1116 transitions. Word has length 45 [2019-10-07 05:57:51,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 05:57:51,747 INFO L462 AbstractCegarLoop]: Abstraction has 860 states and 1116 transitions. [2019-10-07 05:57:51,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 05:57:51,747 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1116 transitions. [2019-10-07 05:57:51,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-07 05:57:51,749 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 05:57:51,749 INFO L385 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] [2019-10-07 05:57:51,749 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 05:57:51,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 05:57:51,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1161320697, now seen corresponding path program 1 times [2019-10-07 05:57:51,750 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 05:57:51,751 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:57:51,751 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:57:51,752 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:57:51,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 05:57:51,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 05:57:51,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 05:57:51,913 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:57:51,913 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 05:57:51,913 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 05:57:51,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 05:57:51,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 05:57:51,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 05:57:51,915 INFO L87 Difference]: Start difference. First operand 860 states and 1116 transitions. Second operand 3 states. [2019-10-07 05:57:52,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 05:57:52,161 INFO L93 Difference]: Finished difference Result 991 states and 1283 transitions. [2019-10-07 05:57:52,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 05:57:52,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-10-07 05:57:52,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 05:57:52,170 INFO L225 Difference]: With dead ends: 991 [2019-10-07 05:57:52,170 INFO L226 Difference]: Without dead ends: 950 [2019-10-07 05:57:52,171 INFO L606 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-07 05:57:52,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2019-10-07 05:57:52,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950. [2019-10-07 05:57:52,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2019-10-07 05:57:52,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1234 transitions. [2019-10-07 05:57:52,229 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1234 transitions. Word has length 46 [2019-10-07 05:57:52,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 05:57:52,231 INFO L462 AbstractCegarLoop]: Abstraction has 950 states and 1234 transitions. [2019-10-07 05:57:52,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 05:57:52,231 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1234 transitions. [2019-10-07 05:57:52,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-07 05:57:52,235 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 05:57:52,235 INFO L385 BasicCegarLoop]: trace histogram [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] [2019-10-07 05:57:52,236 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 05:57:52,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 05:57:52,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1346056143, now seen corresponding path program 1 times [2019-10-07 05:57:52,236 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 05:57:52,236 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:57:52,236 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:57:52,237 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:57:52,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 05:57:52,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 05:57:52,393 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 05:57:52,393 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:57:52,393 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 05:57:52,394 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 05:57:52,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 05:57:52,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 05:57:52,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 05:57:52,395 INFO L87 Difference]: Start difference. First operand 950 states and 1234 transitions. Second operand 6 states. [2019-10-07 05:57:52,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 05:57:52,565 INFO L93 Difference]: Finished difference Result 1916 states and 2500 transitions. [2019-10-07 05:57:52,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 05:57:52,566 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2019-10-07 05:57:52,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 05:57:52,573 INFO L225 Difference]: With dead ends: 1916 [2019-10-07 05:57:52,573 INFO L226 Difference]: Without dead ends: 984 [2019-10-07 05:57:52,577 INFO L606 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-07 05:57:52,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2019-10-07 05:57:52,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 984. [2019-10-07 05:57:52,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-10-07 05:57:52,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1282 transitions. [2019-10-07 05:57:52,645 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1282 transitions. Word has length 89 [2019-10-07 05:57:52,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 05:57:52,645 INFO L462 AbstractCegarLoop]: Abstraction has 984 states and 1282 transitions. [2019-10-07 05:57:52,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 05:57:52,645 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1282 transitions. [2019-10-07 05:57:52,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-07 05:57:52,648 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 05:57:52,648 INFO L385 BasicCegarLoop]: trace histogram [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] [2019-10-07 05:57:52,648 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 05:57:52,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 05:57:52,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1383285675, now seen corresponding path program 1 times [2019-10-07 05:57:52,649 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 05:57:52,649 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:57:52,649 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:57:52,649 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:57:52,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 05:57:52,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 05:57:52,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 05:57:52,796 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:57:52,796 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 05:57:52,797 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 05:57:52,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 05:57:52,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 05:57:52,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 05:57:52,798 INFO L87 Difference]: Start difference. First operand 984 states and 1282 transitions. Second operand 4 states. [2019-10-07 05:57:53,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 05:57:53,524 INFO L93 Difference]: Finished difference Result 1956 states and 2568 transitions. [2019-10-07 05:57:53,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 05:57:53,524 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-10-07 05:57:53,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 05:57:53,531 INFO L225 Difference]: With dead ends: 1956 [2019-10-07 05:57:53,531 INFO L226 Difference]: Without dead ends: 990 [2019-10-07 05:57:53,536 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 05:57:53,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2019-10-07 05:57:53,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 988. [2019-10-07 05:57:53,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-10-07 05:57:53,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1286 transitions. [2019-10-07 05:57:53,604 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1286 transitions. Word has length 104 [2019-10-07 05:57:53,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 05:57:53,605 INFO L462 AbstractCegarLoop]: Abstraction has 988 states and 1286 transitions. [2019-10-07 05:57:53,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 05:57:53,605 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1286 transitions. [2019-10-07 05:57:53,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-07 05:57:53,608 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 05:57:53,608 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 05:57:53,609 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 05:57:53,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 05:57:53,609 INFO L82 PathProgramCache]: Analyzing trace with hash 400440286, now seen corresponding path program 1 times [2019-10-07 05:57:53,609 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 05:57:53,609 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:57:53,610 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:57:53,610 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:57:53,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 05:57:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 05:57:53,752 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-07 05:57:53,752 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:57:53,752 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 05:57:53,753 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 05:57:53,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 05:57:53,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 05:57:53,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 05:57:53,754 INFO L87 Difference]: Start difference. First operand 988 states and 1286 transitions. Second operand 4 states. [2019-10-07 05:57:53,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 05:57:53,858 INFO L93 Difference]: Finished difference Result 2026 states and 2681 transitions. [2019-10-07 05:57:53,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 05:57:53,859 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-10-07 05:57:53,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 05:57:53,867 INFO L225 Difference]: With dead ends: 2026 [2019-10-07 05:57:53,868 INFO L226 Difference]: Without dead ends: 1056 [2019-10-07 05:57:53,873 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 05:57:53,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2019-10-07 05:57:54,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 996. [2019-10-07 05:57:54,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 996 states. [2019-10-07 05:57:54,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1294 transitions. [2019-10-07 05:57:54,025 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1294 transitions. Word has length 147 [2019-10-07 05:57:54,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 05:57:54,026 INFO L462 AbstractCegarLoop]: Abstraction has 996 states and 1294 transitions. [2019-10-07 05:57:54,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 05:57:54,026 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1294 transitions. [2019-10-07 05:57:54,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-07 05:57:54,032 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 05:57:54,033 INFO L385 BasicCegarLoop]: trace histogram [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] [2019-10-07 05:57:54,033 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 05:57:54,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 05:57:54,033 INFO L82 PathProgramCache]: Analyzing trace with hash 412473398, now seen corresponding path program 1 times [2019-10-07 05:57:54,034 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 05:57:54,034 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:57:54,034 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:57:54,034 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:57:54,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 05:57:54,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 05:57:54,188 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-07 05:57:54,189 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:57:54,189 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 05:57:54,189 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 05:57:54,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 05:57:54,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 05:57:54,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 05:57:54,191 INFO L87 Difference]: Start difference. First operand 996 states and 1294 transitions. Second operand 3 states. [2019-10-07 05:57:54,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 05:57:54,278 INFO L93 Difference]: Finished difference Result 1990 states and 2619 transitions. [2019-10-07 05:57:54,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 05:57:54,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-10-07 05:57:54,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 05:57:54,286 INFO L225 Difference]: With dead ends: 1990 [2019-10-07 05:57:54,287 INFO L226 Difference]: Without dead ends: 1012 [2019-10-07 05:57:54,292 INFO L606 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-07 05:57:54,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2019-10-07 05:57:54,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 1004. [2019-10-07 05:57:54,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1004 states. [2019-10-07 05:57:54,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1302 transitions. [2019-10-07 05:57:54,352 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1302 transitions. Word has length 156 [2019-10-07 05:57:54,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 05:57:54,353 INFO L462 AbstractCegarLoop]: Abstraction has 1004 states and 1302 transitions. [2019-10-07 05:57:54,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 05:57:54,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1302 transitions. [2019-10-07 05:57:54,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-07 05:57:54,357 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 05:57:54,357 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 05:57:54,358 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 05:57:54,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 05:57:54,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1369600157, now seen corresponding path program 1 times [2019-10-07 05:57:54,358 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 05:57:54,358 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:57:54,359 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:57:54,359 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:57:54,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 05:57:54,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 05:57:54,561 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 05:57:54,561 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:57:54,561 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 05:57:54,562 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 05:57:54,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 05:57:54,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 05:57:54,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 05:57:54,564 INFO L87 Difference]: Start difference. First operand 1004 states and 1302 transitions. Second operand 5 states. [2019-10-07 05:57:54,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 05:57:54,643 INFO L93 Difference]: Finished difference Result 2006 states and 2612 transitions. [2019-10-07 05:57:54,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 05:57:54,643 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 165 [2019-10-07 05:57:54,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 05:57:54,650 INFO L225 Difference]: With dead ends: 2006 [2019-10-07 05:57:54,651 INFO L226 Difference]: Without dead ends: 1020 [2019-10-07 05:57:54,655 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 05:57:54,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2019-10-07 05:57:54,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 1012. [2019-10-07 05:57:54,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1012 states. [2019-10-07 05:57:54,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1314 transitions. [2019-10-07 05:57:54,722 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1314 transitions. Word has length 165 [2019-10-07 05:57:54,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 05:57:54,723 INFO L462 AbstractCegarLoop]: Abstraction has 1012 states and 1314 transitions. [2019-10-07 05:57:54,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 05:57:54,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1314 transitions. [2019-10-07 05:57:54,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-07 05:57:54,726 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 05:57:54,727 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 05:57:54,727 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 05:57:54,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 05:57:54,728 INFO L82 PathProgramCache]: Analyzing trace with hash 915393057, now seen corresponding path program 1 times [2019-10-07 05:57:54,728 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 05:57:54,728 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:57:54,728 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:57:54,728 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:57:54,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 05:57:54,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 05:57:55,024 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-07 05:57:55,025 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:57:55,025 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 05:57:55,025 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 05:57:55,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 05:57:55,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 05:57:55,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 05:57:55,027 INFO L87 Difference]: Start difference. First operand 1012 states and 1314 transitions. Second operand 5 states. [2019-10-07 05:57:55,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 05:57:55,118 INFO L93 Difference]: Finished difference Result 2066 states and 2704 transitions. [2019-10-07 05:57:55,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 05:57:55,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 174 [2019-10-07 05:57:55,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 05:57:55,126 INFO L225 Difference]: With dead ends: 2066 [2019-10-07 05:57:55,126 INFO L226 Difference]: Without dead ends: 1072 [2019-10-07 05:57:55,131 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-07 05:57:55,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2019-10-07 05:57:55,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 1020. [2019-10-07 05:57:55,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2019-10-07 05:57:55,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1322 transitions. [2019-10-07 05:57:55,194 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1322 transitions. Word has length 174 [2019-10-07 05:57:55,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 05:57:55,195 INFO L462 AbstractCegarLoop]: Abstraction has 1020 states and 1322 transitions. [2019-10-07 05:57:55,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 05:57:55,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1322 transitions. [2019-10-07 05:57:55,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-10-07 05:57:55,201 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 05:57:55,201 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 05:57:55,202 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 05:57:55,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 05:57:55,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1842701031, now seen corresponding path program 1 times [2019-10-07 05:57:55,203 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 05:57:55,203 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:57:55,203 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:57:55,203 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:57:55,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 05:57:55,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 05:57:55,406 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-07 05:57:55,406 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:57:55,407 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 05:57:55,407 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 05:57:55,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 05:57:55,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 05:57:55,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 05:57:55,408 INFO L87 Difference]: Start difference. First operand 1020 states and 1322 transitions. Second operand 5 states. [2019-10-07 05:57:55,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 05:57:55,481 INFO L93 Difference]: Finished difference Result 2058 states and 2706 transitions. [2019-10-07 05:57:55,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 05:57:55,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 211 [2019-10-07 05:57:55,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 05:57:55,488 INFO L225 Difference]: With dead ends: 2058 [2019-10-07 05:57:55,489 INFO L226 Difference]: Without dead ends: 1056 [2019-10-07 05:57:55,493 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 05:57:55,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2019-10-07 05:57:55,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 1036. [2019-10-07 05:57:55,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2019-10-07 05:57:55,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1350 transitions. [2019-10-07 05:57:55,551 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1350 transitions. Word has length 211 [2019-10-07 05:57:55,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 05:57:55,552 INFO L462 AbstractCegarLoop]: Abstraction has 1036 states and 1350 transitions. [2019-10-07 05:57:55,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 05:57:55,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1350 transitions. [2019-10-07 05:57:55,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-10-07 05:57:55,557 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 05:57:55,557 INFO L385 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 05:57:55,558 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 05:57:55,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 05:57:55,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1044559062, now seen corresponding path program 1 times [2019-10-07 05:57:55,558 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 05:57:55,558 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:57:55,559 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:57:55,559 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:57:55,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 05:57:55,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 05:57:55,901 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-07 05:57:55,902 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:57:55,904 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 05:57:55,904 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-07 05:57:55,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-07 05:57:55,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-07 05:57:55,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-07 05:57:55,907 INFO L87 Difference]: Start difference. First operand 1036 states and 1350 transitions. Second operand 10 states. [2019-10-07 05:57:56,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 05:57:56,063 INFO L93 Difference]: Finished difference Result 2094 states and 2758 transitions. [2019-10-07 05:57:56,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-07 05:57:56,064 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 237 [2019-10-07 05:57:56,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 05:57:56,077 INFO L225 Difference]: With dead ends: 2094 [2019-10-07 05:57:56,078 INFO L226 Difference]: Without dead ends: 1076 [2019-10-07 05:57:56,085 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-07 05:57:56,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2019-10-07 05:57:56,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 1046. [2019-10-07 05:57:56,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1046 states. [2019-10-07 05:57:56,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1362 transitions. [2019-10-07 05:57:56,172 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1362 transitions. Word has length 237 [2019-10-07 05:57:56,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 05:57:56,173 INFO L462 AbstractCegarLoop]: Abstraction has 1046 states and 1362 transitions. [2019-10-07 05:57:56,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-07 05:57:56,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1362 transitions. [2019-10-07 05:57:56,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-10-07 05:57:56,182 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 05:57:56,183 INFO L385 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 05:57:56,183 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 05:57:56,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 05:57:56,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1402068112, now seen corresponding path program 1 times [2019-10-07 05:57:56,184 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 05:57:56,184 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:57:56,185 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:57:56,186 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:57:56,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 05:57:56,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 05:57:56,566 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-07 05:57:56,566 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:57:56,566 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 05:57:56,566 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-07 05:57:56,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-07 05:57:56,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-07 05:57:56,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-07 05:57:56,570 INFO L87 Difference]: Start difference. First operand 1046 states and 1362 transitions. Second operand 10 states. [2019-10-07 05:57:56,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 05:57:56,688 INFO L93 Difference]: Finished difference Result 2114 states and 2758 transitions. [2019-10-07 05:57:56,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-07 05:57:56,689 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 235 [2019-10-07 05:57:56,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 05:57:56,696 INFO L225 Difference]: With dead ends: 2114 [2019-10-07 05:57:56,696 INFO L226 Difference]: Without dead ends: 1086 [2019-10-07 05:57:56,704 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-07 05:57:56,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states. [2019-10-07 05:57:56,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 1048. [2019-10-07 05:57:56,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2019-10-07 05:57:56,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1364 transitions. [2019-10-07 05:57:56,767 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1364 transitions. Word has length 235 [2019-10-07 05:57:56,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 05:57:56,770 INFO L462 AbstractCegarLoop]: Abstraction has 1048 states and 1364 transitions. [2019-10-07 05:57:56,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-07 05:57:56,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1364 transitions. [2019-10-07 05:57:56,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-10-07 05:57:56,776 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 05:57:56,776 INFO L385 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 05:57:56,777 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 05:57:56,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 05:57:56,779 INFO L82 PathProgramCache]: Analyzing trace with hash 822307866, now seen corresponding path program 1 times [2019-10-07 05:57:56,779 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 05:57:56,779 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:57:56,779 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:57:56,779 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:57:56,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 05:57:56,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 05:57:57,266 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-10-07 05:57:57,267 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:57:57,267 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 05:57:57,268 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-07 05:57:57,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-07 05:57:57,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-07 05:57:57,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-07 05:57:57,269 INFO L87 Difference]: Start difference. First operand 1048 states and 1364 transitions. Second operand 10 states. [2019-10-07 05:57:57,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 05:57:57,436 INFO L93 Difference]: Finished difference Result 2160 states and 2838 transitions. [2019-10-07 05:57:57,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 05:57:57,436 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 246 [2019-10-07 05:57:57,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 05:57:57,445 INFO L225 Difference]: With dead ends: 2160 [2019-10-07 05:57:57,445 INFO L226 Difference]: Without dead ends: 1130 [2019-10-07 05:57:57,450 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-07 05:57:57,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2019-10-07 05:57:57,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1048. [2019-10-07 05:57:57,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2019-10-07 05:57:57,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1364 transitions. [2019-10-07 05:57:57,514 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1364 transitions. Word has length 246 [2019-10-07 05:57:57,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 05:57:57,515 INFO L462 AbstractCegarLoop]: Abstraction has 1048 states and 1364 transitions. [2019-10-07 05:57:57,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-07 05:57:57,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1364 transitions. [2019-10-07 05:57:57,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-10-07 05:57:57,521 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 05:57:57,521 INFO L385 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 05:57:57,521 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 05:57:57,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 05:57:57,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1309145940, now seen corresponding path program 1 times [2019-10-07 05:57:57,522 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 05:57:57,522 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:57:57,522 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:57:57,523 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:57:57,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 05:57:57,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 05:57:57,850 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-10-07 05:57:57,851 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:57:57,851 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 05:57:57,851 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-07 05:57:57,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-07 05:57:57,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-07 05:57:57,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-07 05:57:57,853 INFO L87 Difference]: Start difference. First operand 1048 states and 1364 transitions. Second operand 10 states. [2019-10-07 05:57:58,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 05:57:58,031 INFO L93 Difference]: Finished difference Result 2172 states and 2850 transitions. [2019-10-07 05:57:58,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 05:57:58,032 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 244 [2019-10-07 05:57:58,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 05:57:58,043 INFO L225 Difference]: With dead ends: 2172 [2019-10-07 05:57:58,044 INFO L226 Difference]: Without dead ends: 1142 [2019-10-07 05:57:58,051 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-07 05:57:58,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2019-10-07 05:57:58,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1044. [2019-10-07 05:57:58,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1044 states. [2019-10-07 05:57:58,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1356 transitions. [2019-10-07 05:57:58,152 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1356 transitions. Word has length 244 [2019-10-07 05:57:58,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 05:57:58,153 INFO L462 AbstractCegarLoop]: Abstraction has 1044 states and 1356 transitions. [2019-10-07 05:57:58,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-07 05:57:58,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1356 transitions. [2019-10-07 05:57:58,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-10-07 05:57:58,161 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 05:57:58,162 INFO L385 BasicCegarLoop]: trace histogram [8, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 05:57:58,162 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 05:57:58,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 05:57:58,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1423067087, now seen corresponding path program 1 times [2019-10-07 05:57:58,163 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 05:57:58,163 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:57:58,163 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:57:58,163 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:57:58,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 05:57:58,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 05:57:58,553 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-10-07 05:57:58,554 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:57:58,554 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 05:57:58,554 INFO L95 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-07 05:57:59,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 05:57:59,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 2905 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-07 05:57:59,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 05:57:59,405 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-10-07 05:57:59,406 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 05:58:00,166 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-10-07 05:58:00,167 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 05:58:00,167 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 10 [2019-10-07 05:58:00,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 05:58:00,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 05:58:00,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-10-07 05:58:00,168 INFO L87 Difference]: Start difference. First operand 1044 states and 1356 transitions. Second operand 4 states. [2019-10-07 05:58:00,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 05:58:00,278 INFO L93 Difference]: Finished difference Result 2078 states and 2706 transitions. [2019-10-07 05:58:00,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 05:58:00,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 272 [2019-10-07 05:58:00,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 05:58:00,287 INFO L225 Difference]: With dead ends: 2078 [2019-10-07 05:58:00,287 INFO L226 Difference]: Without dead ends: 1052 [2019-10-07 05:58:00,292 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 544 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-10-07 05:58:00,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2019-10-07 05:58:00,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1052. [2019-10-07 05:58:00,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-10-07 05:58:00,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1366 transitions. [2019-10-07 05:58:00,405 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1366 transitions. Word has length 272 [2019-10-07 05:58:00,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 05:58:00,406 INFO L462 AbstractCegarLoop]: Abstraction has 1052 states and 1366 transitions. [2019-10-07 05:58:00,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 05:58:00,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1366 transitions. [2019-10-07 05:58:00,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-10-07 05:58:00,412 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 05:58:00,412 INFO L385 BasicCegarLoop]: trace histogram [8, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 05:58:00,624 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 05:58:00,625 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 05:58:00,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 05:58:00,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1818920145, now seen corresponding path program 1 times [2019-10-07 05:58:00,625 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 05:58:00,626 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:58:00,626 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:58:00,626 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:58:00,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 05:58:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 05:58:00,917 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-10-07 05:58:00,918 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:58:00,918 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 05:58:00,918 INFO L95 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-07 05:58:01,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 05:58:01,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 2927 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 05:58:01,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 05:58:01,875 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-10-07 05:58:01,875 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 05:58:02,558 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-10-07 05:58:02,558 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 05:58:02,640 INFO L162 IcfgInterpreter]: Started Sifa with 206 locations of interest [2019-10-07 05:58:02,640 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 05:58:02,660 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 05:58:02,673 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 05:58:02,674 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 06:01:50,640 WARN L191 SmtUtils]: Spent 732.00 ms on a formula simplification that was a NOOP. DAG size: 1173 [2019-10-07 06:02:22,747 WARN L191 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 113 [2019-10-07 06:02:23,314 WARN L191 SmtUtils]: Spent 561.00 ms on a formula simplification that was a NOOP. DAG size: 1156 [2019-10-07 06:02:24,153 WARN L191 SmtUtils]: Spent 425.00 ms on a formula simplification that was a NOOP. DAG size: 1155 [2019-10-07 06:02:25,151 WARN L191 SmtUtils]: Spent 513.00 ms on a formula simplification that was a NOOP. DAG size: 1155 [2019-10-07 06:02:25,763 WARN L191 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 1166 [2019-10-07 06:02:26,080 WARN L191 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 1166 [2019-10-07 06:02:26,426 WARN L191 SmtUtils]: Spent 343.00 ms on a formula simplification that was a NOOP. DAG size: 1166 [2019-10-07 06:02:27,099 WARN L191 SmtUtils]: Spent 604.00 ms on a formula simplification that was a NOOP. DAG size: 1326 [2019-10-07 06:02:27,732 WARN L191 SmtUtils]: Spent 616.00 ms on a formula simplification that was a NOOP. DAG size: 1326 [2019-10-07 06:02:28,312 WARN L191 SmtUtils]: Spent 575.00 ms on a formula simplification that was a NOOP. DAG size: 1326 [2019-10-07 06:02:28,942 WARN L191 SmtUtils]: Spent 578.00 ms on a formula simplification that was a NOOP. DAG size: 1326 [2019-10-07 06:02:30,172 WARN L191 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 1328 DAG size of output: 1326 [2019-10-07 06:02:30,745 WARN L191 SmtUtils]: Spent 569.00 ms on a formula simplification that was a NOOP. DAG size: 1326 [2019-10-07 06:02:31,395 WARN L191 SmtUtils]: Spent 587.00 ms on a formula simplification that was a NOOP. DAG size: 1326 [2019-10-07 06:02:31,982 WARN L191 SmtUtils]: Spent 584.00 ms on a formula simplification that was a NOOP. DAG size: 1326 [2019-10-07 06:02:32,580 WARN L191 SmtUtils]: Spent 594.00 ms on a formula simplification that was a NOOP. DAG size: 1326 [2019-10-07 06:02:33,205 WARN L191 SmtUtils]: Spent 558.00 ms on a formula simplification that was a NOOP. DAG size: 1326 [2019-10-07 06:02:33,231 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 391 for LOIs [2019-10-07 06:02:33,714 WARN L191 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 1150 [2019-10-07 06:02:33,946 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 1150 [2019-10-07 06:02:34,486 WARN L191 SmtUtils]: Spent 480.00 ms on a formula simplification that was a NOOP. DAG size: 1310 [2019-10-07 06:02:34,488 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1340 for LOIs [2019-10-07 06:02:35,049 WARN L191 SmtUtils]: Spent 559.00 ms on a formula simplification that was a NOOP. DAG size: 1340 [2019-10-07 06:02:35,606 WARN L191 SmtUtils]: Spent 553.00 ms on a formula simplification that was a NOOP. DAG size: 1340 [2019-10-07 06:02:36,338 WARN L191 SmtUtils]: Spent 662.00 ms on a formula simplification that was a NOOP. DAG size: 1388 [2019-10-07 06:02:36,914 WARN L191 SmtUtils]: Spent 545.00 ms on a formula simplification that was a NOOP. DAG size: 1340 [2019-10-07 06:02:37,488 WARN L191 SmtUtils]: Spent 571.00 ms on a formula simplification that was a NOOP. DAG size: 1340 [2019-10-07 06:02:38,172 WARN L191 SmtUtils]: Spent 627.00 ms on a formula simplification that was a NOOP. DAG size: 1388 [2019-10-07 06:02:38,928 WARN L191 SmtUtils]: Spent 697.00 ms on a formula simplification that was a NOOP. DAG size: 1348 [2019-10-07 06:02:39,526 WARN L191 SmtUtils]: Spent 595.00 ms on a formula simplification that was a NOOP. DAG size: 1348 [2019-10-07 06:02:40,208 WARN L191 SmtUtils]: Spent 622.00 ms on a formula simplification that was a NOOP. DAG size: 1388 [2019-10-07 06:02:41,246 WARN L191 SmtUtils]: Spent 992.00 ms on a formula simplification. DAG size of input: 1390 DAG size of output: 1348 [2019-10-07 06:02:41,802 WARN L191 SmtUtils]: Spent 553.00 ms on a formula simplification that was a NOOP. DAG size: 1348 [2019-10-07 06:02:42,577 WARN L191 SmtUtils]: Spent 673.00 ms on a formula simplification that was a NOOP. DAG size: 1388 [2019-10-07 06:02:43,645 WARN L191 SmtUtils]: Spent 1.05 s on a formula simplification that was a NOOP. DAG size: 1348 [2019-10-07 06:02:44,204 WARN L191 SmtUtils]: Spent 556.00 ms on a formula simplification that was a NOOP. DAG size: 1348 [2019-10-07 06:02:44,874 WARN L191 SmtUtils]: Spent 622.00 ms on a formula simplification that was a NOOP. DAG size: 1388 [2019-10-07 06:02:45,434 WARN L191 SmtUtils]: Spent 555.00 ms on a formula simplification that was a NOOP. DAG size: 1348 [2019-10-07 06:02:45,991 WARN L191 SmtUtils]: Spent 554.00 ms on a formula simplification that was a NOOP. DAG size: 1348 [2019-10-07 06:02:46,727 WARN L191 SmtUtils]: Spent 647.00 ms on a formula simplification that was a NOOP. DAG size: 1388 [2019-10-07 06:02:47,301 WARN L191 SmtUtils]: Spent 570.00 ms on a formula simplification that was a NOOP. DAG size: 1348 [2019-10-07 06:02:47,856 WARN L191 SmtUtils]: Spent 552.00 ms on a formula simplification that was a NOOP. DAG size: 1348 [2019-10-07 06:02:48,519 WARN L191 SmtUtils]: Spent 615.00 ms on a formula simplification that was a NOOP. DAG size: 1388 [2019-10-07 06:02:49,083 WARN L191 SmtUtils]: Spent 560.00 ms on a formula simplification that was a NOOP. DAG size: 1348 [2019-10-07 06:02:49,652 WARN L191 SmtUtils]: Spent 566.00 ms on a formula simplification that was a NOOP. DAG size: 1348 [2019-10-07 06:02:50,340 WARN L191 SmtUtils]: Spent 639.00 ms on a formula simplification that was a NOOP. DAG size: 1388 [2019-10-07 06:02:50,936 WARN L191 SmtUtils]: Spent 592.00 ms on a formula simplification that was a NOOP. DAG size: 1348 [2019-10-07 06:02:51,509 WARN L191 SmtUtils]: Spent 570.00 ms on a formula simplification that was a NOOP. DAG size: 1348 [2019-10-07 06:02:52,204 WARN L191 SmtUtils]: Spent 644.00 ms on a formula simplification that was a NOOP. DAG size: 1388 [2019-10-07 06:02:52,777 WARN L191 SmtUtils]: Spent 569.00 ms on a formula simplification that was a NOOP. DAG size: 1348 [2019-10-07 06:02:53,344 WARN L191 SmtUtils]: Spent 563.00 ms on a formula simplification that was a NOOP. DAG size: 1348 [2019-10-07 06:02:54,014 WARN L191 SmtUtils]: Spent 617.00 ms on a formula simplification that was a NOOP. DAG size: 1388 [2019-10-07 06:02:54,561 WARN L191 SmtUtils]: Spent 544.00 ms on a formula simplification that was a NOOP. DAG size: 1348 [2019-10-07 06:02:55,141 WARN L191 SmtUtils]: Spent 577.00 ms on a formula simplification that was a NOOP. DAG size: 1348 [2019-10-07 06:02:55,825 WARN L191 SmtUtils]: Spent 633.00 ms on a formula simplification that was a NOOP. DAG size: 1388 [2019-10-07 06:02:56,391 WARN L191 SmtUtils]: Spent 562.00 ms on a formula simplification that was a NOOP. DAG size: 1348 [2019-10-07 06:02:56,947 WARN L191 SmtUtils]: Spent 553.00 ms on a formula simplification that was a NOOP. DAG size: 1348 [2019-10-07 06:02:57,622 WARN L191 SmtUtils]: Spent 626.00 ms on a formula simplification that was a NOOP. DAG size: 1388 [2019-10-07 06:02:58,189 WARN L191 SmtUtils]: Spent 563.00 ms on a formula simplification that was a NOOP. DAG size: 1348 [2019-10-07 06:02:58,746 WARN L191 SmtUtils]: Spent 553.00 ms on a formula simplification that was a NOOP. DAG size: 1348 [2019-10-07 06:02:59,444 WARN L191 SmtUtils]: Spent 649.00 ms on a formula simplification that was a NOOP. DAG size: 1388 [2019-10-07 06:03:00,006 WARN L191 SmtUtils]: Spent 558.00 ms on a formula simplification that was a NOOP. DAG size: 1348 [2019-10-07 06:03:00,571 WARN L191 SmtUtils]: Spent 561.00 ms on a formula simplification that was a NOOP. DAG size: 1348 [2019-10-07 06:03:01,248 WARN L191 SmtUtils]: Spent 626.00 ms on a formula simplification that was a NOOP. DAG size: 1388 [2019-10-07 06:03:01,809 WARN L191 SmtUtils]: Spent 556.00 ms on a formula simplification that was a NOOP. DAG size: 1348 [2019-10-07 06:03:02,369 WARN L191 SmtUtils]: Spent 556.00 ms on a formula simplification that was a NOOP. DAG size: 1348 [2019-10-07 06:03:03,046 WARN L191 SmtUtils]: Spent 627.00 ms on a formula simplification that was a NOOP. DAG size: 1388 [2019-10-07 06:03:03,604 WARN L191 SmtUtils]: Spent 554.00 ms on a formula simplification that was a NOOP. DAG size: 1348 [2019-10-07 06:03:04,169 WARN L191 SmtUtils]: Spent 561.00 ms on a formula simplification that was a NOOP. DAG size: 1348 [2019-10-07 06:03:04,855 WARN L191 SmtUtils]: Spent 638.00 ms on a formula simplification that was a NOOP. DAG size: 1388 [2019-10-07 06:03:05,412 WARN L191 SmtUtils]: Spent 554.00 ms on a formula simplification that was a NOOP. DAG size: 1348 [2019-10-07 06:03:05,971 WARN L191 SmtUtils]: Spent 555.00 ms on a formula simplification that was a NOOP. DAG size: 1348 [2019-10-07 06:03:06,645 WARN L191 SmtUtils]: Spent 626.00 ms on a formula simplification that was a NOOP. DAG size: 1388 [2019-10-07 06:03:07,200 WARN L191 SmtUtils]: Spent 551.00 ms on a formula simplification that was a NOOP. DAG size: 1348 [2019-10-07 06:03:07,756 WARN L191 SmtUtils]: Spent 552.00 ms on a formula simplification that was a NOOP. DAG size: 1348 [2019-10-07 06:03:08,444 WARN L191 SmtUtils]: Spent 638.00 ms on a formula simplification that was a NOOP. DAG size: 1388 [2019-10-07 06:03:09,007 WARN L191 SmtUtils]: Spent 560.00 ms on a formula simplification that was a NOOP. DAG size: 1348 [2019-10-07 06:03:09,564 WARN L191 SmtUtils]: Spent 553.00 ms on a formula simplification that was a NOOP. DAG size: 1348 [2019-10-07 06:03:10,241 WARN L191 SmtUtils]: Spent 629.00 ms on a formula simplification that was a NOOP. DAG size: 1388 [2019-10-07 06:03:10,801 WARN L191 SmtUtils]: Spent 556.00 ms on a formula simplification that was a NOOP. DAG size: 1348 [2019-10-07 06:03:11,373 WARN L191 SmtUtils]: Spent 569.00 ms on a formula simplification that was a NOOP. DAG size: 1348 [2019-10-07 06:03:12,048 WARN L191 SmtUtils]: Spent 621.00 ms on a formula simplification that was a NOOP. DAG size: 1388 [2019-10-07 06:03:12,602 WARN L191 SmtUtils]: Spent 550.00 ms on a formula simplification that was a NOOP. DAG size: 1348 [2019-10-07 06:03:13,163 WARN L191 SmtUtils]: Spent 557.00 ms on a formula simplification that was a NOOP. DAG size: 1348 [2019-10-07 06:03:13,837 WARN L191 SmtUtils]: Spent 625.00 ms on a formula simplification that was a NOOP. DAG size: 1388 [2019-10-07 06:03:14,395 WARN L191 SmtUtils]: Spent 553.00 ms on a formula simplification that was a NOOP. DAG size: 1348 [2019-10-07 06:03:14,950 WARN L191 SmtUtils]: Spent 552.00 ms on a formula simplification that was a NOOP. DAG size: 1348 [2019-10-07 06:03:15,621 WARN L191 SmtUtils]: Spent 623.00 ms on a formula simplification that was a NOOP. DAG size: 1388 [2019-10-07 06:03:16,175 WARN L191 SmtUtils]: Spent 550.00 ms on a formula simplification that was a NOOP. DAG size: 1348 [2019-10-07 06:03:16,743 WARN L191 SmtUtils]: Spent 565.00 ms on a formula simplification that was a NOOP. DAG size: 1348 [2019-10-07 06:03:17,411 WARN L191 SmtUtils]: Spent 619.00 ms on a formula simplification that was a NOOP. DAG size: 1388 [2019-10-07 06:03:17,976 WARN L191 SmtUtils]: Spent 561.00 ms on a formula simplification that was a NOOP. DAG size: 1348 [2019-10-07 06:03:18,533 WARN L191 SmtUtils]: Spent 554.00 ms on a formula simplification that was a NOOP. DAG size: 1348 [2019-10-07 06:03:19,213 WARN L191 SmtUtils]: Spent 631.00 ms on a formula simplification that was a NOOP. DAG size: 1388 [2019-10-07 06:03:19,768 WARN L191 SmtUtils]: Spent 552.00 ms on a formula simplification that was a NOOP. DAG size: 1348 [2019-10-07 06:03:20,325 WARN L191 SmtUtils]: Spent 553.00 ms on a formula simplification that was a NOOP. DAG size: 1348 [2019-10-07 06:03:21,001 WARN L191 SmtUtils]: Spent 627.00 ms on a formula simplification that was a NOOP. DAG size: 1388 [2019-10-07 06:03:21,640 WARN L191 SmtUtils]: Spent 629.00 ms on a formula simplification that was a NOOP. DAG size: 1382 [2019-10-07 06:03:22,261 WARN L191 SmtUtils]: Spent 618.00 ms on a formula simplification that was a NOOP. DAG size: 1382 [2019-10-07 06:03:22,944 WARN L191 SmtUtils]: Spent 631.00 ms on a formula simplification that was a NOOP. DAG size: 1388 [2019-10-07 06:03:23,616 WARN L191 SmtUtils]: Spent 661.00 ms on a formula simplification that was a NOOP. DAG size: 1395 [2019-10-07 06:03:25,211 WARN L191 SmtUtils]: Spent 1.59 s on a formula simplification that was a NOOP. DAG size: 1394 [2019-10-07 06:03:25,352 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 293 [2019-10-07 06:03:27,128 WARN L191 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 1406 DAG size of output: 1402 [2019-10-07 06:03:27,469 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 06:03:27,471 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ε at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:133) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ε at de.uni_freiburg.informatik.ultimate.lib.sifa.PriorityWorklist.add(PriorityWorklist.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.lambda$2(DagInterpreter.java:135) at java.lang.Iterable.forEach(Iterable.java:75) at java.util.Collections$UnmodifiableCollection.forEach(Collections.java:1080) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:135) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:104) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.computeTopSummary(TopInputCallSummarizer.java:78) at java.util.HashMap.computeIfAbsent(HashMap.java:1127) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.summarize(TopInputCallSummarizer.java:67) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:230) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:214) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:197) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:166) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:130) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:104) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.computeTopSummary(TopInputCallSummarizer.java:78) at java.util.HashMap.computeIfAbsent(HashMap.java:1127) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.summarize(TopInputCallSummarizer.java:67) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:230) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:214) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:197) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:166) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:130) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:104) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarizeInternal(FixpointLoopSummarizer.java:118) at java.util.HashMap.computeIfAbsent(HashMap.java:1127) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:178) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:169) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:130) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:287) ... 21 more [2019-10-07 06:03:27,478 INFO L168 Benchmark]: Toolchain (without parser) took 347661.61 ms. Allocated memory was 136.8 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 94.7 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 86.4 MB. Max. memory is 7.1 GB. [2019-10-07 06:03:27,478 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 136.8 MB. Free memory was 118.8 MB in the beginning and 118.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 06:03:27,479 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1901.85 ms. Allocated memory was 136.8 MB in the beginning and 204.5 MB in the end (delta: 67.6 MB). Free memory was 94.5 MB in the beginning and 109.4 MB in the end (delta: -14.9 MB). Peak memory consumption was 58.0 MB. Max. memory is 7.1 GB. [2019-10-07 06:03:27,480 INFO L168 Benchmark]: Boogie Preprocessor took 286.67 ms. Allocated memory is still 204.5 MB. Free memory was 109.4 MB in the beginning and 98.2 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. [2019-10-07 06:03:27,480 INFO L168 Benchmark]: RCFGBuilder took 5033.28 ms. Allocated memory was 204.5 MB in the beginning and 314.6 MB in the end (delta: 110.1 MB). Free memory was 98.2 MB in the beginning and 242.2 MB in the end (delta: -144.0 MB). Peak memory consumption was 81.1 MB. Max. memory is 7.1 GB. [2019-10-07 06:03:27,481 INFO L168 Benchmark]: TraceAbstraction took 340434.48 ms. Allocated memory was 314.6 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 242.2 MB in the beginning and 2.0 GB in the end (delta: -1.7 GB). Peak memory consumption was 56.1 MB. Max. memory is 7.1 GB. [2019-10-07 06:03:27,484 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 136.8 MB. Free memory was 118.8 MB in the beginning and 118.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1901.85 ms. Allocated memory was 136.8 MB in the beginning and 204.5 MB in the end (delta: 67.6 MB). Free memory was 94.5 MB in the beginning and 109.4 MB in the end (delta: -14.9 MB). Peak memory consumption was 58.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 286.67 ms. Allocated memory is still 204.5 MB. Free memory was 109.4 MB in the beginning and 98.2 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5033.28 ms. Allocated memory was 204.5 MB in the beginning and 314.6 MB in the end (delta: 110.1 MB). Free memory was 98.2 MB in the beginning and 242.2 MB in the end (delta: -144.0 MB). Peak memory consumption was 81.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 340434.48 ms. Allocated memory was 314.6 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 242.2 MB in the beginning and 2.0 GB in the end (delta: -1.7 GB). Peak memory consumption was 56.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ε de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ε: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...