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-13a467a-m [2019-10-15 00:54:07,639 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 00:54:07,641 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 00:54:07,655 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 00:54:07,655 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 00:54:07,656 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 00:54:07,658 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 00:54:07,660 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 00:54:07,661 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 00:54:07,662 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 00:54:07,663 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 00:54:07,664 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 00:54:07,665 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 00:54:07,669 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 00:54:07,670 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 00:54:07,671 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 00:54:07,672 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 00:54:07,673 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 00:54:07,675 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 00:54:07,679 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 00:54:07,682 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 00:54:07,683 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 00:54:07,684 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 00:54:07,685 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 00:54:07,689 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 00:54:07,690 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 00:54:07,690 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 00:54:07,691 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 00:54:07,692 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 00:54:07,695 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 00:54:07,695 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 00:54:07,697 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 00:54:07,697 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 00:54:07,698 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 00:54:07,702 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 00:54:07,702 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 00:54:07,703 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 00:54:07,703 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 00:54:07,703 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 00:54:07,704 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 00:54:07,706 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 00:54:07,706 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-15 00:54:07,726 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 00:54:07,726 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 00:54:07,728 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 00:54:07,728 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 00:54:07,728 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 00:54:07,729 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 00:54:07,729 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 00:54:07,729 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 00:54:07,729 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 00:54:07,730 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 00:54:07,731 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 00:54:07,731 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 00:54:07,731 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 00:54:07,731 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 00:54:07,732 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 00:54:07,732 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 00:54:07,732 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 00:54:07,732 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 00:54:07,732 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 00:54:07,733 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 00:54:07,733 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 00:54:07,733 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 00:54:07,733 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 00:54:07,733 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 00:54:07,734 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 00:54:07,734 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 00:54:07,734 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 00:54:07,734 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 00:54:07,734 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-15 00:54:08,062 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 00:54:08,079 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 00:54:08,082 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 00:54:08,084 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 00:54:08,084 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 00:54:08,085 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-15 00:54:08,149 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f70fd832/09bfe600908540a98e1459151ef8d497/FLAGafe7d6f11 [2019-10-15 00:54:08,903 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 00:54:08,903 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-15 00:54:08,947 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f70fd832/09bfe600908540a98e1459151ef8d497/FLAGafe7d6f11 [2019-10-15 00:54:09,461 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f70fd832/09bfe600908540a98e1459151ef8d497 [2019-10-15 00:54:09,471 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 00:54:09,473 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 00:54:09,474 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 00:54:09,474 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 00:54:09,479 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 00:54:09,480 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:54:09" (1/1) ... [2019-10-15 00:54:09,482 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@944d793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:54:09, skipping insertion in model container [2019-10-15 00:54:09,483 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:54:09" (1/1) ... [2019-10-15 00:54:09,490 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 00:54:09,597 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 00:54:10,570 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 00:54:10,618 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 00:54:10,841 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 00:54:10,895 INFO L192 MainTranslator]: Completed translation [2019-10-15 00:54:10,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:54:10 WrapperNode [2019-10-15 00:54:10,896 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 00:54:10,897 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 00:54:10,897 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 00:54:10,897 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 00:54:10,913 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:54:10" (1/1) ... [2019-10-15 00:54:10,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:54:10" (1/1) ... [2019-10-15 00:54:10,942 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:54:10" (1/1) ... [2019-10-15 00:54:10,942 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:54:10" (1/1) ... [2019-10-15 00:54:10,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:54:10" (1/1) ... [2019-10-15 00:54:11,003 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:54:10" (1/1) ... [2019-10-15 00:54:11,019 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:54:10" (1/1) ... [2019-10-15 00:54:11,038 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 00:54:11,039 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 00:54:11,039 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 00:54:11,039 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 00:54:11,040 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:54: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-15 00:54:11,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 00:54:11,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 00:54:11,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~int~TO~int [2019-10-15 00:54:11,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2019-10-15 00:54:11,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-10-15 00:54:11,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-10-15 00:54:11,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2019-10-15 00:54:11,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2019-10-15 00:54:11,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2019-10-15 00:54:11,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ptr [2019-10-15 00:54:11,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2019-10-15 00:54:11,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2019-10-15 00:54:11,211 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_sock [2019-10-15 00:54:11,211 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_sk [2019-10-15 00:54:11,212 INFO L138 BoogieDeclarations]: Found implementation of procedure register_pppox_proto [2019-10-15 00:54:11,213 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_pppox_proto [2019-10-15 00:54:11,215 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_unbind_sock [2019-10-15 00:54:11,215 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_ioctl [2019-10-15 00:54:11,215 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_create [2019-10-15 00:54:11,216 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_init [2019-10-15 00:54:11,216 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_exit [2019-10-15 00:54:11,217 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 00:54:11,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get_5 [2019-10-15 00:54:11,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put_6 [2019-10-15 00:54:11,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-10-15 00:54:11,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2019-10-15 00:54:11,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_err_ptr [2019-10-15 00:54:11,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_ptr_err [2019-10-15 00:54:11,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err_or_null [2019-10-15 00:54:11,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_get [2019-10-15 00:54:11,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get [2019-10-15 00:54:11,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2019-10-15 00:54:11,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put_and_exit [2019-10-15 00:54:11,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_refcount [2019-10-15 00:54:11,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-10-15 00:54:11,220 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_fault [2019-10-15 00:54:11,220 INFO L138 BoogieDeclarations]: Found implementation of procedure __request_module [2019-10-15 00:54:11,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-10-15 00:54:11,220 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_sock_nested [2019-10-15 00:54:11,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_channel_index [2019-10-15 00:54:11,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_unregister_channel [2019-10-15 00:54:11,220 INFO L138 BoogieDeclarations]: Found implementation of procedure release_sock [2019-10-15 00:54:11,221 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_register [2019-10-15 00:54:11,222 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_unregister [2019-10-15 00:54:11,222 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-10-15 00:54:11,222 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-10-15 00:54:11,222 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-10-15 00:54:11,222 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-10-15 00:54:11,222 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 00:54:11,222 INFO L130 BoogieDeclarations]: Found specification of procedure __might_fault [2019-10-15 00:54:11,223 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-10-15 00:54:11,223 INFO L130 BoogieDeclarations]: Found specification of procedure __request_module [2019-10-15 00:54:11,223 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get_5 [2019-10-15 00:54:11,223 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put_6 [2019-10-15 00:54:11,223 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get [2019-10-15 00:54:11,223 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2019-10-15 00:54:11,223 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 00:54:11,224 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-15 00:54:11,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 00:54:11,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-10-15 00:54:11,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-15 00:54:11,225 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 00:54:11,225 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-10-15 00:54:11,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 00:54:11,226 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-10-15 00:54:11,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-10-15 00:54:11,226 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2019-10-15 00:54:11,226 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2019-10-15 00:54:11,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-10-15 00:54:11,227 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2019-10-15 00:54:11,227 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ptr [2019-10-15 00:54:11,227 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2019-10-15 00:54:11,227 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2019-10-15 00:54:11,228 INFO L130 BoogieDeclarations]: Found specification of procedure sock_register [2019-10-15 00:54:11,228 INFO L130 BoogieDeclarations]: Found specification of procedure sock_unregister [2019-10-15 00:54:11,229 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_unregister_channel [2019-10-15 00:54:11,229 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_channel_index [2019-10-15 00:54:11,229 INFO L130 BoogieDeclarations]: Found specification of procedure lock_sock_nested [2019-10-15 00:54:11,230 INFO L130 BoogieDeclarations]: Found specification of procedure lock_sock [2019-10-15 00:54:11,230 INFO L130 BoogieDeclarations]: Found specification of procedure release_sock [2019-10-15 00:54:11,231 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_sk [2019-10-15 00:54:11,231 INFO L130 BoogieDeclarations]: Found specification of procedure register_pppox_proto [2019-10-15 00:54:11,231 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_pppox_proto [2019-10-15 00:54:11,231 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_unbind_sock [2019-10-15 00:54:11,231 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_ioctl [2019-10-15 00:54:11,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 00:54:11,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 00:54:11,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 00:54:11,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 00:54:11,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 00:54:11,233 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~int~TO~int [2019-10-15 00:54:11,233 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_create [2019-10-15 00:54:11,233 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2019-10-15 00:54:11,234 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_init [2019-10-15 00:54:11,234 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_exit [2019-10-15 00:54:11,234 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-10-15 00:54:11,234 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-10-15 00:54:11,234 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 00:54:11,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 00:54:11,234 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-10-15 00:54:11,234 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2019-10-15 00:54:11,234 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_err_ptr [2019-10-15 00:54:11,235 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_ptr_err [2019-10-15 00:54:11,235 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err_or_null [2019-10-15 00:54:11,235 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_get [2019-10-15 00:54:11,235 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put_and_exit [2019-10-15 00:54:11,235 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_refcount [2019-10-15 00:54:11,235 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-10-15 00:54:11,235 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 00:54:11,235 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-10-15 00:54:11,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 00:54:11,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-15 00:54:11,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-15 00:54:11,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 00:54:12,217 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2019-10-15 00:54:12,248 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_module_put_and_exitFINAL: assume true; [2019-10-15 00:54:12,589 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 00:54:12,590 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 00:54:12,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:54:12 BoogieIcfgContainer [2019-10-15 00:54:12,592 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 00:54:12,593 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 00:54:12,593 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 00:54:12,597 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 00:54:12,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 12:54:09" (1/3) ... [2019-10-15 00:54:12,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41795a85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:54:12, skipping insertion in model container [2019-10-15 00:54:12,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:54:10" (2/3) ... [2019-10-15 00:54:12,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41795a85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:54:12, skipping insertion in model container [2019-10-15 00:54:12,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:54:12" (3/3) ... [2019-10-15 00:54:12,600 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-15 00:54:12,611 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 00:54:12,621 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 00:54:12,633 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 00:54:12,659 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 00:54:12,659 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 00:54:12,660 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 00:54:12,660 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 00:54:12,661 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 00:54:12,666 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 00:54:12,666 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 00:54:12,666 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 00:54:12,687 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2019-10-15 00:54:12,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-15 00:54:12,697 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:54:12,698 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-15 00:54:12,701 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:54:12,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:54:12,707 INFO L82 PathProgramCache]: Analyzing trace with hash 945988663, now seen corresponding path program 1 times [2019-10-15 00:54:12,716 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:54:12,717 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275489161] [2019-10-15 00:54:12,717 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:54:12,717 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:54:12,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:54:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:54:13,256 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-15 00:54:13,257 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275489161] [2019-10-15 00:54:13,258 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:54:13,260 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 00:54:13,260 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617733440] [2019-10-15 00:54:13,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 00:54:13,268 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:54:13,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 00:54:13,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 00:54:13,287 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2019-10-15 00:54:13,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:54:13,495 INFO L93 Difference]: Finished difference Result 307 states and 392 transitions. [2019-10-15 00:54:13,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 00:54:13,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-10-15 00:54:13,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:54:13,511 INFO L225 Difference]: With dead ends: 307 [2019-10-15 00:54:13,511 INFO L226 Difference]: Without dead ends: 190 [2019-10-15 00:54:13,516 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-15 00:54:13,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-10-15 00:54:13,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2019-10-15 00:54:13,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-10-15 00:54:13,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 227 transitions. [2019-10-15 00:54:13,582 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 227 transitions. Word has length 69 [2019-10-15 00:54:13,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:54:13,585 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 227 transitions. [2019-10-15 00:54:13,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 00:54:13,585 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 227 transitions. [2019-10-15 00:54:13,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-15 00:54:13,589 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:54:13,589 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-15 00:54:13,590 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:54:13,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:54:13,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1444090839, now seen corresponding path program 1 times [2019-10-15 00:54:13,590 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:54:13,591 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283207358] [2019-10-15 00:54:13,591 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:54:13,591 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:54:13,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:54:13,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:54:13,781 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-15 00:54:13,781 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283207358] [2019-10-15 00:54:13,782 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:54:13,782 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 00:54:13,782 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347579892] [2019-10-15 00:54:13,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 00:54:13,785 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:54:13,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 00:54:13,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 00:54:13,785 INFO L87 Difference]: Start difference. First operand 187 states and 227 transitions. Second operand 3 states. [2019-10-15 00:54:13,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:54:13,836 INFO L93 Difference]: Finished difference Result 197 states and 235 transitions. [2019-10-15 00:54:13,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 00:54:13,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-10-15 00:54:13,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:54:13,840 INFO L225 Difference]: With dead ends: 197 [2019-10-15 00:54:13,840 INFO L226 Difference]: Without dead ends: 192 [2019-10-15 00:54:13,842 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-15 00:54:13,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-10-15 00:54:13,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 187. [2019-10-15 00:54:13,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-10-15 00:54:13,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 226 transitions. [2019-10-15 00:54:13,865 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 226 transitions. Word has length 74 [2019-10-15 00:54:13,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:54:13,866 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 226 transitions. [2019-10-15 00:54:13,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 00:54:13,866 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 226 transitions. [2019-10-15 00:54:13,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-15 00:54:13,869 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:54:13,870 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-15 00:54:13,870 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:54:13,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:54:13,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1501349141, now seen corresponding path program 1 times [2019-10-15 00:54:13,871 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:54:13,871 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394939440] [2019-10-15 00:54:13,871 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:54:13,871 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:54:13,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:54:13,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:54:14,038 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-15 00:54:14,039 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394939440] [2019-10-15 00:54:14,039 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:54:14,039 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 00:54:14,039 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272483517] [2019-10-15 00:54:14,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 00:54:14,041 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:54:14,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 00:54:14,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 00:54:14,042 INFO L87 Difference]: Start difference. First operand 187 states and 226 transitions. Second operand 3 states. [2019-10-15 00:54:14,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:54:14,101 INFO L93 Difference]: Finished difference Result 490 states and 613 transitions. [2019-10-15 00:54:14,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 00:54:14,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-10-15 00:54:14,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:54:14,114 INFO L225 Difference]: With dead ends: 490 [2019-10-15 00:54:14,114 INFO L226 Difference]: Without dead ends: 327 [2019-10-15 00:54:14,116 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-15 00:54:14,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-10-15 00:54:14,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 323. [2019-10-15 00:54:14,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-10-15 00:54:14,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 401 transitions. [2019-10-15 00:54:14,150 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 401 transitions. Word has length 74 [2019-10-15 00:54:14,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:54:14,151 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 401 transitions. [2019-10-15 00:54:14,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 00:54:14,151 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 401 transitions. [2019-10-15 00:54:14,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-15 00:54:14,158 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:54:14,158 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-15 00:54:14,158 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:54:14,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:54:14,159 INFO L82 PathProgramCache]: Analyzing trace with hash -173204652, now seen corresponding path program 1 times [2019-10-15 00:54:14,159 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:54:14,159 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733523222] [2019-10-15 00:54:14,159 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:54:14,160 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:54:14,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:54:14,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:54:14,262 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-15 00:54:14,263 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733523222] [2019-10-15 00:54:14,263 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:54:14,263 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 00:54:14,264 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613078407] [2019-10-15 00:54:14,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 00:54:14,265 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:54:14,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 00:54:14,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 00:54:14,265 INFO L87 Difference]: Start difference. First operand 323 states and 401 transitions. Second operand 3 states. [2019-10-15 00:54:14,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:54:14,316 INFO L93 Difference]: Finished difference Result 701 states and 881 transitions. [2019-10-15 00:54:14,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 00:54:14,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-10-15 00:54:14,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:54:14,320 INFO L225 Difference]: With dead ends: 701 [2019-10-15 00:54:14,321 INFO L226 Difference]: Without dead ends: 412 [2019-10-15 00:54:14,322 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-15 00:54:14,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2019-10-15 00:54:14,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 399. [2019-10-15 00:54:14,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-10-15 00:54:14,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 501 transitions. [2019-10-15 00:54:14,354 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 501 transitions. Word has length 88 [2019-10-15 00:54:14,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:54:14,355 INFO L462 AbstractCegarLoop]: Abstraction has 399 states and 501 transitions. [2019-10-15 00:54:14,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 00:54:14,355 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 501 transitions. [2019-10-15 00:54:14,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-15 00:54:14,359 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:54:14,360 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-15 00:54:14,360 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:54:14,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:54:14,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1275114055, now seen corresponding path program 1 times [2019-10-15 00:54:14,361 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:54:14,361 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579617764] [2019-10-15 00:54:14,361 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:54:14,361 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:54:14,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:54:14,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:54:14,638 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-15 00:54:14,639 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579617764] [2019-10-15 00:54:14,639 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372893824] [2019-10-15 00:54:14,639 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-15 00:54:14,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:54:14,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 971 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-15 00:54:15,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 00:54:15,139 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-15 00:54:15,140 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 00:54:15,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:54:15,403 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-15 00:54:15,404 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 00:54:15,404 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [6] total 14 [2019-10-15 00:54:15,404 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920151138] [2019-10-15 00:54:15,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 00:54:15,405 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:54:15,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 00:54:15,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-10-15 00:54:15,406 INFO L87 Difference]: Start difference. First operand 399 states and 501 transitions. Second operand 10 states. [2019-10-15 00:54:15,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:54:15,478 INFO L93 Difference]: Finished difference Result 816 states and 1037 transitions. [2019-10-15 00:54:15,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 00:54:15,479 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 107 [2019-10-15 00:54:15,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:54:15,483 INFO L225 Difference]: With dead ends: 816 [2019-10-15 00:54:15,483 INFO L226 Difference]: Without dead ends: 451 [2019-10-15 00:54:15,484 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-10-15 00:54:15,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-10-15 00:54:15,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 429. [2019-10-15 00:54:15,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-10-15 00:54:15,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 535 transitions. [2019-10-15 00:54:15,551 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 535 transitions. Word has length 107 [2019-10-15 00:54:15,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:54:15,551 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 535 transitions. [2019-10-15 00:54:15,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 00:54:15,552 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 535 transitions. [2019-10-15 00:54:15,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-15 00:54:15,554 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:54:15,554 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-15 00:54:15,759 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 00:54:15,760 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:54:15,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:54:15,761 INFO L82 PathProgramCache]: Analyzing trace with hash -4749623, now seen corresponding path program 1 times [2019-10-15 00:54:15,762 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:54:15,762 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432638109] [2019-10-15 00:54:15,762 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:54:15,762 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:54:15,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:54:15,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:54:15,872 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-15 00:54:15,872 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432638109] [2019-10-15 00:54:15,872 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899753165] [2019-10-15 00:54:15,873 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-15 00:54:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:54:16,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 00:54:16,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 00:54:16,197 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-15 00:54:16,198 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 00:54:16,283 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-15 00:54:16,284 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 00:54:16,284 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-15 00:54:16,284 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276602846] [2019-10-15 00:54:16,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 00:54:16,285 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:54:16,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 00:54:16,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 00:54:16,286 INFO L87 Difference]: Start difference. First operand 429 states and 535 transitions. Second operand 3 states. [2019-10-15 00:54:16,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:54:16,313 INFO L93 Difference]: Finished difference Result 799 states and 1014 transitions. [2019-10-15 00:54:16,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 00:54:16,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-10-15 00:54:16,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:54:16,320 INFO L225 Difference]: With dead ends: 799 [2019-10-15 00:54:16,320 INFO L226 Difference]: Without dead ends: 404 [2019-10-15 00:54:16,322 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-15 00:54:16,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2019-10-15 00:54:16,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 392. [2019-10-15 00:54:16,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-10-15 00:54:16,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 488 transitions. [2019-10-15 00:54:16,366 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 488 transitions. Word has length 107 [2019-10-15 00:54:16,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:54:16,367 INFO L462 AbstractCegarLoop]: Abstraction has 392 states and 488 transitions. [2019-10-15 00:54:16,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 00:54:16,367 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 488 transitions. [2019-10-15 00:54:16,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-15 00:54:16,369 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:54:16,370 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-15 00:54:16,582 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 00:54:16,583 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:54:16,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:54:16,583 INFO L82 PathProgramCache]: Analyzing trace with hash 549282891, now seen corresponding path program 1 times [2019-10-15 00:54:16,583 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:54:16,584 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725759094] [2019-10-15 00:54:16,584 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:54:16,584 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:54:16,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:54:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:54:16,826 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-15 00:54:16,827 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725759094] [2019-10-15 00:54:16,827 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:54:16,828 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 00:54:16,828 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985393868] [2019-10-15 00:54:16,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 00:54:16,829 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:54:16,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 00:54:16,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-15 00:54:16,830 INFO L87 Difference]: Start difference. First operand 392 states and 488 transitions. Second operand 7 states. [2019-10-15 00:54:17,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:54:17,505 INFO L93 Difference]: Finished difference Result 637 states and 788 transitions. [2019-10-15 00:54:17,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 00:54:17,506 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2019-10-15 00:54:17,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:54:17,510 INFO L225 Difference]: With dead ends: 637 [2019-10-15 00:54:17,510 INFO L226 Difference]: Without dead ends: 634 [2019-10-15 00:54:17,511 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-15 00:54:17,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2019-10-15 00:54:17,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 599. [2019-10-15 00:54:17,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-15 00:54:17,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 751 transitions. [2019-10-15 00:54:17,541 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 751 transitions. Word has length 113 [2019-10-15 00:54:17,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:54:17,542 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 751 transitions. [2019-10-15 00:54:17,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 00:54:17,542 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 751 transitions. [2019-10-15 00:54:17,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-15 00:54:17,544 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:54:17,544 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-15 00:54:17,544 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:54:17,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:54:17,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1039387099, now seen corresponding path program 1 times [2019-10-15 00:54:17,545 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:54:17,545 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540937330] [2019-10-15 00:54:17,545 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:54:17,545 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:54:17,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:54:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:54:17,644 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-15 00:54:17,645 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540937330] [2019-10-15 00:54:17,645 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:54:17,645 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 00:54:17,645 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247371737] [2019-10-15 00:54:17,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 00:54:17,646 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:54:17,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 00:54:17,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 00:54:17,647 INFO L87 Difference]: Start difference. First operand 599 states and 751 transitions. Second operand 3 states. [2019-10-15 00:54:17,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:54:17,679 INFO L93 Difference]: Finished difference Result 1033 states and 1296 transitions. [2019-10-15 00:54:17,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 00:54:17,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-10-15 00:54:17,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:54:17,684 INFO L225 Difference]: With dead ends: 1033 [2019-10-15 00:54:17,684 INFO L226 Difference]: Without dead ends: 611 [2019-10-15 00:54:17,685 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-15 00:54:17,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-10-15 00:54:17,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 599. [2019-10-15 00:54:17,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-15 00:54:17,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 747 transitions. [2019-10-15 00:54:17,716 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 747 transitions. Word has length 122 [2019-10-15 00:54:17,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:54:17,716 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 747 transitions. [2019-10-15 00:54:17,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 00:54:17,716 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 747 transitions. [2019-10-15 00:54:17,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-15 00:54:17,718 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:54:17,719 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-15 00:54:17,719 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:54:17,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:54:17,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1173400605, now seen corresponding path program 1 times [2019-10-15 00:54:17,719 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:54:17,720 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059962359] [2019-10-15 00:54:17,720 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:54:17,720 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:54:17,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:54:17,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:54:17,943 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-15 00:54:17,944 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059962359] [2019-10-15 00:54:17,944 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355453365] [2019-10-15 00:54:17,944 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-15 00:54:18,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:54:18,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 962 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-15 00:54:18,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 00:54:18,431 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-15 00:54:18,431 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 00:54:18,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:54:18,829 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-15 00:54:18,829 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 00:54:18,829 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [8] total 14 [2019-10-15 00:54:18,830 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911610203] [2019-10-15 00:54:18,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 00:54:18,830 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:54:18,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 00:54:18,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-10-15 00:54:18,831 INFO L87 Difference]: Start difference. First operand 599 states and 747 transitions. Second operand 12 states. [2019-10-15 00:54:18,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:54:18,904 INFO L93 Difference]: Finished difference Result 1025 states and 1278 transitions. [2019-10-15 00:54:18,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 00:54:18,905 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 122 [2019-10-15 00:54:18,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:54:18,910 INFO L225 Difference]: With dead ends: 1025 [2019-10-15 00:54:18,910 INFO L226 Difference]: Without dead ends: 603 [2019-10-15 00:54:18,912 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-15 00:54:18,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-10-15 00:54:18,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 597. [2019-10-15 00:54:18,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-10-15 00:54:18,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 741 transitions. [2019-10-15 00:54:18,946 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 741 transitions. Word has length 122 [2019-10-15 00:54:18,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:54:18,947 INFO L462 AbstractCegarLoop]: Abstraction has 597 states and 741 transitions. [2019-10-15 00:54:18,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 00:54:18,947 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 741 transitions. [2019-10-15 00:54:18,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-15 00:54:18,949 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:54:18,950 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-15 00:54:19,158 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 00:54:19,158 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:54:19,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:54:19,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1755090979, now seen corresponding path program 1 times [2019-10-15 00:54:19,159 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:54:19,159 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975793686] [2019-10-15 00:54:19,159 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:54:19,159 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:54:19,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:54:19,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:54:19,340 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-15 00:54:19,340 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975793686] [2019-10-15 00:54:19,341 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279901508] [2019-10-15 00:54:19,341 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-15 00:54:19,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:54:19,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 1042 conjuncts, 54 conjunts are in the unsatisfiable core [2019-10-15 00:54:19,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 00:54:19,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:54:19,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:54:19,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:54:19,848 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:54:19,850 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:54:19,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:54:19,869 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-15 00:54:19,871 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 00:54:19,899 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:54:19,911 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:54:19,913 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:54:19,915 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:54:19,917 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:54:19,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:54:19,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:54:19,923 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:54:19,924 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-15 00:54:19,924 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 00:54:19,939 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:54:19,940 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-15 00:54:19,940 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:10 [2019-10-15 00:54:19,994 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:54:19,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:54:19,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:54:19,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:54:20,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:54:20,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:54:20,003 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-15 00:54:20,003 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 00:54:20,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:54:20,037 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:54:20,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:54:20,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:54:20,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:54:20,046 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:54:20,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:54:20,051 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:54:20,052 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-15 00:54:20,054 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 00:54:20,069 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:54:20,070 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-15 00:54:20,070 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:10 [2019-10-15 00:54:20,611 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-15 00:54:20,612 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 00:54:21,061 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-15 00:54:21,063 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 00:54:21,063 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8, 5] imperfect sequences [6] total 15 [2019-10-15 00:54:21,063 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798872469] [2019-10-15 00:54:21,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-15 00:54:21,065 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:54:21,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-15 00:54:21,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-10-15 00:54:21,066 INFO L87 Difference]: Start difference. First operand 597 states and 741 transitions. Second operand 11 states. [2019-10-15 00:54:21,859 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-10-15 00:54:22,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:54:22,099 INFO L93 Difference]: Finished difference Result 1313 states and 1664 transitions. [2019-10-15 00:54:22,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 00:54:22,100 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 137 [2019-10-15 00:54:22,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:54:22,104 INFO L225 Difference]: With dead ends: 1313 [2019-10-15 00:54:22,104 INFO L226 Difference]: Without dead ends: 638 [2019-10-15 00:54:22,110 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 266 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2019-10-15 00:54:22,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-10-15 00:54:22,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 620. [2019-10-15 00:54:22,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-10-15 00:54:22,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 767 transitions. [2019-10-15 00:54:22,144 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 767 transitions. Word has length 137 [2019-10-15 00:54:22,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:54:22,145 INFO L462 AbstractCegarLoop]: Abstraction has 620 states and 767 transitions. [2019-10-15 00:54:22,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-15 00:54:22,145 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 767 transitions. [2019-10-15 00:54:22,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-15 00:54:22,148 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:54:22,148 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-15 00:54:22,354 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 00:54:22,354 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:54:22,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:54:22,355 INFO L82 PathProgramCache]: Analyzing trace with hash -827044600, now seen corresponding path program 1 times [2019-10-15 00:54:22,355 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:54:22,355 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156860104] [2019-10-15 00:54:22,355 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:54:22,355 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:54:22,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:54:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:54:22,635 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-15 00:54:22,636 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156860104] [2019-10-15 00:54:22,636 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784409754] [2019-10-15 00:54:22,636 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-15 00:54:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:54:22,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 1047 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-15 00:54:22,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 00:54:23,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:54:23,053 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-15 00:54:23,054 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 00:54:23,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:54:23,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:54:23,448 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-15 00:54:23,448 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 00:54:23,448 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 11 [2019-10-15 00:54:23,449 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374660030] [2019-10-15 00:54:23,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 00:54:23,451 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:54:23,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 00:54:23,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-10-15 00:54:23,452 INFO L87 Difference]: Start difference. First operand 620 states and 767 transitions. Second operand 6 states. [2019-10-15 00:54:23,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:54:23,558 INFO L93 Difference]: Finished difference Result 1217 states and 1506 transitions. [2019-10-15 00:54:23,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 00:54:23,559 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 138 [2019-10-15 00:54:23,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:54:23,563 INFO L225 Difference]: With dead ends: 1217 [2019-10-15 00:54:23,564 INFO L226 Difference]: Without dead ends: 614 [2019-10-15 00:54:23,566 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-15 00:54:23,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-10-15 00:54:23,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 610. [2019-10-15 00:54:23,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-10-15 00:54:23,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 754 transitions. [2019-10-15 00:54:23,602 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 754 transitions. Word has length 138 [2019-10-15 00:54:23,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:54:23,603 INFO L462 AbstractCegarLoop]: Abstraction has 610 states and 754 transitions. [2019-10-15 00:54:23,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 00:54:23,603 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 754 transitions. [2019-10-15 00:54:23,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-15 00:54:23,605 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:54:23,606 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-15 00:54:23,811 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 00:54:23,812 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:54:23,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:54:23,812 INFO L82 PathProgramCache]: Analyzing trace with hash 183446843, now seen corresponding path program 2 times [2019-10-15 00:54:23,813 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:54:23,813 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662259050] [2019-10-15 00:54:23,813 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:54:23,813 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:54:23,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:54:23,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:54:24,148 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-15 00:54:24,148 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662259050] [2019-10-15 00:54:24,148 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598294829] [2019-10-15 00:54:24,149 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-15 00:54:24,509 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-15 00:54:24,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 00:54:24,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 986 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-15 00:54:24,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 00:54:24,598 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-15 00:54:24,598 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 00:54:24,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:54:24,922 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2019-10-15 00:54:24,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:54:24,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:54:24,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:54:33,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:54:33,202 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-15 00:54:33,203 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1117358640] [2019-10-15 00:54:33,210 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-15 00:54:33,212 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-15 00:54:33,212 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 00:54:33,213 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-10-15 00:54:33,213 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045565167] [2019-10-15 00:54:33,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-15 00:54:33,214 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:54:33,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-15 00:54:33,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=118, Unknown=2, NotChecked=0, Total=156 [2019-10-15 00:54:33,215 INFO L87 Difference]: Start difference. First operand 610 states and 754 transitions. Second operand 13 states. [2019-10-15 00:54:35,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:54:35,397 INFO L93 Difference]: Finished difference Result 1204 states and 1492 transitions. [2019-10-15 00:54:35,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 00:54:35,398 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 139 [2019-10-15 00:54:35,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:54:35,402 INFO L225 Difference]: With dead ends: 1204 [2019-10-15 00:54:35,402 INFO L226 Difference]: Without dead ends: 611 [2019-10-15 00:54:35,404 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 269 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=50, Invalid=157, Unknown=3, NotChecked=0, Total=210 [2019-10-15 00:54:35,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-10-15 00:54:35,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-10-15 00:54:35,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-10-15 00:54:35,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 755 transitions. [2019-10-15 00:54:35,448 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 755 transitions. Word has length 139 [2019-10-15 00:54:35,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:54:35,449 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 755 transitions. [2019-10-15 00:54:35,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-15 00:54:35,449 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 755 transitions. [2019-10-15 00:54:35,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-15 00:54:35,453 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:54:35,454 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-15 00:54:35,661 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 00:54:35,661 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:54:35,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:54:35,662 INFO L82 PathProgramCache]: Analyzing trace with hash -644070369, now seen corresponding path program 3 times [2019-10-15 00:54:35,662 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:54:35,662 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869802347] [2019-10-15 00:54:35,663 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:54:35,663 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:54:35,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:54:35,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:54:35,984 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-15 00:54:35,984 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869802347] [2019-10-15 00:54:35,984 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375684042] [2019-10-15 00:54:35,985 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-15 00:54:36,406 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-15 00:54:36,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 00:54:36,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 1065 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-15 00:54:36,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 00:54:36,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:54:36,589 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-15 00:54:36,589 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 00:54:36,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:54:36,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:54:37,143 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-15 00:54:37,144 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1707254922] [2019-10-15 00:54:37,144 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-15 00:54:37,144 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-15 00:54:37,144 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 00:54:37,145 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2019-10-15 00:54:37,145 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523172343] [2019-10-15 00:54:37,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-15 00:54:37,146 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:54:37,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-15 00:54:37,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2019-10-15 00:54:37,147 INFO L87 Difference]: Start difference. First operand 611 states and 755 transitions. Second operand 18 states. [2019-10-15 00:54:37,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:54:37,318 INFO L93 Difference]: Finished difference Result 1206 states and 1494 transitions. [2019-10-15 00:54:37,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 00:54:37,319 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 141 [2019-10-15 00:54:37,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:54:37,322 INFO L225 Difference]: With dead ends: 1206 [2019-10-15 00:54:37,322 INFO L226 Difference]: Without dead ends: 612 [2019-10-15 00:54:37,324 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-15 00:54:37,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-10-15 00:54:37,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2019-10-15 00:54:37,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-10-15 00:54:37,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 756 transitions. [2019-10-15 00:54:37,358 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 756 transitions. Word has length 141 [2019-10-15 00:54:37,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:54:37,359 INFO L462 AbstractCegarLoop]: Abstraction has 612 states and 756 transitions. [2019-10-15 00:54:37,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-15 00:54:37,359 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 756 transitions. [2019-10-15 00:54:37,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-15 00:54:37,361 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:54:37,361 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-15 00:54:37,567 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 00:54:37,568 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:54:37,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:54:37,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1373112069, now seen corresponding path program 4 times [2019-10-15 00:54:37,569 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:54:37,569 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303699920] [2019-10-15 00:54:37,569 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:54:37,569 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:54:37,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:54:37,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:54:37,817 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-15 00:54:37,817 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303699920] [2019-10-15 00:54:37,818 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408033764] [2019-10-15 00:54:37,818 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-15 00:54:38,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:54:38,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 1077 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-15 00:54:38,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 00:54:38,494 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-15 00:54:38,495 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 00:54:38,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:54:38,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:54:38,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:54:38,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:54:41,118 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 36 [2019-10-15 00:54:41,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:54:43,222 WARN L191 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 39 [2019-10-15 00:54:45,400 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 39 [2019-10-15 00:54:45,490 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-15 00:54:45,490 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1263473720] [2019-10-15 00:54:45,491 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-15 00:54:45,491 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-15 00:54:45,491 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 00:54:45,491 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-10-15 00:54:45,491 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982134698] [2019-10-15 00:54:45,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-15 00:54:45,492 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:54:45,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-15 00:54:45,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-10-15 00:54:45,493 INFO L87 Difference]: Start difference. First operand 612 states and 756 transitions. Second operand 17 states.