java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_1_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:01:26,690 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:01:26,692 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:01:26,707 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:01:26,707 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:01:26,708 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:01:26,709 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:01:26,711 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:01:26,713 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:01:26,714 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:01:26,715 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:01:26,715 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:01:26,716 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:01:26,717 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:01:26,718 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:01:26,720 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:01:26,722 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:01:26,724 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:01:26,726 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:01:26,727 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:01:26,729 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:01:26,729 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:01:26,730 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:01:26,731 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:01:26,731 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:01:26,733 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:01:26,733 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:01:26,734 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:01:26,734 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:01:26,734 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:01:26,735 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:01:26,735 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf [2018-01-24 16:01:26,743 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:01:26,744 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:01:26,744 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:01:26,745 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:01:26,745 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:01:26,745 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:01:26,745 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:01:26,745 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:01:26,745 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:01:26,746 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:01:26,746 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:01:26,746 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:01:26,746 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:01:26,746 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:01:26,746 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:01:26,746 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:01:26,746 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:01:26,747 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:01:26,747 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:01:26,747 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:01:26,747 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:01:26,747 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:01:26,747 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:01:26,748 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:01:26,748 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:01:26,748 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:01:26,748 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:01:26,748 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:01:26,748 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 16:01:26,749 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:01:26,749 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:01:26,749 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:01:26,749 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 16:01:26,750 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:01:26,750 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:01:26,783 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:01:26,794 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:01:26,797 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:01:26,798 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:01:26,798 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:01:26,799 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_1_true-valid-memsafety_true-termination.i [2018-01-24 16:01:26,974 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:01:26,979 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:01:26,980 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:01:26,980 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:01:26,985 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:01:26,986 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:01:26" (1/1) ... [2018-01-24 16:01:26,989 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d434187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:01:26, skipping insertion in model container [2018-01-24 16:01:26,989 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:01:26" (1/1) ... [2018-01-24 16:01:27,002 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:01:27,050 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:01:27,176 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:01:27,201 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:01:27,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:01:27 WrapperNode [2018-01-24 16:01:27,214 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:01:27,215 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:01:27,215 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:01:27,215 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:01:27,227 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:01:27" (1/1) ... [2018-01-24 16:01:27,227 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:01:27" (1/1) ... [2018-01-24 16:01:27,237 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:01:27" (1/1) ... [2018-01-24 16:01:27,238 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:01:27" (1/1) ... [2018-01-24 16:01:27,247 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:01:27" (1/1) ... [2018-01-24 16:01:27,251 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:01:27" (1/1) ... [2018-01-24 16:01:27,253 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:01:27" (1/1) ... [2018-01-24 16:01:27,257 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:01:27,257 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:01:27,257 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:01:27,258 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:01:27,259 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:01:27" (1/1) ... No working directory specified, using /storage/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 [2018-01-24 16:01:27,305 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:01:27,305 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:01:27,305 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-01-24 16:01:27,306 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 16:01:27,306 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-01-24 16:01:27,306 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-01-24 16:01:27,306 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-01-24 16:01:27,306 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-01-24 16:01:27,306 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-01-24 16:01:27,306 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-01-24 16:01:27,306 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-01-24 16:01:27,306 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-01-24 16:01:27,306 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-01-24 16:01:27,307 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-01-24 16:01:27,307 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-01-24 16:01:27,307 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 16:01:27,307 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:01:27,307 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 16:01:27,307 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 16:01:27,307 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:01:27,307 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:01:27,308 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:01:27,308 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:01:27,308 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:01:27,308 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-24 16:01:27,308 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-24 16:01:27,308 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 16:01:27,309 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 16:01:27,309 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:01:27,309 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-24 16:01:27,309 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 16:01:27,309 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-01-24 16:01:27,309 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-01-24 16:01:27,310 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-01-24 16:01:27,310 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-01-24 16:01:27,310 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-01-24 16:01:27,310 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-01-24 16:01:27,310 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-01-24 16:01:27,310 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-01-24 16:01:27,311 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-01-24 16:01:27,311 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-01-24 16:01:27,311 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-01-24 16:01:27,311 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-01-24 16:01:27,311 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 16:01:27,311 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:01:27,311 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:01:27,312 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:01:27,556 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-24 16:01:27,698 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:01:27,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:01:27 BoogieIcfgContainer [2018-01-24 16:01:27,699 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:01:27,700 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 16:01:27,700 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 16:01:27,702 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 16:01:27,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 04:01:26" (1/3) ... [2018-01-24 16:01:27,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a1ea8b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:01:27, skipping insertion in model container [2018-01-24 16:01:27,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:01:27" (2/3) ... [2018-01-24 16:01:27,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a1ea8b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:01:27, skipping insertion in model container [2018-01-24 16:01:27,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:01:27" (3/3) ... [2018-01-24 16:01:27,706 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test22_1_true-valid-memsafety_true-termination.i [2018-01-24 16:01:27,715 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 16:01:27,723 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-01-24 16:01:27,773 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 16:01:27,773 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 16:01:27,773 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 16:01:27,774 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 16:01:27,774 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 16:01:27,774 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 16:01:27,774 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 16:01:27,774 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 16:01:27,775 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 16:01:27,798 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states. [2018-01-24 16:01:27,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 16:01:27,805 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:27,806 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:01:27,806 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 16:01:27,811 INFO L82 PathProgramCache]: Analyzing trace with hash -401333144, now seen corresponding path program 1 times [2018-01-24 16:01:27,814 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:27,867 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:27,867 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:27,868 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:27,868 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:27,929 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:28,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:01:28,056 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:01:28,056 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:01:28,056 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:01:28,126 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:01:28,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:01:28,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:01:28,139 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 5 states. [2018-01-24 16:01:28,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:28,207 INFO L93 Difference]: Finished difference Result 224 states and 237 transitions. [2018-01-24 16:01:28,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:01:28,209 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-24 16:01:28,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:28,224 INFO L225 Difference]: With dead ends: 224 [2018-01-24 16:01:28,224 INFO L226 Difference]: Without dead ends: 121 [2018-01-24 16:01:28,228 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:01:28,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-24 16:01:28,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-01-24 16:01:28,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-24 16:01:28,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 126 transitions. [2018-01-24 16:01:28,263 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 126 transitions. Word has length 17 [2018-01-24 16:01:28,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:28,264 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 126 transitions. [2018-01-24 16:01:28,264 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:01:28,264 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2018-01-24 16:01:28,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 16:01:28,265 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:28,265 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:01:28,265 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 16:01:28,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1306365930, now seen corresponding path program 1 times [2018-01-24 16:01:28,265 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:28,266 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:28,266 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:28,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:28,267 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:28,288 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:28,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:01:28,357 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:01:28,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:01:28,358 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:01:28,360 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:01:28,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:01:28,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:01:28,360 INFO L87 Difference]: Start difference. First operand 119 states and 126 transitions. Second operand 6 states. [2018-01-24 16:01:28,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:28,542 INFO L93 Difference]: Finished difference Result 121 states and 128 transitions. [2018-01-24 16:01:28,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:01:28,542 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 16:01:28,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:28,543 INFO L225 Difference]: With dead ends: 121 [2018-01-24 16:01:28,544 INFO L226 Difference]: Without dead ends: 120 [2018-01-24 16:01:28,544 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:01:28,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-24 16:01:28,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-01-24 16:01:28,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-24 16:01:28,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2018-01-24 16:01:28,554 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 19 [2018-01-24 16:01:28,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:28,555 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2018-01-24 16:01:28,555 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:01:28,555 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2018-01-24 16:01:28,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 16:01:28,555 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:28,555 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:01:28,555 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 16:01:28,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1306365931, now seen corresponding path program 1 times [2018-01-24 16:01:28,556 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:28,557 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:28,557 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:28,557 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:28,557 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:28,578 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:28,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:01:28,810 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:01:28,811 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 16:01:28,811 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:01:28,811 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 16:01:28,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 16:01:28,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:01:28,811 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand 7 states. [2018-01-24 16:01:29,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:29,014 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2018-01-24 16:01:29,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 16:01:29,014 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-01-24 16:01:29,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:29,016 INFO L225 Difference]: With dead ends: 120 [2018-01-24 16:01:29,016 INFO L226 Difference]: Without dead ends: 119 [2018-01-24 16:01:29,016 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:01:29,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-24 16:01:29,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-01-24 16:01:29,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-24 16:01:29,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 124 transitions. [2018-01-24 16:01:29,025 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 124 transitions. Word has length 19 [2018-01-24 16:01:29,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:29,025 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 124 transitions. [2018-01-24 16:01:29,025 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 16:01:29,025 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2018-01-24 16:01:29,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 16:01:29,026 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:29,026 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:01:29,026 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 16:01:29,027 INFO L82 PathProgramCache]: Analyzing trace with hash -860603530, now seen corresponding path program 1 times [2018-01-24 16:01:29,027 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:29,028 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:29,028 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:29,028 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:29,028 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:29,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:29,052 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:29,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:01:29,127 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:01:29,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 16:01:29,127 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:01:29,128 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 16:01:29,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 16:01:29,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:01:29,129 INFO L87 Difference]: Start difference. First operand 117 states and 124 transitions. Second operand 7 states. [2018-01-24 16:01:29,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:29,193 INFO L93 Difference]: Finished difference Result 183 states and 192 transitions. [2018-01-24 16:01:29,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:01:29,194 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-01-24 16:01:29,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:29,196 INFO L225 Difference]: With dead ends: 183 [2018-01-24 16:01:29,196 INFO L226 Difference]: Without dead ends: 129 [2018-01-24 16:01:29,197 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:01:29,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-01-24 16:01:29,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2018-01-24 16:01:29,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-24 16:01:29,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2018-01-24 16:01:29,208 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 29 [2018-01-24 16:01:29,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:29,208 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2018-01-24 16:01:29,208 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 16:01:29,208 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2018-01-24 16:01:29,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 16:01:29,209 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:29,209 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:01:29,209 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 16:01:29,209 INFO L82 PathProgramCache]: Analyzing trace with hash 23284980, now seen corresponding path program 1 times [2018-01-24 16:01:29,210 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:29,211 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:29,211 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:29,211 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:29,211 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:29,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:29,224 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:29,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:01:29,272 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:01:29,272 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 16:01:29,273 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:01:29,273 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 16:01:29,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 16:01:29,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 16:01:29,274 INFO L87 Difference]: Start difference. First operand 125 states and 132 transitions. Second operand 3 states. [2018-01-24 16:01:29,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:29,408 INFO L93 Difference]: Finished difference Result 141 states and 148 transitions. [2018-01-24 16:01:29,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 16:01:29,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-01-24 16:01:29,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:29,410 INFO L225 Difference]: With dead ends: 141 [2018-01-24 16:01:29,411 INFO L226 Difference]: Without dead ends: 129 [2018-01-24 16:01:29,411 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 16:01:29,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-01-24 16:01:29,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 121. [2018-01-24 16:01:29,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-01-24 16:01:29,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 127 transitions. [2018-01-24 16:01:29,428 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 127 transitions. Word has length 27 [2018-01-24 16:01:29,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:29,428 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 127 transitions. [2018-01-24 16:01:29,429 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 16:01:29,429 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 127 transitions. [2018-01-24 16:01:29,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 16:01:29,429 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:29,430 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:01:29,430 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 16:01:29,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1295663626, now seen corresponding path program 1 times [2018-01-24 16:01:29,430 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:29,431 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:29,431 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:29,431 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:29,431 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:29,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:29,441 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:29,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:01:29,484 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:01:29,484 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 16:01:29,484 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:01:29,484 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:01:29,484 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:01:29,485 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:01:29,485 INFO L87 Difference]: Start difference. First operand 121 states and 127 transitions. Second operand 6 states. [2018-01-24 16:01:29,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:29,505 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2018-01-24 16:01:29,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:01:29,510 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-01-24 16:01:29,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:29,512 INFO L225 Difference]: With dead ends: 125 [2018-01-24 16:01:29,512 INFO L226 Difference]: Without dead ends: 113 [2018-01-24 16:01:29,513 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:01:29,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-24 16:01:29,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-01-24 16:01:29,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-24 16:01:29,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 118 transitions. [2018-01-24 16:01:29,523 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 118 transitions. Word has length 29 [2018-01-24 16:01:29,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:29,523 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 118 transitions. [2018-01-24 16:01:29,523 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:01:29,523 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2018-01-24 16:01:29,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 16:01:29,524 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:29,524 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:01:29,524 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 16:01:29,525 INFO L82 PathProgramCache]: Analyzing trace with hash 522747174, now seen corresponding path program 1 times [2018-01-24 16:01:29,525 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:29,526 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:29,526 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:29,526 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:29,526 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:29,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:29,542 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:29,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:01:29,572 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:01:29,573 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:01:29,573 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:01:29,573 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:01:29,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:01:29,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:01:29,573 INFO L87 Difference]: Start difference. First operand 113 states and 118 transitions. Second operand 4 states. [2018-01-24 16:01:29,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:29,592 INFO L93 Difference]: Finished difference Result 205 states and 215 transitions. [2018-01-24 16:01:29,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:01:29,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-01-24 16:01:29,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:29,593 INFO L225 Difference]: With dead ends: 205 [2018-01-24 16:01:29,593 INFO L226 Difference]: Without dead ends: 114 [2018-01-24 16:01:29,594 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:01:29,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-24 16:01:29,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-01-24 16:01:29,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-24 16:01:29,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2018-01-24 16:01:29,604 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 34 [2018-01-24 16:01:29,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:29,604 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2018-01-24 16:01:29,604 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:01:29,604 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2018-01-24 16:01:29,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-24 16:01:29,605 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:29,605 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:01:29,605 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 16:01:29,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1305776369, now seen corresponding path program 1 times [2018-01-24 16:01:29,606 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:29,606 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:29,607 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:29,607 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:29,607 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:29,622 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:29,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:01:29,660 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:01:29,660 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:01:29,661 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-01-24 16:01:29,662 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [27], [32], [48], [53], [57], [61], [64], [66], [67], [71], [73], [74], [114], [117], [118], [119], [121], [122], [123], [131], [132], [133], [134], [135], [137], [141], [145], [149], [161], [162], [163] [2018-01-24 16:01:29,723 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:01:29,723 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:01:32,872 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:01:32,873 INFO L268 AbstractInterpreter]: Visited 35 different actions 43 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 21 variables. [2018-01-24 16:01:32,934 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:01:32,935 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:01:32,935 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:01:32,946 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:32,946 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:01:32,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:32,993 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:01:33,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:01:33,016 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:01:33,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:01:33,107 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:01:33,107 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:01:33,113 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:33,113 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:01:33,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:33,179 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:01:33,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:01:33,185 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:01:33,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:01:33,252 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:01:33,253 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5] total 9 [2018-01-24 16:01:33,253 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:01:33,253 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:01:33,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:01:33,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:01:33,254 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 6 states. [2018-01-24 16:01:33,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:33,295 INFO L93 Difference]: Finished difference Result 206 states and 216 transitions. [2018-01-24 16:01:33,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:01:33,296 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-24 16:01:33,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:33,297 INFO L225 Difference]: With dead ends: 206 [2018-01-24 16:01:33,297 INFO L226 Difference]: Without dead ends: 115 [2018-01-24 16:01:33,298 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 134 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-01-24 16:01:33,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-24 16:01:33,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-01-24 16:01:33,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-24 16:01:33,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 120 transitions. [2018-01-24 16:01:33,308 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 120 transitions. Word has length 35 [2018-01-24 16:01:33,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:33,308 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 120 transitions. [2018-01-24 16:01:33,309 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:01:33,309 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 120 transitions. [2018-01-24 16:01:33,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 16:01:33,310 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:33,310 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:01:33,311 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 16:01:33,311 INFO L82 PathProgramCache]: Analyzing trace with hash 2139535942, now seen corresponding path program 2 times [2018-01-24 16:01:33,311 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:33,313 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:33,313 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:33,313 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:33,313 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:33,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:33,333 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:33,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:01:33,414 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:01:33,414 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:01:33,414 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 16:01:33,415 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 16:01:33,415 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:01:33,415 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:01:33,427 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:01:33,427 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:01:33,457 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:01:33,460 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:01:33,465 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:01:33,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-24 16:01:33,495 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:01:33,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-24 16:01:33,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:01:33,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 16:01:33,526 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-24 16:01:34,282 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 16:01:34,283 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:01:34,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 16:01:34,919 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 16:01:34,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14, 13] imperfect sequences [6] total 31 [2018-01-24 16:01:34,920 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:01:34,920 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 16:01:34,920 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 16:01:34,920 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=840, Unknown=0, NotChecked=0, Total=930 [2018-01-24 16:01:34,921 INFO L87 Difference]: Start difference. First operand 115 states and 120 transitions. Second operand 15 states. [2018-01-24 16:01:37,018 WARN L143 SmtUtils]: Spent 2046ms on a formula simplification that was a NOOP. DAG size: 39 [2018-01-24 16:01:37,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:37,756 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2018-01-24 16:01:37,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 16:01:37,756 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2018-01-24 16:01:37,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:37,757 INFO L225 Difference]: With dead ends: 115 [2018-01-24 16:01:37,757 INFO L226 Difference]: Without dead ends: 114 [2018-01-24 16:01:37,758 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=118, Invalid=1072, Unknown=0, NotChecked=0, Total=1190 [2018-01-24 16:01:37,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-24 16:01:37,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-01-24 16:01:37,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-24 16:01:37,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2018-01-24 16:01:37,773 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 36 [2018-01-24 16:01:37,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:37,774 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2018-01-24 16:01:37,774 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 16:01:37,774 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2018-01-24 16:01:37,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 16:01:37,775 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:37,775 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:01:37,775 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 16:01:37,775 INFO L82 PathProgramCache]: Analyzing trace with hash 2139535941, now seen corresponding path program 1 times [2018-01-24 16:01:37,776 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:37,777 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:37,777 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 16:01:37,777 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:37,777 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:37,792 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:38,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 16:01:38,031 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:01:38,031 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 16:01:38,031 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:01:38,031 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 16:01:38,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 16:01:38,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 16:01:38,032 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 10 states. [2018-01-24 16:01:38,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:38,434 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2018-01-24 16:01:38,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 16:01:38,435 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-01-24 16:01:38,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:38,436 INFO L225 Difference]: With dead ends: 114 [2018-01-24 16:01:38,436 INFO L226 Difference]: Without dead ends: 113 [2018-01-24 16:01:38,437 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-01-24 16:01:38,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-24 16:01:38,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-01-24 16:01:38,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-24 16:01:38,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 118 transitions. [2018-01-24 16:01:38,451 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 118 transitions. Word has length 36 [2018-01-24 16:01:38,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:38,452 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 118 transitions. [2018-01-24 16:01:38,452 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 16:01:38,452 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2018-01-24 16:01:38,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 16:01:38,453 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:38,453 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:01:38,454 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 16:01:38,454 INFO L82 PathProgramCache]: Analyzing trace with hash 562133952, now seen corresponding path program 1 times [2018-01-24 16:01:38,454 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:38,455 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:38,455 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:38,455 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:38,456 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:38,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:38,471 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:38,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 16:01:38,571 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:01:38,571 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 16:01:38,571 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:01:38,572 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 16:01:38,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 16:01:38,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 16:01:38,572 INFO L87 Difference]: Start difference. First operand 113 states and 118 transitions. Second operand 10 states. [2018-01-24 16:01:38,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:38,837 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2018-01-24 16:01:38,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 16:01:38,837 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2018-01-24 16:01:38,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:38,838 INFO L225 Difference]: With dead ends: 113 [2018-01-24 16:01:38,838 INFO L226 Difference]: Without dead ends: 111 [2018-01-24 16:01:38,839 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-01-24 16:01:38,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-24 16:01:38,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-01-24 16:01:38,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-24 16:01:38,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 116 transitions. [2018-01-24 16:01:38,852 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 116 transitions. Word has length 41 [2018-01-24 16:01:38,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:38,852 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 116 transitions. [2018-01-24 16:01:38,853 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 16:01:38,853 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 116 transitions. [2018-01-24 16:01:38,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 16:01:38,854 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:38,854 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:01:38,854 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 16:01:38,854 INFO L82 PathProgramCache]: Analyzing trace with hash 562133953, now seen corresponding path program 1 times [2018-01-24 16:01:38,854 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:38,856 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:38,856 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:38,856 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:38,856 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:38,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:38,874 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:38,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:01:38,941 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:01:38,941 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:01:38,941 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-01-24 16:01:38,941 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [27], [32], [48], [53], [57], [61], [62], [65], [66], [67], [71], [73], [74], [106], [109], [114], [117], [118], [119], [121], [122], [123], [131], [132], [133], [134], [135], [137], [141], [145], [149], [150], [151], [161], [162], [163] [2018-01-24 16:01:38,947 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:01:38,947 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:01:42,012 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:01:42,012 INFO L268 AbstractInterpreter]: Visited 40 different actions 48 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 21 variables. [2018-01-24 16:01:42,019 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:01:42,019 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:01:42,019 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:01:42,049 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:42,050 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:01:42,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:42,087 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:01:42,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:01:42,157 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:01:42,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:01:42,246 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:01:42,246 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:01:42,249 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:42,249 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:01:42,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:42,301 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:01:42,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:01:42,306 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:01:42,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:01:42,331 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:01:42,331 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6] total 11 [2018-01-24 16:01:42,331 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:01:42,332 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 16:01:42,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 16:01:42,332 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-01-24 16:01:42,332 INFO L87 Difference]: Start difference. First operand 111 states and 116 transitions. Second operand 7 states. [2018-01-24 16:01:42,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:42,359 INFO L93 Difference]: Finished difference Result 199 states and 209 transitions. [2018-01-24 16:01:42,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:01:42,359 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-01-24 16:01:42,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:42,360 INFO L225 Difference]: With dead ends: 199 [2018-01-24 16:01:42,361 INFO L226 Difference]: Without dead ends: 112 [2018-01-24 16:01:42,361 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2018-01-24 16:01:42,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-24 16:01:42,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-01-24 16:01:42,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-24 16:01:42,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2018-01-24 16:01:42,375 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 41 [2018-01-24 16:01:42,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:42,375 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2018-01-24 16:01:42,376 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 16:01:42,376 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2018-01-24 16:01:42,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-24 16:01:42,376 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:42,377 INFO L322 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:01:42,377 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 16:01:42,377 INFO L82 PathProgramCache]: Analyzing trace with hash 258949560, now seen corresponding path program 2 times [2018-01-24 16:01:42,377 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:42,378 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:42,378 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:42,379 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:42,379 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:42,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:42,396 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:42,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:01:42,449 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:01:42,449 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:01:42,449 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 16:01:42,449 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 16:01:42,450 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:01:42,450 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:01:42,460 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:01:42,460 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:01:42,488 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:01:42,492 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:01:42,497 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:01:42,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-24 16:01:42,503 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:01:42,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-24 16:01:42,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:01:42,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 16:01:42,535 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-24 16:01:43,066 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 16:01:43,066 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:01:46,370 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 16:01:46,390 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 16:01:46,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15, 13] imperfect sequences [7] total 33 [2018-01-24 16:01:46,391 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:01:46,391 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 16:01:46,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 16:01:46,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=950, Unknown=1, NotChecked=0, Total=1056 [2018-01-24 16:01:46,392 INFO L87 Difference]: Start difference. First operand 112 states and 117 transitions. Second operand 16 states. [2018-01-24 16:01:47,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:47,067 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2018-01-24 16:01:47,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 16:01:47,067 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2018-01-24 16:01:47,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:47,068 INFO L225 Difference]: With dead ends: 112 [2018-01-24 16:01:47,068 INFO L226 Difference]: Without dead ends: 110 [2018-01-24 16:01:47,069 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=136, Invalid=1195, Unknown=1, NotChecked=0, Total=1332 [2018-01-24 16:01:47,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-01-24 16:01:47,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-01-24 16:01:47,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-01-24 16:01:47,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 115 transitions. [2018-01-24 16:01:47,083 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 115 transitions. Word has length 42 [2018-01-24 16:01:47,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:47,083 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 115 transitions. [2018-01-24 16:01:47,083 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 16:01:47,083 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 115 transitions. [2018-01-24 16:01:47,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-24 16:01:47,084 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:47,084 INFO L322 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:01:47,085 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 16:01:47,085 INFO L82 PathProgramCache]: Analyzing trace with hash -916811563, now seen corresponding path program 1 times [2018-01-24 16:01:47,085 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:47,086 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:47,086 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 16:01:47,086 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:47,087 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:47,101 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:47,184 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 16:01:47,184 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:01:47,184 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 16:01:47,184 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:01:47,185 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 16:01:47,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 16:01:47,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:01:47,185 INFO L87 Difference]: Start difference. First operand 110 states and 115 transitions. Second operand 8 states. [2018-01-24 16:01:47,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:47,236 INFO L93 Difference]: Finished difference Result 173 states and 180 transitions. [2018-01-24 16:01:47,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:01:47,236 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-01-24 16:01:47,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:47,237 INFO L225 Difference]: With dead ends: 173 [2018-01-24 16:01:47,237 INFO L226 Difference]: Without dead ends: 110 [2018-01-24 16:01:47,238 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-24 16:01:47,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-01-24 16:01:47,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-01-24 16:01:47,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-01-24 16:01:47,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2018-01-24 16:01:47,248 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 47 [2018-01-24 16:01:47,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:47,249 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2018-01-24 16:01:47,249 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 16:01:47,249 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2018-01-24 16:01:47,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-24 16:01:47,249 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:47,249 INFO L322 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:01:47,249 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 16:01:47,250 INFO L82 PathProgramCache]: Analyzing trace with hash -396278647, now seen corresponding path program 1 times [2018-01-24 16:01:47,250 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:47,251 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:47,251 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:47,251 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:47,251 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:47,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:47,261 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:47,377 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 16:01:47,377 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:01:47,377 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 16:01:47,377 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:01:47,378 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 16:01:47,378 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 16:01:47,378 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 16:01:47,378 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand 10 states. [2018-01-24 16:01:47,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:47,482 INFO L93 Difference]: Finished difference Result 175 states and 181 transitions. [2018-01-24 16:01:47,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 16:01:47,484 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2018-01-24 16:01:47,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:47,485 INFO L225 Difference]: With dead ends: 175 [2018-01-24 16:01:47,485 INFO L226 Difference]: Without dead ends: 110 [2018-01-24 16:01:47,485 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-01-24 16:01:47,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-01-24 16:01:47,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-01-24 16:01:47,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-01-24 16:01:47,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 113 transitions. [2018-01-24 16:01:47,498 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 113 transitions. Word has length 52 [2018-01-24 16:01:47,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:47,498 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 113 transitions. [2018-01-24 16:01:47,498 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 16:01:47,498 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2018-01-24 16:01:47,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-24 16:01:47,499 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:47,499 INFO L322 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:01:47,499 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 16:01:47,499 INFO L82 PathProgramCache]: Analyzing trace with hash 401221152, now seen corresponding path program 1 times [2018-01-24 16:01:47,499 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:47,500 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:47,500 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:47,501 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:47,501 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:47,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:47,519 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:47,733 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 16:01:47,734 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:01:47,734 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-01-24 16:01:47,734 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:01:47,734 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 16:01:47,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 16:01:47,734 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-01-24 16:01:47,735 INFO L87 Difference]: Start difference. First operand 110 states and 113 transitions. Second operand 21 states. [2018-01-24 16:01:48,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:48,183 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2018-01-24 16:01:48,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-24 16:01:48,218 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 63 [2018-01-24 16:01:48,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:48,219 INFO L225 Difference]: With dead ends: 119 [2018-01-24 16:01:48,219 INFO L226 Difference]: Without dead ends: 117 [2018-01-24 16:01:48,220 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2018-01-24 16:01:48,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-24 16:01:48,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2018-01-24 16:01:48,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-24 16:01:48,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 111 transitions. [2018-01-24 16:01:48,236 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 111 transitions. Word has length 63 [2018-01-24 16:01:48,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:48,236 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 111 transitions. [2018-01-24 16:01:48,237 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-24 16:01:48,237 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 111 transitions. [2018-01-24 16:01:48,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-24 16:01:48,238 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:48,238 INFO L322 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:01:48,238 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 16:01:48,238 INFO L82 PathProgramCache]: Analyzing trace with hash 401221153, now seen corresponding path program 1 times [2018-01-24 16:01:48,238 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:48,239 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:48,240 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:48,240 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:48,240 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:48,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:48,263 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:48,334 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:01:48,335 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:01:48,335 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:01:48,335 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 64 with the following transitions: [2018-01-24 16:01:48,335 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [12], [13], [17], [20], [27], [32], [34], [35], [38], [48], [50], [53], [57], [60], [61], [62], [65], [66], [67], [71], [73], [74], [75], [106], [107], [110], [113], [114], [117], [118], [119], [121], [122], [123], [124], [131], [132], [133], [134], [135], [136], [137], [139], [141], [142], [145], [146], [147], [149], [150], [151], [152], [153], [159], [161], [162], [163] [2018-01-24 16:01:48,338 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:01:48,339 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:01:52,076 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:01:52,076 INFO L268 AbstractInterpreter]: Visited 61 different actions 69 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 26 variables. [2018-01-24 16:01:52,088 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:01:52,088 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:01:52,088 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:01:52,095 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:52,096 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:01:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:52,128 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:01:52,149 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:01:52,150 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:01:52,253 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:01:52,272 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:01:52,272 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:01:52,276 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:52,276 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:01:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:52,342 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:01:52,348 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:01:52,348 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:01:52,403 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:01:52,404 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:01:52,404 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 13 [2018-01-24 16:01:52,404 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:01:52,405 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 16:01:52,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 16:01:52,405 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-01-24 16:01:52,405 INFO L87 Difference]: Start difference. First operand 108 states and 111 transitions. Second operand 8 states. [2018-01-24 16:01:52,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:52,431 INFO L93 Difference]: Finished difference Result 192 states and 198 transitions. [2018-01-24 16:01:52,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 16:01:52,431 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2018-01-24 16:01:52,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:52,432 INFO L225 Difference]: With dead ends: 192 [2018-01-24 16:01:52,432 INFO L226 Difference]: Without dead ends: 109 [2018-01-24 16:01:52,433 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 244 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=77, Invalid=105, Unknown=0, NotChecked=0, Total=182 [2018-01-24 16:01:52,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-24 16:01:52,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-01-24 16:01:52,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-24 16:01:52,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 112 transitions. [2018-01-24 16:01:52,450 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 112 transitions. Word has length 63 [2018-01-24 16:01:52,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:52,450 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 112 transitions. [2018-01-24 16:01:52,451 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 16:01:52,451 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 112 transitions. [2018-01-24 16:01:52,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-24 16:01:52,451 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:52,452 INFO L322 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:01:52,452 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 16:01:52,452 INFO L82 PathProgramCache]: Analyzing trace with hash -421459752, now seen corresponding path program 2 times [2018-01-24 16:01:52,452 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:52,453 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:52,453 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:52,453 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:52,453 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:52,473 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:52,529 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:01:52,529 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:01:52,529 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:01:52,529 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 16:01:52,529 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 16:01:52,529 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:01:52,530 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:01:52,539 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:01:52,539 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:01:52,580 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:01:52,586 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:01:52,591 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:01:52,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-24 16:01:52,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:01:52,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-24 16:01:52,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:01:52,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 16:01:52,623 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-24 16:01:53,337 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 16:01:53,337 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:01:54,228 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 16:01:54,248 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 16:01:54,249 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20, 18] imperfect sequences [8] total 44 [2018-01-24 16:01:54,249 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:01:54,249 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 16:01:54,249 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 16:01:54,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1746, Unknown=0, NotChecked=0, Total=1892 [2018-01-24 16:01:54,250 INFO L87 Difference]: Start difference. First operand 109 states and 112 transitions. Second operand 21 states. [2018-01-24 16:01:55,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:55,331 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2018-01-24 16:01:55,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-24 16:01:55,331 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-01-24 16:01:55,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:55,332 INFO L225 Difference]: With dead ends: 109 [2018-01-24 16:01:55,332 INFO L226 Difference]: Without dead ends: 107 [2018-01-24 16:01:55,333 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=195, Invalid=2255, Unknown=0, NotChecked=0, Total=2450 [2018-01-24 16:01:55,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-24 16:01:55,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-01-24 16:01:55,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-24 16:01:55,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 110 transitions. [2018-01-24 16:01:55,349 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 110 transitions. Word has length 64 [2018-01-24 16:01:55,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:55,349 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 110 transitions. [2018-01-24 16:01:55,349 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-24 16:01:55,349 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2018-01-24 16:01:55,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-24 16:01:55,350 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:55,350 INFO L322 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:01:55,350 INFO L371 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 16:01:55,350 INFO L82 PathProgramCache]: Analyzing trace with hash -713687403, now seen corresponding path program 1 times [2018-01-24 16:01:55,350 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:55,351 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:55,351 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 16:01:55,351 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:55,351 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:55,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:55,364 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:55,431 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 16:01:55,431 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:01:55,431 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-24 16:01:55,431 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:01:55,432 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 16:01:55,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 16:01:55,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-01-24 16:01:55,432 INFO L87 Difference]: Start difference. First operand 107 states and 110 transitions. Second operand 11 states. [2018-01-24 16:01:55,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:55,487 INFO L93 Difference]: Finished difference Result 113 states and 115 transitions. [2018-01-24 16:01:55,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 16:01:55,487 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2018-01-24 16:01:55,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:55,488 INFO L225 Difference]: With dead ends: 113 [2018-01-24 16:01:55,488 INFO L226 Difference]: Without dead ends: 107 [2018-01-24 16:01:55,488 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-01-24 16:01:55,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-24 16:01:55,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-01-24 16:01:55,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-24 16:01:55,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 109 transitions. [2018-01-24 16:01:55,499 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 109 transitions. Word has length 62 [2018-01-24 16:01:55,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:55,499 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 109 transitions. [2018-01-24 16:01:55,499 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 16:01:55,499 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions. [2018-01-24 16:01:55,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-01-24 16:01:55,500 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:55,500 INFO L322 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:01:55,500 INFO L371 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 16:01:55,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1331716926, now seen corresponding path program 1 times [2018-01-24 16:01:55,500 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:55,501 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:55,501 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:55,501 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:55,501 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:55,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:55,517 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:55,853 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 16:01:55,853 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:01:55,853 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-01-24 16:01:55,853 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:01:55,853 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-24 16:01:55,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-24 16:01:55,854 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-01-24 16:01:55,854 INFO L87 Difference]: Start difference. First operand 107 states and 109 transitions. Second operand 24 states. [2018-01-24 16:01:56,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:56,401 INFO L93 Difference]: Finished difference Result 112 states and 114 transitions. [2018-01-24 16:01:56,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-24 16:01:56,402 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 78 [2018-01-24 16:01:56,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:56,402 INFO L225 Difference]: With dead ends: 112 [2018-01-24 16:01:56,402 INFO L226 Difference]: Without dead ends: 110 [2018-01-24 16:01:56,403 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2018-01-24 16:01:56,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-01-24 16:01:56,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 105. [2018-01-24 16:01:56,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-24 16:01:56,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2018-01-24 16:01:56,413 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 78 [2018-01-24 16:01:56,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:56,414 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2018-01-24 16:01:56,414 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-24 16:01:56,414 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2018-01-24 16:01:56,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-01-24 16:01:56,414 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:56,414 INFO L322 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:01:56,414 INFO L371 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 16:01:56,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1331716925, now seen corresponding path program 1 times [2018-01-24 16:01:56,415 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:56,415 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:56,415 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:56,415 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:56,416 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:56,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:56,435 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:56,543 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:01:56,544 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:01:56,544 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:01:56,544 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 79 with the following transitions: [2018-01-24 16:01:56,544 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [12], [13], [17], [20], [27], [32], [34], [35], [36], [39], [40], [43], [44], [45], [48], [50], [53], [57], [60], [61], [62], [65], [66], [67], [71], [73], [74], [75], [77], [80], [85], [88], [91], [106], [107], [110], [113], [114], [117], [118], [119], [121], [122], [123], [124], [131], [132], [133], [134], [135], [136], [137], [139], [141], [142], [143], [145], [146], [147], [149], [150], [151], [152], [153], [154], [155], [157], [159], [161], [162], [163] [2018-01-24 16:01:56,548 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:01:56,548 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:02:00,046 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:02:00,046 INFO L268 AbstractInterpreter]: Visited 75 different actions 83 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 27 variables. [2018-01-24 16:02:00,052 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:02:00,052 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:02:00,052 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:02:00,063 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:02:00,063 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:02:00,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:00,122 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:02:00,194 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:02:00,194 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:02:00,416 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:02:00,438 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:02:00,438 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:02:00,443 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:02:00,443 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:02:00,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:00,537 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:02:00,542 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:02:00,542 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:02:00,630 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:02:00,632 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:02:00,632 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8] total 15 [2018-01-24 16:02:00,632 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:02:00,633 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 16:02:00,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 16:02:00,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-01-24 16:02:00,633 INFO L87 Difference]: Start difference. First operand 105 states and 107 transitions. Second operand 9 states. [2018-01-24 16:02:00,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:02:00,690 INFO L93 Difference]: Finished difference Result 185 states and 189 transitions. [2018-01-24 16:02:00,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:02:00,690 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2018-01-24 16:02:00,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:02:00,691 INFO L225 Difference]: With dead ends: 185 [2018-01-24 16:02:00,692 INFO L226 Difference]: Without dead ends: 106 [2018-01-24 16:02:00,692 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 303 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=137, Unknown=0, NotChecked=0, Total=240 [2018-01-24 16:02:00,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-24 16:02:00,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-01-24 16:02:00,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-24 16:02:00,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2018-01-24 16:02:00,711 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 108 transitions. Word has length 78 [2018-01-24 16:02:00,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:02:00,712 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 108 transitions. [2018-01-24 16:02:00,712 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 16:02:00,712 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 108 transitions. [2018-01-24 16:02:00,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-24 16:02:00,713 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:02:00,713 INFO L322 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:02:00,713 INFO L371 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 16:02:00,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1544426796, now seen corresponding path program 2 times [2018-01-24 16:02:00,714 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:02:00,715 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:00,715 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:02:00,715 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:00,715 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:02:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:00,736 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:02:00,841 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:02:00,842 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:02:00,842 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:02:00,842 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 16:02:00,842 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 16:02:00,842 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:02:00,842 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:02:00,853 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:02:00,854 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:02:00,899 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:02:00,904 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:02:00,909 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:02:00,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-24 16:02:00,915 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:02:00,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-24 16:02:00,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:02:00,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 16:02:00,962 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-24 16:02:02,015 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-24 16:02:02,015 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:02:06,847 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-24 16:02:06,867 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 16:02:06,868 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24, 22] imperfect sequences [9] total 53 [2018-01-24 16:02:06,868 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:02:06,868 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-24 16:02:06,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-24 16:02:06,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=2573, Unknown=2, NotChecked=0, Total=2756 [2018-01-24 16:02:06,869 INFO L87 Difference]: Start difference. First operand 106 states and 108 transitions. Second operand 25 states. [2018-01-24 16:02:08,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:02:08,406 INFO L93 Difference]: Finished difference Result 106 states and 108 transitions. [2018-01-24 16:02:08,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-24 16:02:08,407 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 79 [2018-01-24 16:02:08,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:02:08,407 INFO L225 Difference]: With dead ends: 106 [2018-01-24 16:02:08,407 INFO L226 Difference]: Without dead ends: 104 [2018-01-24 16:02:08,408 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 111 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 981 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=246, Invalid=3412, Unknown=2, NotChecked=0, Total=3660 [2018-01-24 16:02:08,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-24 16:02:08,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-01-24 16:02:08,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-24 16:02:08,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2018-01-24 16:02:08,426 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 106 transitions. Word has length 79 [2018-01-24 16:02:08,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:02:08,426 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 106 transitions. [2018-01-24 16:02:08,427 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-24 16:02:08,427 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2018-01-24 16:02:08,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-01-24 16:02:08,428 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:02:08,428 INFO L322 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:02:08,428 INFO L371 AbstractCegarLoop]: === Iteration 23 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 16:02:08,428 INFO L82 PathProgramCache]: Analyzing trace with hash -814306387, now seen corresponding path program 1 times [2018-01-24 16:02:08,428 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:02:08,429 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:08,429 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 16:02:08,430 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:08,430 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:02:08,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:08,453 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:02:08,538 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:02:08,538 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:02:08,539 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:02:08,539 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 84 with the following transitions: [2018-01-24 16:02:08,539 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [12], [13], [17], [20], [27], [32], [34], [35], [36], [39], [40], [43], [44], [45], [48], [50], [53], [57], [60], [61], [62], [65], [66], [67], [71], [73], [74], [75], [77], [80], [85], [88], [89], [92], [93], [98], [100], [106], [107], [110], [113], [114], [117], [118], [119], [121], [122], [123], [124], [131], [132], [133], [134], [135], [136], [137], [139], [141], [142], [143], [145], [146], [147], [149], [150], [151], [152], [153], [154], [155], [157], [159], [161], [162], [163] [2018-01-24 16:02:08,543 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:02:08,543 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-24 16:02:10,072 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-24 16:02:10,073 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-24 16:02:10,073 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 16:02:10,073 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:02:10,073 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:02:10,081 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:02:10,082 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:02:10,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:10,125 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:02:10,127 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 16:02:10,127 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 16:02:10,132 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 16:02:10,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 04:02:10 BoogieIcfgContainer [2018-01-24 16:02:10,132 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 16:02:10,133 INFO L168 Benchmark]: Toolchain (without parser) took 43158.31 ms. Allocated memory was 302.5 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 261.6 MB in the beginning and 382.9 MB in the end (delta: -121.3 MB). Peak memory consumption was 990.1 MB. Max. memory is 5.3 GB. [2018-01-24 16:02:10,134 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 302.5 MB. Free memory is still 268.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:02:10,134 INFO L168 Benchmark]: CACSL2BoogieTranslator took 234.30 ms. Allocated memory is still 302.5 MB. Free memory was 261.6 MB in the beginning and 247.4 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 5.3 GB. [2018-01-24 16:02:10,135 INFO L168 Benchmark]: Boogie Preprocessor took 42.03 ms. Allocated memory is still 302.5 MB. Free memory was 247.4 MB in the beginning and 245.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:02:10,135 INFO L168 Benchmark]: RCFGBuilder took 441.53 ms. Allocated memory is still 302.5 MB. Free memory was 245.4 MB in the beginning and 214.8 MB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 5.3 GB. [2018-01-24 16:02:10,135 INFO L168 Benchmark]: TraceAbstraction took 42432.37 ms. Allocated memory was 302.5 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 214.8 MB in the beginning and 382.9 MB in the end (delta: -168.1 MB). Peak memory consumption was 943.4 MB. Max. memory is 5.3 GB. [2018-01-24 16:02:10,137 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 302.5 MB. Free memory is still 268.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 234.30 ms. Allocated memory is still 302.5 MB. Free memory was 261.6 MB in the beginning and 247.4 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.03 ms. Allocated memory is still 302.5 MB. Free memory was 247.4 MB in the beginning and 245.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 441.53 ms. Allocated memory is still 302.5 MB. Free memory was 245.4 MB in the beginning and 214.8 MB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 42432.37 ms. Allocated memory was 302.5 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 214.8 MB in the beginning and 382.9 MB in the end (delta: -168.1 MB). Peak memory consumption was 943.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 34 LocStat_MAX_WEQGRAPH_SIZE : 3 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 259 LocStat_NO_SUPPORTING_DISEQUALITIES : 25 LocStat_NO_DISJUNCTIONS : -68 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 53 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 108 TransStat_NO_SUPPORTING_DISEQUALITIES : 9 TransStat_NO_DISJUNCTIONS : 57 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.267482 RENAME_VARIABLES(MILLISECONDS) : 0.059088 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.108982 PROJECTAWAY(MILLISECONDS) : 0.039326 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.103925 DISJOIN(MILLISECONDS) : 0.492883 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.076456 ADD_EQUALITY(MILLISECONDS) : 0.012725 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.008218 #CONJOIN_DISJUNCTIVE : 86 #RENAME_VARIABLES : 145 #UNFREEZE : 0 #CONJOIN : 178 #PROJECTAWAY : 142 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 141 #ADD_EQUALITY : 111 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 39 LocStat_MAX_WEQGRAPH_SIZE : 6 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 299 LocStat_NO_SUPPORTING_DISEQUALITIES : 30 LocStat_NO_DISJUNCTIONS : -78 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 60 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 120 TransStat_NO_SUPPORTING_DISEQUALITIES : 9 TransStat_NO_DISJUNCTIONS : 64 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.233861 RENAME_VARIABLES(MILLISECONDS) : 0.054238 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.090894 PROJECTAWAY(MILLISECONDS) : 0.024698 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.047536 DISJOIN(MILLISECONDS) : 0.405762 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.069675 ADD_EQUALITY(MILLISECONDS) : 0.012953 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.005480 #CONJOIN_DISJUNCTIVE : 96 #RENAME_VARIABLES : 160 #UNFREEZE : 0 #CONJOIN : 203 #PROJECTAWAY : 159 #ADD_WEAK_EQUALITY : 15 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 156 #ADD_EQUALITY : 128 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 60 LocStat_MAX_WEQGRAPH_SIZE : 6 LocStat_MAX_SIZEOF_WEQEDGELABEL : 4 LocStat_NO_SUPPORTING_EQUALITIES : 486 LocStat_NO_SUPPORTING_DISEQUALITIES : 51 LocStat_NO_DISJUNCTIONS : -120 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 89 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 2 TransStat_NO_SUPPORTING_EQUALITIES : 190 TransStat_NO_SUPPORTING_DISEQUALITIES : 11 TransStat_NO_DISJUNCTIONS : 94 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.366017 RENAME_VARIABLES(MILLISECONDS) : 0.086089 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.146430 PROJECTAWAY(MILLISECONDS) : 0.039522 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.035522 DISJOIN(MILLISECONDS) : 0.684509 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.109770 ADD_EQUALITY(MILLISECONDS) : 0.015121 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.003694 #CONJOIN_DISJUNCTIVE : 138 #RENAME_VARIABLES : 223 #UNFREEZE : 0 #CONJOIN : 310 #PROJECTAWAY : 230 #ADD_WEAK_EQUALITY : 27 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 218 #ADD_EQUALITY : 206 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 10 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 74 LocStat_MAX_WEQGRAPH_SIZE : 6 LocStat_MAX_SIZEOF_WEQEDGELABEL : 4 LocStat_NO_SUPPORTING_EQUALITIES : 626 LocStat_NO_SUPPORTING_DISEQUALITIES : 65 LocStat_NO_DISJUNCTIONS : -148 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 109 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 2 TransStat_NO_SUPPORTING_EQUALITIES : 222 TransStat_NO_SUPPORTING_DISEQUALITIES : 11 TransStat_NO_DISJUNCTIONS : 114 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.196888 RENAME_VARIABLES(MILLISECONDS) : 0.057127 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.079123 PROJECTAWAY(MILLISECONDS) : 0.023548 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.034192 DISJOIN(MILLISECONDS) : 0.419815 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.072066 ADD_EQUALITY(MILLISECONDS) : 0.011669 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.004890 #CONJOIN_DISJUNCTIVE : 161 #RENAME_VARIABLES : 260 #UNFREEZE : 0 #CONJOIN : 358 #PROJECTAWAY : 271 #ADD_WEAK_EQUALITY : 33 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 255 #ADD_EQUALITY : 243 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 10 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1294). Cancelled while BasicCegarLoop was analyzing trace of length 84 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1294). Cancelled while BasicCegarLoop was analyzing trace of length 84 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1411). Cancelled while BasicCegarLoop was analyzing trace of length 84 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1411). Cancelled while BasicCegarLoop was analyzing trace of length 84 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1265). Cancelled while BasicCegarLoop was analyzing trace of length 84 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1265). Cancelled while BasicCegarLoop was analyzing trace of length 84 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1267). Cancelled while BasicCegarLoop was analyzing trace of length 84 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1267). Cancelled while BasicCegarLoop was analyzing trace of length 84 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was analyzing trace of length 84 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was analyzing trace of length 84 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was analyzing trace of length 84 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was analyzing trace of length 84 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1339). Cancelled while BasicCegarLoop was analyzing trace of length 84 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1339). Cancelled while BasicCegarLoop was analyzing trace of length 84 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1441]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1441). Cancelled while BasicCegarLoop was analyzing trace of length 84 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1099). Cancelled while BasicCegarLoop was analyzing trace of length 84 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1100). Cancelled while BasicCegarLoop was analyzing trace of length 84 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1100). Cancelled while BasicCegarLoop was analyzing trace of length 84 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1099). Cancelled while BasicCegarLoop was analyzing trace of length 84 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 18 procedures, 118 locations, 19 error locations. TIMEOUT Result, 42.3s OverallTime, 23 OverallIterations, 5 TraceHistogramMax, 8.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2223 SDtfs, 674 SDslu, 13048 SDs, 0 SdLazy, 5556 SolverSat, 168 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1551 GetRequests, 1174 SyntacticMatches, 17 SemanticMatches, 360 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2359 ImplicationChecksByTransitivity, 17.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 15.1s AbstIntTime, 5 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 32 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 16.1s InterpolantComputationTime, 1646 NumberOfCodeBlocks, 1632 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2255 ConstructedInterpolants, 169 QuantifiedInterpolants, 541222 SizeOfPredicates, 74 NumberOfNonLiveVariables, 3189 ConjunctsInSsa, 289 ConjunctsInUnsatCore, 46 InterpolantComputations, 22 PerfectInterpolantSequences, 112/246 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_16-02-10-150.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_16-02-10-150.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_16-02-10-150.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_16-02-10-150.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_16-02-10-150.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-24_16-02-10-150.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-24_16-02-10-150.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-24_16-02-10-150.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-24_16-02-10-150.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_16-02-10-150.csv Completed graceful shutdown