java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -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-fea9116 [2019-09-20 13:20:27,358 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:20:27,360 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:20:27,372 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:20:27,373 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:20:27,374 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:20:27,375 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:20:27,377 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:20:27,379 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:20:27,379 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:20:27,380 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:20:27,382 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:20:27,382 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:20:27,383 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:20:27,384 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:20:27,385 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:20:27,386 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:20:27,387 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:20:27,389 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:20:27,391 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:20:27,393 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:20:27,394 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:20:27,395 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:20:27,396 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:20:27,399 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:20:27,400 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:20:27,400 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:20:27,401 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:20:27,401 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:20:27,402 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:20:27,403 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:20:27,404 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:20:27,404 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:20:27,405 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:20:27,406 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:20:27,406 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:20:27,407 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:20:27,407 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:20:27,407 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:20:27,408 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:20:27,409 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:20:27,410 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-20 13:20:27,426 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:20:27,426 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:20:27,427 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 13:20:27,428 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 13:20:27,428 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 13:20:27,428 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:20:27,428 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:20:27,428 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 13:20:27,429 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:20:27,429 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:20:27,429 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:20:27,429 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:20:27,429 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:20:27,430 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:20:27,430 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:20:27,430 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 13:20:27,430 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:20:27,430 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:20:27,431 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:20:27,431 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 13:20:27,431 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 13:20:27,431 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:20:27,431 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:20:27,432 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:20:27,432 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 13:20:27,432 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 13:20:27,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:20:27,432 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 13:20:27,433 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:20:27,461 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:20:27,478 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:20:27,481 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:20:27,483 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:20:27,483 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:20:27,484 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-20 13:20:27,565 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ad4d3a15/e7648ecd31414503ac7689ebab69fb8a/FLAG0ca7dee59 [2019-09-20 13:20:28,321 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:20:28,322 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-20 13:20:28,353 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ad4d3a15/e7648ecd31414503ac7689ebab69fb8a/FLAG0ca7dee59 [2019-09-20 13:20:28,420 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ad4d3a15/e7648ecd31414503ac7689ebab69fb8a [2019-09-20 13:20:28,435 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:20:28,437 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:20:28,441 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:20:28,442 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:20:28,446 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:20:28,448 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:20:28" (1/1) ... [2019-09-20 13:20:28,451 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c39475d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:20:28, skipping insertion in model container [2019-09-20 13:20:28,452 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:20:28" (1/1) ... [2019-09-20 13:20:28,461 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:20:28,584 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:20:29,850 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:20:29,899 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:20:30,143 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:20:30,307 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:20:30,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:20:30 WrapperNode [2019-09-20 13:20:30,309 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:20:30,310 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:20:30,310 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:20:30,310 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:20:30,331 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:20:30" (1/1) ... [2019-09-20 13:20:30,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:20:30" (1/1) ... [2019-09-20 13:20:30,379 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:20:30" (1/1) ... [2019-09-20 13:20:30,380 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:20:30" (1/1) ... [2019-09-20 13:20:30,497 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:20:30" (1/1) ... [2019-09-20 13:20:30,534 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:20:30" (1/1) ... [2019-09-20 13:20:30,569 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:20:30" (1/1) ... [2019-09-20 13:20:30,601 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:20:30,602 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:20:30,602 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:20:30,602 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:20:30,605 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:20:30" (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-20 13:20:30,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:20:30,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:20:30,727 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2019-09-20 13:20:30,727 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2019-09-20 13:20:30,728 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2019-09-20 13:20:30,728 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2019-09-20 13:20:30,729 INFO L138 BoogieDeclarations]: Found implementation of procedure iminor [2019-09-20 13:20:30,729 INFO L138 BoogieDeclarations]: Found implementation of procedure register_chrdev [2019-09-20 13:20:30,730 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_chrdev [2019-09-20 13:20:30,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2019-09-20 13:20:30,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-09-20 13:20:30,731 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2019-09-20 13:20:30,732 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2019-09-20 13:20:30,732 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2019-09-20 13:20:30,734 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2019-09-20 13:20:30,734 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_init_units [2019-09-20 13:20:30,737 INFO L138 BoogieDeclarations]: Found implementation of procedure status_reg [2019-09-20 13:20:30,738 INFO L138 BoogieDeclarations]: Found implementation of procedure read_reg [2019-09-20 13:20:30,738 INFO L138 BoogieDeclarations]: Found implementation of procedure write_reg [2019-09-20 13:20:30,739 INFO L138 BoogieDeclarations]: Found implementation of procedure DRIVE [2019-09-20 13:20:30,740 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_sleep [2019-09-20 13:20:30,740 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_wait [2019-09-20 13:20:30,741 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_command [2019-09-20 13:20:30,741 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_completion [2019-09-20 13:20:30,741 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_reset [2019-09-20 13:20:30,741 INFO L138 BoogieDeclarations]: Found implementation of procedure xs [2019-09-20 13:20:30,742 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_identify [2019-09-20 13:20:30,742 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_probe [2019-09-20 13:20:30,742 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_detect [2019-09-20 13:20:30,743 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_open [2019-09-20 13:20:30,743 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_release [2019-09-20 13:20:30,743 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_write [2019-09-20 13:20:30,743 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_read [2019-09-20 13:20:30,744 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_init [2019-09-20 13:20:30,744 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_exit [2019-09-20 13:20:30,744 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:20:30,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_1 [2019-09-20 13:20:30,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_2 [2019-09-20 13:20:30,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_3 [2019-09-20 13:20:30,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_4 [2019-09-20 13:20:30,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_5 [2019-09-20 13:20:30,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_6 [2019-09-20 13:20:30,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_7 [2019-09-20 13:20:30,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_8 [2019-09-20 13:20:30,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_9 [2019-09-20 13:20:30,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_register_chrdev_10 [2019-09-20 13:20:30,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_unregister_chrdev_11 [2019-09-20 13:20:30,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-09-20 13:20:30,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-09-20 13:20:30,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_trap [2019-09-20 13:20:30,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_cred_guard_mutex_of_signal_struct [2019-09-20 13:20:30,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_cred_guard_mutex_of_signal_struct [2019-09-20 13:20:30,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_cred_guard_mutex_of_signal_struct [2019-09-20 13:20:30,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_cred_guard_mutex_of_signal_struct [2019-09-20 13:20:30,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_cred_guard_mutex_of_signal_struct [2019-09-20 13:20:30,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_cred_guard_mutex_of_signal_struct [2019-09-20 13:20:30,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_cred_guard_mutex_of_signal_struct [2019-09-20 13:20:30,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_lock [2019-09-20 13:20:30,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_lock [2019-09-20 13:20:30,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_lock [2019-09-20 13:20:30,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_lock [2019-09-20 13:20:30,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_lock [2019-09-20 13:20:30,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_lock [2019-09-20 13:20:30,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_lock [2019-09-20 13:20:30,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_mutex_of_device [2019-09-20 13:20:30,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_mutex_of_device [2019-09-20 13:20:30,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mutex_of_device [2019-09-20 13:20:30,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_mutex_of_device [2019-09-20 13:20:30,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_mutex_of_device [2019-09-20 13:20:30,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_mutex_of_device [2019-09-20 13:20:30,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mutex_of_device [2019-09-20 13:20:30,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_pg_mutex [2019-09-20 13:20:30,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_pg_mutex [2019-09-20 13:20:30,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_pg_mutex [2019-09-20 13:20:30,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_pg_mutex [2019-09-20 13:20:30,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_pg_mutex [2019-09-20 13:20:30,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_pg_mutex [2019-09-20 13:20:30,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_pg_mutex [2019-09-20 13:20:30,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-09-20 13:20:30,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-09-20 13:20:30,757 INFO L138 BoogieDeclarations]: Found implementation of procedure __class_create [2019-09-20 13:20:30,757 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2019-09-20 13:20:30,758 INFO L138 BoogieDeclarations]: Found implementation of procedure __register_chrdev [2019-09-20 13:20:30,758 INFO L138 BoogieDeclarations]: Found implementation of procedure __unregister_chrdev [2019-09-20 13:20:30,758 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2019-09-20 13:20:30,758 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2019-09-20 13:20:30,759 INFO L138 BoogieDeclarations]: Found implementation of procedure class_destroy [2019-09-20 13:20:30,759 INFO L138 BoogieDeclarations]: Found implementation of procedure device_create [2019-09-20 13:20:30,760 INFO L138 BoogieDeclarations]: Found implementation of procedure device_destroy [2019-09-20 13:20:30,760 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2019-09-20 13:20:30,760 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2019-09-20 13:20:30,761 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_trylock [2019-09-20 13:20:30,761 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2019-09-20 13:20:30,761 INFO L138 BoogieDeclarations]: Found implementation of procedure noop_llseek [2019-09-20 13:20:30,761 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_connect [2019-09-20 13:20:30,761 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_disconnect [2019-09-20 13:20:30,761 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_init [2019-09-20 13:20:30,762 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_read_block [2019-09-20 13:20:30,762 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_read_regr [2019-09-20 13:20:30,762 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_release [2019-09-20 13:20:30,762 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_write_block [2019-09-20 13:20:30,762 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_write_regr [2019-09-20 13:20:30,763 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-09-20 13:20:30,763 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_timeout_interruptible [2019-09-20 13:20:30,763 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_fmt [2019-09-20 13:20:30,763 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-09-20 13:20:30,763 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-09-20 13:20:30,763 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-09-20 13:20:30,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-20 13:20:30,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:20:30,764 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-09-20 13:20:30,764 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2019-09-20 13:20:30,764 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2019-09-20 13:20:30,764 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-09-20 13:20:30,764 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2019-09-20 13:20:30,765 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2019-09-20 13:20:30,765 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-09-20 13:20:30,765 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2019-09-20 13:20:30,765 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_fmt [2019-09-20 13:20:30,766 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2019-09-20 13:20:30,766 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2019-09-20 13:20:30,766 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_trylock [2019-09-20 13:20:30,766 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_4 [2019-09-20 13:20:30,766 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2019-09-20 13:20:30,767 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_2 [2019-09-20 13:20:30,767 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_5 [2019-09-20 13:20:30,767 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_7 [2019-09-20 13:20:30,768 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_9 [2019-09-20 13:20:30,771 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2019-09-20 13:20:30,771 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_1 [2019-09-20 13:20:30,771 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_3 [2019-09-20 13:20:30,772 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_6 [2019-09-20 13:20:30,772 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_8 [2019-09-20 13:20:30,772 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_cred_guard_mutex_of_signal_struct [2019-09-20 13:20:30,773 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_cred_guard_mutex_of_signal_struct [2019-09-20 13:20:30,773 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_lock [2019-09-20 13:20:30,773 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_lock [2019-09-20 13:20:30,773 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mutex_of_device [2019-09-20 13:20:30,774 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_mutex_of_device [2019-09-20 13:20:30,775 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mutex_of_device [2019-09-20 13:20:30,780 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_pg_mutex [2019-09-20 13:20:30,781 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_pg_mutex [2019-09-20 13:20:30,782 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:20:30,783 INFO L130 BoogieDeclarations]: Found specification of procedure iminor [2019-09-20 13:20:30,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:20:30,792 INFO L130 BoogieDeclarations]: Found specification of procedure __register_chrdev [2019-09-20 13:20:30,792 INFO L130 BoogieDeclarations]: Found specification of procedure __unregister_chrdev [2019-09-20 13:20:30,793 INFO L130 BoogieDeclarations]: Found specification of procedure register_chrdev [2019-09-20 13:20:30,793 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_register_chrdev_10 [2019-09-20 13:20:30,793 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_chrdev [2019-09-20 13:20:30,793 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_unregister_chrdev_11 [2019-09-20 13:20:30,794 INFO L130 BoogieDeclarations]: Found specification of procedure noop_llseek [2019-09-20 13:20:30,794 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2019-09-20 13:20:30,796 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-09-20 13:20:30,796 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-20 13:20:30,796 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:20:30,797 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2019-09-20 13:20:30,797 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-09-20 13:20:30,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:20:30,797 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2019-09-20 13:20:30,798 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2019-09-20 13:20:30,798 INFO L130 BoogieDeclarations]: Found specification of procedure __class_create [2019-09-20 13:20:30,798 INFO L130 BoogieDeclarations]: Found specification of procedure class_destroy [2019-09-20 13:20:30,799 INFO L130 BoogieDeclarations]: Found specification of procedure device_create [2019-09-20 13:20:30,799 INFO L130 BoogieDeclarations]: Found specification of procedure device_destroy [2019-09-20 13:20:30,799 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_timeout_interruptible [2019-09-20 13:20:30,799 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2019-09-20 13:20:30,800 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2019-09-20 13:20:30,800 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2019-09-20 13:20:30,800 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2019-09-20 13:20:30,801 INFO L130 BoogieDeclarations]: Found specification of procedure pi_init [2019-09-20 13:20:30,801 INFO L130 BoogieDeclarations]: Found specification of procedure pi_release [2019-09-20 13:20:30,801 INFO L130 BoogieDeclarations]: Found specification of procedure pi_write_regr [2019-09-20 13:20:30,801 INFO L130 BoogieDeclarations]: Found specification of procedure pi_read_regr [2019-09-20 13:20:30,802 INFO L130 BoogieDeclarations]: Found specification of procedure pi_write_block [2019-09-20 13:20:30,802 INFO L130 BoogieDeclarations]: Found specification of procedure pi_read_block [2019-09-20 13:20:30,802 INFO L130 BoogieDeclarations]: Found specification of procedure pi_connect [2019-09-20 13:20:30,802 INFO L130 BoogieDeclarations]: Found specification of procedure pi_disconnect [2019-09-20 13:20:30,803 INFO L130 BoogieDeclarations]: Found specification of procedure pg_open [2019-09-20 13:20:30,803 INFO L130 BoogieDeclarations]: Found specification of procedure pg_release [2019-09-20 13:20:30,803 INFO L130 BoogieDeclarations]: Found specification of procedure pg_read [2019-09-20 13:20:30,804 INFO L130 BoogieDeclarations]: Found specification of procedure pg_write [2019-09-20 13:20:30,804 INFO L130 BoogieDeclarations]: Found specification of procedure pg_detect [2019-09-20 13:20:30,804 INFO L130 BoogieDeclarations]: Found specification of procedure pg_identify [2019-09-20 13:20:30,804 INFO L130 BoogieDeclarations]: Found specification of procedure pg_init_units [2019-09-20 13:20:30,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:20:30,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:20:30,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:20:30,806 INFO L130 BoogieDeclarations]: Found specification of procedure status_reg [2019-09-20 13:20:30,806 INFO L130 BoogieDeclarations]: Found specification of procedure read_reg [2019-09-20 13:20:30,806 INFO L130 BoogieDeclarations]: Found specification of procedure write_reg [2019-09-20 13:20:30,807 INFO L130 BoogieDeclarations]: Found specification of procedure DRIVE [2019-09-20 13:20:30,807 INFO L130 BoogieDeclarations]: Found specification of procedure pg_sleep [2019-09-20 13:20:30,808 INFO L130 BoogieDeclarations]: Found specification of procedure pg_wait [2019-09-20 13:20:30,809 INFO L130 BoogieDeclarations]: Found specification of procedure pg_command [2019-09-20 13:20:30,809 INFO L130 BoogieDeclarations]: Found specification of procedure pg_completion [2019-09-20 13:20:30,809 INFO L130 BoogieDeclarations]: Found specification of procedure pg_reset [2019-09-20 13:20:30,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:20:30,810 INFO L130 BoogieDeclarations]: Found specification of procedure xs [2019-09-20 13:20:30,810 INFO L130 BoogieDeclarations]: Found specification of procedure pg_probe [2019-09-20 13:20:30,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-09-20 13:20:30,811 INFO L130 BoogieDeclarations]: Found specification of procedure pg_init [2019-09-20 13:20:30,811 INFO L130 BoogieDeclarations]: Found specification of procedure pg_exit [2019-09-20 13:20:30,812 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-09-20 13:20:30,812 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-09-20 13:20:30,812 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:20:30,813 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-09-20 13:20:30,813 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_trap [2019-09-20 13:20:30,813 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_cred_guard_mutex_of_signal_struct [2019-09-20 13:20:30,814 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_cred_guard_mutex_of_signal_struct [2019-09-20 13:20:30,814 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_cred_guard_mutex_of_signal_struct [2019-09-20 13:20:30,814 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_cred_guard_mutex_of_signal_struct [2019-09-20 13:20:30,814 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_cred_guard_mutex_of_signal_struct [2019-09-20 13:20:30,815 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_lock [2019-09-20 13:20:30,815 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_lock [2019-09-20 13:20:30,815 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_lock [2019-09-20 13:20:30,816 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_lock [2019-09-20 13:20:30,816 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_lock [2019-09-20 13:20:30,816 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_mutex_of_device [2019-09-20 13:20:30,816 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_mutex_of_device [2019-09-20 13:20:30,817 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_mutex_of_device [2019-09-20 13:20:30,817 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_mutex_of_device [2019-09-20 13:20:30,817 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_pg_mutex [2019-09-20 13:20:30,817 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_pg_mutex [2019-09-20 13:20:30,818 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_pg_mutex [2019-09-20 13:20:30,818 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_pg_mutex [2019-09-20 13:20:30,818 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_pg_mutex [2019-09-20 13:20:30,818 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-09-20 13:20:30,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-09-20 13:20:30,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-20 13:20:30,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-20 13:20:30,819 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-20 13:20:30,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:20:30,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-20 13:20:30,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-20 13:20:30,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:20:33,811 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:20:33,812 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-20 13:20:33,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:20:33 BoogieIcfgContainer [2019-09-20 13:20:33,814 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:20:33,815 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:20:33,816 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:20:33,820 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:20:33,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:20:28" (1/3) ... [2019-09-20 13:20:33,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22a250c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:20:33, skipping insertion in model container [2019-09-20 13:20:33,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:20:30" (2/3) ... [2019-09-20 13:20:33,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22a250c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:20:33, skipping insertion in model container [2019-09-20 13:20:33,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:20:33" (3/3) ... [2019-09-20 13:20:33,824 INFO L109 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pg.ko-main.cil.out.i [2019-09-20 13:20:33,837 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:20:33,848 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:20:33,870 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:20:33,908 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 13:20:33,909 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:20:33,909 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 13:20:33,909 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:20:33,909 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:20:33,910 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:20:33,910 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:20:33,910 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:20:33,910 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:20:33,943 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states. [2019-09-20 13:20:33,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-20 13:20:33,954 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:20:33,955 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-20 13:20:33,958 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:20:33,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:20:33,964 INFO L82 PathProgramCache]: Analyzing trace with hash -466886759, now seen corresponding path program 1 times [2019-09-20 13:20:33,966 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:20:33,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:20:34,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:34,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:20:34,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:34,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:20:34,564 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-20 13:20:34,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:20:34,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:20:34,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:20:34,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:20:34,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:20:34,589 INFO L87 Difference]: Start difference. First operand 699 states. Second operand 4 states. [2019-09-20 13:20:35,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:20:35,600 INFO L93 Difference]: Finished difference Result 1169 states and 1521 transitions. [2019-09-20 13:20:35,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:20:35,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-09-20 13:20:35,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:20:35,625 INFO L225 Difference]: With dead ends: 1169 [2019-09-20 13:20:35,625 INFO L226 Difference]: Without dead ends: 582 [2019-09-20 13:20:35,634 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-20 13:20:35,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-09-20 13:20:35,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-09-20 13:20:35,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-09-20 13:20:35,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 747 transitions. [2019-09-20 13:20:35,761 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 747 transitions. Word has length 31 [2019-09-20 13:20:35,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:20:35,761 INFO L475 AbstractCegarLoop]: Abstraction has 582 states and 747 transitions. [2019-09-20 13:20:35,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:20:35,761 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 747 transitions. [2019-09-20 13:20:35,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-20 13:20:35,773 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:20:35,774 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-20 13:20:35,774 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:20:35,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:20:35,774 INFO L82 PathProgramCache]: Analyzing trace with hash -503911691, now seen corresponding path program 1 times [2019-09-20 13:20:35,775 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:20:35,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:20:35,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:35,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:20:35,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:20:35,964 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-20 13:20:35,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:20:35,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:20:35,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:20:35,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:20:35,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:20:35,967 INFO L87 Difference]: Start difference. First operand 582 states and 747 transitions. Second operand 3 states. [2019-09-20 13:20:36,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:20:36,150 INFO L93 Difference]: Finished difference Result 1470 states and 1896 transitions. [2019-09-20 13:20:36,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:20:36,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-09-20 13:20:36,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:20:36,164 INFO L225 Difference]: With dead ends: 1470 [2019-09-20 13:20:36,164 INFO L226 Difference]: Without dead ends: 899 [2019-09-20 13:20:36,169 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-20 13:20:36,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2019-09-20 13:20:36,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 851. [2019-09-20 13:20:36,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 851 states. [2019-09-20 13:20:36,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1104 transitions. [2019-09-20 13:20:36,240 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1104 transitions. Word has length 34 [2019-09-20 13:20:36,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:20:36,241 INFO L475 AbstractCegarLoop]: Abstraction has 851 states and 1104 transitions. [2019-09-20 13:20:36,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:20:36,241 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1104 transitions. [2019-09-20 13:20:36,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-20 13:20:36,243 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:20:36,243 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-20 13:20:36,243 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:20:36,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:20:36,243 INFO L82 PathProgramCache]: Analyzing trace with hash -159570386, now seen corresponding path program 1 times [2019-09-20 13:20:36,244 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:20:36,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:20:36,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:36,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:20:36,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:36,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:20:36,417 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-20 13:20:36,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:20:36,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:20:36,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:20:36,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:20:36,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:20:36,419 INFO L87 Difference]: Start difference. First operand 851 states and 1104 transitions. Second operand 3 states. [2019-09-20 13:20:36,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:20:36,482 INFO L93 Difference]: Finished difference Result 1703 states and 2221 transitions. [2019-09-20 13:20:36,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:20:36,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-09-20 13:20:36,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:20:36,489 INFO L225 Difference]: With dead ends: 1703 [2019-09-20 13:20:36,489 INFO L226 Difference]: Without dead ends: 863 [2019-09-20 13:20:36,493 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-20 13:20:36,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2019-09-20 13:20:36,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 853. [2019-09-20 13:20:36,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2019-09-20 13:20:36,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1106 transitions. [2019-09-20 13:20:36,537 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1106 transitions. Word has length 44 [2019-09-20 13:20:36,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:20:36,537 INFO L475 AbstractCegarLoop]: Abstraction has 853 states and 1106 transitions. [2019-09-20 13:20:36,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:20:36,537 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1106 transitions. [2019-09-20 13:20:36,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-20 13:20:36,539 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:20:36,539 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-20 13:20:36,539 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:20:36,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:20:36,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1084319382, now seen corresponding path program 1 times [2019-09-20 13:20:36,540 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:20:36,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:20:36,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:36,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:20:36,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:36,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:20:36,648 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-20 13:20:36,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:20:36,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:20:36,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:20:36,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:20:36,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:20:36,650 INFO L87 Difference]: Start difference. First operand 853 states and 1106 transitions. Second operand 3 states. [2019-09-20 13:20:36,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:20:36,895 INFO L93 Difference]: Finished difference Result 2129 states and 2767 transitions. [2019-09-20 13:20:36,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:20:36,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-09-20 13:20:36,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:20:36,904 INFO L225 Difference]: With dead ends: 2129 [2019-09-20 13:20:36,905 INFO L226 Difference]: Without dead ends: 1287 [2019-09-20 13:20:36,909 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-20 13:20:36,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2019-09-20 13:20:36,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1283. [2019-09-20 13:20:36,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2019-09-20 13:20:36,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1663 transitions. [2019-09-20 13:20:36,974 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1663 transitions. Word has length 46 [2019-09-20 13:20:36,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:20:36,975 INFO L475 AbstractCegarLoop]: Abstraction has 1283 states and 1663 transitions. [2019-09-20 13:20:36,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:20:36,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1663 transitions. [2019-09-20 13:20:36,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-20 13:20:36,976 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:20:36,976 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-20 13:20:36,976 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:20:36,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:20:36,977 INFO L82 PathProgramCache]: Analyzing trace with hash 819154128, now seen corresponding path program 1 times [2019-09-20 13:20:36,977 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:20:36,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:20:36,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:36,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:20:36,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:20:37,122 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-20 13:20:37,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:20:37,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:20:37,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:20:37,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:20:37,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:20:37,124 INFO L87 Difference]: Start difference. First operand 1283 states and 1663 transitions. Second operand 3 states. [2019-09-20 13:20:37,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:20:37,213 INFO L93 Difference]: Finished difference Result 2585 states and 3367 transitions. [2019-09-20 13:20:37,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:20:37,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-09-20 13:20:37,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:20:37,223 INFO L225 Difference]: With dead ends: 2585 [2019-09-20 13:20:37,223 INFO L226 Difference]: Without dead ends: 1313 [2019-09-20 13:20:37,229 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-20 13:20:37,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2019-09-20 13:20:37,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 1309. [2019-09-20 13:20:37,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1309 states. [2019-09-20 13:20:37,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1309 states and 1703 transitions. [2019-09-20 13:20:37,305 INFO L78 Accepts]: Start accepts. Automaton has 1309 states and 1703 transitions. Word has length 53 [2019-09-20 13:20:37,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:20:37,306 INFO L475 AbstractCegarLoop]: Abstraction has 1309 states and 1703 transitions. [2019-09-20 13:20:37,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:20:37,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 1703 transitions. [2019-09-20 13:20:37,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-20 13:20:37,307 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:20:37,307 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-20 13:20:37,307 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:20:37,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:20:37,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1968261359, now seen corresponding path program 1 times [2019-09-20 13:20:37,308 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:20:37,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:20:37,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:37,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:20:37,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:37,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:20:37,548 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-20 13:20:37,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:20:37,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:20:37,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:20:37,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:20:37,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:20:37,549 INFO L87 Difference]: Start difference. First operand 1309 states and 1703 transitions. Second operand 3 states. [2019-09-20 13:20:37,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:20:37,666 INFO L93 Difference]: Finished difference Result 1331 states and 1729 transitions. [2019-09-20 13:20:37,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:20:37,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-09-20 13:20:37,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:20:37,677 INFO L225 Difference]: With dead ends: 1331 [2019-09-20 13:20:37,677 INFO L226 Difference]: Without dead ends: 1320 [2019-09-20 13:20:37,680 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-20 13:20:37,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2019-09-20 13:20:37,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1309. [2019-09-20 13:20:37,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1309 states. [2019-09-20 13:20:37,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1309 states and 1701 transitions. [2019-09-20 13:20:37,788 INFO L78 Accepts]: Start accepts. Automaton has 1309 states and 1701 transitions. Word has length 53 [2019-09-20 13:20:37,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:20:37,789 INFO L475 AbstractCegarLoop]: Abstraction has 1309 states and 1701 transitions. [2019-09-20 13:20:37,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:20:37,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 1701 transitions. [2019-09-20 13:20:37,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-20 13:20:37,791 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:20:37,792 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-20 13:20:37,792 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:20:37,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:20:37,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1911003057, now seen corresponding path program 1 times [2019-09-20 13:20:37,793 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:20:37,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:20:37,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:37,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:20:37,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:37,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:20:37,970 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-20 13:20:37,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:20:37,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:20:37,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:20:37,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:20:37,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:20:37,973 INFO L87 Difference]: Start difference. First operand 1309 states and 1701 transitions. Second operand 3 states. [2019-09-20 13:20:38,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:20:38,292 INFO L93 Difference]: Finished difference Result 1311 states and 1702 transitions. [2019-09-20 13:20:38,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:20:38,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-09-20 13:20:38,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:20:38,303 INFO L225 Difference]: With dead ends: 1311 [2019-09-20 13:20:38,303 INFO L226 Difference]: Without dead ends: 1308 [2019-09-20 13:20:38,305 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-20 13:20:38,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2019-09-20 13:20:38,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1308. [2019-09-20 13:20:38,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1308 states. [2019-09-20 13:20:38,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 1699 transitions. [2019-09-20 13:20:38,388 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 1699 transitions. Word has length 53 [2019-09-20 13:20:38,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:20:38,388 INFO L475 AbstractCegarLoop]: Abstraction has 1308 states and 1699 transitions. [2019-09-20 13:20:38,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:20:38,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 1699 transitions. [2019-09-20 13:20:38,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-20 13:20:38,390 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:20:38,394 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-20 13:20:38,395 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:20:38,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:20:38,395 INFO L82 PathProgramCache]: Analyzing trace with hash 888053654, now seen corresponding path program 1 times [2019-09-20 13:20:38,395 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:20:38,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:20:38,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:38,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:20:38,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:38,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:20:38,513 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-20 13:20:38,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:20:38,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:20:38,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:20:38,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:20:38,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:20:38,514 INFO L87 Difference]: Start difference. First operand 1308 states and 1699 transitions. Second operand 3 states. [2019-09-20 13:20:38,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:20:38,742 INFO L93 Difference]: Finished difference Result 1310 states and 1700 transitions. [2019-09-20 13:20:38,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:20:38,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-09-20 13:20:38,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:20:38,752 INFO L225 Difference]: With dead ends: 1310 [2019-09-20 13:20:38,752 INFO L226 Difference]: Without dead ends: 1307 [2019-09-20 13:20:38,754 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-20 13:20:38,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1307 states. [2019-09-20 13:20:38,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1307 to 1307. [2019-09-20 13:20:38,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1307 states. [2019-09-20 13:20:38,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1307 states and 1697 transitions. [2019-09-20 13:20:38,834 INFO L78 Accepts]: Start accepts. Automaton has 1307 states and 1697 transitions. Word has length 54 [2019-09-20 13:20:38,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:20:38,834 INFO L475 AbstractCegarLoop]: Abstraction has 1307 states and 1697 transitions. [2019-09-20 13:20:38,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:20:38,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 1697 transitions. [2019-09-20 13:20:38,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-20 13:20:38,835 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:20:38,835 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-20 13:20:38,836 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:20:38,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:20:38,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1759470642, now seen corresponding path program 1 times [2019-09-20 13:20:38,836 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:20:38,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:20:38,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:38,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:20:38,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:38,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:20:38,952 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-20 13:20:38,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:20:38,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:20:38,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:20:38,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:20:38,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:20:38,954 INFO L87 Difference]: Start difference. First operand 1307 states and 1697 transitions. Second operand 3 states. [2019-09-20 13:20:39,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:20:39,168 INFO L93 Difference]: Finished difference Result 1309 states and 1698 transitions. [2019-09-20 13:20:39,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:20:39,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-09-20 13:20:39,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:20:39,177 INFO L225 Difference]: With dead ends: 1309 [2019-09-20 13:20:39,177 INFO L226 Difference]: Without dead ends: 1306 [2019-09-20 13:20:39,178 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-20 13:20:39,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2019-09-20 13:20:39,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 1306. [2019-09-20 13:20:39,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1306 states. [2019-09-20 13:20:39,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 1695 transitions. [2019-09-20 13:20:39,248 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 1695 transitions. Word has length 55 [2019-09-20 13:20:39,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:20:39,248 INFO L475 AbstractCegarLoop]: Abstraction has 1306 states and 1695 transitions. [2019-09-20 13:20:39,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:20:39,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1695 transitions. [2019-09-20 13:20:39,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-20 13:20:39,249 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:20:39,249 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-20 13:20:39,250 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:20:39,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:20:39,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1291368935, now seen corresponding path program 1 times [2019-09-20 13:20:39,250 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:20:39,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:20:39,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:39,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:20:39,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:39,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:20:39,361 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-20 13:20:39,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:20:39,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:20:39,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:20:39,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:20:39,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:20:39,363 INFO L87 Difference]: Start difference. First operand 1306 states and 1695 transitions. Second operand 3 states. [2019-09-20 13:20:39,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:20:39,695 INFO L93 Difference]: Finished difference Result 1657 states and 2141 transitions. [2019-09-20 13:20:39,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:20:39,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-09-20 13:20:39,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:20:39,705 INFO L225 Difference]: With dead ends: 1657 [2019-09-20 13:20:39,706 INFO L226 Difference]: Without dead ends: 1608 [2019-09-20 13:20:39,707 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-20 13:20:39,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2019-09-20 13:20:39,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1608. [2019-09-20 13:20:39,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1608 states. [2019-09-20 13:20:39,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2083 transitions. [2019-09-20 13:20:39,797 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 2083 transitions. Word has length 56 [2019-09-20 13:20:39,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:20:39,799 INFO L475 AbstractCegarLoop]: Abstraction has 1608 states and 2083 transitions. [2019-09-20 13:20:39,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:20:39,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2083 transitions. [2019-09-20 13:20:39,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-20 13:20:39,804 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:20:39,804 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-20 13:20:39,804 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:20:39,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:20:39,805 INFO L82 PathProgramCache]: Analyzing trace with hash -979606059, now seen corresponding path program 1 times [2019-09-20 13:20:39,805 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:20:39,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:20:39,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:39,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:20:39,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:39,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:20:39,947 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-20 13:20:39,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:20:39,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:20:39,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:20:39,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:20:39,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:20:39,950 INFO L87 Difference]: Start difference. First operand 1608 states and 2083 transitions. Second operand 5 states. [2019-09-20 13:20:40,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:20:40,102 INFO L93 Difference]: Finished difference Result 3219 states and 4175 transitions. [2019-09-20 13:20:40,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:20:40,104 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-09-20 13:20:40,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:20:40,118 INFO L225 Difference]: With dead ends: 3219 [2019-09-20 13:20:40,118 INFO L226 Difference]: Without dead ends: 1622 [2019-09-20 13:20:40,129 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-20 13:20:40,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2019-09-20 13:20:40,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1622. [2019-09-20 13:20:40,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1622 states. [2019-09-20 13:20:40,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 2097 transitions. [2019-09-20 13:20:40,273 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 2097 transitions. Word has length 106 [2019-09-20 13:20:40,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:20:40,273 INFO L475 AbstractCegarLoop]: Abstraction has 1622 states and 2097 transitions. [2019-09-20 13:20:40,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:20:40,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 2097 transitions. [2019-09-20 13:20:40,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-20 13:20:40,279 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:20:40,279 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-20 13:20:40,280 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:20:40,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:20:40,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1122639744, now seen corresponding path program 1 times [2019-09-20 13:20:40,281 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:20:40,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:20:40,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:40,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:20:40,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:40,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:20:40,501 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-20 13:20:40,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:20:40,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:20:40,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:20:40,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:20:40,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:20:40,504 INFO L87 Difference]: Start difference. First operand 1622 states and 2097 transitions. Second operand 5 states. [2019-09-20 13:20:40,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:20:40,662 INFO L93 Difference]: Finished difference Result 3251 states and 4219 transitions. [2019-09-20 13:20:40,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:20:40,663 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2019-09-20 13:20:40,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:20:40,674 INFO L225 Difference]: With dead ends: 3251 [2019-09-20 13:20:40,675 INFO L226 Difference]: Without dead ends: 1640 [2019-09-20 13:20:40,682 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-20 13:20:40,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2019-09-20 13:20:40,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1630. [2019-09-20 13:20:40,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1630 states. [2019-09-20 13:20:40,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2109 transitions. [2019-09-20 13:20:40,786 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2109 transitions. Word has length 122 [2019-09-20 13:20:40,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:20:40,787 INFO L475 AbstractCegarLoop]: Abstraction has 1630 states and 2109 transitions. [2019-09-20 13:20:40,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:20:40,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2109 transitions. [2019-09-20 13:20:40,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-20 13:20:40,792 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:20:40,792 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-20 13:20:40,792 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:20:40,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:20:40,793 INFO L82 PathProgramCache]: Analyzing trace with hash -489656520, now seen corresponding path program 1 times [2019-09-20 13:20:40,793 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:20:40,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:20:40,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:40,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:20:40,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:20:40,945 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-20 13:20:40,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:20:40,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:20:40,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:20:40,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:20:40,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:20:40,947 INFO L87 Difference]: Start difference. First operand 1630 states and 2109 transitions. Second operand 5 states. [2019-09-20 13:20:41,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:20:41,076 INFO L93 Difference]: Finished difference Result 3317 states and 4319 transitions. [2019-09-20 13:20:41,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:20:41,077 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-09-20 13:20:41,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:20:41,090 INFO L225 Difference]: With dead ends: 3317 [2019-09-20 13:20:41,090 INFO L226 Difference]: Without dead ends: 1698 [2019-09-20 13:20:41,100 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-20 13:20:41,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2019-09-20 13:20:41,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 1638. [2019-09-20 13:20:41,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1638 states. [2019-09-20 13:20:41,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1638 states and 2117 transitions. [2019-09-20 13:20:41,227 INFO L78 Accepts]: Start accepts. Automaton has 1638 states and 2117 transitions. Word has length 133 [2019-09-20 13:20:41,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:20:41,227 INFO L475 AbstractCegarLoop]: Abstraction has 1638 states and 2117 transitions. [2019-09-20 13:20:41,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:20:41,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1638 states and 2117 transitions. [2019-09-20 13:20:41,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-20 13:20:41,236 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:20:41,237 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] [2019-09-20 13:20:41,273 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:20:41,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:20:41,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1250998788, now seen corresponding path program 1 times [2019-09-20 13:20:41,274 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:20:41,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:20:41,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:41,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:20:41,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:41,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:20:41,484 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-20 13:20:41,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:20:41,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:20:41,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:20:41,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:20:41,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:20:41,486 INFO L87 Difference]: Start difference. First operand 1638 states and 2117 transitions. Second operand 4 states. [2019-09-20 13:20:41,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:20:41,611 INFO L93 Difference]: Finished difference Result 3380 states and 4432 transitions. [2019-09-20 13:20:41,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:20:41,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 231 [2019-09-20 13:20:41,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:20:41,623 INFO L225 Difference]: With dead ends: 3380 [2019-09-20 13:20:41,623 INFO L226 Difference]: Without dead ends: 1753 [2019-09-20 13:20:41,632 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-20 13:20:41,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1753 states. [2019-09-20 13:20:41,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1753 to 1648. [2019-09-20 13:20:41,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1648 states. [2019-09-20 13:20:41,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2127 transitions. [2019-09-20 13:20:41,722 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2127 transitions. Word has length 231 [2019-09-20 13:20:41,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:20:41,723 INFO L475 AbstractCegarLoop]: Abstraction has 1648 states and 2127 transitions. [2019-09-20 13:20:41,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:20:41,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2127 transitions. [2019-09-20 13:20:41,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-20 13:20:41,729 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:20:41,729 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-20 13:20:41,729 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:20:41,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:20:41,730 INFO L82 PathProgramCache]: Analyzing trace with hash 583558566, now seen corresponding path program 1 times [2019-09-20 13:20:41,730 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:20:41,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:20:41,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:41,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:20:41,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:41,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:20:41,968 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-20 13:20:41,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:20:41,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:20:41,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:20:41,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:20:41,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:20:41,970 INFO L87 Difference]: Start difference. First operand 1648 states and 2127 transitions. Second operand 3 states. [2019-09-20 13:20:42,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:20:42,083 INFO L93 Difference]: Finished difference Result 3310 states and 4319 transitions. [2019-09-20 13:20:42,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:20:42,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 242 [2019-09-20 13:20:42,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:20:42,094 INFO L225 Difference]: With dead ends: 3310 [2019-09-20 13:20:42,094 INFO L226 Difference]: Without dead ends: 1673 [2019-09-20 13:20:42,104 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-20 13:20:42,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2019-09-20 13:20:42,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1658. [2019-09-20 13:20:42,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1658 states. [2019-09-20 13:20:42,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 2137 transitions. [2019-09-20 13:20:42,198 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 2137 transitions. Word has length 242 [2019-09-20 13:20:42,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:20:42,199 INFO L475 AbstractCegarLoop]: Abstraction has 1658 states and 2137 transitions. [2019-09-20 13:20:42,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:20:42,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2137 transitions. [2019-09-20 13:20:42,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-20 13:20:42,206 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:20:42,206 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, 1, 1] [2019-09-20 13:20:42,206 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:20:42,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:20:42,207 INFO L82 PathProgramCache]: Analyzing trace with hash 38044421, now seen corresponding path program 1 times [2019-09-20 13:20:42,207 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:20:42,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:20:42,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:42,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:20:42,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:42,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:20:42,473 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-20 13:20:42,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:20:42,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:20:42,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:20:42,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:20:42,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:20:42,479 INFO L87 Difference]: Start difference. First operand 1658 states and 2137 transitions. Second operand 6 states. [2019-09-20 13:20:42,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:20:42,649 INFO L93 Difference]: Finished difference Result 3380 states and 4411 transitions. [2019-09-20 13:20:42,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-20 13:20:42,649 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 255 [2019-09-20 13:20:42,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:20:42,661 INFO L225 Difference]: With dead ends: 3380 [2019-09-20 13:20:42,661 INFO L226 Difference]: Without dead ends: 1733 [2019-09-20 13:20:42,669 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-20 13:20:42,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1733 states. [2019-09-20 13:20:42,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1733 to 1699. [2019-09-20 13:20:42,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1699 states. [2019-09-20 13:20:42,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2193 transitions. [2019-09-20 13:20:42,755 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2193 transitions. Word has length 255 [2019-09-20 13:20:42,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:20:42,757 INFO L475 AbstractCegarLoop]: Abstraction has 1699 states and 2193 transitions. [2019-09-20 13:20:42,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:20:42,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2193 transitions. [2019-09-20 13:20:42,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-20 13:20:42,763 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:20:42,764 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, 1, 1] [2019-09-20 13:20:42,764 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:20:42,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:20:42,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1749825401, now seen corresponding path program 1 times [2019-09-20 13:20:42,764 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:20:42,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:20:42,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:42,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:20:42,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:20:43,011 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-20 13:20:43,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:20:43,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:20:43,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:20:43,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:20:43,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:20:43,016 INFO L87 Difference]: Start difference. First operand 1699 states and 2193 transitions. Second operand 5 states. [2019-09-20 13:20:43,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:20:43,154 INFO L93 Difference]: Finished difference Result 3432 states and 4480 transitions. [2019-09-20 13:20:43,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:20:43,154 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 255 [2019-09-20 13:20:43,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:20:43,170 INFO L225 Difference]: With dead ends: 3432 [2019-09-20 13:20:43,170 INFO L226 Difference]: Without dead ends: 1744 [2019-09-20 13:20:43,179 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-20 13:20:43,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1744 states. [2019-09-20 13:20:43,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1744 to 1719. [2019-09-20 13:20:43,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2019-09-20 13:20:43,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2228 transitions. [2019-09-20 13:20:43,324 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2228 transitions. Word has length 255 [2019-09-20 13:20:43,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:20:43,325 INFO L475 AbstractCegarLoop]: Abstraction has 1719 states and 2228 transitions. [2019-09-20 13:20:43,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:20:43,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2228 transitions. [2019-09-20 13:20:43,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-09-20 13:20:43,338 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:20:43,339 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-20 13:20:43,339 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:20:43,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:20:43,340 INFO L82 PathProgramCache]: Analyzing trace with hash -362663679, now seen corresponding path program 1 times [2019-09-20 13:20:43,340 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:20:43,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:20:43,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:43,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:20:43,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:43,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:20:43,825 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-20 13:20:43,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:20:43,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-20 13:20:43,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 13:20:43,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 13:20:43,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:20:43,828 INFO L87 Difference]: Start difference. First operand 1719 states and 2228 transitions. Second operand 10 states. [2019-09-20 13:20:44,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:20:44,043 INFO L93 Difference]: Finished difference Result 3476 states and 4542 transitions. [2019-09-20 13:20:44,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-20 13:20:44,043 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 288 [2019-09-20 13:20:44,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:20:44,060 INFO L225 Difference]: With dead ends: 3476 [2019-09-20 13:20:44,060 INFO L226 Difference]: Without dead ends: 1768 [2019-09-20 13:20:44,072 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-20 13:20:44,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2019-09-20 13:20:44,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1729. [2019-09-20 13:20:44,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1729 states. [2019-09-20 13:20:44,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1729 states to 1729 states and 2239 transitions. [2019-09-20 13:20:44,195 INFO L78 Accepts]: Start accepts. Automaton has 1729 states and 2239 transitions. Word has length 288 [2019-09-20 13:20:44,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:20:44,195 INFO L475 AbstractCegarLoop]: Abstraction has 1729 states and 2239 transitions. [2019-09-20 13:20:44,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 13:20:44,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1729 states and 2239 transitions. [2019-09-20 13:20:44,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-09-20 13:20:44,202 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:20:44,202 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-20 13:20:44,202 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:20:44,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:20:44,203 INFO L82 PathProgramCache]: Analyzing trace with hash 93945189, now seen corresponding path program 1 times [2019-09-20 13:20:44,203 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:20:44,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:20:44,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:44,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:20:44,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:20:44,583 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-20 13:20:44,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:20:44,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:20:44,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:20:44,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:20:44,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:20:44,587 INFO L87 Difference]: Start difference. First operand 1729 states and 2239 transitions. Second operand 6 states. [2019-09-20 13:20:44,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:20:44,730 INFO L93 Difference]: Finished difference Result 3475 states and 4520 transitions. [2019-09-20 13:20:44,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:20:44,731 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 286 [2019-09-20 13:20:44,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:20:44,752 INFO L225 Difference]: With dead ends: 3475 [2019-09-20 13:20:44,753 INFO L226 Difference]: Without dead ends: 1757 [2019-09-20 13:20:44,764 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-20 13:20:44,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2019-09-20 13:20:44,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 1733. [2019-09-20 13:20:44,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1733 states. [2019-09-20 13:20:44,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2243 transitions. [2019-09-20 13:20:44,851 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2243 transitions. Word has length 286 [2019-09-20 13:20:44,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:20:44,852 INFO L475 AbstractCegarLoop]: Abstraction has 1733 states and 2243 transitions. [2019-09-20 13:20:44,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:20:44,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2243 transitions. [2019-09-20 13:20:44,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-09-20 13:20:44,859 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:20:44,859 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-20 13:20:44,860 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:20:44,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:20:44,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1274515421, now seen corresponding path program 1 times [2019-09-20 13:20:44,860 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:20:44,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:20:44,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:44,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:20:44,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:44,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:20:45,289 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-20 13:20:45,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:20:45,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-20 13:20:45,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 13:20:45,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 13:20:45,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:20:45,292 INFO L87 Difference]: Start difference. First operand 1733 states and 2243 transitions. Second operand 10 states. [2019-09-20 13:20:45,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:20:45,479 INFO L93 Difference]: Finished difference Result 3504 states and 4546 transitions. [2019-09-20 13:20:45,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-20 13:20:45,480 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 286 [2019-09-20 13:20:45,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:20:45,494 INFO L225 Difference]: With dead ends: 3504 [2019-09-20 13:20:45,494 INFO L226 Difference]: Without dead ends: 1782 [2019-09-20 13:20:45,504 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-20 13:20:45,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1782 states. [2019-09-20 13:20:45,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1782 to 1735. [2019-09-20 13:20:45,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735 states. [2019-09-20 13:20:45,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2245 transitions. [2019-09-20 13:20:45,627 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2245 transitions. Word has length 286 [2019-09-20 13:20:45,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:20:45,629 INFO L475 AbstractCegarLoop]: Abstraction has 1735 states and 2245 transitions. [2019-09-20 13:20:45,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 13:20:45,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2245 transitions. [2019-09-20 13:20:45,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-09-20 13:20:45,641 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:20:45,642 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-20 13:20:45,642 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:20:45,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:20:45,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1004757881, now seen corresponding path program 1 times [2019-09-20 13:20:45,643 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:20:45,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:20:45,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:45,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:20:45,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:45,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:20:46,033 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-20 13:20:46,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:20:46,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-20 13:20:46,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 13:20:46,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 13:20:46,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:20:46,035 INFO L87 Difference]: Start difference. First operand 1735 states and 2245 transitions. Second operand 10 states. [2019-09-20 13:20:46,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:20:46,199 INFO L93 Difference]: Finished difference Result 3556 states and 4634 transitions. [2019-09-20 13:20:46,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 13:20:46,200 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 299 [2019-09-20 13:20:46,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:20:46,211 INFO L225 Difference]: With dead ends: 3556 [2019-09-20 13:20:46,211 INFO L226 Difference]: Without dead ends: 1832 [2019-09-20 13:20:46,220 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:20:46,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832 states. [2019-09-20 13:20:46,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832 to 1735. [2019-09-20 13:20:46,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735 states. [2019-09-20 13:20:46,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2245 transitions. [2019-09-20 13:20:46,332 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2245 transitions. Word has length 299 [2019-09-20 13:20:46,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:20:46,333 INFO L475 AbstractCegarLoop]: Abstraction has 1735 states and 2245 transitions. [2019-09-20 13:20:46,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 13:20:46,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2245 transitions. [2019-09-20 13:20:46,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-09-20 13:20:46,344 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:20:46,345 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-20 13:20:46,345 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:20:46,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:20:46,346 INFO L82 PathProgramCache]: Analyzing trace with hash 625458459, now seen corresponding path program 1 times [2019-09-20 13:20:46,346 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:20:46,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:20:46,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:46,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:20:46,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:20:46,715 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-20 13:20:46,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:20:46,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-20 13:20:46,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 13:20:46,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 13:20:46,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:20:46,717 INFO L87 Difference]: Start difference. First operand 1735 states and 2245 transitions. Second operand 10 states. [2019-09-20 13:20:46,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:20:46,874 INFO L93 Difference]: Finished difference Result 3568 states and 4646 transitions. [2019-09-20 13:20:46,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 13:20:46,874 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 297 [2019-09-20 13:20:46,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:20:46,886 INFO L225 Difference]: With dead ends: 3568 [2019-09-20 13:20:46,887 INFO L226 Difference]: Without dead ends: 1844 [2019-09-20 13:20:46,896 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-20 13:20:46,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2019-09-20 13:20:46,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1731. [2019-09-20 13:20:46,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1731 states. [2019-09-20 13:20:47,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 2237 transitions. [2019-09-20 13:20:47,005 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 2237 transitions. Word has length 297 [2019-09-20 13:20:47,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:20:47,006 INFO L475 AbstractCegarLoop]: Abstraction has 1731 states and 2237 transitions. [2019-09-20 13:20:47,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 13:20:47,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 2237 transitions. [2019-09-20 13:20:47,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-09-20 13:20:47,014 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:20:47,014 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-20 13:20:47,014 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:20:47,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:20:47,015 INFO L82 PathProgramCache]: Analyzing trace with hash -562159944, now seen corresponding path program 1 times [2019-09-20 13:20:47,015 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:20:47,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:20:47,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:47,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:20:47,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:47,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:20:47,402 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-20 13:20:47,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:20:47,403 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:20:47,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:20:48,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:20:48,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 2957 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-20 13:20:48,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:20:48,595 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2019-09-20 13:20:48,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 13:20:48,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-09-20 13:20:48,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 13:20:48,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 13:20:48,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:20:48,610 INFO L87 Difference]: Start difference. First operand 1731 states and 2237 transitions. Second operand 9 states. [2019-09-20 13:20:49,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:20:49,398 INFO L93 Difference]: Finished difference Result 3508 states and 4570 transitions. [2019-09-20 13:20:49,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-20 13:20:49,399 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 329 [2019-09-20 13:20:49,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:20:49,412 INFO L225 Difference]: With dead ends: 3508 [2019-09-20 13:20:49,412 INFO L226 Difference]: Without dead ends: 1788 [2019-09-20 13:20:49,424 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:20:49,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1788 states. [2019-09-20 13:20:49,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1788 to 1749. [2019-09-20 13:20:49,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1749 states. [2019-09-20 13:20:49,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1749 states to 1749 states and 2256 transitions. [2019-09-20 13:20:49,576 INFO L78 Accepts]: Start accepts. Automaton has 1749 states and 2256 transitions. Word has length 329 [2019-09-20 13:20:49,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:20:49,577 INFO L475 AbstractCegarLoop]: Abstraction has 1749 states and 2256 transitions. [2019-09-20 13:20:49,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 13:20:49,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1749 states and 2256 transitions. [2019-09-20 13:20:49,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-09-20 13:20:49,585 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:20:49,586 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:20:49,586 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:20:49,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:20:49,586 INFO L82 PathProgramCache]: Analyzing trace with hash -606542932, now seen corresponding path program 1 times [2019-09-20 13:20:49,587 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:20:49,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:20:49,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:49,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:20:49,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:49,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:20:49,982 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-20 13:20:49,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:20:49,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:20:49,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:20:49,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:20:49,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:20:49,984 INFO L87 Difference]: Start difference. First operand 1749 states and 2256 transitions. Second operand 5 states. [2019-09-20 13:20:51,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:20:51,063 INFO L93 Difference]: Finished difference Result 3502 states and 4533 transitions. [2019-09-20 13:20:51,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-20 13:20:51,064 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 360 [2019-09-20 13:20:51,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:20:51,075 INFO L225 Difference]: With dead ends: 3502 [2019-09-20 13:20:51,075 INFO L226 Difference]: Without dead ends: 1758 [2019-09-20 13:20:51,086 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:20:51,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1758 states. [2019-09-20 13:20:51,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1749. [2019-09-20 13:20:51,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1749 states. [2019-09-20 13:20:51,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1749 states to 1749 states and 2254 transitions. [2019-09-20 13:20:51,215 INFO L78 Accepts]: Start accepts. Automaton has 1749 states and 2254 transitions. Word has length 360 [2019-09-20 13:20:51,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:20:51,216 INFO L475 AbstractCegarLoop]: Abstraction has 1749 states and 2254 transitions. [2019-09-20 13:20:51,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:20:51,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1749 states and 2254 transitions. [2019-09-20 13:20:51,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-09-20 13:20:51,228 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:20:51,230 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:20:51,230 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:20:51,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:20:51,231 INFO L82 PathProgramCache]: Analyzing trace with hash 101713083, now seen corresponding path program 1 times [2019-09-20 13:20:51,231 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:20:51,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:20:51,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:51,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:20:51,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:20:51,652 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2019-09-20 13:20:51,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:20:51,652 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:20:51,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:20:52,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:20:52,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 3211 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-20 13:20:52,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:20:52,688 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-09-20 13:20:52,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 13:20:52,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-09-20 13:20:52,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:20:52,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:20:52,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:20:52,707 INFO L87 Difference]: Start difference. First operand 1749 states and 2254 transitions. Second operand 4 states. [2019-09-20 13:20:52,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:20:52,830 INFO L93 Difference]: Finished difference Result 3519 states and 4577 transitions. [2019-09-20 13:20:52,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:20:52,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 373 [2019-09-20 13:20:52,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:20:52,843 INFO L225 Difference]: With dead ends: 3519 [2019-09-20 13:20:52,843 INFO L226 Difference]: Without dead ends: 1781 [2019-09-20 13:20:52,851 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:20:52,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2019-09-20 13:20:52,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1769. [2019-09-20 13:20:52,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1769 states. [2019-09-20 13:20:52,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 2282 transitions. [2019-09-20 13:20:52,968 INFO L78 Accepts]: Start accepts. Automaton has 1769 states and 2282 transitions. Word has length 373 [2019-09-20 13:20:52,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:20:52,969 INFO L475 AbstractCegarLoop]: Abstraction has 1769 states and 2282 transitions. [2019-09-20 13:20:52,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:20:52,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 2282 transitions. [2019-09-20 13:20:52,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-09-20 13:20:52,979 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:20:52,979 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:20:52,979 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:20:52,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:20:52,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1660013055, now seen corresponding path program 1 times [2019-09-20 13:20:52,980 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:20:52,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:20:52,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:52,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:20:52,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:53,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:20:53,468 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2019-09-20 13:20:53,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:20:53,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:20:53,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:20:53,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:20:53,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:20:53,471 INFO L87 Difference]: Start difference. First operand 1769 states and 2282 transitions. Second operand 6 states. [2019-09-20 13:20:53,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:20:53,866 INFO L93 Difference]: Finished difference Result 3118 states and 4018 transitions. [2019-09-20 13:20:53,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:20:53,867 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 375 [2019-09-20 13:20:53,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:20:53,897 INFO L225 Difference]: With dead ends: 3118 [2019-09-20 13:20:53,897 INFO L226 Difference]: Without dead ends: 1317 [2019-09-20 13:20:53,916 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 7 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:20:53,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2019-09-20 13:20:54,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 1014. [2019-09-20 13:20:54,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2019-09-20 13:20:54,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1291 transitions. [2019-09-20 13:20:54,030 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1291 transitions. Word has length 375 [2019-09-20 13:20:54,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:20:54,031 INFO L475 AbstractCegarLoop]: Abstraction has 1014 states and 1291 transitions. [2019-09-20 13:20:54,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:20:54,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1291 transitions. [2019-09-20 13:20:54,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2019-09-20 13:20:54,041 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:20:54,044 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:20:54,044 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:20:54,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:20:54,045 INFO L82 PathProgramCache]: Analyzing trace with hash -168595787, now seen corresponding path program 1 times [2019-09-20 13:20:54,045 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:20:54,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:20:54,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:54,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:20:54,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:20:54,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:20:54,478 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2019-09-20 13:20:54,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:20:54,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:20:54,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:20:54,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:20:54,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:20:54,480 INFO L87 Difference]: Start difference. First operand 1014 states and 1291 transitions. Second operand 3 states. [2019-09-20 13:20:54,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:20:54,696 INFO L93 Difference]: Finished difference Result 1014 states and 1291 transitions. [2019-09-20 13:20:54,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:20:54,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 397 [2019-09-20 13:20:54,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:20:54,698 INFO L225 Difference]: With dead ends: 1014 [2019-09-20 13:20:54,698 INFO L226 Difference]: Without dead ends: 0 [2019-09-20 13:20:54,700 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-20 13:20:54,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-20 13:20:54,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-20 13:20:54,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-20 13:20:54,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-20 13:20:54,701 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 397 [2019-09-20 13:20:54,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:20:54,701 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-20 13:20:54,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:20:54,702 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-20 13:20:54,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-20 13:20:54,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.