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_1_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 06:10:15,956 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 06:10:15,957 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 06:10:15,969 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 06:10:15,970 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 06:10:15,970 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 06:10:15,971 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 06:10:15,972 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 06:10:15,974 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 06:10:15,974 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 06:10:15,975 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 06:10:15,975 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 06:10:15,976 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 06:10:15,977 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 06:10:15,978 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 06:10:15,980 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 06:10:15,982 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 06:10:15,984 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 06:10:15,985 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 06:10:15,986 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 06:10:15,989 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 06:10:15,989 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 06:10:15,989 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 06:10:15,990 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 06:10:15,991 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 06:10:15,992 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 06:10:15,992 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 06:10:15,993 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 06:10:15,993 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 06:10:15,993 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 06:10:15,994 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 06:10:15,994 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:10:16,004 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 06:10:16,004 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 06:10:16,005 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 06:10:16,005 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 06:10:16,005 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 06:10:16,005 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 06:10:16,006 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 06:10:16,006 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 06:10:16,006 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 06:10:16,007 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 06:10:16,007 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 06:10:16,007 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 06:10:16,007 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 06:10:16,007 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 06:10:16,008 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 06:10:16,008 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 06:10:16,008 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 06:10:16,008 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 06:10:16,008 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 06:10:16,009 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 06:10:16,009 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 06:10:16,009 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 06:10:16,009 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 06:10:16,009 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 06:10:16,009 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 06:10:16,010 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 06:10:16,010 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 06:10:16,010 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 06:10:16,010 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 06:10:16,010 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 06:10:16,011 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 06:10:16,011 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 06:10:16,011 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 06:10:16,011 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 06:10:16,012 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 06:10:16,012 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 06:10:16,047 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 06:10:16,059 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 06:10:16,063 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 06:10:16,064 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 06:10:16,065 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 06:10:16,066 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_1_true-valid-memsafety_true-termination.i [2018-01-25 06:10:16,286 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 06:10:16,292 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 06:10:16,293 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 06:10:16,293 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 06:10:16,299 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 06:10:16,300 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:10:16" (1/1) ... [2018-01-25 06:10:16,303 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:10:16, skipping insertion in model container [2018-01-25 06:10:16,304 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:10:16" (1/1) ... [2018-01-25 06:10:16,321 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:10:16,372 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:10:16,492 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:10:16,513 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:10:16,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:10:16 WrapperNode [2018-01-25 06:10:16,525 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 06:10:16,526 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 06:10:16,526 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 06:10:16,526 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 06:10:16,542 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:10:16" (1/1) ... [2018-01-25 06:10:16,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:10:16" (1/1) ... [2018-01-25 06:10:16,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:10:16" (1/1) ... [2018-01-25 06:10:16,554 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:10:16" (1/1) ... [2018-01-25 06:10:16,560 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:10:16" (1/1) ... [2018-01-25 06:10:16,563 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:10:16" (1/1) ... [2018-01-25 06:10:16,565 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:10:16" (1/1) ... [2018-01-25 06:10:16,567 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 06:10:16,568 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 06:10:16,568 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 06:10:16,568 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 06:10:16,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:10:16" (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:10:16,611 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 06:10:16,611 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 06:10:16,612 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-01-25 06:10:16,612 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-25 06:10:16,612 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-01-25 06:10:16,612 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-01-25 06:10:16,612 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-01-25 06:10:16,612 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-01-25 06:10:16,612 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-01-25 06:10:16,612 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-01-25 06:10:16,612 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-01-25 06:10:16,612 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-01-25 06:10:16,613 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-01-25 06:10:16,613 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-01-25 06:10:16,613 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-01-25 06:10:16,613 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-25 06:10:16,613 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 06:10:16,613 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 06:10:16,613 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 06:10:16,613 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 06:10:16,613 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 06:10:16,614 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 06:10:16,614 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 06:10:16,614 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 06:10:16,614 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-25 06:10:16,614 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-25 06:10:16,614 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 06:10:16,614 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 06:10:16,614 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 06:10:16,614 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-25 06:10:16,615 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-25 06:10:16,615 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-01-25 06:10:16,615 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-01-25 06:10:16,615 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-01-25 06:10:16,615 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-01-25 06:10:16,615 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-01-25 06:10:16,615 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-01-25 06:10:16,615 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-01-25 06:10:16,615 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-01-25 06:10:16,615 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-01-25 06:10:16,615 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-01-25 06:10:16,616 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-01-25 06:10:16,616 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-01-25 06:10:16,616 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-25 06:10:16,616 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 06:10:16,616 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 06:10:16,616 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 06:10:16,850 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-25 06:10:16,994 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 06:10:16,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:10:16 BoogieIcfgContainer [2018-01-25 06:10:16,995 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 06:10:16,996 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 06:10:16,996 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 06:10:16,998 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 06:10:16,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 06:10:16" (1/3) ... [2018-01-25 06:10:16,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a1ea8b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:10:16, skipping insertion in model container [2018-01-25 06:10:16,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:10:16" (2/3) ... [2018-01-25 06:10:16,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a1ea8b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:10:16, skipping insertion in model container [2018-01-25 06:10:16,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:10:16" (3/3) ... [2018-01-25 06:10:17,001 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test22_1_true-valid-memsafety_true-termination.i [2018-01-25 06:10:17,009 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 06:10:17,015 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-01-25 06:10:17,066 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 06:10:17,066 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 06:10:17,066 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 06:10:17,067 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 06:10:17,067 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 06:10:17,067 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 06:10:17,067 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 06:10:17,067 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 06:10:17,068 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 06:10:17,090 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states. [2018-01-25 06:10:17,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 06:10:17,097 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:17,098 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:10:17,098 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:10:17,103 INFO L82 PathProgramCache]: Analyzing trace with hash -401333144, now seen corresponding path program 1 times [2018-01-25 06:10:17,106 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:17,152 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:17,152 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:17,152 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:17,152 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:17,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:17,211 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:17,332 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:10:17,334 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:10:17,334 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:10:17,335 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:10:17,410 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:10:17,425 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:10:17,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:10:17,428 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 5 states. [2018-01-25 06:10:17,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:10:17,496 INFO L93 Difference]: Finished difference Result 224 states and 237 transitions. [2018-01-25 06:10:17,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:10:17,498 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-25 06:10:17,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:10:17,510 INFO L225 Difference]: With dead ends: 224 [2018-01-25 06:10:17,511 INFO L226 Difference]: Without dead ends: 121 [2018-01-25 06:10:17,515 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:10:17,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-25 06:10:17,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-01-25 06:10:17,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-25 06:10:17,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 126 transitions. [2018-01-25 06:10:17,557 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 126 transitions. Word has length 17 [2018-01-25 06:10:17,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:10:17,557 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 126 transitions. [2018-01-25 06:10:17,557 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:10:17,557 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2018-01-25 06:10:17,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 06:10:17,558 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:17,558 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:10:17,558 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:10:17,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1306365930, now seen corresponding path program 1 times [2018-01-25 06:10:17,559 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:17,560 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:17,560 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:17,561 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:17,561 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:17,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:17,582 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:17,650 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:10:17,650 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:10:17,650 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:10:17,651 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:10:17,652 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:10:17,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:10:17,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:10:17,653 INFO L87 Difference]: Start difference. First operand 119 states and 126 transitions. Second operand 6 states. [2018-01-25 06:10:17,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:10:17,843 INFO L93 Difference]: Finished difference Result 121 states and 128 transitions. [2018-01-25 06:10:17,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:10:17,844 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-25 06:10:17,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:10:17,846 INFO L225 Difference]: With dead ends: 121 [2018-01-25 06:10:17,846 INFO L226 Difference]: Without dead ends: 120 [2018-01-25 06:10:17,847 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:10:17,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-25 06:10:17,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-01-25 06:10:17,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-25 06:10:17,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2018-01-25 06:10:17,860 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 19 [2018-01-25 06:10:17,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:10:17,861 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2018-01-25 06:10:17,861 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:10:17,861 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2018-01-25 06:10:17,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 06:10:17,862 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:17,862 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:10:17,862 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:10:17,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1306365931, now seen corresponding path program 1 times [2018-01-25 06:10:17,862 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:17,864 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:17,864 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:17,864 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:17,864 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:17,885 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:18,112 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:10:18,113 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:10:18,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 06:10:18,113 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:10:18,113 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 06:10:18,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 06:10:18,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:10:18,114 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand 7 states. [2018-01-25 06:10:18,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:10:18,327 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2018-01-25 06:10:18,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 06:10:18,327 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-01-25 06:10:18,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:10:18,329 INFO L225 Difference]: With dead ends: 120 [2018-01-25 06:10:18,329 INFO L226 Difference]: Without dead ends: 119 [2018-01-25 06:10:18,329 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-25 06:10:18,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-25 06:10:18,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-01-25 06:10:18,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-25 06:10:18,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 124 transitions. [2018-01-25 06:10:18,340 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 124 transitions. Word has length 19 [2018-01-25 06:10:18,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:10:18,340 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 124 transitions. [2018-01-25 06:10:18,341 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 06:10:18,341 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2018-01-25 06:10:18,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 06:10:18,341 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:18,342 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:10:18,342 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:10:18,342 INFO L82 PathProgramCache]: Analyzing trace with hash -860603530, now seen corresponding path program 1 times [2018-01-25 06:10:18,342 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:18,343 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:18,343 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:18,344 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:18,344 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:18,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:18,368 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:18,453 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:10:18,453 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:10:18,454 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 06:10:18,454 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:10:18,454 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 06:10:18,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 06:10:18,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:10:18,455 INFO L87 Difference]: Start difference. First operand 117 states and 124 transitions. Second operand 7 states. [2018-01-25 06:10:18,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:10:18,515 INFO L93 Difference]: Finished difference Result 183 states and 192 transitions. [2018-01-25 06:10:18,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 06:10:18,516 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-01-25 06:10:18,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:10:18,517 INFO L225 Difference]: With dead ends: 183 [2018-01-25 06:10:18,518 INFO L226 Difference]: Without dead ends: 129 [2018-01-25 06:10:18,518 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:10:18,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-01-25 06:10:18,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2018-01-25 06:10:18,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-25 06:10:18,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2018-01-25 06:10:18,529 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 29 [2018-01-25 06:10:18,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:10:18,530 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2018-01-25 06:10:18,530 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 06:10:18,530 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2018-01-25 06:10:18,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 06:10:18,531 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:18,531 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:10:18,531 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:10:18,531 INFO L82 PathProgramCache]: Analyzing trace with hash 23284980, now seen corresponding path program 1 times [2018-01-25 06:10:18,531 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:18,533 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:18,533 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:18,533 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:18,533 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:18,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:18,546 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:18,593 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:10:18,593 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:10:18,594 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 06:10:18,594 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:10:18,594 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 06:10:18,594 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 06:10:18,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 06:10:18,595 INFO L87 Difference]: Start difference. First operand 125 states and 132 transitions. Second operand 3 states. [2018-01-25 06:10:18,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:10:18,745 INFO L93 Difference]: Finished difference Result 141 states and 148 transitions. [2018-01-25 06:10:18,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 06:10:18,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-01-25 06:10:18,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:10:18,748 INFO L225 Difference]: With dead ends: 141 [2018-01-25 06:10:18,748 INFO L226 Difference]: Without dead ends: 129 [2018-01-25 06:10:18,748 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 06:10:18,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-01-25 06:10:18,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 121. [2018-01-25 06:10:18,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-01-25 06:10:18,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 127 transitions. [2018-01-25 06:10:18,776 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 127 transitions. Word has length 27 [2018-01-25 06:10:18,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:10:18,776 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 127 transitions. [2018-01-25 06:10:18,776 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 06:10:18,777 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 127 transitions. [2018-01-25 06:10:18,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 06:10:18,777 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:18,778 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:10:18,778 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:10:18,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1295663626, now seen corresponding path program 1 times [2018-01-25 06:10:18,778 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:18,779 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:18,779 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:18,780 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:18,780 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:18,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:18,790 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:18,846 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:10:18,847 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:10:18,847 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 06:10:18,847 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:10:18,847 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:10:18,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:10:18,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:10:18,848 INFO L87 Difference]: Start difference. First operand 121 states and 127 transitions. Second operand 6 states. [2018-01-25 06:10:18,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:10:18,897 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2018-01-25 06:10:18,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:10:18,900 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-01-25 06:10:18,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:10:18,902 INFO L225 Difference]: With dead ends: 125 [2018-01-25 06:10:18,902 INFO L226 Difference]: Without dead ends: 113 [2018-01-25 06:10:18,903 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:10:18,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-25 06:10:18,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-01-25 06:10:18,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-25 06:10:18,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 118 transitions. [2018-01-25 06:10:18,913 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 118 transitions. Word has length 29 [2018-01-25 06:10:18,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:10:18,913 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 118 transitions. [2018-01-25 06:10:18,913 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:10:18,913 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2018-01-25 06:10:18,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 06:10:18,914 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:18,914 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:10:18,914 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:10:18,915 INFO L82 PathProgramCache]: Analyzing trace with hash 522747174, now seen corresponding path program 1 times [2018-01-25 06:10:18,915 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:18,916 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:18,916 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:18,916 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:18,916 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:18,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:18,933 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:18,965 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:10:18,965 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:10:18,965 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 06:10:18,965 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:10:18,966 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:10:18,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:10:18,966 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:10:18,966 INFO L87 Difference]: Start difference. First operand 113 states and 118 transitions. Second operand 4 states. [2018-01-25 06:10:19,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:10:19,014 INFO L93 Difference]: Finished difference Result 205 states and 215 transitions. [2018-01-25 06:10:19,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 06:10:19,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-01-25 06:10:19,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:10:19,016 INFO L225 Difference]: With dead ends: 205 [2018-01-25 06:10:19,016 INFO L226 Difference]: Without dead ends: 114 [2018-01-25 06:10:19,017 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:10:19,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-25 06:10:19,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-01-25 06:10:19,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-25 06:10:19,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2018-01-25 06:10:19,027 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 34 [2018-01-25 06:10:19,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:10:19,027 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2018-01-25 06:10:19,027 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:10:19,028 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2018-01-25 06:10:19,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-25 06:10:19,028 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:19,029 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:10:19,029 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:10:19,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1305776369, now seen corresponding path program 1 times [2018-01-25 06:10:19,029 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:19,030 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:19,030 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:19,031 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:19,031 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:19,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:19,046 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:19,089 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:10:19,089 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:10:19,089 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:10:19,090 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-01-25 06:10:19,091 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [27], [32], [48], [53], [57], [61], [64], [66], [67], [71], [73], [74], [114], [117], [118], [119], [121], [122], [123], [131], [132], [133], [134], [135], [137], [141], [145], [149], [161], [162], [163] [2018-01-25 06:10:19,134 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:10:19,134 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:10:22,299 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 06:10:22,301 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:10:22,312 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 06:10:22,312 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:10:22,313 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:10:22,331 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:22,332 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:10:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:22,379 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:10:22,398 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:10:22,399 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:10:22,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:10:22,516 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:10:22,516 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:10:22,519 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:22,520 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:10:22,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:22,567 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:10:22,572 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:10:22,573 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:10:22,645 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:10:22,648 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 06:10:22,648 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5] total 9 [2018-01-25 06:10:22,648 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 06:10:22,649 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:10:22,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:10:22,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-01-25 06:10:22,649 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 6 states. [2018-01-25 06:10:22,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:10:22,703 INFO L93 Difference]: Finished difference Result 206 states and 216 transitions. [2018-01-25 06:10:22,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:10:22,703 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-25 06:10:22,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:10:22,704 INFO L225 Difference]: With dead ends: 206 [2018-01-25 06:10:22,704 INFO L226 Difference]: Without dead ends: 115 [2018-01-25 06:10:22,705 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:10:22,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-25 06:10:22,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-01-25 06:10:22,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-25 06:10:22,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 120 transitions. [2018-01-25 06:10:22,715 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 120 transitions. Word has length 35 [2018-01-25 06:10:22,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:10:22,715 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 120 transitions. [2018-01-25 06:10:22,715 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:10:22,716 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 120 transitions. [2018-01-25 06:10:22,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-25 06:10:22,717 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:22,717 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:10:22,717 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:10:22,717 INFO L82 PathProgramCache]: Analyzing trace with hash 2139535942, now seen corresponding path program 2 times [2018-01-25 06:10:22,717 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:22,719 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:22,719 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:22,719 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:22,719 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:22,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:22,738 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:22,826 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:10:22,827 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:10:22,827 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:10:22,827 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 06:10:22,827 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:10:22,827 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:10:22,827 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:10:22,842 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 06:10:22,842 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 06:10:22,866 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:10:22,879 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:10:22,884 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:10:22,917 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:10:22,918 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:10:22,953 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:10:22,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:10:22,967 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:10:22,967 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-25 06:10:23,664 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:10:23,664 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:10:24,270 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:10:24,290 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 06:10:24,290 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14, 13] imperfect sequences [6] total 31 [2018-01-25 06:10:24,290 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:10:24,291 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-25 06:10:24,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-25 06:10:24,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=840, Unknown=0, NotChecked=0, Total=930 [2018-01-25 06:10:24,292 INFO L87 Difference]: Start difference. First operand 115 states and 120 transitions. Second operand 15 states. [2018-01-25 06:10:26,375 WARN L143 SmtUtils]: Spent 2028ms on a formula simplification that was a NOOP. DAG size: 39 [2018-01-25 06:10:27,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:10:27,081 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2018-01-25 06:10:27,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-25 06:10:27,081 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2018-01-25 06:10:27,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:10:27,082 INFO L225 Difference]: With dead ends: 115 [2018-01-25 06:10:27,082 INFO L226 Difference]: Without dead ends: 114 [2018-01-25 06:10:27,083 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=118, Invalid=1072, Unknown=0, NotChecked=0, Total=1190 [2018-01-25 06:10:27,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-25 06:10:27,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-01-25 06:10:27,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-25 06:10:27,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2018-01-25 06:10:27,099 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 36 [2018-01-25 06:10:27,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:10:27,100 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2018-01-25 06:10:27,100 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-25 06:10:27,100 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2018-01-25 06:10:27,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-25 06:10:27,101 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:27,101 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:10:27,102 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:10:27,102 INFO L82 PathProgramCache]: Analyzing trace with hash 2139535941, now seen corresponding path program 1 times [2018-01-25 06:10:27,102 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:27,103 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:27,104 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 06:10:27,104 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:27,104 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:27,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:27,119 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:27,236 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:10:27,249 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:10:27,249 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 06:10:27,249 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:10:27,250 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 06:10:27,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 06:10:27,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:10:27,251 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 10 states. [2018-01-25 06:10:27,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:10:27,555 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2018-01-25 06:10:27,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 06:10:27,583 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-01-25 06:10:27,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:10:27,583 INFO L225 Difference]: With dead ends: 114 [2018-01-25 06:10:27,584 INFO L226 Difference]: Without dead ends: 113 [2018-01-25 06:10:27,584 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:10:27,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-25 06:10:27,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-01-25 06:10:27,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-25 06:10:27,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 118 transitions. [2018-01-25 06:10:27,594 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 118 transitions. Word has length 36 [2018-01-25 06:10:27,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:10:27,594 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 118 transitions. [2018-01-25 06:10:27,594 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 06:10:27,595 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2018-01-25 06:10:27,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-25 06:10:27,596 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:27,596 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:10:27,596 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:10:27,596 INFO L82 PathProgramCache]: Analyzing trace with hash 562133952, now seen corresponding path program 1 times [2018-01-25 06:10:27,596 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:27,598 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:27,598 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:27,598 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:27,598 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:27,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:27,612 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:27,696 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:10:27,696 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:10:27,696 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 06:10:27,696 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:10:27,696 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 06:10:27,696 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 06:10:27,697 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:10:27,697 INFO L87 Difference]: Start difference. First operand 113 states and 118 transitions. Second operand 10 states. [2018-01-25 06:10:28,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:10:28,028 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2018-01-25 06:10:28,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 06:10:28,028 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2018-01-25 06:10:28,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:10:28,029 INFO L225 Difference]: With dead ends: 113 [2018-01-25 06:10:28,029 INFO L226 Difference]: Without dead ends: 111 [2018-01-25 06:10:28,029 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:10:28,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-25 06:10:28,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-01-25 06:10:28,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-25 06:10:28,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 116 transitions. [2018-01-25 06:10:28,039 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 116 transitions. Word has length 41 [2018-01-25 06:10:28,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:10:28,039 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 116 transitions. [2018-01-25 06:10:28,039 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 06:10:28,039 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 116 transitions. [2018-01-25 06:10:28,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-25 06:10:28,040 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:28,040 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:10:28,040 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:10:28,041 INFO L82 PathProgramCache]: Analyzing trace with hash 562133953, now seen corresponding path program 1 times [2018-01-25 06:10:28,041 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:28,041 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:28,042 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:28,042 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:28,042 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:28,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:28,056 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:28,155 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:10:28,155 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:10:28,155 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:10:28,155 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-01-25 06:10:28,156 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [27], [32], [48], [53], [57], [61], [62], [65], [66], [67], [71], [73], [74], [106], [109], [114], [117], [118], [119], [121], [122], [123], [131], [132], [133], [134], [135], [137], [141], [145], [149], [150], [151], [161], [162], [163] [2018-01-25 06:10:28,158 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:10:28,158 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:10:30,940 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 06:10:30,940 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:10:30,951 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 06:10:30,951 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:10:30,951 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:10:30,965 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:30,966 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:10:31,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:31,003 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:10:31,088 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:10:31,088 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:10:31,424 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:10:31,444 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:10:31,444 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:10:31,455 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:31,455 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:10:31,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:31,508 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:10:31,514 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:10:31,514 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:10:31,689 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:10:31,690 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 06:10:31,691 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6] total 11 [2018-01-25 06:10:31,691 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 06:10:31,691 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 06:10:31,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 06:10:31,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-01-25 06:10:31,692 INFO L87 Difference]: Start difference. First operand 111 states and 116 transitions. Second operand 7 states. [2018-01-25 06:10:31,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:10:31,748 INFO L93 Difference]: Finished difference Result 199 states and 209 transitions. [2018-01-25 06:10:31,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:10:31,748 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-01-25 06:10:31,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:10:31,749 INFO L225 Difference]: With dead ends: 199 [2018-01-25 06:10:31,749 INFO L226 Difference]: Without dead ends: 112 [2018-01-25 06:10:31,750 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2018-01-25 06:10:31,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-25 06:10:31,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-01-25 06:10:31,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-25 06:10:31,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2018-01-25 06:10:31,764 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 41 [2018-01-25 06:10:31,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:10:31,764 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2018-01-25 06:10:31,764 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 06:10:31,764 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2018-01-25 06:10:31,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-25 06:10:31,765 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:31,765 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:10:31,765 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:10:31,766 INFO L82 PathProgramCache]: Analyzing trace with hash 258949560, now seen corresponding path program 2 times [2018-01-25 06:10:31,766 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:31,767 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:31,767 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:31,767 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:31,767 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:31,782 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:31,840 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:10:31,841 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:10:31,841 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:10:31,841 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 06:10:31,841 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:10:31,841 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:10:31,841 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:10:31,853 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 06:10:31,853 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 06:10:31,882 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:10:31,886 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:10:31,891 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:10:31,896 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:10:31,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:10:31,917 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:10:31,917 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:10:31,935 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:10:31,936 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-25 06:10:32,410 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:10:32,410 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:10:33,482 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:10:33,503 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 06:10:33,503 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15, 13] imperfect sequences [7] total 33 [2018-01-25 06:10:33,504 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:10:33,504 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-25 06:10:33,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-25 06:10:33,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=951, Unknown=0, NotChecked=0, Total=1056 [2018-01-25 06:10:33,505 INFO L87 Difference]: Start difference. First operand 112 states and 117 transitions. Second operand 16 states. [2018-01-25 06:10:35,607 WARN L143 SmtUtils]: Spent 2057ms on a formula simplification that was a NOOP. DAG size: 39 [2018-01-25 06:10:36,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:10:36,177 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2018-01-25 06:10:36,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-25 06:10:36,178 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2018-01-25 06:10:36,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:10:36,179 INFO L225 Difference]: With dead ends: 112 [2018-01-25 06:10:36,179 INFO L226 Difference]: Without dead ends: 110 [2018-01-25 06:10:36,180 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=136, Invalid=1196, Unknown=0, NotChecked=0, Total=1332 [2018-01-25 06:10:36,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-01-25 06:10:36,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-01-25 06:10:36,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-01-25 06:10:36,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 115 transitions. [2018-01-25 06:10:36,196 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 115 transitions. Word has length 42 [2018-01-25 06:10:36,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:10:36,197 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 115 transitions. [2018-01-25 06:10:36,197 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-25 06:10:36,197 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 115 transitions. [2018-01-25 06:10:36,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-25 06:10:36,198 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:36,198 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:10:36,198 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:10:36,198 INFO L82 PathProgramCache]: Analyzing trace with hash -916811563, now seen corresponding path program 1 times [2018-01-25 06:10:36,198 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:36,199 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:36,199 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 06:10:36,200 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:36,200 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:36,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:36,213 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:36,269 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:10:36,269 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:10:36,269 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 06:10:36,269 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:10:36,270 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 06:10:36,270 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 06:10:36,270 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-25 06:10:36,270 INFO L87 Difference]: Start difference. First operand 110 states and 115 transitions. Second operand 8 states. [2018-01-25 06:10:36,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:10:36,332 INFO L93 Difference]: Finished difference Result 173 states and 180 transitions. [2018-01-25 06:10:36,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 06:10:36,332 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-01-25 06:10:36,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:10:36,333 INFO L225 Difference]: With dead ends: 173 [2018-01-25 06:10:36,333 INFO L226 Difference]: Without dead ends: 110 [2018-01-25 06:10:36,333 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:10:36,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-01-25 06:10:36,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-01-25 06:10:36,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-01-25 06:10:36,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2018-01-25 06:10:36,345 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 47 [2018-01-25 06:10:36,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:10:36,345 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2018-01-25 06:10:36,345 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 06:10:36,345 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2018-01-25 06:10:36,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-25 06:10:36,346 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:36,346 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:10:36,346 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:10:36,346 INFO L82 PathProgramCache]: Analyzing trace with hash -396278647, now seen corresponding path program 1 times [2018-01-25 06:10:36,347 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:36,348 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:36,348 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:36,348 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:36,348 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:36,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:36,359 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:36,436 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:10:36,436 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:10:36,436 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-25 06:10:36,436 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:10:36,437 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 06:10:36,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 06:10:36,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:10:36,437 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand 10 states. [2018-01-25 06:10:36,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:10:36,521 INFO L93 Difference]: Finished difference Result 175 states and 181 transitions. [2018-01-25 06:10:36,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 06:10:36,522 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2018-01-25 06:10:36,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:10:36,523 INFO L225 Difference]: With dead ends: 175 [2018-01-25 06:10:36,523 INFO L226 Difference]: Without dead ends: 110 [2018-01-25 06:10:36,523 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:10:36,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-01-25 06:10:36,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-01-25 06:10:36,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-01-25 06:10:36,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 113 transitions. [2018-01-25 06:10:36,538 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 113 transitions. Word has length 52 [2018-01-25 06:10:36,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:10:36,538 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 113 transitions. [2018-01-25 06:10:36,538 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 06:10:36,538 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2018-01-25 06:10:36,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-25 06:10:36,539 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:36,539 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:10:36,539 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:10:36,540 INFO L82 PathProgramCache]: Analyzing trace with hash 401221152, now seen corresponding path program 1 times [2018-01-25 06:10:36,540 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:36,541 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:36,541 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:36,541 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:36,541 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:36,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:36,560 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:36,766 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:10:36,766 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:10:36,766 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-01-25 06:10:36,766 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:10:36,766 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-25 06:10:36,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-25 06:10:36,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-01-25 06:10:36,767 INFO L87 Difference]: Start difference. First operand 110 states and 113 transitions. Second operand 21 states. [2018-01-25 06:10:37,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:10:37,177 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2018-01-25 06:10:37,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-25 06:10:37,177 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 63 [2018-01-25 06:10:37,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:10:37,178 INFO L225 Difference]: With dead ends: 119 [2018-01-25 06:10:37,178 INFO L226 Difference]: Without dead ends: 117 [2018-01-25 06:10:37,179 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:10:37,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-25 06:10:37,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2018-01-25 06:10:37,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-25 06:10:37,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 111 transitions. [2018-01-25 06:10:37,189 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 111 transitions. Word has length 63 [2018-01-25 06:10:37,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:10:37,189 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 111 transitions. [2018-01-25 06:10:37,189 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-25 06:10:37,190 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 111 transitions. [2018-01-25 06:10:37,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-25 06:10:37,190 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:37,191 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:10:37,191 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:10:37,191 INFO L82 PathProgramCache]: Analyzing trace with hash 401221153, now seen corresponding path program 1 times [2018-01-25 06:10:37,191 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:37,192 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:37,192 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:37,192 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:37,192 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:37,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:37,209 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:37,263 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:10:37,264 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:10:37,264 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:10:37,264 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 64 with the following transitions: [2018-01-25 06:10:37,264 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [12], [13], [17], [20], [27], [32], [34], [35], [38], [48], [50], [53], [57], [60], [61], [62], [65], [66], [67], [71], [73], [74], [75], [106], [107], [110], [113], [114], [117], [118], [119], [121], [122], [123], [124], [131], [132], [133], [134], [135], [136], [137], [139], [141], [142], [145], [146], [147], [149], [150], [151], [152], [153], [159], [161], [162], [163] [2018-01-25 06:10:37,266 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:10:37,267 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:10:40,882 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 06:10:40,882 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:10:40,884 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 06:10:40,885 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:10:40,885 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:10:40,898 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:40,898 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:10:40,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:40,941 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:10:40,960 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:10:40,961 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:10:41,078 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:10:41,098 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:10:41,099 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:10:41,102 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:41,102 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:10:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:41,172 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:10:41,178 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:10:41,178 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:10:41,253 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:10:41,255 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 06:10:41,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 13 [2018-01-25 06:10:41,256 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 06:10:41,256 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 06:10:41,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 06:10:41,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-01-25 06:10:41,257 INFO L87 Difference]: Start difference. First operand 108 states and 111 transitions. Second operand 8 states. [2018-01-25 06:10:41,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:10:41,287 INFO L93 Difference]: Finished difference Result 192 states and 198 transitions. [2018-01-25 06:10:41,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 06:10:41,288 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2018-01-25 06:10:41,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:10:41,289 INFO L225 Difference]: With dead ends: 192 [2018-01-25 06:10:41,289 INFO L226 Difference]: Without dead ends: 109 [2018-01-25 06:10:41,290 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 244 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=77, Invalid=105, Unknown=0, NotChecked=0, Total=182 [2018-01-25 06:10:41,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-25 06:10:41,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-01-25 06:10:41,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-25 06:10:41,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 112 transitions. [2018-01-25 06:10:41,308 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 112 transitions. Word has length 63 [2018-01-25 06:10:41,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:10:41,309 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 112 transitions. [2018-01-25 06:10:41,309 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 06:10:41,309 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 112 transitions. [2018-01-25 06:10:41,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-25 06:10:41,310 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:41,310 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:10:41,310 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:10:41,311 INFO L82 PathProgramCache]: Analyzing trace with hash -421459752, now seen corresponding path program 2 times [2018-01-25 06:10:41,311 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:41,312 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:41,312 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:41,312 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:41,313 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:41,336 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:41,425 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:10:41,425 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:10:41,425 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:10:41,425 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 06:10:41,425 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:10:41,426 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:10:41,426 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:10:41,431 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 06:10:41,432 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 06:10:41,458 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:10:41,462 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:10:41,465 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:10:41,470 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:10:41,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:10:41,482 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:10:41,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:10:41,493 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:10:41,493 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-25 06:10:42,233 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:10:42,233 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:10:43,180 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:10:43,206 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 06:10:43,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20, 18] imperfect sequences [8] total 44 [2018-01-25 06:10:43,206 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:10:43,206 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-25 06:10:43,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-25 06:10:43,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1746, Unknown=0, NotChecked=0, Total=1892 [2018-01-25 06:10:43,207 INFO L87 Difference]: Start difference. First operand 109 states and 112 transitions. Second operand 21 states. [2018-01-25 06:10:44,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:10:44,315 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2018-01-25 06:10:44,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-25 06:10:44,316 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-01-25 06:10:44,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:10:44,317 INFO L225 Difference]: With dead ends: 109 [2018-01-25 06:10:44,317 INFO L226 Difference]: Without dead ends: 107 [2018-01-25 06:10:44,318 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=195, Invalid=2255, Unknown=0, NotChecked=0, Total=2450 [2018-01-25 06:10:44,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-25 06:10:44,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-01-25 06:10:44,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-25 06:10:44,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 110 transitions. [2018-01-25 06:10:44,336 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 110 transitions. Word has length 64 [2018-01-25 06:10:44,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:10:44,337 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 110 transitions. [2018-01-25 06:10:44,337 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-25 06:10:44,337 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2018-01-25 06:10:44,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-25 06:10:44,338 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:44,338 INFO L322 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:10:44,338 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:10:44,338 INFO L82 PathProgramCache]: Analyzing trace with hash -713687403, now seen corresponding path program 1 times [2018-01-25 06:10:44,338 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:44,339 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:44,340 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 06:10:44,340 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:44,340 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:44,356 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:44,440 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:10:44,440 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:10:44,440 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-25 06:10:44,440 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:10:44,441 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-25 06:10:44,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-25 06:10:44,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-01-25 06:10:44,441 INFO L87 Difference]: Start difference. First operand 107 states and 110 transitions. Second operand 11 states. [2018-01-25 06:10:44,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:10:44,547 INFO L93 Difference]: Finished difference Result 113 states and 115 transitions. [2018-01-25 06:10:44,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 06:10:44,547 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2018-01-25 06:10:44,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:10:44,548 INFO L225 Difference]: With dead ends: 113 [2018-01-25 06:10:44,548 INFO L226 Difference]: Without dead ends: 107 [2018-01-25 06:10:44,548 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-01-25 06:10:44,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-25 06:10:44,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-01-25 06:10:44,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-25 06:10:44,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 109 transitions. [2018-01-25 06:10:44,560 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 109 transitions. Word has length 62 [2018-01-25 06:10:44,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:10:44,560 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 109 transitions. [2018-01-25 06:10:44,560 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-25 06:10:44,561 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions. [2018-01-25 06:10:44,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-01-25 06:10:44,561 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:44,561 INFO L322 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:10:44,561 INFO L371 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-25 06:10:44,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1331716926, now seen corresponding path program 1 times [2018-01-25 06:10:44,562 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:44,562 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:44,562 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:44,562 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:44,563 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:44,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:44,584 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:45,209 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:10:45,210 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:10:45,210 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-01-25 06:10:45,210 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:10:45,210 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-25 06:10:45,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-25 06:10:45,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-01-25 06:10:45,211 INFO L87 Difference]: Start difference. First operand 107 states and 109 transitions. Second operand 24 states. [2018-01-25 06:10:45,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:10:45,688 INFO L93 Difference]: Finished difference Result 112 states and 114 transitions. [2018-01-25 06:10:45,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-25 06:10:45,688 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 78 [2018-01-25 06:10:45,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:10:45,689 INFO L225 Difference]: With dead ends: 112 [2018-01-25 06:10:45,689 INFO L226 Difference]: Without dead ends: 110 [2018-01-25 06:10:45,689 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2018-01-25 06:10:45,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-01-25 06:10:45,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 105. [2018-01-25 06:10:45,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-25 06:10:45,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2018-01-25 06:10:45,701 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 78 [2018-01-25 06:10:45,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:10:45,701 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2018-01-25 06:10:45,701 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-25 06:10:45,701 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2018-01-25 06:10:45,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-01-25 06:10:45,702 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:45,702 INFO L322 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:10:45,702 INFO L371 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-25 06:10:45,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1331716925, now seen corresponding path program 1 times [2018-01-25 06:10:45,702 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:45,703 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:45,703 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:45,703 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:45,703 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:45,725 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:45,826 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:10:45,827 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:10:45,827 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:10:45,827 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 79 with the following transitions: [2018-01-25 06:10:45,827 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [12], [13], [17], [20], [27], [32], [34], [35], [36], [39], [40], [43], [44], [45], [48], [50], [53], [57], [60], [61], [62], [65], [66], [67], [71], [73], [74], [75], [77], [80], [85], [88], [91], [106], [107], [110], [113], [114], [117], [118], [119], [121], [122], [123], [124], [131], [132], [133], [134], [135], [136], [137], [139], [141], [142], [143], [145], [146], [147], [149], [150], [151], [152], [153], [154], [155], [157], [159], [161], [162], [163] [2018-01-25 06:10:45,829 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:10:45,830 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:10:49,327 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 06:10:49,327 INFO L268 AbstractInterpreter]: Visited 75 different actions 83 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 27 variables. [2018-01-25 06:10:49,332 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 06:10:49,332 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:10:49,332 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 06:10:49,344 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:49,344 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:10:49,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:49,388 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:10:49,396 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:10:49,397 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:10:49,570 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:10:49,591 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:10:49,591 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 06:10:49,594 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:49,594 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:10:49,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:49,675 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:10:49,681 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:10:49,682 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:10:49,738 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:10:49,739 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 06:10:49,739 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8] total 15 [2018-01-25 06:10:49,740 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 06:10:49,740 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 06:10:49,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 06:10:49,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-01-25 06:10:49,740 INFO L87 Difference]: Start difference. First operand 105 states and 107 transitions. Second operand 9 states. [2018-01-25 06:10:49,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:10:49,772 INFO L93 Difference]: Finished difference Result 185 states and 189 transitions. [2018-01-25 06:10:49,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 06:10:49,773 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2018-01-25 06:10:49,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:10:49,774 INFO L225 Difference]: With dead ends: 185 [2018-01-25 06:10:49,774 INFO L226 Difference]: Without dead ends: 106 [2018-01-25 06:10:49,774 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 303 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=137, Unknown=0, NotChecked=0, Total=240 [2018-01-25 06:10:49,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-25 06:10:49,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-01-25 06:10:49,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-25 06:10:49,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2018-01-25 06:10:49,787 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 108 transitions. Word has length 78 [2018-01-25 06:10:49,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:10:49,787 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 108 transitions. [2018-01-25 06:10:49,787 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 06:10:49,787 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 108 transitions. [2018-01-25 06:10:49,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-25 06:10:49,789 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:49,789 INFO L322 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:10:49,789 INFO L371 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-25 06:10:49,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1544426796, now seen corresponding path program 2 times [2018-01-25 06:10:49,789 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:49,790 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:49,790 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:49,791 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:49,791 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:49,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:49,812 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:49,925 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:10:49,925 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:10:49,925 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:10:49,925 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 06:10:49,925 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:10:49,925 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:10:49,926 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 06:10:49,933 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 06:10:49,933 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 06:10:49,976 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:10:49,981 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:10:49,985 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:10:49,988 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:10:49,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:10:50,002 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:10:50,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:10:50,014 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:10:50,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-25 06:10:50,889 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-25 06:10:50,890 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:10:53,714 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-25 06:10:53,734 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 06:10:53,734 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24, 22] imperfect sequences [9] total 53 [2018-01-25 06:10:53,734 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:10:53,735 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-25 06:10:53,735 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-25 06:10:53,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=2574, Unknown=1, NotChecked=0, Total=2756 [2018-01-25 06:10:53,736 INFO L87 Difference]: Start difference. First operand 106 states and 108 transitions. Second operand 25 states. [2018-01-25 06:10:55,832 WARN L143 SmtUtils]: Spent 2035ms on a formula simplification that was a NOOP. DAG size: 39 [2018-01-25 06:10:56,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:10:56,951 INFO L93 Difference]: Finished difference Result 106 states and 108 transitions. [2018-01-25 06:10:56,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-25 06:10:56,952 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 79 [2018-01-25 06:10:56,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:10:56,953 INFO L225 Difference]: With dead ends: 106 [2018-01-25 06:10:56,953 INFO L226 Difference]: Without dead ends: 104 [2018-01-25 06:10:56,954 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 111 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=246, Invalid=3413, Unknown=1, NotChecked=0, Total=3660 [2018-01-25 06:10:56,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-25 06:10:56,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-01-25 06:10:56,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-25 06:10:56,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2018-01-25 06:10:56,973 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 106 transitions. Word has length 79 [2018-01-25 06:10:56,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:10:56,973 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 106 transitions. [2018-01-25 06:10:56,974 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-25 06:10:56,974 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2018-01-25 06:10:56,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-01-25 06:10:56,975 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:56,975 INFO L322 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:10:56,975 INFO L371 AbstractCegarLoop]: === Iteration 23 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-25 06:10:56,975 INFO L82 PathProgramCache]: Analyzing trace with hash -814306387, now seen corresponding path program 1 times [2018-01-25 06:10:56,976 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:56,977 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:56,977 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 06:10:56,977 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:56,977 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:57,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:57,003 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:57,118 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:10:57,119 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:10:57,119 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:10:57,119 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 84 with the following transitions: [2018-01-25 06:10:57,120 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [12], [13], [17], [20], [27], [32], [34], [35], [36], [39], [40], [43], [44], [45], [48], [50], [53], [57], [60], [61], [62], [65], [66], [67], [71], [73], [74], [75], [77], [80], [85], [88], [89], [92], [93], [98], [100], [106], [107], [110], [113], [114], [117], [118], [119], [121], [122], [123], [124], [131], [132], [133], [134], [135], [136], [137], [139], [141], [142], [143], [145], [146], [147], [149], [150], [151], [152], [153], [154], [155], [157], [159], [161], [162], [163] [2018-01-25 06:10:57,122 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:10:57,122 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-25 06:11:00,335 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-25 06:11:00,335 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-25 06:11:00,336 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:11:00,336 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:11:00,336 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 06:11:00,341 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:00,342 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:11:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:00,389 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:11:00,394 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 06:11:00,394 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 06:11:00,398 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 06:11:00,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 06:11:00 BoogieIcfgContainer [2018-01-25 06:11:00,398 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 06:11:00,399 INFO L168 Benchmark]: Toolchain (without parser) took 44112.42 ms. Allocated memory was 306.2 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 265.1 MB in the beginning and 1.0 GB in the end (delta: -778.8 MB). Peak memory consumption was 502.0 MB. Max. memory is 5.3 GB. [2018-01-25 06:11:00,400 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 306.2 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 06:11:00,400 INFO L168 Benchmark]: CACSL2BoogieTranslator took 232.82 ms. Allocated memory is still 306.2 MB. Free memory was 265.1 MB in the beginning and 250.7 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:11:00,400 INFO L168 Benchmark]: Boogie Preprocessor took 41.20 ms. Allocated memory is still 306.2 MB. Free memory was 250.7 MB in the beginning and 248.7 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:11:00,400 INFO L168 Benchmark]: RCFGBuilder took 427.26 ms. Allocated memory is still 306.2 MB. Free memory was 248.7 MB in the beginning and 218.5 MB in the end (delta: 30.2 MB). Peak memory consumption was 30.2 MB. Max. memory is 5.3 GB. [2018-01-25 06:11:00,400 INFO L168 Benchmark]: TraceAbstraction took 43402.58 ms. Allocated memory was 306.2 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 218.5 MB in the beginning and 1.0 GB in the end (delta: -825.4 MB). Peak memory consumption was 455.5 MB. Max. memory is 5.3 GB. [2018-01-25 06:11:00,403 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.20 ms. Allocated memory is still 306.2 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 232.82 ms. Allocated memory is still 306.2 MB. Free memory was 265.1 MB in the beginning and 250.7 MB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.20 ms. Allocated memory is still 306.2 MB. Free memory was 250.7 MB in the beginning and 248.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 427.26 ms. Allocated memory is still 306.2 MB. Free memory was 248.7 MB in the beginning and 218.5 MB in the end (delta: 30.2 MB). Peak memory consumption was 30.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 43402.58 ms. Allocated memory was 306.2 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 218.5 MB in the beginning and 1.0 GB in the end (delta: -825.4 MB). Peak memory consumption was 455.5 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.515936 RENAME_VARIABLES(MILLISECONDS) : 0.131737 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.241248 PROJECTAWAY(MILLISECONDS) : 0.074370 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.100233 DISJOIN(MILLISECONDS) : 0.949171 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.156500 ADD_EQUALITY(MILLISECONDS) : 0.021364 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.005147 #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.233864 RENAME_VARIABLES(MILLISECONDS) : 0.053583 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.098052 PROJECTAWAY(MILLISECONDS) : 0.024325 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.048109 DISJOIN(MILLISECONDS) : 0.418297 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.069032 ADD_EQUALITY(MILLISECONDS) : 0.018610 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.006256 #CONJOIN_DISJUNCTIVE : 96 #RENAME_VARIABLES : 160 #UNFREEZE : 0 #CONJOIN : 203 #PROJECTAWAY : 159 #ADD_WEAK_EQUALITY : 15 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 156 #ADD_EQUALITY : 128 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 60 LocStat_MAX_WEQGRAPH_SIZE : 6 LocStat_MAX_SIZEOF_WEQEDGELABEL : 4 LocStat_NO_SUPPORTING_EQUALITIES : 486 LocStat_NO_SUPPORTING_DISEQUALITIES : 51 LocStat_NO_DISJUNCTIONS : -120 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 89 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 2 TransStat_NO_SUPPORTING_EQUALITIES : 190 TransStat_NO_SUPPORTING_DISEQUALITIES : 11 TransStat_NO_DISJUNCTIONS : 94 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.390448 RENAME_VARIABLES(MILLISECONDS) : 0.093543 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.166382 PROJECTAWAY(MILLISECONDS) : 0.043962 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.046242 DISJOIN(MILLISECONDS) : 0.598872 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.119115 ADD_EQUALITY(MILLISECONDS) : 0.015275 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.006109 #CONJOIN_DISJUNCTIVE : 138 #RENAME_VARIABLES : 223 #UNFREEZE : 0 #CONJOIN : 310 #PROJECTAWAY : 230 #ADD_WEAK_EQUALITY : 27 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 218 #ADD_EQUALITY : 206 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 10 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 74 LocStat_MAX_WEQGRAPH_SIZE : 6 LocStat_MAX_SIZEOF_WEQEDGELABEL : 4 LocStat_NO_SUPPORTING_EQUALITIES : 626 LocStat_NO_SUPPORTING_DISEQUALITIES : 65 LocStat_NO_DISJUNCTIONS : -148 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 109 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 2 TransStat_NO_SUPPORTING_EQUALITIES : 222 TransStat_NO_SUPPORTING_DISEQUALITIES : 11 TransStat_NO_DISJUNCTIONS : 114 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.290615 RENAME_VARIABLES(MILLISECONDS) : 0.089707 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.119150 PROJECTAWAY(MILLISECONDS) : 0.036688 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.032979 DISJOIN(MILLISECONDS) : 0.385929 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.111218 ADD_EQUALITY(MILLISECONDS) : 0.016073 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.005990 #CONJOIN_DISJUNCTIVE : 161 #RENAME_VARIABLES : 260 #UNFREEZE : 0 #CONJOIN : 358 #PROJECTAWAY : 271 #ADD_WEAK_EQUALITY : 33 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 255 #ADD_EQUALITY : 243 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 10 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1294). Cancelled while BasicCegarLoop was analyzing trace of length 84 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1294). Cancelled while BasicCegarLoop was analyzing trace of length 84 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1411). Cancelled while BasicCegarLoop was analyzing trace of length 84 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1411). Cancelled while BasicCegarLoop was analyzing trace of length 84 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1265). Cancelled while BasicCegarLoop was analyzing trace of length 84 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1265). Cancelled while BasicCegarLoop was analyzing trace of length 84 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1267). Cancelled while BasicCegarLoop was analyzing trace of length 84 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1267). Cancelled while BasicCegarLoop was analyzing trace of length 84 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was analyzing trace of length 84 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was analyzing trace of length 84 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was analyzing trace of length 84 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was analyzing trace of length 84 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1339). Cancelled while BasicCegarLoop was analyzing trace of length 84 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1339). Cancelled while BasicCegarLoop was analyzing trace of length 84 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1441]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1441). Cancelled while BasicCegarLoop was analyzing trace of length 84 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1099). Cancelled while BasicCegarLoop was analyzing trace of length 84 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1100). Cancelled while BasicCegarLoop was analyzing trace of length 84 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1100). Cancelled while BasicCegarLoop was analyzing trace of length 84 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1099). Cancelled while BasicCegarLoop was analyzing trace of length 84 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 18 procedures, 118 locations, 19 error locations. TIMEOUT Result, 43.3s OverallTime, 23 OverallIterations, 5 TraceHistogramMax, 12.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2223 SDtfs, 674 SDslu, 13048 SDs, 0 SdLazy, 5556 SolverSat, 168 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1551 GetRequests, 1174 SyntacticMatches, 17 SemanticMatches, 360 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2367 ImplicationChecksByTransitivity, 17.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 16.3s AbstIntTime, 5 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 32 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 12.2s InterpolantComputationTime, 1646 NumberOfCodeBlocks, 1632 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2255 ConstructedInterpolants, 169 QuantifiedInterpolants, 541222 SizeOfPredicates, 74 NumberOfNonLiveVariables, 3189 ConjunctsInSsa, 289 ConjunctsInUnsatCore, 46 InterpolantComputations, 22 PerfectInterpolantSequences, 112/246 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_06-11-00-417.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_06-11-00-417.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_06-11-00-417.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_06-11-00-417.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_06-11-00-417.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-25_06-11-00-417.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-25_06-11-00-417.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-25_06-11-00-417.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-25_06-11-00-417.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_06-11-00-417.csv Completed graceful shutdown