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_smtcomp.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_3_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 06:01:03,277 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 06:01:03,279 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 06:01:03,291 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 06:01:03,291 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 06:01:03,292 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 06:01:03,293 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 06:01:03,294 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 06:01:03,296 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 06:01:03,296 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 06:01:03,297 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 06:01:03,297 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 06:01:03,298 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 06:01:03,299 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 06:01:03,299 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 06:01:03,302 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 06:01:03,304 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 06:01:03,306 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 06:01:03,307 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 06:01:03,308 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 06:01:03,311 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 06:01:03,311 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 06:01:03,311 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 06:01:03,312 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 06:01:03,313 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 06:01:03,315 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 06:01:03,315 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 06:01:03,315 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 06:01:03,316 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 06:01:03,316 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 06:01:03,317 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 06:01:03,317 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_smtcomp.epf [2018-01-25 06:01:03,327 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 06:01:03,327 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 06:01:03,328 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 06:01:03,328 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 06:01:03,328 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 06:01:03,328 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 06:01:03,329 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 06:01:03,329 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 06:01:03,329 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 06:01:03,330 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 06:01:03,330 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 06:01:03,330 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 06:01:03,330 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 06:01:03,330 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 06:01:03,331 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 06:01:03,331 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 06:01:03,331 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 06:01:03,331 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 06:01:03,331 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 06:01:03,332 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 06:01:03,332 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 06:01:03,332 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 06:01:03,332 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 06:01:03,332 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 06:01:03,333 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 06:01:03,333 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 06:01:03,333 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 06:01:03,333 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 06:01:03,333 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 06:01:03,334 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 06:01:03,334 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 06:01:03,334 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 06:01:03,334 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 06:01:03,334 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 06:01:03,335 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 06:01:03,335 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 06:01:03,369 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 06:01:03,382 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 06:01:03,387 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 06:01:03,388 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 06:01:03,389 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 06:01:03,390 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_3_false-valid-deref.i [2018-01-25 06:01:03,597 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 06:01:03,604 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 06:01:03,605 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 06:01:03,605 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 06:01:03,612 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 06:01:03,613 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:01:03" (1/1) ... [2018-01-25 06:01:03,617 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 25.01 06:01:03, skipping insertion in model container [2018-01-25 06:01:03,617 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:01:03" (1/1) ... [2018-01-25 06:01:03,636 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:01:03,686 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:01:03,806 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:01:03,830 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:01:03,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:01:03 WrapperNode [2018-01-25 06:01:03,838 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 06:01:03,839 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 06:01:03,839 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 06:01:03,840 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 06:01:03,852 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:01:03" (1/1) ... [2018-01-25 06:01:03,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:01:03" (1/1) ... [2018-01-25 06:01:03,862 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:01:03" (1/1) ... [2018-01-25 06:01:03,863 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:01:03" (1/1) ... [2018-01-25 06:01:03,871 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:01:03" (1/1) ... [2018-01-25 06:01:03,874 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:01:03" (1/1) ... [2018-01-25 06:01:03,876 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:01:03" (1/1) ... [2018-01-25 06:01:03,878 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 06:01:03,879 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 06:01:03,879 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 06:01:03,879 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 06:01:03,880 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:01:03" (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-25 06:01:03,927 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 06:01:03,928 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 06:01:03,928 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-01-25 06:01:03,928 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-25 06:01:03,928 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-01-25 06:01:03,928 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-01-25 06:01:03,928 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-01-25 06:01:03,928 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-01-25 06:01:03,929 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-01-25 06:01:03,929 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-01-25 06:01:03,929 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-01-25 06:01:03,929 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-01-25 06:01:03,929 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-01-25 06:01:03,929 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-01-25 06:01:03,930 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-01-25 06:01:03,930 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-25 06:01:03,930 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 06:01:03,930 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 06:01:03,930 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 06:01:03,931 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 06:01:03,931 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 06:01:03,931 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 06:01:03,931 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 06:01:03,931 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 06:01:03,931 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-25 06:01:03,932 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-25 06:01:03,932 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 06:01:03,932 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 06:01:03,932 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 06:01:03,932 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-25 06:01:03,932 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-25 06:01:03,933 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-01-25 06:01:03,933 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-01-25 06:01:03,933 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-01-25 06:01:03,933 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-01-25 06:01:03,933 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-01-25 06:01:03,933 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-01-25 06:01:03,934 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-01-25 06:01:03,934 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-01-25 06:01:03,934 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-01-25 06:01:03,934 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-01-25 06:01:03,934 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-01-25 06:01:03,934 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-01-25 06:01:03,935 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-25 06:01:03,935 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 06:01:03,935 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 06:01:03,935 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 06:01:04,167 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-25 06:01:04,331 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 06:01:04,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:01:04 BoogieIcfgContainer [2018-01-25 06:01:04,331 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 06:01:04,332 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 06:01:04,332 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 06:01:04,334 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 06:01:04,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 06:01:03" (1/3) ... [2018-01-25 06:01:04,335 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bd413f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:01:04, skipping insertion in model container [2018-01-25 06:01:04,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:01:03" (2/3) ... [2018-01-25 06:01:04,336 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bd413f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:01:04, skipping insertion in model container [2018-01-25 06:01:04,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:01:04" (3/3) ... [2018-01-25 06:01:04,338 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test22_3_false-valid-deref.i [2018-01-25 06:01:04,345 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 06:01:04,352 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-01-25 06:01:04,407 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 06:01:04,407 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 06:01:04,407 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 06:01:04,407 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 06:01:04,407 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 06:01:04,408 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 06:01:04,408 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 06:01:04,408 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 06:01:04,409 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 06:01:04,433 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states. [2018-01-25 06:01:04,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 06:01:04,441 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:04,442 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:01:04,442 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-25 06:01:04,448 INFO L82 PathProgramCache]: Analyzing trace with hash 556227080, now seen corresponding path program 1 times [2018-01-25 06:01:04,450 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:04,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:04,519 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:04,520 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:04,520 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:04,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:04,583 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:04,718 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-25 06:01:04,793 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:01:04,793 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:01:04,794 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:01:04,797 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:01:04,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:01:04,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:01:04,812 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 5 states. [2018-01-25 06:01:04,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:04,883 INFO L93 Difference]: Finished difference Result 226 states and 241 transitions. [2018-01-25 06:01:04,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:01:04,885 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-25 06:01:04,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:04,899 INFO L225 Difference]: With dead ends: 226 [2018-01-25 06:01:04,899 INFO L226 Difference]: Without dead ends: 122 [2018-01-25 06:01:04,904 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-25 06:01:04,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-01-25 06:01:04,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2018-01-25 06:01:04,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-25 06:01:04,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-01-25 06:01:04,945 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 17 [2018-01-25 06:01:04,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:04,945 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-01-25 06:01:04,945 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:01:04,945 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-01-25 06:01:04,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 06:01:04,946 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:04,946 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-25 06:01:04,946 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-25 06:01:04,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1895274134, now seen corresponding path program 1 times [2018-01-25 06:01:04,946 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:04,948 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:04,948 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:04,948 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:04,948 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:04,971 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:05,037 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-25 06:01:05,038 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:01:05,038 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:01:05,038 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:01:05,040 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:01:05,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:01:05,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:01:05,041 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 6 states. [2018-01-25 06:01:05,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:05,213 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2018-01-25 06:01:05,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:01:05,213 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-25 06:01:05,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:05,216 INFO L225 Difference]: With dead ends: 122 [2018-01-25 06:01:05,216 INFO L226 Difference]: Without dead ends: 121 [2018-01-25 06:01:05,217 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-25 06:01:05,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-25 06:01:05,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-01-25 06:01:05,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-25 06:01:05,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2018-01-25 06:01:05,231 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 19 [2018-01-25 06:01:05,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:05,231 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2018-01-25 06:01:05,231 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:01:05,231 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2018-01-25 06:01:05,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 06:01:05,232 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:05,232 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-25 06:01:05,232 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-25 06:01:05,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1895274133, now seen corresponding path program 1 times [2018-01-25 06:01:05,233 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:05,234 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:05,235 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:05,235 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:05,235 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:05,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:05,257 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:05,619 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-25 06:01:05,619 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:01:05,619 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 06:01:05,619 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:01:05,619 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 06:01:05,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 06:01:05,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:01:05,620 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 7 states. [2018-01-25 06:01:05,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:05,820 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2018-01-25 06:01:05,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 06:01:05,820 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-01-25 06:01:05,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:05,821 INFO L225 Difference]: With dead ends: 121 [2018-01-25 06:01:05,822 INFO L226 Difference]: Without dead ends: 120 [2018-01-25 06:01:05,822 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-25 06:01:05,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-25 06:01:05,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-01-25 06:01:05,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-25 06:01:05,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2018-01-25 06:01:05,833 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 19 [2018-01-25 06:01:05,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:05,833 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2018-01-25 06:01:05,833 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 06:01:05,834 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2018-01-25 06:01:05,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 06:01:05,835 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:05,835 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-25 06:01:05,835 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-25 06:01:05,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1715794329, now seen corresponding path program 1 times [2018-01-25 06:01:05,836 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:05,837 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:05,837 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:05,837 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:05,837 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:05,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:05,862 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:05,966 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-25 06:01:05,967 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:01:05,967 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 06:01:05,967 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:01:05,967 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 06:01:05,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 06:01:05,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:01:05,968 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand 7 states. [2018-01-25 06:01:06,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:06,041 INFO L93 Difference]: Finished difference Result 188 states and 203 transitions. [2018-01-25 06:01:06,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 06:01:06,042 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-01-25 06:01:06,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:06,044 INFO L225 Difference]: With dead ends: 188 [2018-01-25 06:01:06,044 INFO L226 Difference]: Without dead ends: 131 [2018-01-25 06:01:06,045 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-25 06:01:06,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-01-25 06:01:06,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2018-01-25 06:01:06,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-01-25 06:01:06,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 136 transitions. [2018-01-25 06:01:06,061 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 136 transitions. Word has length 29 [2018-01-25 06:01:06,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:06,062 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 136 transitions. [2018-01-25 06:01:06,062 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 06:01:06,062 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 136 transitions. [2018-01-25 06:01:06,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 06:01:06,064 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:06,064 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-25 06:01:06,064 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-25 06:01:06,065 INFO L82 PathProgramCache]: Analyzing trace with hash -785661208, now seen corresponding path program 1 times [2018-01-25 06:01:06,065 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:06,066 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:06,066 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:06,067 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:06,067 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:06,087 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:06,199 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-25 06:01:06,200 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:01:06,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 06:01:06,200 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:01:06,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 06:01:06,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 06:01:06,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:01:06,201 INFO L87 Difference]: Start difference. First operand 127 states and 136 transitions. Second operand 10 states. [2018-01-25 06:01:06,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:06,405 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2018-01-25 06:01:06,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 06:01:06,405 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-01-25 06:01:06,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:06,407 INFO L225 Difference]: With dead ends: 127 [2018-01-25 06:01:06,407 INFO L226 Difference]: Without dead ends: 126 [2018-01-25 06:01:06,408 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-25 06:01:06,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-25 06:01:06,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-01-25 06:01:06,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-25 06:01:06,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2018-01-25 06:01:06,421 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 34 [2018-01-25 06:01:06,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:06,421 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2018-01-25 06:01:06,421 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 06:01:06,421 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2018-01-25 06:01:06,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 06:01:06,423 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:06,423 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-25 06:01:06,423 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-25 06:01:06,423 INFO L82 PathProgramCache]: Analyzing trace with hash -785661207, now seen corresponding path program 1 times [2018-01-25 06:01:06,423 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:06,425 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:06,425 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:06,425 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:06,425 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:06,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:06,441 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:06,488 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-25 06:01:06,489 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:01:06,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 06:01:06,489 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:01:06,489 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:01:06,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:01:06,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:01:06,490 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand 4 states. [2018-01-25 06:01:06,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:06,528 INFO L93 Difference]: Finished difference Result 218 states and 233 transitions. [2018-01-25 06:01:06,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 06:01:06,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-01-25 06:01:06,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:06,536 INFO L225 Difference]: With dead ends: 218 [2018-01-25 06:01:06,536 INFO L226 Difference]: Without dead ends: 127 [2018-01-25 06:01:06,537 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-25 06:01:06,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-25 06:01:06,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-01-25 06:01:06,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-01-25 06:01:06,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 136 transitions. [2018-01-25 06:01:06,549 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 136 transitions. Word has length 34 [2018-01-25 06:01:06,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:06,550 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 136 transitions. [2018-01-25 06:01:06,550 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:01:06,550 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 136 transitions. [2018-01-25 06:01:06,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-25 06:01:06,551 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:06,551 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:01:06,551 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-25 06:01:06,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1322241719, now seen corresponding path program 1 times [2018-01-25 06:01:06,552 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:06,553 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:06,553 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:06,553 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:06,554 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:06,564 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:06,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-25 06:01:06,599 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:01:06,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 06:01:06,599 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:01:06,599 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 06:01:06,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 06:01:06,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 06:01:06,600 INFO L87 Difference]: Start difference. First operand 127 states and 136 transitions. Second operand 3 states. [2018-01-25 06:01:06,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:06,706 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2018-01-25 06:01:06,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 06:01:06,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-01-25 06:01:06,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:06,708 INFO L225 Difference]: With dead ends: 144 [2018-01-25 06:01:06,708 INFO L226 Difference]: Without dead ends: 131 [2018-01-25 06:01:06,709 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-25 06:01:06,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-01-25 06:01:06,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2018-01-25 06:01:06,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-25 06:01:06,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2018-01-25 06:01:06,721 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 32 [2018-01-25 06:01:06,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:06,721 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2018-01-25 06:01:06,722 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 06:01:06,722 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2018-01-25 06:01:06,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-25 06:01:06,723 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:06,723 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-25 06:01:06,723 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-25 06:01:06,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1082750419, now seen corresponding path program 1 times [2018-01-25 06:01:06,723 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:06,724 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:06,724 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:06,724 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:06,724 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:06,739 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:06,801 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-25 06:01:06,802 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:01:06,802 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:01:06,803 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-01-25 06:01:06,804 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [27], [32], [48], [54], [58], [62], [65], [67], [68], [72], [74], [75], [115], [118], [119], [120], [122], [123], [124], [132], [133], [134], [135], [136], [138], [142], [146], [152], [164], [165], [166] [2018-01-25 06:01:06,858 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:01:06,858 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:01:10,063 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 06:01:10,064 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-25 06:01:10,085 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 06:01:10,086 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:01:10,086 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-25 06:01:10,095 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:10,095 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:01:10,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:10,143 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:01:10,197 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-25 06:01:10,197 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:01:10,325 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-25 06:01:10,361 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:01:10,361 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-25 06:01:10,368 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:10,368 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:01:10,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:10,438 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:01:10,444 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-25 06:01:10,444 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:01:10,495 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-25 06:01:10,497 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 06:01:10,497 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5] total 9 [2018-01-25 06:01:10,497 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 06:01:10,497 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:01:10,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:01:10,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-01-25 06:01:10,498 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand 6 states. [2018-01-25 06:01:10,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:10,557 INFO L93 Difference]: Finished difference Result 215 states and 229 transitions. [2018-01-25 06:01:10,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:01:10,558 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-25 06:01:10,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:10,559 INFO L225 Difference]: With dead ends: 215 [2018-01-25 06:01:10,559 INFO L226 Difference]: Without dead ends: 124 [2018-01-25 06:01:10,560 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 134 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:01:10,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-25 06:01:10,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-01-25 06:01:10,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-25 06:01:10,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2018-01-25 06:01:10,573 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 35 [2018-01-25 06:01:10,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:10,573 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2018-01-25 06:01:10,573 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:01:10,574 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2018-01-25 06:01:10,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 06:01:10,575 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:10,575 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:01:10,575 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-25 06:01:10,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1962528345, now seen corresponding path program 1 times [2018-01-25 06:01:10,575 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:10,577 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:10,577 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:10,577 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:10,578 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:10,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:10,588 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:10,662 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-25 06:01:10,662 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:01:10,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 06:01:10,662 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:01:10,663 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:01:10,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:01:10,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:01:10,663 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand 6 states. [2018-01-25 06:01:10,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:10,745 INFO L93 Difference]: Finished difference Result 128 states and 135 transitions. [2018-01-25 06:01:10,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:01:10,745 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-01-25 06:01:10,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:10,746 INFO L225 Difference]: With dead ends: 128 [2018-01-25 06:01:10,746 INFO L226 Difference]: Without dead ends: 115 [2018-01-25 06:01:10,747 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-25 06:01:10,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-25 06:01:10,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-01-25 06:01:10,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-25 06:01:10,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2018-01-25 06:01:10,755 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 34 [2018-01-25 06:01:10,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:10,755 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2018-01-25 06:01:10,755 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:01:10,755 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2018-01-25 06:01:10,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-25 06:01:10,756 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:10,756 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-25 06:01:10,756 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-25 06:01:10,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1126031319, now seen corresponding path program 2 times [2018-01-25 06:01:10,757 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:10,758 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:10,758 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:10,758 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:10,759 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:10,773 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:10,851 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-25 06:01:10,852 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:01:10,852 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:01:10,852 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 06:01:10,852 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 06:01:10,852 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:01:10,852 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-25 06:01:10,871 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 06:01:10,871 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 06:01:10,894 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:01:10,906 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:01:10,910 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:01:10,943 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-25 06:01:10,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:01:11,009 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-25 06:01:11,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:01:11,036 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-25 06:01:11,036 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-25 06:01:11,735 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-25 06:01:11,736 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:01:14,214 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-25 06:01:14,234 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 06:01:14,234 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14, 13] imperfect sequences [6] total 31 [2018-01-25 06:01:14,235 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:01:14,235 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-25 06:01:14,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-25 06:01:14,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=839, Unknown=1, NotChecked=0, Total=930 [2018-01-25 06:01:14,236 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand 15 states. [2018-01-25 06:01:15,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:15,167 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2018-01-25 06:01:15,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-25 06:01:15,168 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2018-01-25 06:01:15,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:15,169 INFO L225 Difference]: With dead ends: 115 [2018-01-25 06:01:15,169 INFO L226 Difference]: Without dead ends: 114 [2018-01-25 06:01:15,170 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=118, Invalid=1071, Unknown=1, NotChecked=0, Total=1190 [2018-01-25 06:01:15,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-25 06:01:15,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-01-25 06:01:15,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-25 06:01:15,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 120 transitions. [2018-01-25 06:01:15,181 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 120 transitions. Word has length 36 [2018-01-25 06:01:15,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:15,181 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 120 transitions. [2018-01-25 06:01:15,181 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-25 06:01:15,181 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions. [2018-01-25 06:01:15,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-25 06:01:15,182 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:15,182 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-25 06:01:15,183 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-25 06:01:15,183 INFO L82 PathProgramCache]: Analyzing trace with hash -504837186, now seen corresponding path program 1 times [2018-01-25 06:01:15,183 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:15,184 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:15,184 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 06:01:15,185 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:15,185 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:15,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:15,199 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:15,320 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-25 06:01:15,320 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:01:15,320 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 06:01:15,320 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:01:15,321 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 06:01:15,321 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 06:01:15,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:01:15,321 INFO L87 Difference]: Start difference. First operand 114 states and 120 transitions. Second operand 10 states. [2018-01-25 06:01:15,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:15,577 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2018-01-25 06:01:15,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 06:01:15,578 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2018-01-25 06:01:15,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:15,579 INFO L225 Difference]: With dead ends: 114 [2018-01-25 06:01:15,579 INFO L226 Difference]: Without dead ends: 112 [2018-01-25 06:01:15,579 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 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-25 06:01:15,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-25 06:01:15,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-01-25 06:01:15,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-25 06:01:15,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 118 transitions. [2018-01-25 06:01:15,596 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 118 transitions. Word has length 41 [2018-01-25 06:01:15,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:15,596 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 118 transitions. [2018-01-25 06:01:15,596 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 06:01:15,596 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2018-01-25 06:01:15,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-25 06:01:15,598 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:15,598 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-25 06:01:15,598 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-25 06:01:15,598 INFO L82 PathProgramCache]: Analyzing trace with hash -504837185, now seen corresponding path program 1 times [2018-01-25 06:01:15,598 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:15,599 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:15,600 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:15,600 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:15,600 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:15,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:15,618 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:15,665 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-25 06:01:15,666 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:01:15,666 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:01:15,666 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-01-25 06:01:15,667 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [27], [32], [48], [54], [58], [62], [63], [66], [67], [68], [72], [74], [75], [107], [110], [115], [118], [119], [120], [122], [123], [124], [132], [133], [134], [135], [136], [138], [142], [146], [152], [153], [154], [164], [165], [166] [2018-01-25 06:01:15,669 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:01:15,670 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:01:18,054 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 06:01:18,054 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-25 06:01:18,066 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 06:01:18,066 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:01:18,066 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-25 06:01:18,072 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:18,072 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:01:18,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:18,106 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:01:18,196 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-25 06:01:18,196 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:01:18,474 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-25 06:01:18,496 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:01:18,496 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-25 06:01:18,499 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:18,499 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:01:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:18,546 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:01:18,551 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-25 06:01:18,551 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:01:18,573 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-25 06:01:18,574 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 06:01:18,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6] total 11 [2018-01-25 06:01:18,574 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 06:01:18,575 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 06:01:18,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 06:01:18,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-01-25 06:01:18,575 INFO L87 Difference]: Start difference. First operand 112 states and 118 transitions. Second operand 7 states. [2018-01-25 06:01:18,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:18,603 INFO L93 Difference]: Finished difference Result 201 states and 213 transitions. [2018-01-25 06:01:18,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:01:18,638 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-01-25 06:01:18,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:18,639 INFO L225 Difference]: With dead ends: 201 [2018-01-25 06:01:18,639 INFO L226 Difference]: Without dead ends: 113 [2018-01-25 06:01:18,639 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2018-01-25 06:01:18,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-25 06:01:18,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-01-25 06:01:18,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-25 06:01:18,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2018-01-25 06:01:18,650 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 41 [2018-01-25 06:01:18,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:18,650 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2018-01-25 06:01:18,650 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 06:01:18,650 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-01-25 06:01:18,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-25 06:01:18,651 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:18,651 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-25 06:01:18,651 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-25 06:01:18,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1693572501, now seen corresponding path program 2 times [2018-01-25 06:01:18,651 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:18,652 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:18,653 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:18,653 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:18,653 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:18,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:18,669 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:18,738 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-25 06:01:18,739 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:01:18,739 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:01:18,739 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 06:01:18,739 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 06:01:18,739 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:01:18,739 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-25 06:01:18,748 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 06:01:18,748 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 06:01:18,774 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:01:18,776 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:01:18,779 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:01:18,783 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-25 06:01:18,783 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:01:18,794 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-25 06:01:18,795 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:01:18,805 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-25 06:01:18,805 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-25 06:01:19,333 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-25 06:01:19,333 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:01:19,772 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-25 06:01:19,793 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 06:01:19,794 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15, 13] imperfect sequences [7] total 33 [2018-01-25 06:01:19,794 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:01:19,794 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-25 06:01:19,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-25 06:01:19,795 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=951, Unknown=0, NotChecked=0, Total=1056 [2018-01-25 06:01:19,795 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand 16 states. [2018-01-25 06:01:20,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:20,461 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2018-01-25 06:01:20,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-25 06:01:20,462 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2018-01-25 06:01:20,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:20,463 INFO L225 Difference]: With dead ends: 113 [2018-01-25 06:01:20,463 INFO L226 Difference]: Without dead ends: 111 [2018-01-25 06:01:20,463 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=136, Invalid=1196, Unknown=0, NotChecked=0, Total=1332 [2018-01-25 06:01:20,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-25 06:01:20,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-01-25 06:01:20,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-25 06:01:20,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 117 transitions. [2018-01-25 06:01:20,474 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 117 transitions. Word has length 42 [2018-01-25 06:01:20,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:20,474 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 117 transitions. [2018-01-25 06:01:20,474 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-25 06:01:20,475 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2018-01-25 06:01:20,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-25 06:01:20,475 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:20,476 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-25 06:01:20,476 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-25 06:01:20,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1966889947, now seen corresponding path program 1 times [2018-01-25 06:01:20,476 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:20,477 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:20,477 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 06:01:20,477 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:20,478 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:20,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:20,492 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:20,547 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-25 06:01:20,547 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:01:20,547 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 06:01:20,548 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:01:20,548 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 06:01:20,548 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 06:01:20,548 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-25 06:01:20,548 INFO L87 Difference]: Start difference. First operand 111 states and 117 transitions. Second operand 8 states. [2018-01-25 06:01:20,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:20,596 INFO L93 Difference]: Finished difference Result 175 states and 184 transitions. [2018-01-25 06:01:20,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 06:01:20,597 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-01-25 06:01:20,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:20,598 INFO L225 Difference]: With dead ends: 175 [2018-01-25 06:01:20,598 INFO L226 Difference]: Without dead ends: 111 [2018-01-25 06:01:20,599 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-25 06:01:20,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-25 06:01:20,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-01-25 06:01:20,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-25 06:01:20,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 116 transitions. [2018-01-25 06:01:20,616 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 116 transitions. Word has length 47 [2018-01-25 06:01:20,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:20,617 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 116 transitions. [2018-01-25 06:01:20,617 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 06:01:20,617 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 116 transitions. [2018-01-25 06:01:20,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-25 06:01:20,618 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:20,618 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-25 06:01:20,618 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-25 06:01:20,618 INFO L82 PathProgramCache]: Analyzing trace with hash 2136929804, now seen corresponding path program 1 times [2018-01-25 06:01:20,618 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:20,619 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:20,620 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:20,620 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:20,620 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:20,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:20,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:20,701 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-25 06:01:20,701 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:01:20,701 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-25 06:01:20,701 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:01:20,702 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 06:01:20,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 06:01:20,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:01:20,702 INFO L87 Difference]: Start difference. First operand 111 states and 116 transitions. Second operand 10 states. [2018-01-25 06:01:20,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:20,766 INFO L93 Difference]: Finished difference Result 177 states and 185 transitions. [2018-01-25 06:01:20,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 06:01:20,766 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2018-01-25 06:01:20,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:20,767 INFO L225 Difference]: With dead ends: 177 [2018-01-25 06:01:20,767 INFO L226 Difference]: Without dead ends: 111 [2018-01-25 06:01:20,768 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 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-25 06:01:20,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-25 06:01:20,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-01-25 06:01:20,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-25 06:01:20,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2018-01-25 06:01:20,780 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 52 [2018-01-25 06:01:20,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:20,780 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2018-01-25 06:01:20,780 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 06:01:20,780 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2018-01-25 06:01:20,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-25 06:01:20,781 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:20,781 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-25 06:01:20,781 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-25 06:01:20,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1070951830, now seen corresponding path program 1 times [2018-01-25 06:01:20,781 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:20,782 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:20,782 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:20,782 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:20,782 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:20,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:20,798 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:21,038 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-25 06:01:21,039 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:01:21,039 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-01-25 06:01:21,039 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:01:21,039 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-25 06:01:21,039 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-25 06:01:21,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-01-25 06:01:21,040 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand 21 states. [2018-01-25 06:01:21,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:21,442 INFO L93 Difference]: Finished difference Result 141 states and 153 transitions. [2018-01-25 06:01:21,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-25 06:01:21,442 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 63 [2018-01-25 06:01:21,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:21,443 INFO L225 Difference]: With dead ends: 141 [2018-01-25 06:01:21,443 INFO L226 Difference]: Without dead ends: 139 [2018-01-25 06:01:21,443 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-25 06:01:21,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-01-25 06:01:21,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 134. [2018-01-25 06:01:21,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-01-25 06:01:21,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2018-01-25 06:01:21,460 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 63 [2018-01-25 06:01:21,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:21,460 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2018-01-25 06:01:21,460 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-25 06:01:21,461 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2018-01-25 06:01:21,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-25 06:01:21,461 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:21,462 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-25 06:01:21,462 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-25 06:01:21,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1070951829, now seen corresponding path program 1 times [2018-01-25 06:01:21,462 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:21,463 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:21,463 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:21,463 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:21,464 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:21,484 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:21,549 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-25 06:01:21,550 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:01:21,550 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:01:21,550 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 64 with the following transitions: [2018-01-25 06:01:21,550 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [12], [13], [17], [20], [27], [32], [34], [35], [38], [48], [50], [54], [58], [61], [62], [63], [66], [67], [68], [72], [74], [75], [76], [107], [108], [111], [114], [115], [118], [119], [120], [122], [123], [124], [125], [132], [133], [134], [135], [136], [137], [138], [140], [142], [143], [146], [147], [148], [152], [153], [154], [155], [156], [162], [164], [165], [166] [2018-01-25 06:01:21,553 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:01:21,554 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:01:25,320 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 06:01:25,321 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-25 06:01:25,335 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 06:01:25,335 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:01:25,335 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-25 06:01:25,349 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:25,349 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:01:25,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:25,394 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:01:25,441 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-25 06:01:25,442 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:01:25,531 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-25 06:01:25,551 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:01:25,551 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-25 06:01:25,556 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:25,556 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:01:25,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:25,626 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:01:25,631 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-25 06:01:25,631 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:01:25,679 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-25 06:01:25,680 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 06:01:25,681 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 13 [2018-01-25 06:01:25,681 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 06:01:25,681 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 06:01:25,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 06:01:25,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-01-25 06:01:25,681 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand 8 states. [2018-01-25 06:01:25,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:25,709 INFO L93 Difference]: Finished difference Result 244 states and 268 transitions. [2018-01-25 06:01:25,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 06:01:25,710 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2018-01-25 06:01:25,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:25,711 INFO L225 Difference]: With dead ends: 244 [2018-01-25 06:01:25,711 INFO L226 Difference]: Without dead ends: 135 [2018-01-25 06:01:25,711 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 244 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=105, Unknown=0, NotChecked=0, Total=182 [2018-01-25 06:01:25,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-25 06:01:25,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-01-25 06:01:25,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-25 06:01:25,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2018-01-25 06:01:25,726 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 63 [2018-01-25 06:01:25,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:25,726 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2018-01-25 06:01:25,726 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 06:01:25,726 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2018-01-25 06:01:25,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-25 06:01:25,727 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:25,727 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-25 06:01:25,727 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-25 06:01:25,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1223229503, now seen corresponding path program 2 times [2018-01-25 06:01:25,727 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:25,728 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:25,728 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:25,728 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:25,728 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:25,742 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:25,793 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-25 06:01:25,794 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:01:25,794 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:01:25,794 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 06:01:25,794 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 06:01:25,794 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:01:25,794 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-25 06:01:25,800 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 06:01:25,800 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 06:01:25,831 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:01:25,838 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:01:25,842 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:01:25,853 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-25 06:01:25,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:01:25,885 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-25 06:01:25,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:01:25,896 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-25 06:01:25,896 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-25 06:01:26,775 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-25 06:01:26,775 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:01:34,988 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-25 06:01:35,013 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 06:01:35,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20, 18] imperfect sequences [8] total 44 [2018-01-25 06:01:35,013 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:01:35,013 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-25 06:01:35,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-25 06:01:35,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1743, Unknown=3, NotChecked=0, Total=1892 [2018-01-25 06:01:35,015 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand 21 states. [2018-01-25 06:01:35,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:35,929 INFO L93 Difference]: Finished difference Result 135 states and 147 transitions. [2018-01-25 06:01:35,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-25 06:01:35,930 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-01-25 06:01:35,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:35,931 INFO L225 Difference]: With dead ends: 135 [2018-01-25 06:01:35,931 INFO L226 Difference]: Without dead ends: 133 [2018-01-25 06:01:35,932 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=195, Invalid=2252, Unknown=3, NotChecked=0, Total=2450 [2018-01-25 06:01:35,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-25 06:01:35,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-01-25 06:01:35,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-25 06:01:35,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 143 transitions. [2018-01-25 06:01:35,948 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 143 transitions. Word has length 64 [2018-01-25 06:01:35,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:35,949 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 143 transitions. [2018-01-25 06:01:35,949 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-25 06:01:35,949 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 143 transitions. [2018-01-25 06:01:35,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-25 06:01:35,950 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:35,950 INFO L322 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:01:35,950 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-25 06:01:35,950 INFO L82 PathProgramCache]: Analyzing trace with hash -577954366, now seen corresponding path program 1 times [2018-01-25 06:01:35,950 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:35,951 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:35,951 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 06:01:35,952 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:35,952 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:35,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:35,963 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:36,291 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-01-25 06:01:36,292 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:01:36,292 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:01:36,292 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 68 with the following transitions: [2018-01-25 06:01:36,292 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [12], [13], [16], [17], [24], [26], [27], [32], [34], [48], [50], [53], [54], [58], [61], [62], [63], [66], [67], [68], [72], [74], [75], [107], [108], [111], [114], [115], [118], [119], [120], [122], [123], [124], [132], [133], [134], [135], [136], [137], [138], [139], [142], [143], [146], [147], [148], [149], [150], [151], [152], [153], [154], [155], [164], [165], [166] [2018-01-25 06:01:36,294 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:01:36,295 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:01:38,927 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-25 06:01:38,927 INFO L268 AbstractInterpreter]: Visited 54 different actions 62 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 22 variables. [2018-01-25 06:01:38,932 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-25 06:01:39,695 INFO L232 lantSequenceWeakener]: Weakened 32 states. On average, predicates are now at 67.72% of their original sizes. [2018-01-25 06:01:39,695 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-25 06:01:40,703 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-25 06:01:40,704 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-25 06:01:40,705 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [33] imperfect sequences [11] total 43 [2018-01-25 06:01:40,705 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:01:40,705 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-25 06:01:40,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-25 06:01:40,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1002, Unknown=0, NotChecked=0, Total=1122 [2018-01-25 06:01:40,706 INFO L87 Difference]: Start difference. First operand 133 states and 143 transitions. Second operand 34 states. Received shutdown request... [2018-01-25 06:01:47,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-25 06:01:47,124 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 06:01:47,128 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 06:01:47,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 06:01:47 BoogieIcfgContainer [2018-01-25 06:01:47,129 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 06:01:47,129 INFO L168 Benchmark]: Toolchain (without parser) took 43532.35 ms. Allocated memory was 298.8 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 257.7 MB in the beginning and 1.3 GB in the end (delta: -1.0 GB). Peak memory consumption was 153.2 MB. Max. memory is 5.3 GB. [2018-01-25 06:01:47,130 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 298.8 MB. Free memory is still 264.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 06:01:47,130 INFO L168 Benchmark]: CACSL2BoogieTranslator took 234.20 ms. Allocated memory is still 298.8 MB. Free memory was 257.7 MB in the beginning and 243.4 MB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 5.3 GB. [2018-01-25 06:01:47,130 INFO L168 Benchmark]: Boogie Preprocessor took 39.33 ms. Allocated memory is still 298.8 MB. Free memory was 243.4 MB in the beginning and 241.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 06:01:47,130 INFO L168 Benchmark]: RCFGBuilder took 452.45 ms. Allocated memory is still 298.8 MB. Free memory was 241.4 MB in the beginning and 211.3 MB in the end (delta: 30.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 5.3 GB. [2018-01-25 06:01:47,131 INFO L168 Benchmark]: TraceAbstraction took 42796.77 ms. Allocated memory was 298.8 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 210.3 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 105.8 MB. Max. memory is 5.3 GB. [2018-01-25 06:01:47,132 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.19 ms. Allocated memory is still 298.8 MB. Free memory is still 264.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 234.20 ms. Allocated memory is still 298.8 MB. Free memory was 257.7 MB in the beginning and 243.4 MB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.33 ms. Allocated memory is still 298.8 MB. Free memory was 243.4 MB in the beginning and 241.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 452.45 ms. Allocated memory is still 298.8 MB. Free memory was 241.4 MB in the beginning and 211.3 MB in the end (delta: 30.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 42796.77 ms. Allocated memory was 298.8 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 210.3 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 105.8 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.434877 RENAME_VARIABLES(MILLISECONDS) : 0.104192 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.170250 PROJECTAWAY(MILLISECONDS) : 0.051064 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.142091 DISJOIN(MILLISECONDS) : 0.748783 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.130763 ADD_EQUALITY(MILLISECONDS) : 0.021241 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.011653 #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.238198 RENAME_VARIABLES(MILLISECONDS) : 0.056045 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.099420 PROJECTAWAY(MILLISECONDS) : 0.022247 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.052505 DISJOIN(MILLISECONDS) : 0.393787 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.071079 ADD_EQUALITY(MILLISECONDS) : 0.013691 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.010531 #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 : 2 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 : 1 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.385367 RENAME_VARIABLES(MILLISECONDS) : 0.084611 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.163121 PROJECTAWAY(MILLISECONDS) : 0.039211 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.065613 DISJOIN(MILLISECONDS) : 0.736265 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.107017 ADD_EQUALITY(MILLISECONDS) : 0.015600 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.006754 #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 : 52 LocStat_MAX_WEQGRAPH_SIZE : 6 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 397 LocStat_NO_SUPPORTING_DISEQUALITIES : 43 LocStat_NO_DISJUNCTIONS : -104 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 76 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 2 TransStat_NO_SUPPORTING_EQUALITIES : 144 TransStat_NO_SUPPORTING_DISEQUALITIES : 9 TransStat_NO_DISJUNCTIONS : 79 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.375913 RENAME_VARIABLES(MILLISECONDS) : 0.064472 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.350263 PROJECTAWAY(MILLISECONDS) : 0.010125 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.028065 DISJOIN(MILLISECONDS) : 0.356161 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.083608 ADD_EQUALITY(MILLISECONDS) : 0.010635 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.006012 #CONJOIN_DISJUNCTIVE : 120 #RENAME_VARIABLES : 201 #UNFREEZE : 0 #CONJOIN : 262 #PROJECTAWAY : 203 #ADD_WEAK_EQUALITY : 27 #DISJOIN : 3 #RENAME_VARIABLES_DISJUNCTIVE : 198 #ADD_EQUALITY : 160 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 * 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 constructing difference of abstraction (133states) and interpolant automaton (currently 14 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1294). Cancelled while BasicCegarLoop was constructing difference of abstraction (133states) and interpolant automaton (currently 14 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1411). Cancelled while BasicCegarLoop was constructing difference of abstraction (133states) and interpolant automaton (currently 14 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1411). Cancelled while BasicCegarLoop was constructing difference of abstraction (133states) and interpolant automaton (currently 14 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1265). Cancelled while BasicCegarLoop was constructing difference of abstraction (133states) and interpolant automaton (currently 14 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1265). Cancelled while BasicCegarLoop was constructing difference of abstraction (133states) and interpolant automaton (currently 14 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1267). Cancelled while BasicCegarLoop was constructing difference of abstraction (133states) and interpolant automaton (currently 14 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1267). Cancelled while BasicCegarLoop was constructing difference of abstraction (133states) and interpolant automaton (currently 14 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was constructing difference of abstraction (133states) and interpolant automaton (currently 14 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was constructing difference of abstraction (133states) and interpolant automaton (currently 14 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was constructing difference of abstraction (133states) and interpolant automaton (currently 14 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was constructing difference of abstraction (133states) and interpolant automaton (currently 14 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1339). Cancelled while BasicCegarLoop was constructing difference of abstraction (133states) and interpolant automaton (currently 14 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1339). Cancelled while BasicCegarLoop was constructing difference of abstraction (133states) and interpolant automaton (currently 14 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1443]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1443). Cancelled while BasicCegarLoop was constructing difference of abstraction (133states) and interpolant automaton (currently 14 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1099). Cancelled while BasicCegarLoop was constructing difference of abstraction (133states) and interpolant automaton (currently 14 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1100). Cancelled while BasicCegarLoop was constructing difference of abstraction (133states) and interpolant automaton (currently 14 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1100). Cancelled while BasicCegarLoop was constructing difference of abstraction (133states) and interpolant automaton (currently 14 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1099). Cancelled while BasicCegarLoop was constructing difference of abstraction (133states) and interpolant automaton (currently 14 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 18 procedures, 119 locations, 19 error locations. TIMEOUT Result, 42.7s OverallTime, 19 OverallIterations, 4 TraceHistogramMax, 10.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1932 SDtfs, 599 SDslu, 9758 SDs, 0 SdLazy, 3901 SolverSat, 143 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.1s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 1083 GetRequests, 792 SyntacticMatches, 12 SemanticMatches, 279 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1569 ImplicationChecksByTransitivity, 16.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=135occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 12.1s AbstIntTime, 4 AbstIntIterations, 1 AbstIntStrong, 0.9285559014168642 AbsIntWeakeningRatio, 0.8333333333333334 AbsIntAvgWeakeningVarsNumRemoved, 4.2272727272727275 AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 23 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 16.4s InterpolantComputationTime, 1189 NumberOfCodeBlocks, 1180 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1572 ConstructedInterpolants, 103 QuantifiedInterpolants, 297869 SizeOfPredicates, 49 NumberOfNonLiveVariables, 2028 ConjunctsInSsa, 185 ConjunctsInUnsatCore, 37 InterpolantComputations, 18 PerfectInterpolantSequences, 78/150 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_3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_06-01-47-145.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_06-01-47-145.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_06-01-47-145.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_06-01-47-145.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_06-01-47-145.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-25_06-01-47-145.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-25_06-01-47-145.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-25_06-01-47-145.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-25_06-01-47-145.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_06-01-47-145.csv Completed graceful shutdown