java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pg.ko-main.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 17:22:03,719 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 17:22:03,721 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 17:22:03,733 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 17:22:03,734 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 17:22:03,736 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 17:22:03,737 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 17:22:03,741 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 17:22:03,746 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 17:22:03,747 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 17:22:03,748 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 17:22:03,751 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 17:22:03,751 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 17:22:03,760 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 17:22:03,761 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 17:22:03,763 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 17:22:03,767 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 17:22:03,768 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 17:22:03,772 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 17:22:03,774 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 17:22:03,777 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 17:22:03,779 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 17:22:03,780 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 17:22:03,780 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 17:22:03,785 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 17:22:03,786 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 17:22:03,786 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 17:22:03,787 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 17:22:03,788 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 17:22:03,791 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 17:22:03,791 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 17:22:03,793 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 17:22:03,793 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 17:22:03,794 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 17:22:03,795 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 17:22:03,798 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 17:22:03,799 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 17:22:03,800 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 17:22:03,800 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 17:22:03,800 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 17:22:03,803 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 17:22:03,805 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-16 17:22:03,837 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 17:22:03,837 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 17:22:03,838 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-16 17:22:03,839 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-16 17:22:03,839 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-16 17:22:03,840 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-16 17:22:03,840 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-16 17:22:03,841 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-16 17:22:03,841 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-16 17:22:03,841 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-16 17:22:03,843 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 17:22:03,844 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 17:22:03,844 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 17:22:03,844 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 17:22:03,845 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 17:22:03,845 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 17:22:03,845 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 17:22:03,845 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 17:22:03,845 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 17:22:03,846 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 17:22:03,846 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 17:22:03,846 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-16 17:22:03,847 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 17:22:03,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:22:03,847 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 17:22:03,848 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 17:22:03,848 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-16 17:22:03,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 17:22:03,849 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 17:22:03,849 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-16 17:22:03,878 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 17:22:03,895 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 17:22:03,899 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 17:22:03,901 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 17:22:03,901 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 17:22:03,902 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-09-16 17:22:03,972 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bd716d22/e0d9d2cd92a04c22ada2c4b84c9527db/FLAG8fda39f0d [2019-09-16 17:22:04,784 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 17:22:04,785 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-09-16 17:22:04,831 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bd716d22/e0d9d2cd92a04c22ada2c4b84c9527db/FLAG8fda39f0d [2019-09-16 17:22:05,313 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bd716d22/e0d9d2cd92a04c22ada2c4b84c9527db [2019-09-16 17:22:05,322 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 17:22:05,324 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 17:22:05,325 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 17:22:05,325 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 17:22:05,328 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 17:22:05,329 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:22:05" (1/1) ... [2019-09-16 17:22:05,332 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26a95c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:22:05, skipping insertion in model container [2019-09-16 17:22:05,332 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:22:05" (1/1) ... [2019-09-16 17:22:05,338 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 17:22:05,452 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 17:22:06,714 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:22:06,779 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 17:22:07,040 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:22:07,244 INFO L192 MainTranslator]: Completed translation [2019-09-16 17:22:07,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:22:07 WrapperNode [2019-09-16 17:22:07,246 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 17:22:07,247 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 17:22:07,247 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 17:22:07,247 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 17:22:07,267 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:22:07" (1/1) ... [2019-09-16 17:22:07,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:22:07" (1/1) ... [2019-09-16 17:22:07,364 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:22:07" (1/1) ... [2019-09-16 17:22:07,365 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:22:07" (1/1) ... [2019-09-16 17:22:07,494 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:22:07" (1/1) ... [2019-09-16 17:22:07,525 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:22:07" (1/1) ... [2019-09-16 17:22:07,542 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:22:07" (1/1) ... [2019-09-16 17:22:07,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 17:22:07,558 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 17:22:07,558 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 17:22:07,559 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 17:22:07,560 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:22:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:22:07,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 17:22:07,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 17:22:07,651 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2019-09-16 17:22:07,651 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2019-09-16 17:22:07,651 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2019-09-16 17:22:07,651 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2019-09-16 17:22:07,652 INFO L138 BoogieDeclarations]: Found implementation of procedure iminor [2019-09-16 17:22:07,652 INFO L138 BoogieDeclarations]: Found implementation of procedure register_chrdev [2019-09-16 17:22:07,652 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_chrdev [2019-09-16 17:22:07,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2019-09-16 17:22:07,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-09-16 17:22:07,653 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2019-09-16 17:22:07,653 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2019-09-16 17:22:07,653 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2019-09-16 17:22:07,653 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2019-09-16 17:22:07,654 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_init_units [2019-09-16 17:22:07,654 INFO L138 BoogieDeclarations]: Found implementation of procedure status_reg [2019-09-16 17:22:07,654 INFO L138 BoogieDeclarations]: Found implementation of procedure read_reg [2019-09-16 17:22:07,654 INFO L138 BoogieDeclarations]: Found implementation of procedure write_reg [2019-09-16 17:22:07,655 INFO L138 BoogieDeclarations]: Found implementation of procedure DRIVE [2019-09-16 17:22:07,655 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_sleep [2019-09-16 17:22:07,655 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_wait [2019-09-16 17:22:07,655 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_command [2019-09-16 17:22:07,656 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_completion [2019-09-16 17:22:07,656 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_reset [2019-09-16 17:22:07,656 INFO L138 BoogieDeclarations]: Found implementation of procedure xs [2019-09-16 17:22:07,656 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_identify [2019-09-16 17:22:07,656 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_probe [2019-09-16 17:22:07,657 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_detect [2019-09-16 17:22:07,657 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_open [2019-09-16 17:22:07,657 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_release [2019-09-16 17:22:07,657 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_write [2019-09-16 17:22:07,657 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_read [2019-09-16 17:22:07,658 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_init [2019-09-16 17:22:07,658 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_exit [2019-09-16 17:22:07,658 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 17:22:07,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_1 [2019-09-16 17:22:07,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_2 [2019-09-16 17:22:07,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_3 [2019-09-16 17:22:07,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_4 [2019-09-16 17:22:07,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_5 [2019-09-16 17:22:07,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_6 [2019-09-16 17:22:07,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_7 [2019-09-16 17:22:07,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_8 [2019-09-16 17:22:07,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_9 [2019-09-16 17:22:07,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_register_chrdev_10 [2019-09-16 17:22:07,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_unregister_chrdev_11 [2019-09-16 17:22:07,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-09-16 17:22:07,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-09-16 17:22:07,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_trap [2019-09-16 17:22:07,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_cred_guard_mutex_of_signal_struct [2019-09-16 17:22:07,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_cred_guard_mutex_of_signal_struct [2019-09-16 17:22:07,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_cred_guard_mutex_of_signal_struct [2019-09-16 17:22:07,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_cred_guard_mutex_of_signal_struct [2019-09-16 17:22:07,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_cred_guard_mutex_of_signal_struct [2019-09-16 17:22:07,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_cred_guard_mutex_of_signal_struct [2019-09-16 17:22:07,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_cred_guard_mutex_of_signal_struct [2019-09-16 17:22:07,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_lock [2019-09-16 17:22:07,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_lock [2019-09-16 17:22:07,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_lock [2019-09-16 17:22:07,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_lock [2019-09-16 17:22:07,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_lock [2019-09-16 17:22:07,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_lock [2019-09-16 17:22:07,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_lock [2019-09-16 17:22:07,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_mutex_of_device [2019-09-16 17:22:07,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_mutex_of_device [2019-09-16 17:22:07,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mutex_of_device [2019-09-16 17:22:07,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_mutex_of_device [2019-09-16 17:22:07,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_mutex_of_device [2019-09-16 17:22:07,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_mutex_of_device [2019-09-16 17:22:07,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mutex_of_device [2019-09-16 17:22:07,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_pg_mutex [2019-09-16 17:22:07,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_pg_mutex [2019-09-16 17:22:07,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_pg_mutex [2019-09-16 17:22:07,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_pg_mutex [2019-09-16 17:22:07,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_pg_mutex [2019-09-16 17:22:07,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_pg_mutex [2019-09-16 17:22:07,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_pg_mutex [2019-09-16 17:22:07,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-09-16 17:22:07,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-09-16 17:22:07,666 INFO L138 BoogieDeclarations]: Found implementation of procedure __class_create [2019-09-16 17:22:07,667 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2019-09-16 17:22:07,667 INFO L138 BoogieDeclarations]: Found implementation of procedure __register_chrdev [2019-09-16 17:22:07,667 INFO L138 BoogieDeclarations]: Found implementation of procedure __unregister_chrdev [2019-09-16 17:22:07,667 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2019-09-16 17:22:07,667 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2019-09-16 17:22:07,668 INFO L138 BoogieDeclarations]: Found implementation of procedure class_destroy [2019-09-16 17:22:07,668 INFO L138 BoogieDeclarations]: Found implementation of procedure device_create [2019-09-16 17:22:07,668 INFO L138 BoogieDeclarations]: Found implementation of procedure device_destroy [2019-09-16 17:22:07,668 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2019-09-16 17:22:07,668 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2019-09-16 17:22:07,669 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_trylock [2019-09-16 17:22:07,669 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2019-09-16 17:22:07,669 INFO L138 BoogieDeclarations]: Found implementation of procedure noop_llseek [2019-09-16 17:22:07,669 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_connect [2019-09-16 17:22:07,669 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_disconnect [2019-09-16 17:22:07,669 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_init [2019-09-16 17:22:07,670 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_read_block [2019-09-16 17:22:07,670 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_read_regr [2019-09-16 17:22:07,670 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_release [2019-09-16 17:22:07,670 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_write_block [2019-09-16 17:22:07,670 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_write_regr [2019-09-16 17:22:07,671 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-09-16 17:22:07,671 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_timeout_interruptible [2019-09-16 17:22:07,671 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_fmt [2019-09-16 17:22:07,671 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-09-16 17:22:07,672 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-09-16 17:22:07,672 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-09-16 17:22:07,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-16 17:22:07,672 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 17:22:07,672 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-09-16 17:22:07,673 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2019-09-16 17:22:07,673 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2019-09-16 17:22:07,673 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-09-16 17:22:07,673 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2019-09-16 17:22:07,673 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2019-09-16 17:22:07,673 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-09-16 17:22:07,674 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2019-09-16 17:22:07,674 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_fmt [2019-09-16 17:22:07,674 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2019-09-16 17:22:07,674 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2019-09-16 17:22:07,674 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_trylock [2019-09-16 17:22:07,675 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_4 [2019-09-16 17:22:07,675 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2019-09-16 17:22:07,675 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_2 [2019-09-16 17:22:07,675 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_5 [2019-09-16 17:22:07,675 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_7 [2019-09-16 17:22:07,676 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_9 [2019-09-16 17:22:07,676 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2019-09-16 17:22:07,676 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_1 [2019-09-16 17:22:07,676 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_3 [2019-09-16 17:22:07,676 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_6 [2019-09-16 17:22:07,677 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_8 [2019-09-16 17:22:07,677 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_cred_guard_mutex_of_signal_struct [2019-09-16 17:22:07,677 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_cred_guard_mutex_of_signal_struct [2019-09-16 17:22:07,677 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_lock [2019-09-16 17:22:07,677 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_lock [2019-09-16 17:22:07,677 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mutex_of_device [2019-09-16 17:22:07,678 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_mutex_of_device [2019-09-16 17:22:07,678 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mutex_of_device [2019-09-16 17:22:07,678 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_pg_mutex [2019-09-16 17:22:07,678 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_pg_mutex [2019-09-16 17:22:07,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 17:22:07,679 INFO L130 BoogieDeclarations]: Found specification of procedure iminor [2019-09-16 17:22:07,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-16 17:22:07,679 INFO L130 BoogieDeclarations]: Found specification of procedure __register_chrdev [2019-09-16 17:22:07,679 INFO L130 BoogieDeclarations]: Found specification of procedure __unregister_chrdev [2019-09-16 17:22:07,679 INFO L130 BoogieDeclarations]: Found specification of procedure register_chrdev [2019-09-16 17:22:07,680 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_register_chrdev_10 [2019-09-16 17:22:07,680 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_chrdev [2019-09-16 17:22:07,680 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_unregister_chrdev_11 [2019-09-16 17:22:07,680 INFO L130 BoogieDeclarations]: Found specification of procedure noop_llseek [2019-09-16 17:22:07,680 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2019-09-16 17:22:07,681 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-09-16 17:22:07,681 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-16 17:22:07,681 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-16 17:22:07,681 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2019-09-16 17:22:07,681 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-09-16 17:22:07,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-16 17:22:07,682 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2019-09-16 17:22:07,682 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2019-09-16 17:22:07,682 INFO L130 BoogieDeclarations]: Found specification of procedure __class_create [2019-09-16 17:22:07,682 INFO L130 BoogieDeclarations]: Found specification of procedure class_destroy [2019-09-16 17:22:07,682 INFO L130 BoogieDeclarations]: Found specification of procedure device_create [2019-09-16 17:22:07,683 INFO L130 BoogieDeclarations]: Found specification of procedure device_destroy [2019-09-16 17:22:07,683 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_timeout_interruptible [2019-09-16 17:22:07,683 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2019-09-16 17:22:07,683 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2019-09-16 17:22:07,683 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2019-09-16 17:22:07,684 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2019-09-16 17:22:07,684 INFO L130 BoogieDeclarations]: Found specification of procedure pi_init [2019-09-16 17:22:07,684 INFO L130 BoogieDeclarations]: Found specification of procedure pi_release [2019-09-16 17:22:07,684 INFO L130 BoogieDeclarations]: Found specification of procedure pi_write_regr [2019-09-16 17:22:07,684 INFO L130 BoogieDeclarations]: Found specification of procedure pi_read_regr [2019-09-16 17:22:07,685 INFO L130 BoogieDeclarations]: Found specification of procedure pi_write_block [2019-09-16 17:22:07,685 INFO L130 BoogieDeclarations]: Found specification of procedure pi_read_block [2019-09-16 17:22:07,685 INFO L130 BoogieDeclarations]: Found specification of procedure pi_connect [2019-09-16 17:22:07,685 INFO L130 BoogieDeclarations]: Found specification of procedure pi_disconnect [2019-09-16 17:22:07,685 INFO L130 BoogieDeclarations]: Found specification of procedure pg_open [2019-09-16 17:22:07,685 INFO L130 BoogieDeclarations]: Found specification of procedure pg_release [2019-09-16 17:22:07,686 INFO L130 BoogieDeclarations]: Found specification of procedure pg_read [2019-09-16 17:22:07,686 INFO L130 BoogieDeclarations]: Found specification of procedure pg_write [2019-09-16 17:22:07,686 INFO L130 BoogieDeclarations]: Found specification of procedure pg_detect [2019-09-16 17:22:07,686 INFO L130 BoogieDeclarations]: Found specification of procedure pg_identify [2019-09-16 17:22:07,686 INFO L130 BoogieDeclarations]: Found specification of procedure pg_init_units [2019-09-16 17:22:07,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-16 17:22:07,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-16 17:22:07,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-16 17:22:07,687 INFO L130 BoogieDeclarations]: Found specification of procedure status_reg [2019-09-16 17:22:07,687 INFO L130 BoogieDeclarations]: Found specification of procedure read_reg [2019-09-16 17:22:07,687 INFO L130 BoogieDeclarations]: Found specification of procedure write_reg [2019-09-16 17:22:07,688 INFO L130 BoogieDeclarations]: Found specification of procedure DRIVE [2019-09-16 17:22:07,688 INFO L130 BoogieDeclarations]: Found specification of procedure pg_sleep [2019-09-16 17:22:07,688 INFO L130 BoogieDeclarations]: Found specification of procedure pg_wait [2019-09-16 17:22:07,688 INFO L130 BoogieDeclarations]: Found specification of procedure pg_command [2019-09-16 17:22:07,688 INFO L130 BoogieDeclarations]: Found specification of procedure pg_completion [2019-09-16 17:22:07,688 INFO L130 BoogieDeclarations]: Found specification of procedure pg_reset [2019-09-16 17:22:07,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-16 17:22:07,689 INFO L130 BoogieDeclarations]: Found specification of procedure xs [2019-09-16 17:22:07,689 INFO L130 BoogieDeclarations]: Found specification of procedure pg_probe [2019-09-16 17:22:07,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-09-16 17:22:07,689 INFO L130 BoogieDeclarations]: Found specification of procedure pg_init [2019-09-16 17:22:07,689 INFO L130 BoogieDeclarations]: Found specification of procedure pg_exit [2019-09-16 17:22:07,690 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-09-16 17:22:07,690 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-09-16 17:22:07,690 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 17:22:07,690 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-09-16 17:22:07,690 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_trap [2019-09-16 17:22:07,690 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_cred_guard_mutex_of_signal_struct [2019-09-16 17:22:07,691 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_cred_guard_mutex_of_signal_struct [2019-09-16 17:22:07,691 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_cred_guard_mutex_of_signal_struct [2019-09-16 17:22:07,691 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_cred_guard_mutex_of_signal_struct [2019-09-16 17:22:07,691 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_cred_guard_mutex_of_signal_struct [2019-09-16 17:22:07,691 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_lock [2019-09-16 17:22:07,692 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_lock [2019-09-16 17:22:07,692 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_lock [2019-09-16 17:22:07,692 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_lock [2019-09-16 17:22:07,692 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_lock [2019-09-16 17:22:07,692 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_mutex_of_device [2019-09-16 17:22:07,692 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_mutex_of_device [2019-09-16 17:22:07,693 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_mutex_of_device [2019-09-16 17:22:07,693 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_mutex_of_device [2019-09-16 17:22:07,693 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_pg_mutex [2019-09-16 17:22:07,693 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_pg_mutex [2019-09-16 17:22:07,693 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_pg_mutex [2019-09-16 17:22:07,693 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_pg_mutex [2019-09-16 17:22:07,694 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_pg_mutex [2019-09-16 17:22:07,694 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-09-16 17:22:07,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-09-16 17:22:07,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-16 17:22:07,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-16 17:22:07,694 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-16 17:22:07,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 17:22:07,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-16 17:22:07,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-16 17:22:07,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 17:22:11,049 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 17:22:11,050 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-16 17:22:11,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:22:11 BoogieIcfgContainer [2019-09-16 17:22:11,052 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 17:22:11,054 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 17:22:11,054 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 17:22:11,057 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 17:22:11,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 05:22:05" (1/3) ... [2019-09-16 17:22:11,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b71bcb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:22:11, skipping insertion in model container [2019-09-16 17:22:11,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:22:07" (2/3) ... [2019-09-16 17:22:11,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b71bcb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:22:11, skipping insertion in model container [2019-09-16 17:22:11,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:22:11" (3/3) ... [2019-09-16 17:22:11,062 INFO L109 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pg.ko-main.cil.out.i [2019-09-16 17:22:11,072 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 17:22:11,087 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 17:22:11,105 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 17:22:11,137 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 17:22:11,137 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-16 17:22:11,138 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 17:22:11,138 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 17:22:11,138 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 17:22:11,138 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 17:22:11,138 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 17:22:11,139 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 17:22:11,181 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states. [2019-09-16 17:22:11,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-16 17:22:11,200 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:22:11,201 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:22:11,204 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:22:11,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:22:11,212 INFO L82 PathProgramCache]: Analyzing trace with hash -466886759, now seen corresponding path program 1 times [2019-09-16 17:22:11,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:22:11,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:22:11,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:22:11,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:22:11,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:22:11,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:22:11,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:22:11,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:22:11,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:22:11,900 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:22:11,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:22:11,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:22:11,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:22:11,923 INFO L87 Difference]: Start difference. First operand 699 states. Second operand 4 states. [2019-09-16 17:22:12,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:22:12,828 INFO L93 Difference]: Finished difference Result 589 states and 754 transitions. [2019-09-16 17:22:12,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:22:12,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-09-16 17:22:12,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:22:12,853 INFO L225 Difference]: With dead ends: 589 [2019-09-16 17:22:12,853 INFO L226 Difference]: Without dead ends: 582 [2019-09-16 17:22:12,855 INFO L636 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-09-16 17:22:12,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-09-16 17:22:12,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-09-16 17:22:12,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-09-16 17:22:12,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 747 transitions. [2019-09-16 17:22:12,951 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 747 transitions. Word has length 31 [2019-09-16 17:22:12,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:22:12,952 INFO L475 AbstractCegarLoop]: Abstraction has 582 states and 747 transitions. [2019-09-16 17:22:12,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:22:12,952 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 747 transitions. [2019-09-16 17:22:12,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-16 17:22:12,957 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:22:12,957 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:22:12,958 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:22:12,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:22:12,958 INFO L82 PathProgramCache]: Analyzing trace with hash -503911691, now seen corresponding path program 1 times [2019-09-16 17:22:12,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:22:12,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:22:12,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:22:12,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:22:12,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:22:13,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:22:13,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:22:13,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:22:13,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:22:13,245 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:22:13,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:22:13,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:22:13,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:22:13,248 INFO L87 Difference]: Start difference. First operand 582 states and 747 transitions. Second operand 3 states. [2019-09-16 17:22:13,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:22:13,411 INFO L93 Difference]: Finished difference Result 899 states and 1159 transitions. [2019-09-16 17:22:13,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:22:13,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-09-16 17:22:13,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:22:13,419 INFO L225 Difference]: With dead ends: 899 [2019-09-16 17:22:13,419 INFO L226 Difference]: Without dead ends: 899 [2019-09-16 17:22:13,420 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:22:13,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2019-09-16 17:22:13,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 851. [2019-09-16 17:22:13,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 851 states. [2019-09-16 17:22:13,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1104 transitions. [2019-09-16 17:22:13,478 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1104 transitions. Word has length 34 [2019-09-16 17:22:13,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:22:13,478 INFO L475 AbstractCegarLoop]: Abstraction has 851 states and 1104 transitions. [2019-09-16 17:22:13,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:22:13,479 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1104 transitions. [2019-09-16 17:22:13,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-16 17:22:13,481 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:22:13,481 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:22:13,482 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:22:13,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:22:13,482 INFO L82 PathProgramCache]: Analyzing trace with hash -159570386, now seen corresponding path program 1 times [2019-09-16 17:22:13,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:22:13,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:22:13,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:22:13,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:22:13,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:22:13,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:22:13,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:22:13,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:22:13,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:22:13,779 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:22:13,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:22:13,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:22:13,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:22:13,781 INFO L87 Difference]: Start difference. First operand 851 states and 1104 transitions. Second operand 3 states. [2019-09-16 17:22:13,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:22:13,830 INFO L93 Difference]: Finished difference Result 863 states and 1120 transitions. [2019-09-16 17:22:13,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:22:13,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-09-16 17:22:13,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:22:13,841 INFO L225 Difference]: With dead ends: 863 [2019-09-16 17:22:13,842 INFO L226 Difference]: Without dead ends: 863 [2019-09-16 17:22:13,842 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:22:13,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2019-09-16 17:22:13,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 853. [2019-09-16 17:22:13,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2019-09-16 17:22:13,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1106 transitions. [2019-09-16 17:22:13,892 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1106 transitions. Word has length 44 [2019-09-16 17:22:13,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:22:13,892 INFO L475 AbstractCegarLoop]: Abstraction has 853 states and 1106 transitions. [2019-09-16 17:22:13,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:22:13,892 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1106 transitions. [2019-09-16 17:22:13,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-16 17:22:13,894 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:22:13,895 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:22:13,895 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:22:13,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:22:13,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1084319382, now seen corresponding path program 1 times [2019-09-16 17:22:13,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:22:13,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:22:13,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:22:13,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:22:13,906 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:22:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:22:14,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:22:14,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:22:14,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:22:14,070 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:22:14,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:22:14,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:22:14,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:22:14,071 INFO L87 Difference]: Start difference. First operand 853 states and 1106 transitions. Second operand 3 states. [2019-09-16 17:22:14,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:22:14,417 INFO L93 Difference]: Finished difference Result 1287 states and 1666 transitions. [2019-09-16 17:22:14,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:22:14,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-09-16 17:22:14,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:22:14,430 INFO L225 Difference]: With dead ends: 1287 [2019-09-16 17:22:14,431 INFO L226 Difference]: Without dead ends: 1287 [2019-09-16 17:22:14,431 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:22:14,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2019-09-16 17:22:14,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1283. [2019-09-16 17:22:14,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2019-09-16 17:22:14,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1663 transitions. [2019-09-16 17:22:14,491 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1663 transitions. Word has length 46 [2019-09-16 17:22:14,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:22:14,491 INFO L475 AbstractCegarLoop]: Abstraction has 1283 states and 1663 transitions. [2019-09-16 17:22:14,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:22:14,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1663 transitions. [2019-09-16 17:22:14,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-16 17:22:14,496 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:22:14,496 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:22:14,497 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:22:14,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:22:14,498 INFO L82 PathProgramCache]: Analyzing trace with hash 819154128, now seen corresponding path program 1 times [2019-09-16 17:22:14,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:22:14,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:22:14,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:22:14,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:22:14,507 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:22:14,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:22:14,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-16 17:22:14,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:22:14,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:22:14,740 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:22:14,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:22:14,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:22:14,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:22:14,741 INFO L87 Difference]: Start difference. First operand 1283 states and 1663 transitions. Second operand 3 states. [2019-09-16 17:22:14,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:22:14,774 INFO L93 Difference]: Finished difference Result 1313 states and 1707 transitions. [2019-09-16 17:22:14,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:22:14,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-09-16 17:22:14,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:22:14,790 INFO L225 Difference]: With dead ends: 1313 [2019-09-16 17:22:14,790 INFO L226 Difference]: Without dead ends: 1313 [2019-09-16 17:22:14,791 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:22:14,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2019-09-16 17:22:14,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 1309. [2019-09-16 17:22:14,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1309 states. [2019-09-16 17:22:14,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1309 states and 1703 transitions. [2019-09-16 17:22:14,837 INFO L78 Accepts]: Start accepts. Automaton has 1309 states and 1703 transitions. Word has length 53 [2019-09-16 17:22:14,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:22:14,838 INFO L475 AbstractCegarLoop]: Abstraction has 1309 states and 1703 transitions. [2019-09-16 17:22:14,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:22:14,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 1703 transitions. [2019-09-16 17:22:14,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-16 17:22:14,839 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:22:14,840 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:22:14,840 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:22:14,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:22:14,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1968261359, now seen corresponding path program 1 times [2019-09-16 17:22:14,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:22:14,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:22:14,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:22:14,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:22:14,848 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:22:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:22:15,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-16 17:22:15,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:22:15,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:22:15,064 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:22:15,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:22:15,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:22:15,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:22:15,065 INFO L87 Difference]: Start difference. First operand 1309 states and 1703 transitions. Second operand 3 states. [2019-09-16 17:22:15,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:22:15,175 INFO L93 Difference]: Finished difference Result 1320 states and 1714 transitions. [2019-09-16 17:22:15,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:22:15,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-09-16 17:22:15,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:22:15,184 INFO L225 Difference]: With dead ends: 1320 [2019-09-16 17:22:15,184 INFO L226 Difference]: Without dead ends: 1320 [2019-09-16 17:22:15,185 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:22:15,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2019-09-16 17:22:15,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1309. [2019-09-16 17:22:15,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1309 states. [2019-09-16 17:22:15,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1309 states and 1701 transitions. [2019-09-16 17:22:15,226 INFO L78 Accepts]: Start accepts. Automaton has 1309 states and 1701 transitions. Word has length 53 [2019-09-16 17:22:15,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:22:15,226 INFO L475 AbstractCegarLoop]: Abstraction has 1309 states and 1701 transitions. [2019-09-16 17:22:15,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:22:15,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 1701 transitions. [2019-09-16 17:22:15,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-16 17:22:15,228 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:22:15,228 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:22:15,228 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:22:15,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:22:15,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1911003057, now seen corresponding path program 1 times [2019-09-16 17:22:15,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:22:15,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:22:15,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:22:15,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:22:15,234 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:22:15,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:22:15,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-16 17:22:15,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:22:15,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:22:15,417 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:22:15,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:22:15,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:22:15,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:22:15,418 INFO L87 Difference]: Start difference. First operand 1309 states and 1701 transitions. Second operand 3 states. [2019-09-16 17:22:15,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:22:15,651 INFO L93 Difference]: Finished difference Result 1308 states and 1699 transitions. [2019-09-16 17:22:15,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:22:15,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-09-16 17:22:15,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:22:15,659 INFO L225 Difference]: With dead ends: 1308 [2019-09-16 17:22:15,660 INFO L226 Difference]: Without dead ends: 1308 [2019-09-16 17:22:15,660 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:22:15,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2019-09-16 17:22:15,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1308. [2019-09-16 17:22:15,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1308 states. [2019-09-16 17:22:15,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 1699 transitions. [2019-09-16 17:22:15,701 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 1699 transitions. Word has length 53 [2019-09-16 17:22:15,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:22:15,702 INFO L475 AbstractCegarLoop]: Abstraction has 1308 states and 1699 transitions. [2019-09-16 17:22:15,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:22:15,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 1699 transitions. [2019-09-16 17:22:15,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-16 17:22:15,703 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:22:15,703 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:22:15,703 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:22:15,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:22:15,703 INFO L82 PathProgramCache]: Analyzing trace with hash 888053654, now seen corresponding path program 1 times [2019-09-16 17:22:15,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:22:15,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:22:15,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:22:15,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:22:15,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:22:15,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:22:15,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-16 17:22:15,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:22:15,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:22:15,879 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:22:15,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:22:15,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:22:15,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:22:15,880 INFO L87 Difference]: Start difference. First operand 1308 states and 1699 transitions. Second operand 3 states. [2019-09-16 17:22:16,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:22:16,251 INFO L93 Difference]: Finished difference Result 1307 states and 1697 transitions. [2019-09-16 17:22:16,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:22:16,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-09-16 17:22:16,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:22:16,261 INFO L225 Difference]: With dead ends: 1307 [2019-09-16 17:22:16,261 INFO L226 Difference]: Without dead ends: 1307 [2019-09-16 17:22:16,262 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:22:16,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1307 states. [2019-09-16 17:22:16,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1307 to 1307. [2019-09-16 17:22:16,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1307 states. [2019-09-16 17:22:16,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1307 states and 1697 transitions. [2019-09-16 17:22:16,315 INFO L78 Accepts]: Start accepts. Automaton has 1307 states and 1697 transitions. Word has length 54 [2019-09-16 17:22:16,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:22:16,316 INFO L475 AbstractCegarLoop]: Abstraction has 1307 states and 1697 transitions. [2019-09-16 17:22:16,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:22:16,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 1697 transitions. [2019-09-16 17:22:16,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-16 17:22:16,317 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:22:16,318 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:22:16,318 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:22:16,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:22:16,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1759470642, now seen corresponding path program 1 times [2019-09-16 17:22:16,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:22:16,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:22:16,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:22:16,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:22:16,324 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:22:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:22:16,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-16 17:22:16,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:22:16,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:22:16,479 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:22:16,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:22:16,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:22:16,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:22:16,480 INFO L87 Difference]: Start difference. First operand 1307 states and 1697 transitions. Second operand 3 states. [2019-09-16 17:22:16,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:22:16,797 INFO L93 Difference]: Finished difference Result 1306 states and 1695 transitions. [2019-09-16 17:22:16,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:22:16,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-09-16 17:22:16,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:22:16,806 INFO L225 Difference]: With dead ends: 1306 [2019-09-16 17:22:16,806 INFO L226 Difference]: Without dead ends: 1306 [2019-09-16 17:22:16,807 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:22:16,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2019-09-16 17:22:16,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 1306. [2019-09-16 17:22:16,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1306 states. [2019-09-16 17:22:16,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 1695 transitions. [2019-09-16 17:22:16,848 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 1695 transitions. Word has length 55 [2019-09-16 17:22:16,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:22:16,849 INFO L475 AbstractCegarLoop]: Abstraction has 1306 states and 1695 transitions. [2019-09-16 17:22:16,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:22:16,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1695 transitions. [2019-09-16 17:22:16,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-16 17:22:16,850 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:22:16,850 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:22:16,850 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:22:16,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:22:16,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1291368935, now seen corresponding path program 1 times [2019-09-16 17:22:16,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:22:16,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:22:16,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:22:16,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:22:16,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:22:16,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:22:17,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-16 17:22:17,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:22:17,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:22:17,011 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:22:17,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:22:17,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:22:17,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:22:17,012 INFO L87 Difference]: Start difference. First operand 1306 states and 1695 transitions. Second operand 3 states. [2019-09-16 17:22:17,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:22:17,322 INFO L93 Difference]: Finished difference Result 1653 states and 2135 transitions. [2019-09-16 17:22:17,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:22:17,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-09-16 17:22:17,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:22:17,333 INFO L225 Difference]: With dead ends: 1653 [2019-09-16 17:22:17,334 INFO L226 Difference]: Without dead ends: 1608 [2019-09-16 17:22:17,334 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:22:17,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2019-09-16 17:22:17,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1608. [2019-09-16 17:22:17,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1608 states. [2019-09-16 17:22:17,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2083 transitions. [2019-09-16 17:22:17,387 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 2083 transitions. Word has length 56 [2019-09-16 17:22:17,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:22:17,388 INFO L475 AbstractCegarLoop]: Abstraction has 1608 states and 2083 transitions. [2019-09-16 17:22:17,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:22:17,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2083 transitions. [2019-09-16 17:22:17,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-16 17:22:17,397 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:22:17,397 INFO L407 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, 1, 1] [2019-09-16 17:22:17,398 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:22:17,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:22:17,398 INFO L82 PathProgramCache]: Analyzing trace with hash -979606059, now seen corresponding path program 1 times [2019-09-16 17:22:17,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:22:17,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:22:17,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:22:17,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:22:17,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:22:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:22:17,658 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-16 17:22:17,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:22:17,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:22:17,659 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:22:17,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:22:17,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:22:17,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:22:17,660 INFO L87 Difference]: Start difference. First operand 1608 states and 2083 transitions. Second operand 5 states. [2019-09-16 17:22:17,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:22:17,710 INFO L93 Difference]: Finished difference Result 1622 states and 2097 transitions. [2019-09-16 17:22:17,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:22:17,712 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-09-16 17:22:17,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:22:17,726 INFO L225 Difference]: With dead ends: 1622 [2019-09-16 17:22:17,726 INFO L226 Difference]: Without dead ends: 1622 [2019-09-16 17:22:17,728 INFO L636 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-09-16 17:22:17,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2019-09-16 17:22:17,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1622. [2019-09-16 17:22:17,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1622 states. [2019-09-16 17:22:17,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 2097 transitions. [2019-09-16 17:22:17,803 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 2097 transitions. Word has length 106 [2019-09-16 17:22:17,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:22:17,804 INFO L475 AbstractCegarLoop]: Abstraction has 1622 states and 2097 transitions. [2019-09-16 17:22:17,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:22:17,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 2097 transitions. [2019-09-16 17:22:17,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-16 17:22:17,811 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:22:17,811 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:22:17,811 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:22:17,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:22:17,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1122639744, now seen corresponding path program 1 times [2019-09-16 17:22:17,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:22:17,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:22:17,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:22:17,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:22:17,821 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:22:17,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:22:18,130 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-16 17:22:18,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:22:18,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:22:18,130 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:22:18,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:22:18,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:22:18,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:22:18,132 INFO L87 Difference]: Start difference. First operand 1622 states and 2097 transitions. Second operand 5 states. [2019-09-16 17:22:18,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:22:18,175 INFO L93 Difference]: Finished difference Result 1640 states and 2121 transitions. [2019-09-16 17:22:18,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:22:18,176 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2019-09-16 17:22:18,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:22:18,185 INFO L225 Difference]: With dead ends: 1640 [2019-09-16 17:22:18,186 INFO L226 Difference]: Without dead ends: 1640 [2019-09-16 17:22:18,186 INFO L636 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-09-16 17:22:18,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2019-09-16 17:22:18,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1630. [2019-09-16 17:22:18,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1630 states. [2019-09-16 17:22:18,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2109 transitions. [2019-09-16 17:22:18,243 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2109 transitions. Word has length 122 [2019-09-16 17:22:18,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:22:18,243 INFO L475 AbstractCegarLoop]: Abstraction has 1630 states and 2109 transitions. [2019-09-16 17:22:18,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:22:18,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2109 transitions. [2019-09-16 17:22:18,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-16 17:22:18,248 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:22:18,248 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:22:18,249 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:22:18,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:22:18,249 INFO L82 PathProgramCache]: Analyzing trace with hash -489656520, now seen corresponding path program 1 times [2019-09-16 17:22:18,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:22:18,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:22:18,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:22:18,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:22:18,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:22:18,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:22:18,477 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-16 17:22:18,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:22:18,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:22:18,478 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:22:18,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:22:18,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:22:18,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:22:18,479 INFO L87 Difference]: Start difference. First operand 1630 states and 2109 transitions. Second operand 5 states. [2019-09-16 17:22:18,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:22:18,542 INFO L93 Difference]: Finished difference Result 1698 states and 2207 transitions. [2019-09-16 17:22:18,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:22:18,543 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-09-16 17:22:18,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:22:18,554 INFO L225 Difference]: With dead ends: 1698 [2019-09-16 17:22:18,554 INFO L226 Difference]: Without dead ends: 1698 [2019-09-16 17:22:18,556 INFO L636 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-09-16 17:22:18,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2019-09-16 17:22:18,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 1638. [2019-09-16 17:22:18,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1638 states. [2019-09-16 17:22:18,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1638 states and 2117 transitions. [2019-09-16 17:22:18,611 INFO L78 Accepts]: Start accepts. Automaton has 1638 states and 2117 transitions. Word has length 133 [2019-09-16 17:22:18,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:22:18,612 INFO L475 AbstractCegarLoop]: Abstraction has 1638 states and 2117 transitions. [2019-09-16 17:22:18,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:22:18,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1638 states and 2117 transitions. [2019-09-16 17:22:18,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-09-16 17:22:18,619 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:22:18,619 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:22:18,619 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:22:18,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:22:18,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1433135490, now seen corresponding path program 1 times [2019-09-16 17:22:18,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:22:18,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:22:18,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:22:18,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:22:18,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:22:18,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:22:18,893 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-16 17:22:18,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:22:18,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:22:18,894 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:22:18,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:22:18,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:22:18,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:22:18,895 INFO L87 Difference]: Start difference. First operand 1638 states and 2117 transitions. Second operand 4 states. [2019-09-16 17:22:18,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:22:18,959 INFO L93 Difference]: Finished difference Result 1753 states and 2285 transitions. [2019-09-16 17:22:18,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:22:18,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 233 [2019-09-16 17:22:18,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:22:18,971 INFO L225 Difference]: With dead ends: 1753 [2019-09-16 17:22:18,971 INFO L226 Difference]: Without dead ends: 1753 [2019-09-16 17:22:18,973 INFO L636 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-09-16 17:22:18,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1753 states. [2019-09-16 17:22:19,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1753 to 1648. [2019-09-16 17:22:19,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1648 states. [2019-09-16 17:22:19,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2127 transitions. [2019-09-16 17:22:19,028 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2127 transitions. Word has length 233 [2019-09-16 17:22:19,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:22:19,029 INFO L475 AbstractCegarLoop]: Abstraction has 1648 states and 2127 transitions. [2019-09-16 17:22:19,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:22:19,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2127 transitions. [2019-09-16 17:22:19,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-16 17:22:19,035 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:22:19,035 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:22:19,036 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:22:19,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:22:19,036 INFO L82 PathProgramCache]: Analyzing trace with hash 583558566, now seen corresponding path program 1 times [2019-09-16 17:22:19,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:22:19,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:22:19,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:22:19,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:22:19,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:22:19,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:22:19,337 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-16 17:22:19,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:22:19,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:22:19,338 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:22:19,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:22:19,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:22:19,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:22:19,339 INFO L87 Difference]: Start difference. First operand 1648 states and 2127 transitions. Second operand 3 states. [2019-09-16 17:22:19,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:22:19,382 INFO L93 Difference]: Finished difference Result 1673 states and 2157 transitions. [2019-09-16 17:22:19,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:22:19,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 242 [2019-09-16 17:22:19,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:22:19,393 INFO L225 Difference]: With dead ends: 1673 [2019-09-16 17:22:19,394 INFO L226 Difference]: Without dead ends: 1673 [2019-09-16 17:22:19,396 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:22:19,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2019-09-16 17:22:19,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1658. [2019-09-16 17:22:19,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1658 states. [2019-09-16 17:22:19,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 2137 transitions. [2019-09-16 17:22:19,472 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 2137 transitions. Word has length 242 [2019-09-16 17:22:19,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:22:19,473 INFO L475 AbstractCegarLoop]: Abstraction has 1658 states and 2137 transitions. [2019-09-16 17:22:19,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:22:19,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2137 transitions. [2019-09-16 17:22:19,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-16 17:22:19,483 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:22:19,484 INFO L407 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2019-09-16 17:22:19,484 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:22:19,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:22:19,485 INFO L82 PathProgramCache]: Analyzing trace with hash 741430911, now seen corresponding path program 1 times [2019-09-16 17:22:19,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:22:19,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:22:19,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:22:19,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:22:19,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:22:19,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:22:19,904 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-16 17:22:19,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:22:19,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 17:22:19,907 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:22:19,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 17:22:19,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 17:22:19,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:22:19,908 INFO L87 Difference]: Start difference. First operand 1658 states and 2137 transitions. Second operand 6 states. [2019-09-16 17:22:20,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:22:20,016 INFO L93 Difference]: Finished difference Result 1723 states and 2224 transitions. [2019-09-16 17:22:20,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:22:20,017 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 253 [2019-09-16 17:22:20,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:22:20,032 INFO L225 Difference]: With dead ends: 1723 [2019-09-16 17:22:20,032 INFO L226 Difference]: Without dead ends: 1723 [2019-09-16 17:22:20,033 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-16 17:22:20,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2019-09-16 17:22:20,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 1699. [2019-09-16 17:22:20,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1699 states. [2019-09-16 17:22:20,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2193 transitions. [2019-09-16 17:22:20,114 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2193 transitions. Word has length 253 [2019-09-16 17:22:20,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:22:20,117 INFO L475 AbstractCegarLoop]: Abstraction has 1699 states and 2193 transitions. [2019-09-16 17:22:20,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 17:22:20,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2193 transitions. [2019-09-16 17:22:20,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-16 17:22:20,124 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:22:20,125 INFO L407 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2019-09-16 17:22:20,125 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:22:20,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:22:20,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1046438911, now seen corresponding path program 1 times [2019-09-16 17:22:20,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:22:20,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:22:20,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:22:20,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:22:20,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:22:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:22:20,398 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-16 17:22:20,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:22:20,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:22:20,399 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:22:20,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:22:20,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:22:20,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:22:20,401 INFO L87 Difference]: Start difference. First operand 1699 states and 2193 transitions. Second operand 5 states. [2019-09-16 17:22:20,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:22:20,434 INFO L93 Difference]: Finished difference Result 1744 states and 2259 transitions. [2019-09-16 17:22:20,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:22:20,435 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 253 [2019-09-16 17:22:20,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:22:20,445 INFO L225 Difference]: With dead ends: 1744 [2019-09-16 17:22:20,445 INFO L226 Difference]: Without dead ends: 1744 [2019-09-16 17:22:20,447 INFO L636 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-09-16 17:22:20,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1744 states. [2019-09-16 17:22:20,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1744 to 1719. [2019-09-16 17:22:20,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2019-09-16 17:22:20,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2228 transitions. [2019-09-16 17:22:20,508 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2228 transitions. Word has length 253 [2019-09-16 17:22:20,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:22:20,509 INFO L475 AbstractCegarLoop]: Abstraction has 1719 states and 2228 transitions. [2019-09-16 17:22:20,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:22:20,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2228 transitions. [2019-09-16 17:22:20,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-09-16 17:22:20,516 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:22:20,516 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:22:20,517 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:22:20,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:22:20,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1274515421, now seen corresponding path program 1 times [2019-09-16 17:22:20,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:22:20,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:22:20,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:22:20,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:22:20,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:22:20,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:22:21,027 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-09-16 17:22:21,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:22:21,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-16 17:22:21,028 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:22:21,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-16 17:22:21,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-16 17:22:21,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-16 17:22:21,032 INFO L87 Difference]: Start difference. First operand 1719 states and 2228 transitions. Second operand 10 states. [2019-09-16 17:22:21,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:22:21,145 INFO L93 Difference]: Finished difference Result 1768 states and 2284 transitions. [2019-09-16 17:22:21,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-16 17:22:21,145 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 286 [2019-09-16 17:22:21,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:22:21,162 INFO L225 Difference]: With dead ends: 1768 [2019-09-16 17:22:21,163 INFO L226 Difference]: Without dead ends: 1768 [2019-09-16 17:22:21,163 INFO L636 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-09-16 17:22:21,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2019-09-16 17:22:21,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1729. [2019-09-16 17:22:21,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1729 states. [2019-09-16 17:22:21,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1729 states to 1729 states and 2239 transitions. [2019-09-16 17:22:21,235 INFO L78 Accepts]: Start accepts. Automaton has 1729 states and 2239 transitions. Word has length 286 [2019-09-16 17:22:21,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:22:21,235 INFO L475 AbstractCegarLoop]: Abstraction has 1729 states and 2239 transitions. [2019-09-16 17:22:21,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-16 17:22:21,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1729 states and 2239 transitions. [2019-09-16 17:22:21,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-09-16 17:22:21,243 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:22:21,244 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:22:21,244 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:22:21,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:22:21,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1005796931, now seen corresponding path program 1 times [2019-09-16 17:22:21,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:22:21,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:22:21,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:22:21,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:22:21,253 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:22:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:22:21,564 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-09-16 17:22:21,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:22:21,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 17:22:21,564 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:22:21,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 17:22:21,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 17:22:21,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:22:21,567 INFO L87 Difference]: Start difference. First operand 1729 states and 2239 transitions. Second operand 6 states. [2019-09-16 17:22:21,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:22:21,654 INFO L93 Difference]: Finished difference Result 1767 states and 2290 transitions. [2019-09-16 17:22:21,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-16 17:22:21,655 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 288 [2019-09-16 17:22:21,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:22:21,678 INFO L225 Difference]: With dead ends: 1767 [2019-09-16 17:22:21,678 INFO L226 Difference]: Without dead ends: 1767 [2019-09-16 17:22:21,679 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-16 17:22:21,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2019-09-16 17:22:21,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1733. [2019-09-16 17:22:21,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1733 states. [2019-09-16 17:22:21,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2243 transitions. [2019-09-16 17:22:21,730 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2243 transitions. Word has length 288 [2019-09-16 17:22:21,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:22:21,730 INFO L475 AbstractCegarLoop]: Abstraction has 1733 states and 2243 transitions. [2019-09-16 17:22:21,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 17:22:21,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2243 transitions. [2019-09-16 17:22:21,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-09-16 17:22:21,739 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:22:21,739 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:22:21,740 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:22:21,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:22:21,740 INFO L82 PathProgramCache]: Analyzing trace with hash -362663679, now seen corresponding path program 1 times [2019-09-16 17:22:21,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:22:21,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:22:21,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:22:21,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:22:21,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:22:21,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:22:22,122 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-09-16 17:22:22,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:22:22,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-16 17:22:22,123 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:22:22,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-16 17:22:22,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-16 17:22:22,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-16 17:22:22,125 INFO L87 Difference]: Start difference. First operand 1733 states and 2243 transitions. Second operand 10 states. [2019-09-16 17:22:22,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:22:22,205 INFO L93 Difference]: Finished difference Result 1782 states and 2302 transitions. [2019-09-16 17:22:22,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-16 17:22:22,205 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 288 [2019-09-16 17:22:22,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:22:22,214 INFO L225 Difference]: With dead ends: 1782 [2019-09-16 17:22:22,214 INFO L226 Difference]: Without dead ends: 1782 [2019-09-16 17:22:22,215 INFO L636 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-09-16 17:22:22,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1782 states. [2019-09-16 17:22:22,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1782 to 1735. [2019-09-16 17:22:22,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735 states. [2019-09-16 17:22:22,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2245 transitions. [2019-09-16 17:22:22,292 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2245 transitions. Word has length 288 [2019-09-16 17:22:22,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:22:22,294 INFO L475 AbstractCegarLoop]: Abstraction has 1735 states and 2245 transitions. [2019-09-16 17:22:22,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-16 17:22:22,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2245 transitions. [2019-09-16 17:22:22,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-09-16 17:22:22,300 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:22:22,301 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:22:22,301 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:22:22,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:22:22,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1004757881, now seen corresponding path program 1 times [2019-09-16 17:22:22,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:22:22,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:22:22,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:22:22,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:22:22,308 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:22:22,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:22:22,672 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-09-16 17:22:22,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:22:22,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-16 17:22:22,673 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:22:22,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-16 17:22:22,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-16 17:22:22,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-16 17:22:22,674 INFO L87 Difference]: Start difference. First operand 1735 states and 2245 transitions. Second operand 10 states. [2019-09-16 17:22:22,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:22:22,777 INFO L93 Difference]: Finished difference Result 1832 states and 2386 transitions. [2019-09-16 17:22:22,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-16 17:22:22,777 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 299 [2019-09-16 17:22:22,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:22:22,786 INFO L225 Difference]: With dead ends: 1832 [2019-09-16 17:22:22,786 INFO L226 Difference]: Without dead ends: 1832 [2019-09-16 17:22:22,787 INFO L636 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-09-16 17:22:22,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832 states. [2019-09-16 17:22:22,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832 to 1735. [2019-09-16 17:22:22,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735 states. [2019-09-16 17:22:22,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2245 transitions. [2019-09-16 17:22:22,854 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2245 transitions. Word has length 299 [2019-09-16 17:22:22,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:22:22,855 INFO L475 AbstractCegarLoop]: Abstraction has 1735 states and 2245 transitions. [2019-09-16 17:22:22,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-16 17:22:22,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2245 transitions. [2019-09-16 17:22:22,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-09-16 17:22:22,865 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:22:22,866 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:22:22,866 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:22:22,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:22:22,867 INFO L82 PathProgramCache]: Analyzing trace with hash 625458459, now seen corresponding path program 1 times [2019-09-16 17:22:22,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:22:22,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:22:22,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:22:22,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:22:22,873 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:22:23,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:22:23,278 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-09-16 17:22:23,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:22:23,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-16 17:22:23,279 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:22:23,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-16 17:22:23,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-16 17:22:23,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-16 17:22:23,280 INFO L87 Difference]: Start difference. First operand 1735 states and 2245 transitions. Second operand 10 states. [2019-09-16 17:22:23,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:22:23,377 INFO L93 Difference]: Finished difference Result 1844 states and 2398 transitions. [2019-09-16 17:22:23,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-16 17:22:23,377 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 297 [2019-09-16 17:22:23,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:22:23,386 INFO L225 Difference]: With dead ends: 1844 [2019-09-16 17:22:23,386 INFO L226 Difference]: Without dead ends: 1844 [2019-09-16 17:22:23,387 INFO L636 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-09-16 17:22:23,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2019-09-16 17:22:23,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1731. [2019-09-16 17:22:23,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1731 states. [2019-09-16 17:22:23,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 2237 transitions. [2019-09-16 17:22:23,432 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 2237 transitions. Word has length 297 [2019-09-16 17:22:23,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:22:23,433 INFO L475 AbstractCegarLoop]: Abstraction has 1731 states and 2237 transitions. [2019-09-16 17:22:23,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-16 17:22:23,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 2237 transitions. [2019-09-16 17:22:23,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-09-16 17:22:23,441 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:22:23,441 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:22:23,441 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:22:23,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:22:23,442 INFO L82 PathProgramCache]: Analyzing trace with hash -562159944, now seen corresponding path program 1 times [2019-09-16 17:22:23,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:22:23,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:22:23,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:22:23,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:22:23,450 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:22:23,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:22:23,956 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-16 17:22:23,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:22:23,956 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:22:23,958 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 330 with the following transitions: [2019-09-16 17:22:23,962 INFO L207 CegarAbsIntRunner]: [0], [2], [3], [6], [8], [9], [10], [12], [13], [14], [15], [16], [17], [18], [20], [21], [53], [54], [59], [61], [62], [183], [185], [186], [189], [191], [233], [238], [240], [242], [243], [267], [279], [284], [286], [289], [291], [293], [295], [307], [311], [315], [316], [317], [318], [325], [326], [339], [344], [349], [351], [353], [356], [360], [364], [366], [368], [369], [370], [371], [372], [375], [376], [377], [379], [381], [384], [390], [550], [553], [555], [558], [560], [563], [609], [611], [616], [618], [620], [623], [626], [647], [660], [673], [686], [689], [692], [718], [721], [724], [736], [739], [742], [744], [747], [755], [792], [793], [872], [875], [908], [911], [916], [917], [936], [938], [940], [944], [948], [951], [953], [958], [962], [965], [969], [971], [973], [978], [1000], [1002], [1004], [1005], [1006], [1011], [1014], [1019], [1021], [1024], [1041], [1076], [1077], [1078], [1079], [1080], [1082], [1086], [1088], [1092], [1100], [1102], [1103], [1140], [1141], [1147], [1148], [1149], [1155], [1177], [1179], [1182], [1184], [1188], [1213], [1214], [1221], [1223], [1225], [1228], [1231], [1270], [1272], [1273], [1298], [1299], [1437], [1438], [1439], [1440], [1441], [1442], [1443], [1444], [1451], [1452], [1475], [1476], [1477], [1478], [1491], [1492], [1493], [1494], [1505], [1506], [1507], [1508], [1509], [1510], [1511], [1512], [1517], [1519], [1520], [1521], [1522], [1523], [1524], [1535], [1569], [1570], [1571], [1572], [1583], [1584], [1595], [1599], [1600], [1615], [1616], [1617], [1618], [1633], [1634], [1635], [1636], [1637], [1638], [1639], [1640], [1641], [1642], [1645], [1646], [1647], [1648], [1649], [1650], [1651], [1652], [1653], [1654], [1655], [1656], [1667], [1668], [1669], [1670], [1689], [1697], [1698], [1699], [1700], [1707], [1708], [1709], [1710], [1711], [1712], [1713], [1714], [1727], [1728], [1751], [1752], [1753] [2019-09-16 17:22:24,034 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:22:24,036 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:22:24,167 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-16 17:22:24,169 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 142 root evaluator evaluations with a maximum evaluation depth of 0. Performed 142 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 278 variables. [2019-09-16 17:22:24,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:22:24,174 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-16 17:22:24,323 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-16 17:22:24,324 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-16 17:22:24,340 INFO L420 sIntCurrentIteration]: We unified 328 AI predicates to 328 [2019-09-16 17:22:24,340 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-16 17:22:24,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-16 17:22:24,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 8 [2019-09-16 17:22:24,343 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:22:24,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-16 17:22:24,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-16 17:22:24,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-16 17:22:24,346 INFO L87 Difference]: Start difference. First operand 1731 states and 2237 transitions. Second operand 2 states. [2019-09-16 17:22:24,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:22:24,347 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-16 17:22:24,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-16 17:22:24,349 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 329 [2019-09-16 17:22:24,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:22:24,350 INFO L225 Difference]: With dead ends: 2 [2019-09-16 17:22:24,350 INFO L226 Difference]: Without dead ends: 0 [2019-09-16 17:22:24,351 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-16 17:22:24,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-16 17:22:24,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-16 17:22:24,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-16 17:22:24,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-16 17:22:24,352 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 329 [2019-09-16 17:22:24,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:22:24,352 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-16 17:22:24,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-16 17:22:24,353 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-16 17:22:24,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-16 17:22:24,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 05:22:24 BoogieIcfgContainer [2019-09-16 17:22:24,358 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 17:22:24,368 INFO L168 Benchmark]: Toolchain (without parser) took 19036.69 ms. Allocated memory was 137.9 MB in the beginning and 734.5 MB in the end (delta: 596.6 MB). Free memory was 79.9 MB in the beginning and 620.2 MB in the end (delta: -540.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 7.1 GB. [2019-09-16 17:22:24,369 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 137.9 MB. Free memory was 103.8 MB in the beginning and 103.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-09-16 17:22:24,370 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1921.75 ms. Allocated memory was 137.9 MB in the beginning and 212.3 MB in the end (delta: 74.4 MB). Free memory was 79.7 MB in the beginning and 114.5 MB in the end (delta: -34.8 MB). Peak memory consumption was 53.5 MB. Max. memory is 7.1 GB. [2019-09-16 17:22:24,371 INFO L168 Benchmark]: Boogie Preprocessor took 310.96 ms. Allocated memory is still 212.3 MB. Free memory was 114.5 MB in the beginning and 99.0 MB in the end (delta: 15.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 7.1 GB. [2019-09-16 17:22:24,374 INFO L168 Benchmark]: RCFGBuilder took 3494.20 ms. Allocated memory was 212.3 MB in the beginning and 388.5 MB in the end (delta: 176.2 MB). Free memory was 99.0 MB in the beginning and 295.4 MB in the end (delta: -196.4 MB). Peak memory consumption was 103.1 MB. Max. memory is 7.1 GB. [2019-09-16 17:22:24,375 INFO L168 Benchmark]: TraceAbstraction took 13304.69 ms. Allocated memory was 388.5 MB in the beginning and 734.5 MB in the end (delta: 346.0 MB). Free memory was 295.4 MB in the beginning and 620.2 MB in the end (delta: -324.8 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. [2019-09-16 17:22:24,387 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.24 ms. Allocated memory is still 137.9 MB. Free memory was 103.8 MB in the beginning and 103.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1921.75 ms. Allocated memory was 137.9 MB in the beginning and 212.3 MB in the end (delta: 74.4 MB). Free memory was 79.7 MB in the beginning and 114.5 MB in the end (delta: -34.8 MB). Peak memory consumption was 53.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 310.96 ms. Allocated memory is still 212.3 MB. Free memory was 114.5 MB in the beginning and 99.0 MB in the end (delta: 15.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3494.20 ms. Allocated memory was 212.3 MB in the beginning and 388.5 MB in the end (delta: 176.2 MB). Free memory was 99.0 MB in the beginning and 295.4 MB in the end (delta: -196.4 MB). Peak memory consumption was 103.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13304.69 ms. Allocated memory was 388.5 MB in the beginning and 734.5 MB in the end (delta: 346.0 MB). Free memory was 295.4 MB in the beginning and 620.2 MB in the end (delta: -324.8 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4029]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 108 procedures, 813 locations, 1 error locations. SAFE Result, 13.2s OverallTime, 23 OverallIterations, 8 TraceHistogramMax, 4.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 16690 SDtfs, 5562 SDslu, 42409 SDs, 0 SdLazy, 653 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 448 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1735occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 2.4786585365853657 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 646 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 3608 NumberOfCodeBlocks, 3608 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 3585 ConstructedInterpolants, 0 QuantifiedInterpolants, 923169 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 22 PerfectInterpolantSequences, 992/994 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...