java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 20:55:07,362 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 20:55:07,365 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 20:55:07,385 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 20:55:07,385 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 20:55:07,387 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 20:55:07,389 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 20:55:07,400 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 20:55:07,405 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 20:55:07,409 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 20:55:07,410 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 20:55:07,412 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 20:55:07,412 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 20:55:07,413 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 20:55:07,416 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 20:55:07,418 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 20:55:07,419 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 20:55:07,420 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 20:55:07,422 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 20:55:07,427 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 20:55:07,431 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 20:55:07,434 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 20:55:07,437 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 20:55:07,438 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 20:55:07,440 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 20:55:07,440 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 20:55:07,440 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 20:55:07,442 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 20:55:07,444 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 20:55:07,446 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 20:55:07,446 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 20:55:07,448 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 20:55:07,448 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 20:55:07,449 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 20:55:07,451 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 20:55:07,451 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 20:55:07,451 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 20:55:07,452 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 20:55:07,452 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 20:55:07,453 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 20:55:07,454 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 20:55:07,455 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 20:55:07,487 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 20:55:07,489 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 20:55:07,490 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 20:55:07,491 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 20:55:07,491 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 20:55:07,494 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 20:55:07,495 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 20:55:07,495 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 20:55:07,495 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 20:55:07,495 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 20:55:07,495 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 20:55:07,495 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 20:55:07,496 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 20:55:07,496 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 20:55:07,496 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 20:55:07,496 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 20:55:07,496 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 20:55:07,497 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 20:55:07,497 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 20:55:07,497 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 20:55:07,497 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 20:55:07,497 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 20:55:07,498 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 20:55:07,498 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 20:55:07,498 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 20:55:07,499 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 20:55:07,499 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 20:55:07,499 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 20:55:07,500 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 20:55:07,789 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 20:55:07,802 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 20:55:07,806 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 20:55:07,808 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 20:55:07,808 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 20:55:07,809 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i [2019-10-13 20:55:07,876 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d53208fc/39b5d2fa813f4be5a08cbd3869666232/FLAG28ed0f176 [2019-10-13 20:55:08,597 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 20:55:08,597 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i [2019-10-13 20:55:08,639 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d53208fc/39b5d2fa813f4be5a08cbd3869666232/FLAG28ed0f176 [2019-10-13 20:55:08,725 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d53208fc/39b5d2fa813f4be5a08cbd3869666232 [2019-10-13 20:55:08,736 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 20:55:08,738 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 20:55:08,739 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 20:55:08,739 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 20:55:08,742 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 20:55:08,743 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:55:08" (1/1) ... [2019-10-13 20:55:08,746 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5510b8b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:55:08, skipping insertion in model container [2019-10-13 20:55:08,746 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:55:08" (1/1) ... [2019-10-13 20:55:08,754 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 20:55:08,878 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 20:55:10,174 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 20:55:10,203 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 20:55:10,415 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 20:55:10,490 INFO L192 MainTranslator]: Completed translation [2019-10-13 20:55:10,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:55:10 WrapperNode [2019-10-13 20:55:10,491 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 20:55:10,492 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 20:55:10,492 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 20:55:10,493 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 20:55:10,509 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:55:10" (1/1) ... [2019-10-13 20:55:10,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:55:10" (1/1) ... [2019-10-13 20:55:10,559 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:55:10" (1/1) ... [2019-10-13 20:55:10,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:55:10" (1/1) ... [2019-10-13 20:55:10,600 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:55:10" (1/1) ... [2019-10-13 20:55:10,609 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:55:10" (1/1) ... [2019-10-13 20:55:10,620 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:55:10" (1/1) ... [2019-10-13 20:55:10,630 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 20:55:10,631 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 20:55:10,631 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 20:55:10,632 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 20:55:10,633 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:55:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 20:55:10,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 20:55:10,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 20:55:10,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~int~TO~int [2019-10-13 20:55:10,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2019-10-13 20:55:10,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-10-13 20:55:10,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-10-13 20:55:10,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2019-10-13 20:55:10,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2019-10-13 20:55:10,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2019-10-13 20:55:10,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ptr [2019-10-13 20:55:10,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2019-10-13 20:55:10,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2019-10-13 20:55:10,763 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_sock [2019-10-13 20:55:10,764 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_sk [2019-10-13 20:55:10,764 INFO L138 BoogieDeclarations]: Found implementation of procedure register_pppox_proto [2019-10-13 20:55:10,764 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_pppox_proto [2019-10-13 20:55:10,766 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_unbind_sock [2019-10-13 20:55:10,766 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_ioctl [2019-10-13 20:55:10,767 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_create [2019-10-13 20:55:10,767 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_init [2019-10-13 20:55:10,767 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_exit [2019-10-13 20:55:10,767 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 20:55:10,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get_5 [2019-10-13 20:55:10,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put_6 [2019-10-13 20:55:10,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-10-13 20:55:10,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2019-10-13 20:55:10,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_err_ptr [2019-10-13 20:55:10,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_ptr_err [2019-10-13 20:55:10,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err_or_null [2019-10-13 20:55:10,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_get [2019-10-13 20:55:10,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get [2019-10-13 20:55:10,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2019-10-13 20:55:10,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put_and_exit [2019-10-13 20:55:10,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_refcount [2019-10-13 20:55:10,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-10-13 20:55:10,770 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_fault [2019-10-13 20:55:10,770 INFO L138 BoogieDeclarations]: Found implementation of procedure __request_module [2019-10-13 20:55:10,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-10-13 20:55:10,770 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_sock_nested [2019-10-13 20:55:10,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_channel_index [2019-10-13 20:55:10,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_unregister_channel [2019-10-13 20:55:10,771 INFO L138 BoogieDeclarations]: Found implementation of procedure release_sock [2019-10-13 20:55:10,771 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_register [2019-10-13 20:55:10,771 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_unregister [2019-10-13 20:55:10,771 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-10-13 20:55:10,772 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-10-13 20:55:10,772 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-10-13 20:55:10,772 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-10-13 20:55:10,772 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 20:55:10,773 INFO L130 BoogieDeclarations]: Found specification of procedure __might_fault [2019-10-13 20:55:10,773 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-10-13 20:55:10,773 INFO L130 BoogieDeclarations]: Found specification of procedure __request_module [2019-10-13 20:55:10,773 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get_5 [2019-10-13 20:55:10,774 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put_6 [2019-10-13 20:55:10,774 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get [2019-10-13 20:55:10,774 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2019-10-13 20:55:10,774 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 20:55:10,774 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-13 20:55:10,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 20:55:10,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-10-13 20:55:10,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-13 20:55:10,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 20:55:10,776 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-10-13 20:55:10,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 20:55:10,776 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-10-13 20:55:10,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-10-13 20:55:10,777 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2019-10-13 20:55:10,777 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2019-10-13 20:55:10,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-10-13 20:55:10,777 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2019-10-13 20:55:10,777 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ptr [2019-10-13 20:55:10,777 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2019-10-13 20:55:10,778 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2019-10-13 20:55:10,778 INFO L130 BoogieDeclarations]: Found specification of procedure sock_register [2019-10-13 20:55:10,779 INFO L130 BoogieDeclarations]: Found specification of procedure sock_unregister [2019-10-13 20:55:10,779 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_unregister_channel [2019-10-13 20:55:10,779 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_channel_index [2019-10-13 20:55:10,779 INFO L130 BoogieDeclarations]: Found specification of procedure lock_sock_nested [2019-10-13 20:55:10,779 INFO L130 BoogieDeclarations]: Found specification of procedure lock_sock [2019-10-13 20:55:10,780 INFO L130 BoogieDeclarations]: Found specification of procedure release_sock [2019-10-13 20:55:10,780 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_sk [2019-10-13 20:55:10,780 INFO L130 BoogieDeclarations]: Found specification of procedure register_pppox_proto [2019-10-13 20:55:10,781 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_pppox_proto [2019-10-13 20:55:10,781 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_unbind_sock [2019-10-13 20:55:10,781 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_ioctl [2019-10-13 20:55:10,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 20:55:10,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 20:55:10,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 20:55:10,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 20:55:10,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 20:55:10,783 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~int~TO~int [2019-10-13 20:55:10,783 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_create [2019-10-13 20:55:10,783 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2019-10-13 20:55:10,783 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_init [2019-10-13 20:55:10,783 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_exit [2019-10-13 20:55:10,784 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-10-13 20:55:10,784 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-10-13 20:55:10,784 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 20:55:10,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 20:55:10,784 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-10-13 20:55:10,784 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2019-10-13 20:55:10,784 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_err_ptr [2019-10-13 20:55:10,784 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_ptr_err [2019-10-13 20:55:10,785 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err_or_null [2019-10-13 20:55:10,785 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_get [2019-10-13 20:55:10,785 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put_and_exit [2019-10-13 20:55:10,785 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_refcount [2019-10-13 20:55:10,785 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-10-13 20:55:10,785 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 20:55:10,785 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-10-13 20:55:10,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 20:55:10,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-13 20:55:10,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-13 20:55:10,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 20:55:11,909 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2019-10-13 20:55:11,937 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_module_put_and_exitFINAL: assume true; [2019-10-13 20:55:12,284 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 20:55:12,284 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 20:55:12,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:55:12 BoogieIcfgContainer [2019-10-13 20:55:12,286 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 20:55:12,287 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 20:55:12,288 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 20:55:12,291 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 20:55:12,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 08:55:08" (1/3) ... [2019-10-13 20:55:12,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@403b63cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:55:12, skipping insertion in model container [2019-10-13 20:55:12,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:55:10" (2/3) ... [2019-10-13 20:55:12,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@403b63cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:55:12, skipping insertion in model container [2019-10-13 20:55:12,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:55:12" (3/3) ... [2019-10-13 20:55:12,294 INFO L109 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i [2019-10-13 20:55:12,304 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 20:55:12,313 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 20:55:12,324 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 20:55:12,352 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 20:55:12,352 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 20:55:12,352 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 20:55:12,352 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 20:55:12,352 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 20:55:12,353 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 20:55:12,353 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 20:55:12,353 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 20:55:12,374 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2019-10-13 20:55:12,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-13 20:55:12,383 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:55:12,384 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:55:12,386 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:55:12,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:55:12,393 INFO L82 PathProgramCache]: Analyzing trace with hash 945988663, now seen corresponding path program 1 times [2019-10-13 20:55:12,402 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:55:12,403 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204115782] [2019-10-13 20:55:12,403 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:55:12,403 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:55:12,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:55:12,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:55:13,013 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-13 20:55:13,014 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204115782] [2019-10-13 20:55:13,017 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:55:13,018 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 20:55:13,018 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509281633] [2019-10-13 20:55:13,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 20:55:13,025 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:55:13,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 20:55:13,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 20:55:13,047 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2019-10-13 20:55:13,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:55:13,231 INFO L93 Difference]: Finished difference Result 307 states and 392 transitions. [2019-10-13 20:55:13,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 20:55:13,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-10-13 20:55:13,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:55:13,248 INFO L225 Difference]: With dead ends: 307 [2019-10-13 20:55:13,248 INFO L226 Difference]: Without dead ends: 190 [2019-10-13 20:55:13,253 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 20:55:13,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-10-13 20:55:13,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2019-10-13 20:55:13,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-10-13 20:55:13,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 227 transitions. [2019-10-13 20:55:13,322 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 227 transitions. Word has length 69 [2019-10-13 20:55:13,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:55:13,324 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 227 transitions. [2019-10-13 20:55:13,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 20:55:13,325 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 227 transitions. [2019-10-13 20:55:13,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-13 20:55:13,329 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:55:13,329 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:55:13,329 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:55:13,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:55:13,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1444090839, now seen corresponding path program 1 times [2019-10-13 20:55:13,330 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:55:13,330 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751312502] [2019-10-13 20:55:13,330 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:55:13,331 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:55:13,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:55:13,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:55:13,522 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-13 20:55:13,523 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751312502] [2019-10-13 20:55:13,523 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:55:13,523 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 20:55:13,523 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660009090] [2019-10-13 20:55:13,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 20:55:13,526 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:55:13,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 20:55:13,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 20:55:13,527 INFO L87 Difference]: Start difference. First operand 187 states and 227 transitions. Second operand 3 states. [2019-10-13 20:55:13,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:55:13,573 INFO L93 Difference]: Finished difference Result 197 states and 235 transitions. [2019-10-13 20:55:13,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 20:55:13,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-10-13 20:55:13,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:55:13,582 INFO L225 Difference]: With dead ends: 197 [2019-10-13 20:55:13,583 INFO L226 Difference]: Without dead ends: 192 [2019-10-13 20:55:13,584 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 20:55:13,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-10-13 20:55:13,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 187. [2019-10-13 20:55:13,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-10-13 20:55:13,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 226 transitions. [2019-10-13 20:55:13,628 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 226 transitions. Word has length 74 [2019-10-13 20:55:13,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:55:13,629 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 226 transitions. [2019-10-13 20:55:13,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 20:55:13,629 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 226 transitions. [2019-10-13 20:55:13,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-13 20:55:13,632 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:55:13,632 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:55:13,632 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:55:13,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:55:13,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1501349141, now seen corresponding path program 1 times [2019-10-13 20:55:13,633 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:55:13,633 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195876932] [2019-10-13 20:55:13,634 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:55:13,634 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:55:13,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:55:13,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:55:13,818 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-13 20:55:13,819 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195876932] [2019-10-13 20:55:13,819 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:55:13,819 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 20:55:13,819 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890277906] [2019-10-13 20:55:13,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 20:55:13,820 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:55:13,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 20:55:13,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 20:55:13,822 INFO L87 Difference]: Start difference. First operand 187 states and 226 transitions. Second operand 3 states. [2019-10-13 20:55:13,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:55:13,888 INFO L93 Difference]: Finished difference Result 490 states and 613 transitions. [2019-10-13 20:55:13,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 20:55:13,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-10-13 20:55:13,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:55:13,900 INFO L225 Difference]: With dead ends: 490 [2019-10-13 20:55:13,901 INFO L226 Difference]: Without dead ends: 327 [2019-10-13 20:55:13,906 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 20:55:13,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-10-13 20:55:13,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 323. [2019-10-13 20:55:13,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-10-13 20:55:13,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 401 transitions. [2019-10-13 20:55:13,969 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 401 transitions. Word has length 74 [2019-10-13 20:55:13,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:55:13,970 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 401 transitions. [2019-10-13 20:55:13,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 20:55:13,970 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 401 transitions. [2019-10-13 20:55:13,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-13 20:55:13,972 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:55:13,973 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:55:13,973 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:55:13,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:55:13,975 INFO L82 PathProgramCache]: Analyzing trace with hash -173204652, now seen corresponding path program 1 times [2019-10-13 20:55:13,976 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:55:13,976 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590811931] [2019-10-13 20:55:13,976 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:55:13,976 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:55:13,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:55:14,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:55:14,135 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-13 20:55:14,136 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590811931] [2019-10-13 20:55:14,141 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:55:14,142 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 20:55:14,142 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852834573] [2019-10-13 20:55:14,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 20:55:14,143 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:55:14,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 20:55:14,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 20:55:14,146 INFO L87 Difference]: Start difference. First operand 323 states and 401 transitions. Second operand 3 states. [2019-10-13 20:55:14,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:55:14,221 INFO L93 Difference]: Finished difference Result 701 states and 881 transitions. [2019-10-13 20:55:14,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 20:55:14,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-10-13 20:55:14,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:55:14,229 INFO L225 Difference]: With dead ends: 701 [2019-10-13 20:55:14,229 INFO L226 Difference]: Without dead ends: 412 [2019-10-13 20:55:14,231 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 20:55:14,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2019-10-13 20:55:14,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 399. [2019-10-13 20:55:14,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-10-13 20:55:14,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 501 transitions. [2019-10-13 20:55:14,265 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 501 transitions. Word has length 88 [2019-10-13 20:55:14,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:55:14,267 INFO L462 AbstractCegarLoop]: Abstraction has 399 states and 501 transitions. [2019-10-13 20:55:14,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 20:55:14,268 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 501 transitions. [2019-10-13 20:55:14,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-13 20:55:14,277 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:55:14,277 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:55:14,278 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:55:14,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:55:14,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1275114055, now seen corresponding path program 1 times [2019-10-13 20:55:14,279 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:55:14,279 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755541794] [2019-10-13 20:55:14,279 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:55:14,279 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:55:14,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:55:14,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:55:14,662 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 20:55:14,663 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755541794] [2019-10-13 20:55:14,663 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112896512] [2019-10-13 20:55:14,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:55:15,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:55:15,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 971 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-13 20:55:15,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 20:55:15,209 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-13 20:55:15,210 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 20:55:15,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:55:15,550 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-13 20:55:15,551 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 20:55:15,551 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [6] total 14 [2019-10-13 20:55:15,552 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851833203] [2019-10-13 20:55:15,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 20:55:15,554 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:55:15,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 20:55:15,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-10-13 20:55:15,555 INFO L87 Difference]: Start difference. First operand 399 states and 501 transitions. Second operand 10 states. [2019-10-13 20:55:15,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:55:15,655 INFO L93 Difference]: Finished difference Result 816 states and 1037 transitions. [2019-10-13 20:55:15,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 20:55:15,656 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 107 [2019-10-13 20:55:15,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:55:15,662 INFO L225 Difference]: With dead ends: 816 [2019-10-13 20:55:15,662 INFO L226 Difference]: Without dead ends: 451 [2019-10-13 20:55:15,665 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-10-13 20:55:15,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-10-13 20:55:15,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 429. [2019-10-13 20:55:15,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-10-13 20:55:15,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 535 transitions. [2019-10-13 20:55:15,700 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 535 transitions. Word has length 107 [2019-10-13 20:55:15,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:55:15,701 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 535 transitions. [2019-10-13 20:55:15,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 20:55:15,701 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 535 transitions. [2019-10-13 20:55:15,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-13 20:55:15,708 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:55:15,708 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:55:15,916 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:55:15,916 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:55:15,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:55:15,917 INFO L82 PathProgramCache]: Analyzing trace with hash -4749623, now seen corresponding path program 1 times [2019-10-13 20:55:15,918 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:55:15,918 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329617001] [2019-10-13 20:55:15,918 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:55:15,918 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:55:15,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:55:15,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:55:16,037 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-13 20:55:16,038 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329617001] [2019-10-13 20:55:16,038 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631623452] [2019-10-13 20:55:16,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:55:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:55:16,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 20:55:16,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 20:55:16,434 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-13 20:55:16,435 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 20:55:16,593 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-13 20:55:16,594 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 20:55:16,594 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-13 20:55:16,595 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521454592] [2019-10-13 20:55:16,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 20:55:16,595 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:55:16,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 20:55:16,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 20:55:16,596 INFO L87 Difference]: Start difference. First operand 429 states and 535 transitions. Second operand 3 states. [2019-10-13 20:55:16,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:55:16,625 INFO L93 Difference]: Finished difference Result 799 states and 1014 transitions. [2019-10-13 20:55:16,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 20:55:16,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-10-13 20:55:16,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:55:16,628 INFO L225 Difference]: With dead ends: 799 [2019-10-13 20:55:16,628 INFO L226 Difference]: Without dead ends: 404 [2019-10-13 20:55:16,630 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 214 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 20:55:16,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2019-10-13 20:55:16,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 392. [2019-10-13 20:55:16,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-10-13 20:55:16,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 488 transitions. [2019-10-13 20:55:16,649 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 488 transitions. Word has length 107 [2019-10-13 20:55:16,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:55:16,649 INFO L462 AbstractCegarLoop]: Abstraction has 392 states and 488 transitions. [2019-10-13 20:55:16,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 20:55:16,650 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 488 transitions. [2019-10-13 20:55:16,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-13 20:55:16,651 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:55:16,651 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:55:16,858 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:55:16,858 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:55:16,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:55:16,858 INFO L82 PathProgramCache]: Analyzing trace with hash 549282891, now seen corresponding path program 1 times [2019-10-13 20:55:16,859 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:55:16,859 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010625212] [2019-10-13 20:55:16,859 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:55:16,859 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:55:16,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:55:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:55:17,118 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-13 20:55:17,119 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010625212] [2019-10-13 20:55:17,119 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:55:17,119 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 20:55:17,119 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662767530] [2019-10-13 20:55:17,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 20:55:17,120 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:55:17,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 20:55:17,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-13 20:55:17,121 INFO L87 Difference]: Start difference. First operand 392 states and 488 transitions. Second operand 7 states. [2019-10-13 20:55:17,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:55:17,739 INFO L93 Difference]: Finished difference Result 637 states and 788 transitions. [2019-10-13 20:55:17,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 20:55:17,740 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2019-10-13 20:55:17,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:55:17,744 INFO L225 Difference]: With dead ends: 637 [2019-10-13 20:55:17,744 INFO L226 Difference]: Without dead ends: 634 [2019-10-13 20:55:17,745 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-10-13 20:55:17,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2019-10-13 20:55:17,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 599. [2019-10-13 20:55:17,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-13 20:55:17,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 751 transitions. [2019-10-13 20:55:17,785 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 751 transitions. Word has length 113 [2019-10-13 20:55:17,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:55:17,786 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 751 transitions. [2019-10-13 20:55:17,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 20:55:17,786 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 751 transitions. [2019-10-13 20:55:17,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-13 20:55:17,789 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:55:17,789 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:55:17,790 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:55:17,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:55:17,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1039387099, now seen corresponding path program 1 times [2019-10-13 20:55:17,791 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:55:17,791 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983868940] [2019-10-13 20:55:17,792 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:55:17,792 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:55:17,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:55:17,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:55:17,956 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-13 20:55:17,956 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983868940] [2019-10-13 20:55:17,957 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:55:17,957 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 20:55:17,959 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081581603] [2019-10-13 20:55:17,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 20:55:17,960 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:55:17,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 20:55:17,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 20:55:17,961 INFO L87 Difference]: Start difference. First operand 599 states and 751 transitions. Second operand 3 states. [2019-10-13 20:55:17,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:55:17,991 INFO L93 Difference]: Finished difference Result 1033 states and 1296 transitions. [2019-10-13 20:55:17,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 20:55:17,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-10-13 20:55:17,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:55:17,996 INFO L225 Difference]: With dead ends: 1033 [2019-10-13 20:55:17,996 INFO L226 Difference]: Without dead ends: 611 [2019-10-13 20:55:17,997 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 20:55:17,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-10-13 20:55:18,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 599. [2019-10-13 20:55:18,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-13 20:55:18,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 747 transitions. [2019-10-13 20:55:18,029 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 747 transitions. Word has length 122 [2019-10-13 20:55:18,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:55:18,030 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 747 transitions. [2019-10-13 20:55:18,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 20:55:18,030 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 747 transitions. [2019-10-13 20:55:18,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-13 20:55:18,032 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:55:18,032 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:55:18,033 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:55:18,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:55:18,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1173400605, now seen corresponding path program 1 times [2019-10-13 20:55:18,034 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:55:18,034 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294488477] [2019-10-13 20:55:18,034 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:55:18,034 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:55:18,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:55:18,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:55:18,263 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-13 20:55:18,264 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294488477] [2019-10-13 20:55:18,264 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529960574] [2019-10-13 20:55:18,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:55:18,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:55:18,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 962 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-13 20:55:18,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 20:55:18,628 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-13 20:55:18,629 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 20:55:18,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:55:18,933 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-13 20:55:18,937 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 20:55:18,937 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [8] total 14 [2019-10-13 20:55:18,938 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096390381] [2019-10-13 20:55:18,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 20:55:18,939 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:55:18,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 20:55:18,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-10-13 20:55:18,940 INFO L87 Difference]: Start difference. First operand 599 states and 747 transitions. Second operand 12 states. [2019-10-13 20:55:19,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:55:19,023 INFO L93 Difference]: Finished difference Result 1025 states and 1278 transitions. [2019-10-13 20:55:19,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 20:55:19,024 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 122 [2019-10-13 20:55:19,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:55:19,029 INFO L225 Difference]: With dead ends: 1025 [2019-10-13 20:55:19,029 INFO L226 Difference]: Without dead ends: 603 [2019-10-13 20:55:19,031 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 240 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-10-13 20:55:19,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-10-13 20:55:19,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 597. [2019-10-13 20:55:19,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-10-13 20:55:19,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 741 transitions. [2019-10-13 20:55:19,103 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 741 transitions. Word has length 122 [2019-10-13 20:55:19,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:55:19,106 INFO L462 AbstractCegarLoop]: Abstraction has 597 states and 741 transitions. [2019-10-13 20:55:19,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 20:55:19,106 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 741 transitions. [2019-10-13 20:55:19,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-13 20:55:19,108 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:55:19,109 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:55:19,319 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:55:19,319 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:55:19,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:55:19,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1755090979, now seen corresponding path program 1 times [2019-10-13 20:55:19,320 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:55:19,321 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087970154] [2019-10-13 20:55:19,321 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:55:19,321 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:55:19,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:55:19,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:55:19,504 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-13 20:55:19,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087970154] [2019-10-13 20:55:19,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53367915] [2019-10-13 20:55:19,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:55:19,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:55:19,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 1042 conjuncts, 54 conjunts are in the unsatisfiable core [2019-10-13 20:55:19,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 20:55:19,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:55:19,980 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:55:19,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:55:19,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:55:19,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:55:19,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:55:20,004 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2019-10-13 20:55:20,005 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 20:55:20,028 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:55:20,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:55:20,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:55:20,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:55:20,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:55:20,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:55:20,050 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:55:20,052 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:55:20,053 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 13 [2019-10-13 20:55:20,053 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 20:55:20,063 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:55:20,064 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 20:55:20,064 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:10 [2019-10-13 20:55:20,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:55:20,112 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:55:20,113 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:55:20,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:55:20,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:55:20,120 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:55:20,122 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2019-10-13 20:55:20,123 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 20:55:20,146 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:55:20,152 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:55:20,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:55:20,155 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:55:20,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:55:20,158 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:55:20,159 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:55:20,160 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:55:20,161 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 13 [2019-10-13 20:55:20,162 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 20:55:20,173 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:55:20,174 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 20:55:20,174 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:10 [2019-10-13 20:55:20,727 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-13 20:55:20,727 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 20:55:21,224 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-13 20:55:21,224 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 20:55:21,225 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8, 5] imperfect sequences [6] total 15 [2019-10-13 20:55:21,225 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981653823] [2019-10-13 20:55:21,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 20:55:21,226 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:55:21,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 20:55:21,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-10-13 20:55:21,227 INFO L87 Difference]: Start difference. First operand 597 states and 741 transitions. Second operand 11 states. [2019-10-13 20:55:21,866 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-10-13 20:55:22,138 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-10-13 20:55:22,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:55:22,429 INFO L93 Difference]: Finished difference Result 1313 states and 1664 transitions. [2019-10-13 20:55:22,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 20:55:22,431 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 137 [2019-10-13 20:55:22,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:55:22,434 INFO L225 Difference]: With dead ends: 1313 [2019-10-13 20:55:22,435 INFO L226 Difference]: Without dead ends: 638 [2019-10-13 20:55:22,437 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 266 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2019-10-13 20:55:22,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-10-13 20:55:22,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 620. [2019-10-13 20:55:22,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-10-13 20:55:22,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 767 transitions. [2019-10-13 20:55:22,467 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 767 transitions. Word has length 137 [2019-10-13 20:55:22,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:55:22,468 INFO L462 AbstractCegarLoop]: Abstraction has 620 states and 767 transitions. [2019-10-13 20:55:22,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 20:55:22,468 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 767 transitions. [2019-10-13 20:55:22,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-13 20:55:22,470 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:55:22,470 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:55:22,676 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:55:22,677 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:55:22,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:55:22,677 INFO L82 PathProgramCache]: Analyzing trace with hash -827044600, now seen corresponding path program 1 times [2019-10-13 20:55:22,678 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:55:22,678 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120120538] [2019-10-13 20:55:22,678 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:55:22,679 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:55:22,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:55:22,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:55:22,956 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-13 20:55:22,957 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120120538] [2019-10-13 20:55:22,957 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989413419] [2019-10-13 20:55:22,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:55:23,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:55:23,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 1047 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-13 20:55:23,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 20:55:23,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:55:23,357 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 20:55:23,358 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 20:55:23,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:55:23,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:55:23,755 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-13 20:55:23,756 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 20:55:23,756 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 11 [2019-10-13 20:55:23,756 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724447063] [2019-10-13 20:55:23,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 20:55:23,757 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:55:23,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 20:55:23,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-10-13 20:55:23,758 INFO L87 Difference]: Start difference. First operand 620 states and 767 transitions. Second operand 6 states. [2019-10-13 20:55:23,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:55:23,862 INFO L93 Difference]: Finished difference Result 1217 states and 1506 transitions. [2019-10-13 20:55:23,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 20:55:23,863 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 138 [2019-10-13 20:55:23,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:55:23,867 INFO L225 Difference]: With dead ends: 1217 [2019-10-13 20:55:23,867 INFO L226 Difference]: Without dead ends: 614 [2019-10-13 20:55:23,870 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 269 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-10-13 20:55:23,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-10-13 20:55:23,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 610. [2019-10-13 20:55:23,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-10-13 20:55:23,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 754 transitions. [2019-10-13 20:55:23,918 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 754 transitions. Word has length 138 [2019-10-13 20:55:23,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:55:23,920 INFO L462 AbstractCegarLoop]: Abstraction has 610 states and 754 transitions. [2019-10-13 20:55:23,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 20:55:23,920 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 754 transitions. [2019-10-13 20:55:23,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-13 20:55:23,924 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:55:23,925 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:55:24,130 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:55:24,131 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:55:24,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:55:24,131 INFO L82 PathProgramCache]: Analyzing trace with hash 183446843, now seen corresponding path program 2 times [2019-10-13 20:55:24,131 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:55:24,132 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528129961] [2019-10-13 20:55:24,132 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:55:24,132 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:55:24,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:55:24,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:55:24,431 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-13 20:55:24,431 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528129961] [2019-10-13 20:55:24,432 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572942905] [2019-10-13 20:55:24,432 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:55:24,757 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 20:55:24,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 20:55:24,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 986 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-13 20:55:24,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 20:55:24,855 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-13 20:55:24,856 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 20:55:25,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:55:25,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:55:25,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:55:25,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:55:33,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:55:33,300 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-13 20:55:33,301 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [2047274786] [2019-10-13 20:55:33,305 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-13 20:55:33,307 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-13 20:55:33,307 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-13 20:55:33,307 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-10-13 20:55:33,307 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682607270] [2019-10-13 20:55:33,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-13 20:55:33,308 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:55:33,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-13 20:55:33,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=118, Unknown=2, NotChecked=0, Total=156 [2019-10-13 20:55:33,309 INFO L87 Difference]: Start difference. First operand 610 states and 754 transitions. Second operand 13 states. [2019-10-13 20:55:35,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:55:35,485 INFO L93 Difference]: Finished difference Result 1204 states and 1492 transitions. [2019-10-13 20:55:35,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 20:55:35,486 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 139 [2019-10-13 20:55:35,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:55:35,489 INFO L225 Difference]: With dead ends: 1204 [2019-10-13 20:55:35,490 INFO L226 Difference]: Without dead ends: 611 [2019-10-13 20:55:35,494 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 269 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=50, Invalid=157, Unknown=3, NotChecked=0, Total=210 [2019-10-13 20:55:35,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-10-13 20:55:35,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-10-13 20:55:35,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-10-13 20:55:35,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 755 transitions. [2019-10-13 20:55:35,524 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 755 transitions. Word has length 139 [2019-10-13 20:55:35,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:55:35,525 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 755 transitions. [2019-10-13 20:55:35,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-13 20:55:35,525 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 755 transitions. [2019-10-13 20:55:35,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-13 20:55:35,528 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:55:35,528 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:55:35,742 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:55:35,743 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:55:35,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:55:35,743 INFO L82 PathProgramCache]: Analyzing trace with hash -644070369, now seen corresponding path program 3 times [2019-10-13 20:55:35,743 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:55:35,744 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483016701] [2019-10-13 20:55:35,744 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:55:35,744 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:55:35,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:55:35,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:55:36,019 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 20:55:36,019 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483016701] [2019-10-13 20:55:36,019 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904969670] [2019-10-13 20:55:36,020 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:55:36,489 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 20:55:36,489 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 20:55:36,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 1065 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-13 20:55:36,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 20:55:36,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:55:36,696 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-13 20:55:36,697 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 20:55:37,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:55:37,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:55:37,363 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 20:55:37,364 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [628383101] [2019-10-13 20:55:37,364 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-13 20:55:37,364 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-13 20:55:37,364 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-13 20:55:37,365 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2019-10-13 20:55:37,365 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474486870] [2019-10-13 20:55:37,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-13 20:55:37,367 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:55:37,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-13 20:55:37,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2019-10-13 20:55:37,368 INFO L87 Difference]: Start difference. First operand 611 states and 755 transitions. Second operand 18 states. [2019-10-13 20:55:37,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:55:37,519 INFO L93 Difference]: Finished difference Result 1206 states and 1494 transitions. [2019-10-13 20:55:37,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 20:55:37,520 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 141 [2019-10-13 20:55:37,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:55:37,523 INFO L225 Difference]: With dead ends: 1206 [2019-10-13 20:55:37,523 INFO L226 Difference]: Without dead ends: 612 [2019-10-13 20:55:37,525 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 270 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2019-10-13 20:55:37,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-10-13 20:55:37,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2019-10-13 20:55:37,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-10-13 20:55:37,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 756 transitions. [2019-10-13 20:55:37,551 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 756 transitions. Word has length 141 [2019-10-13 20:55:37,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:55:37,551 INFO L462 AbstractCegarLoop]: Abstraction has 612 states and 756 transitions. [2019-10-13 20:55:37,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-13 20:55:37,551 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 756 transitions. [2019-10-13 20:55:37,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-13 20:55:37,553 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:55:37,554 INFO L380 BasicCegarLoop]: trace histogram [6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:55:37,765 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:55:37,766 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:55:37,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:55:37,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1373112069, now seen corresponding path program 4 times [2019-10-13 20:55:37,767 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:55:37,767 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17059658] [2019-10-13 20:55:37,768 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:55:37,768 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:55:37,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:55:37,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:55:38,041 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-13 20:55:38,041 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17059658] [2019-10-13 20:55:38,042 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734538162] [2019-10-13 20:55:38,042 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:55:38,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:55:38,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 1077 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-13 20:55:38,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 20:55:38,578 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-13 20:55:38,578 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 20:55:38,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:55:38,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:55:38,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:55:38,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:55:41,139 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 36 [2019-10-13 20:55:41,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:55:43,238 WARN L191 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 39 [2019-10-13 20:55:45,321 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 40 [2019-10-13 20:55:45,474 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-13 20:55:45,474 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [478077235] [2019-10-13 20:55:45,475 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-13 20:55:45,475 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-13 20:55:45,475 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-13 20:55:45,475 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-10-13 20:55:45,476 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365879484] [2019-10-13 20:55:45,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-13 20:55:45,477 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:55:45,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-13 20:55:45,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-10-13 20:55:45,477 INFO L87 Difference]: Start difference. First operand 612 states and 756 transitions. Second operand 17 states.