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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_1_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:20:10,684 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:20:10,685 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:20:10,695 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:20:10,695 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:20:10,696 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:20:10,697 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:20:10,698 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:20:10,700 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:20:10,700 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:20:10,701 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:20:10,701 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:20:10,702 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:20:10,703 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:20:10,704 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:20:10,706 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:20:10,707 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:20:10,709 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:20:10,709 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:20:10,710 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:20:10,712 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:20:10,712 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:20:10,713 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:20:10,713 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:20:10,714 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:20:10,715 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:20:10,715 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:20:10,716 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:20:10,716 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:20:10,716 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:20:10,716 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:20:10,717 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 10:20:10,726 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:20:10,726 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:20:10,727 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:20:10,727 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:20:10,727 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:20:10,728 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:20:10,728 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:20:10,728 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:20:10,728 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:20:10,728 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:20:10,728 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:20:10,729 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:20:10,729 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:20:10,729 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:20:10,729 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:20:10,729 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:20:10,729 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:20:10,730 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:20:10,730 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:20:10,730 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:20:10,730 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:20:10,730 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:20:10,731 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:20:10,758 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:20:10,765 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:20:10,767 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:20:10,768 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:20:10,768 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:20:10,769 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_1_false-valid-memtrack_true-termination.i [2018-02-02 10:20:10,888 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:20:10,890 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:20:10,890 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:20:10,890 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:20:10,896 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:20:10,897 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:20:10" (1/1) ... [2018-02-02 10:20:10,899 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30ce2b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:20:10, skipping insertion in model container [2018-02-02 10:20:10,899 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:20:10" (1/1) ... [2018-02-02 10:20:10,913 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:20:10,949 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:20:11,046 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:20:11,069 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:20:11,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:20:11 WrapperNode [2018-02-02 10:20:11,079 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:20:11,080 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:20:11,080 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:20:11,080 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:20:11,093 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:20:11" (1/1) ... [2018-02-02 10:20:11,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:20:11" (1/1) ... [2018-02-02 10:20:11,104 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:20:11" (1/1) ... [2018-02-02 10:20:11,104 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:20:11" (1/1) ... [2018-02-02 10:20:11,109 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:20:11" (1/1) ... [2018-02-02 10:20:11,112 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:20:11" (1/1) ... [2018-02-02 10:20:11,114 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:20:11" (1/1) ... [2018-02-02 10:20:11,117 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:20:11,117 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:20:11,117 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:20:11,118 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:20:11,118 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:20:11" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-02 10:20:11,162 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:20:11,162 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:20:11,163 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-02-02 10:20:11,163 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 10:20:11,163 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-02-02 10:20:11,163 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2018-02-02 10:20:11,163 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-02-02 10:20:11,163 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-02-02 10:20:11,163 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-02-02 10:20:11,163 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2018-02-02 10:20:11,164 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-02-02 10:20:11,164 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-02-02 10:20:11,164 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-02-02 10:20:11,164 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-02-02 10:20:11,164 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2018-02-02 10:20:11,164 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-02-02 10:20:11,164 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-02-02 10:20:11,164 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-02-02 10:20:11,164 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 10:20:11,164 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:20:11,165 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:20:11,165 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:20:11,165 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:20:11,165 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:20:11,165 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:20:11,165 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:20:11,165 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:20:11,165 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-02 10:20:11,165 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-02 10:20:11,166 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:20:11,166 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:20:11,166 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:20:11,166 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-02 10:20:11,166 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 10:20:11,166 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-02-02 10:20:11,166 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2018-02-02 10:20:11,166 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-02-02 10:20:11,166 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-02-02 10:20:11,167 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-02-02 10:20:11,167 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-02-02 10:20:11,167 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2018-02-02 10:20:11,167 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-02-02 10:20:11,167 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-02-02 10:20:11,167 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-02-02 10:20:11,167 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-02-02 10:20:11,167 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2018-02-02 10:20:11,167 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-02-02 10:20:11,168 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-02-02 10:20:11,168 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-02-02 10:20:11,168 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 10:20:11,168 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:20:11,168 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:20:11,168 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:20:11,356 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-02 10:20:11,498 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:20:11,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:20:11 BoogieIcfgContainer [2018-02-02 10:20:11,499 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:20:11,500 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:20:11,500 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:20:11,503 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:20:11,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:20:10" (1/3) ... [2018-02-02 10:20:11,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20fc48b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:20:11, skipping insertion in model container [2018-02-02 10:20:11,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:20:11" (2/3) ... [2018-02-02 10:20:11,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20fc48b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:20:11, skipping insertion in model container [2018-02-02 10:20:11,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:20:11" (3/3) ... [2018-02-02 10:20:11,506 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test22_1_false-valid-memtrack_true-termination.i [2018-02-02 10:20:11,511 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:20:11,517 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-02-02 10:20:11,540 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:20:11,541 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:20:11,541 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:20:11,541 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:20:11,541 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:20:11,541 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:20:11,541 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:20:11,541 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:20:11,542 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:20:11,552 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states. [2018-02-02 10:20:11,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:20:11,559 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:11,559 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:20:11,560 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_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, 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-02-02 10:20:11,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1956546830, now seen corresponding path program 1 times [2018-02-02 10:20:11,600 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:11,636 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:11,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:11,714 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:20:11,714 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:20:11,715 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:11,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:11,715 INFO L182 omatonBuilderFactory]: Interpolants [145#true, 146#false, 147#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 148#(and (= 0 |ldv_kobject_create_#t~ret17.base|) (= 0 |ldv_kobject_create_#t~ret17.offset|)), 149#(and (= ldv_kobject_create_~kobj~1.offset 0) (= ldv_kobject_create_~kobj~1.base 0))] [2018-02-02 10:20:11,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:11,716 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:20:11,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:20:11,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:20:11,806 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 5 states. [2018-02-02 10:20:11,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:11,858 INFO L93 Difference]: Finished difference Result 148 states and 156 transitions. [2018-02-02 10:20:11,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:20:11,859 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 10:20:11,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:11,869 INFO L225 Difference]: With dead ends: 148 [2018-02-02 10:20:11,869 INFO L226 Difference]: Without dead ends: 145 [2018-02-02 10:20:11,870 INFO L554 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-02-02 10:20:11,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-02 10:20:11,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2018-02-02 10:20:11,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-02 10:20:11,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 151 transitions. [2018-02-02 10:20:11,902 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 151 transitions. Word has length 17 [2018-02-02 10:20:11,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:11,902 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 151 transitions. [2018-02-02 10:20:11,902 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:20:11,902 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 151 transitions. [2018-02-02 10:20:11,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:20:11,903 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:11,903 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:20:11,903 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_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, 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-02-02 10:20:11,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1123892084, now seen corresponding path program 1 times [2018-02-02 10:20:11,904 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:11,919 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:11,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:11,960 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:20:11,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:20:11,960 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:11,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:11,960 INFO L182 omatonBuilderFactory]: Interpolants [441#true, 442#false, 443#(= 1 (select |#valid| |ldv_malloc_#t~malloc4.base|)), 444#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 445#(= 1 (select |#valid| |ldv_kobject_create_#t~ret17.base|)), 446#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base))] [2018-02-02 10:20:11,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:11,962 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:20:11,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:20:11,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:20:11,962 INFO L87 Difference]: Start difference. First operand 143 states and 151 transitions. Second operand 6 states. [2018-02-02 10:20:12,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:12,079 INFO L93 Difference]: Finished difference Result 144 states and 152 transitions. [2018-02-02 10:20:12,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:20:12,079 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 10:20:12,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:12,080 INFO L225 Difference]: With dead ends: 144 [2018-02-02 10:20:12,081 INFO L226 Difference]: Without dead ends: 144 [2018-02-02 10:20:12,081 INFO L554 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-02-02 10:20:12,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-02-02 10:20:12,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2018-02-02 10:20:12,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-02 10:20:12,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 150 transitions. [2018-02-02 10:20:12,089 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 150 transitions. Word has length 19 [2018-02-02 10:20:12,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:12,089 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 150 transitions. [2018-02-02 10:20:12,090 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:20:12,090 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 150 transitions. [2018-02-02 10:20:12,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:20:12,090 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:12,090 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:20:12,090 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_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, 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-02-02 10:20:12,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1123892085, now seen corresponding path program 1 times [2018-02-02 10:20:12,091 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:12,108 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:12,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:12,285 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:20:12,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:20:12,285 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:12,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:12,285 INFO L182 omatonBuilderFactory]: Interpolants [736#false, 737#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 738#(and (= 0 |ldv_malloc_#t~malloc4.offset|) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc4.base|)) (<= 2147483648 |ldv_malloc_#in~size|))), 739#(and (= 0 |ldv_malloc_#res.offset|) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)) (<= 2147483648 |ldv_malloc_#in~size|))), 740#(and (<= 16 (select |#length| |ldv_kobject_create_#t~ret17.base|)) (= 0 |ldv_kobject_create_#t~ret17.offset|)), 741#(and (= ldv_kobject_create_~kobj~1.offset 0) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 735#true] [2018-02-02 10:20:12,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:12,286 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:20:12,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:20:12,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:20:12,286 INFO L87 Difference]: Start difference. First operand 142 states and 150 transitions. Second operand 7 states. [2018-02-02 10:20:12,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:12,480 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2018-02-02 10:20:12,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:20:12,480 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-02-02 10:20:12,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:12,482 INFO L225 Difference]: With dead ends: 143 [2018-02-02 10:20:12,482 INFO L226 Difference]: Without dead ends: 143 [2018-02-02 10:20:12,483 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:20:12,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-02 10:20:12,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2018-02-02 10:20:12,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-02-02 10:20:12,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 149 transitions. [2018-02-02 10:20:12,490 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 149 transitions. Word has length 19 [2018-02-02 10:20:12,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:12,490 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 149 transitions. [2018-02-02 10:20:12,490 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:20:12,490 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 149 transitions. [2018-02-02 10:20:12,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 10:20:12,490 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:12,494 INFO L351 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-02-02 10:20:12,494 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_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, 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-02-02 10:20:12,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1414777661, now seen corresponding path program 1 times [2018-02-02 10:20:12,495 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:12,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:12,506 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:12,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:12,553 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:20:12,553 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:20:12,553 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:12,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:12,553 INFO L182 omatonBuilderFactory]: Interpolants [1030#true, 1031#false, 1032#(and (= 0 |ldv_kobject_create_#res.base|) (= 0 |ldv_kobject_create_#res.offset|)), 1033#(and (= 0 |entry_point_#t~ret19.base|) (= 0 |entry_point_#t~ret19.offset|)), 1034#(and (= 0 entry_point_~kobj~2.base) (= 0 entry_point_~kobj~2.offset)), 1035#(and (= 0 |ldv_kobject_get_#in~kobj.base|) (= 0 |ldv_kobject_get_#in~kobj.offset|)), 1036#(and (= 0 ldv_kobject_get_~kobj.offset) (= ldv_kobject_get_~kobj.base 0))] [2018-02-02 10:20:12,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:12,554 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:20:12,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:20:12,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:20:12,554 INFO L87 Difference]: Start difference. First operand 141 states and 149 transitions. Second operand 7 states. [2018-02-02 10:20:12,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:12,589 INFO L93 Difference]: Finished difference Result 157 states and 166 transitions. [2018-02-02 10:20:12,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:20:12,589 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-02-02 10:20:12,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:12,591 INFO L225 Difference]: With dead ends: 157 [2018-02-02 10:20:12,591 INFO L226 Difference]: Without dead ends: 157 [2018-02-02 10:20:12,591 INFO L554 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-02-02 10:20:12,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-02-02 10:20:12,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 150. [2018-02-02 10:20:12,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-02 10:20:12,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 158 transitions. [2018-02-02 10:20:12,599 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 158 transitions. Word has length 27 [2018-02-02 10:20:12,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:12,600 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 158 transitions. [2018-02-02 10:20:12,600 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:20:12,600 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 158 transitions. [2018-02-02 10:20:12,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:20:12,600 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:12,600 INFO L351 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-02-02 10:20:12,600 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_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, 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-02-02 10:20:12,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1439517623, now seen corresponding path program 1 times [2018-02-02 10:20:12,601 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:12,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:12,615 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:12,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:12,678 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:20:12,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:20:12,679 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:12,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:12,679 INFO L182 omatonBuilderFactory]: Interpolants [1346#true, 1347#false, 1348#(= 1 (select |#valid| |#Ultimate.C_memset_#ptr.base|)), 1349#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base)), 1350#(= 1 (select |#valid| |ldv_kobject_init_#in~kobj.base|)), 1351#(= 1 (select |#valid| ldv_kobject_init_~kobj.base)), 1352#(= 1 (select |#valid| |ldv_kobject_init_internal_#in~kobj.base|)), 1353#(= 1 (select |#valid| ldv_kobject_init_internal_~kobj.base)), 1354#(= 1 (select |#valid| |ldv_kref_init_#in~kref.base|)), 1355#(= 1 (select |#valid| ldv_kref_init_~kref.base))] [2018-02-02 10:20:12,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:12,679 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:20:12,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:20:12,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:20:12,680 INFO L87 Difference]: Start difference. First operand 150 states and 158 transitions. Second operand 10 states. [2018-02-02 10:20:12,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:12,861 INFO L93 Difference]: Finished difference Result 149 states and 157 transitions. [2018-02-02 10:20:12,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:20:12,861 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-02-02 10:20:12,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:12,862 INFO L225 Difference]: With dead ends: 149 [2018-02-02 10:20:12,862 INFO L226 Difference]: Without dead ends: 149 [2018-02-02 10:20:12,862 INFO L554 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-02-02 10:20:12,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-02-02 10:20:12,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-02-02 10:20:12,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-02-02 10:20:12,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 157 transitions. [2018-02-02 10:20:12,867 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 157 transitions. Word has length 34 [2018-02-02 10:20:12,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:12,867 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 157 transitions. [2018-02-02 10:20:12,867 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:20:12,867 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 157 transitions. [2018-02-02 10:20:12,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:20:12,868 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:12,868 INFO L351 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-02-02 10:20:12,868 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_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, 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-02-02 10:20:12,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1439517624, now seen corresponding path program 1 times [2018-02-02 10:20:12,869 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:12,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:12,877 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:12,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:12,910 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:20:12,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:20:12,910 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:12,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:12,911 INFO L182 omatonBuilderFactory]: Interpolants [1660#true, 1661#false, 1662#(= |#Ultimate.C_memset_#t~loopctr21| 0), 1663#(<= |#Ultimate.C_memset_#amount| 0)] [2018-02-02 10:20:12,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:12,911 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:20:12,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:20:12,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:20:12,912 INFO L87 Difference]: Start difference. First operand 149 states and 157 transitions. Second operand 4 states. [2018-02-02 10:20:12,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:12,922 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2018-02-02 10:20:12,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:20:12,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-02-02 10:20:12,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:12,927 INFO L225 Difference]: With dead ends: 152 [2018-02-02 10:20:12,927 INFO L226 Difference]: Without dead ends: 150 [2018-02-02 10:20:12,928 INFO L554 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-02-02 10:20:12,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-02 10:20:12,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-02-02 10:20:12,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-02 10:20:12,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 158 transitions. [2018-02-02 10:20:12,933 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 158 transitions. Word has length 34 [2018-02-02 10:20:12,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:12,934 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 158 transitions. [2018-02-02 10:20:12,934 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:20:12,934 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 158 transitions. [2018-02-02 10:20:12,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 10:20:12,935 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:12,935 INFO L351 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-02-02 10:20:12,935 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_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, 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-02-02 10:20:12,935 INFO L82 PathProgramCache]: Analyzing trace with hash -204456797, now seen corresponding path program 1 times [2018-02-02 10:20:12,936 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:12,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:12,950 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:12,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:12,974 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:12,975 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:20:12,975 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:12,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:12,975 INFO L182 omatonBuilderFactory]: Interpolants [1968#true, 1969#false, 1970#(= |#Ultimate.C_memset_#t~loopctr21| 0), 1971#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 1972#(<= |#Ultimate.C_memset_#amount| 1)] [2018-02-02 10:20:12,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:12,975 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:20:12,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:20:12,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:20:12,976 INFO L87 Difference]: Start difference. First operand 150 states and 158 transitions. Second operand 5 states. [2018-02-02 10:20:12,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:12,996 INFO L93 Difference]: Finished difference Result 153 states and 161 transitions. [2018-02-02 10:20:12,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:20:12,996 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-02-02 10:20:12,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:12,997 INFO L225 Difference]: With dead ends: 153 [2018-02-02 10:20:12,997 INFO L226 Difference]: Without dead ends: 151 [2018-02-02 10:20:12,997 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:20:12,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-02 10:20:13,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-02-02 10:20:13,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-02 10:20:13,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 159 transitions. [2018-02-02 10:20:13,003 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 159 transitions. Word has length 35 [2018-02-02 10:20:13,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:13,003 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 159 transitions. [2018-02-02 10:20:13,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:20:13,003 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 159 transitions. [2018-02-02 10:20:13,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 10:20:13,004 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:13,004 INFO L351 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, 1] [2018-02-02 10:20:13,004 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_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, 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-02-02 10:20:13,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1829139958, now seen corresponding path program 1 times [2018-02-02 10:20:13,006 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:13,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:13,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:13,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:13,063 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:20:13,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:20:13,063 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:13,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:13,064 INFO L182 omatonBuilderFactory]: Interpolants [2279#true, 2280#false, 2281#(and (= 0 |ldv_kobject_create_#res.base|) (= 0 |ldv_kobject_create_#res.offset|)), 2282#(and (= 0 |entry_point_#t~ret19.base|) (= 0 |entry_point_#t~ret19.offset|)), 2283#(and (= 0 entry_point_~kobj~2.base) (= 0 entry_point_~kobj~2.offset)), 2284#(and (= 0 |ldv_kobject_put_#in~kobj.offset|) (= 0 |ldv_kobject_put_#in~kobj.base|)), 2285#(and (= ldv_kobject_put_~kobj.offset 0) (= 0 ldv_kobject_put_~kobj.base))] [2018-02-02 10:20:13,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:13,064 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:20:13,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:20:13,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:20:13,065 INFO L87 Difference]: Start difference. First operand 151 states and 159 transitions. Second operand 7 states. [2018-02-02 10:20:13,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:13,091 INFO L93 Difference]: Finished difference Result 161 states and 169 transitions. [2018-02-02 10:20:13,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:20:13,091 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-02-02 10:20:13,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:13,092 INFO L225 Difference]: With dead ends: 161 [2018-02-02 10:20:13,092 INFO L226 Difference]: Without dead ends: 161 [2018-02-02 10:20:13,092 INFO L554 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-02-02 10:20:13,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-02 10:20:13,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 157. [2018-02-02 10:20:13,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-02-02 10:20:13,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 165 transitions. [2018-02-02 10:20:13,096 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 165 transitions. Word has length 36 [2018-02-02 10:20:13,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:13,097 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 165 transitions. [2018-02-02 10:20:13,097 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:20:13,097 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 165 transitions. [2018-02-02 10:20:13,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 10:20:13,098 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:13,098 INFO L351 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-02-02 10:20:13,098 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_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, 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-02-02 10:20:13,098 INFO L82 PathProgramCache]: Analyzing trace with hash 371943704, now seen corresponding path program 2 times [2018-02-02 10:20:13,099 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:13,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:13,110 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:13,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:13,154 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:13,154 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:20:13,154 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:13,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:13,155 INFO L182 omatonBuilderFactory]: Interpolants [2608#(= |#Ultimate.C_memset_#t~loopctr21| 0), 2609#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 2610#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 2611#(<= |#Ultimate.C_memset_#amount| 2), 2606#true, 2607#false] [2018-02-02 10:20:13,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-02-02 10:20:13,155 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:20:13,155 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:20:13,155 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:20:13,155 INFO L87 Difference]: Start difference. First operand 157 states and 165 transitions. Second operand 6 states. [2018-02-02 10:20:13,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:13,174 INFO L93 Difference]: Finished difference Result 160 states and 168 transitions. [2018-02-02 10:20:13,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:20:13,174 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-02-02 10:20:13,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:13,175 INFO L225 Difference]: With dead ends: 160 [2018-02-02 10:20:13,176 INFO L226 Difference]: Without dead ends: 158 [2018-02-02 10:20:13,176 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:20:13,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-02 10:20:13,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-02-02 10:20:13,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-02 10:20:13,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 166 transitions. [2018-02-02 10:20:13,180 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 166 transitions. Word has length 36 [2018-02-02 10:20:13,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:13,180 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 166 transitions. [2018-02-02 10:20:13,180 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:20:13,181 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 166 transitions. [2018-02-02 10:20:13,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:20:13,181 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:13,181 INFO L351 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-02-02 10:20:13,182 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_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, 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-02-02 10:20:13,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1983848104, now seen corresponding path program 1 times [2018-02-02 10:20:13,183 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:13,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:13,189 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:13,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:13,209 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:20:13,209 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:20:13,209 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:13,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:13,210 INFO L182 omatonBuilderFactory]: Interpolants [2932#true, 2933#false, 2934#(= |#valid| |old(#valid)|)] [2018-02-02 10:20:13,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:13,210 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:20:13,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:20:13,211 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:20:13,211 INFO L87 Difference]: Start difference. First operand 158 states and 166 transitions. Second operand 3 states. [2018-02-02 10:20:13,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:13,294 INFO L93 Difference]: Finished difference Result 175 states and 184 transitions. [2018-02-02 10:20:13,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:20:13,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-02-02 10:20:13,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:13,295 INFO L225 Difference]: With dead ends: 175 [2018-02-02 10:20:13,295 INFO L226 Difference]: Without dead ends: 162 [2018-02-02 10:20:13,296 INFO L554 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-02-02 10:20:13,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-02 10:20:13,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 154. [2018-02-02 10:20:13,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-02-02 10:20:13,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 161 transitions. [2018-02-02 10:20:13,301 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 161 transitions. Word has length 34 [2018-02-02 10:20:13,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:13,302 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 161 transitions. [2018-02-02 10:20:13,302 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:20:13,302 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 161 transitions. [2018-02-02 10:20:13,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 10:20:13,303 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:13,303 INFO L351 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] [2018-02-02 10:20:13,303 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_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, 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-02-02 10:20:13,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1060490051, now seen corresponding path program 3 times [2018-02-02 10:20:13,307 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:13,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:13,320 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:13,359 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:13,359 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:13,359 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:20:13,359 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:13,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:13,360 INFO L182 omatonBuilderFactory]: Interpolants [3264#true, 3265#false, 3266#(= |#Ultimate.C_memset_#t~loopctr21| 0), 3267#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 3268#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 3269#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 3270#(<= |#Ultimate.C_memset_#amount| 3)] [2018-02-02 10:20:13,360 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:13,360 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:20:13,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:20:13,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:20:13,361 INFO L87 Difference]: Start difference. First operand 154 states and 161 transitions. Second operand 7 states. [2018-02-02 10:20:13,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:13,381 INFO L93 Difference]: Finished difference Result 157 states and 164 transitions. [2018-02-02 10:20:13,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:20:13,382 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-02-02 10:20:13,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:13,383 INFO L225 Difference]: With dead ends: 157 [2018-02-02 10:20:13,383 INFO L226 Difference]: Without dead ends: 155 [2018-02-02 10:20:13,383 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:20:13,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-02-02 10:20:13,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-02-02 10:20:13,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-02 10:20:13,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 162 transitions. [2018-02-02 10:20:13,388 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 162 transitions. Word has length 37 [2018-02-02 10:20:13,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:13,388 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 162 transitions. [2018-02-02 10:20:13,388 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:20:13,388 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 162 transitions. [2018-02-02 10:20:13,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 10:20:13,389 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:13,389 INFO L351 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, 1] [2018-02-02 10:20:13,389 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_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, 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-02-02 10:20:13,389 INFO L82 PathProgramCache]: Analyzing trace with hash 515535126, now seen corresponding path program 1 times [2018-02-02 10:20:13,390 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:13,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:13,397 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:13,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:13,419 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:20:13,419 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:20:13,419 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:13,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:13,420 INFO L182 omatonBuilderFactory]: Interpolants [3585#true, 3586#false, 3587#(not (= |ldv_malloc_#t~malloc4.base| 0)), 3588#(not (= |ldv_malloc_#res.base| 0)), 3589#(not (= |ldv_kobject_create_#t~ret17.base| 0)), 3590#(not (= ldv_kobject_create_~kobj~1.base 0))] [2018-02-02 10:20:13,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:13,420 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:20:13,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:20:13,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:20:13,420 INFO L87 Difference]: Start difference. First operand 155 states and 162 transitions. Second operand 6 states. [2018-02-02 10:20:13,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:13,431 INFO L93 Difference]: Finished difference Result 140 states and 146 transitions. [2018-02-02 10:20:13,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:20:13,432 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-02-02 10:20:13,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:13,432 INFO L225 Difference]: With dead ends: 140 [2018-02-02 10:20:13,432 INFO L226 Difference]: Without dead ends: 140 [2018-02-02 10:20:13,432 INFO L554 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-02-02 10:20:13,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-02-02 10:20:13,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-02-02 10:20:13,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-02 10:20:13,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 146 transitions. [2018-02-02 10:20:13,435 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 146 transitions. Word has length 36 [2018-02-02 10:20:13,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:13,435 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 146 transitions. [2018-02-02 10:20:13,435 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:20:13,435 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 146 transitions. [2018-02-02 10:20:13,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 10:20:13,436 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:13,436 INFO L351 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] [2018-02-02 10:20:13,436 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_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, 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-02-02 10:20:13,436 INFO L82 PathProgramCache]: Analyzing trace with hash 930590328, now seen corresponding path program 4 times [2018-02-02 10:20:13,437 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:13,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:13,447 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:13,496 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:13,496 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:13,496 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:20:13,496 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:13,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:13,497 INFO L182 omatonBuilderFactory]: Interpolants [3873#true, 3874#false, 3875#(= |#Ultimate.C_memset_#t~loopctr21| 0), 3876#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 3877#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 3878#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 3879#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 3880#(<= |#Ultimate.C_memset_#amount| 4)] [2018-02-02 10:20:13,497 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:13,497 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:20:13,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:20:13,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:20:13,497 INFO L87 Difference]: Start difference. First operand 140 states and 146 transitions. Second operand 8 states. [2018-02-02 10:20:13,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:13,521 INFO L93 Difference]: Finished difference Result 143 states and 149 transitions. [2018-02-02 10:20:13,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:20:13,522 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-02-02 10:20:13,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:13,522 INFO L225 Difference]: With dead ends: 143 [2018-02-02 10:20:13,522 INFO L226 Difference]: Without dead ends: 141 [2018-02-02 10:20:13,523 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:20:13,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-02 10:20:13,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-02-02 10:20:13,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-02-02 10:20:13,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 147 transitions. [2018-02-02 10:20:13,526 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 147 transitions. Word has length 38 [2018-02-02 10:20:13,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:13,526 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 147 transitions. [2018-02-02 10:20:13,526 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:20:13,526 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 147 transitions. [2018-02-02 10:20:13,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 10:20:13,527 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:13,527 INFO L351 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] [2018-02-02 10:20:13,527 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_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, 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-02-02 10:20:13,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1198666211, now seen corresponding path program 5 times [2018-02-02 10:20:13,528 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:13,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:13,539 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:13,600 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:13,600 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:13,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:20:13,601 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:13,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:13,601 INFO L182 omatonBuilderFactory]: Interpolants [4167#true, 4168#false, 4169#(= |#Ultimate.C_memset_#t~loopctr21| 0), 4170#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 4171#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 4172#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 4173#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 4174#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 4175#(<= |#Ultimate.C_memset_#amount| 5)] [2018-02-02 10:20:13,601 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:13,602 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:20:13,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:20:13,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:20:13,602 INFO L87 Difference]: Start difference. First operand 141 states and 147 transitions. Second operand 9 states. [2018-02-02 10:20:13,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:13,636 INFO L93 Difference]: Finished difference Result 144 states and 150 transitions. [2018-02-02 10:20:13,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:20:13,636 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-02-02 10:20:13,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:13,637 INFO L225 Difference]: With dead ends: 144 [2018-02-02 10:20:13,638 INFO L226 Difference]: Without dead ends: 142 [2018-02-02 10:20:13,638 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:20:13,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-02-02 10:20:13,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-02-02 10:20:13,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-02 10:20:13,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 148 transitions. [2018-02-02 10:20:13,642 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 148 transitions. Word has length 39 [2018-02-02 10:20:13,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:13,642 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 148 transitions. [2018-02-02 10:20:13,642 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:20:13,642 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 148 transitions. [2018-02-02 10:20:13,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 10:20:13,643 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:13,643 INFO L351 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 10:20:13,643 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_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, 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-02-02 10:20:13,643 INFO L82 PathProgramCache]: Analyzing trace with hash 919083992, now seen corresponding path program 6 times [2018-02-02 10:20:13,644 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:13,657 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:13,716 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:13,716 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:13,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:20:13,716 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:13,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:13,717 INFO L182 omatonBuilderFactory]: Interpolants [4464#true, 4465#false, 4466#(= |#Ultimate.C_memset_#t~loopctr21| 0), 4467#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 4468#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 4469#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 4470#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 4471#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 4472#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 4473#(<= |#Ultimate.C_memset_#amount| 6)] [2018-02-02 10:20:13,717 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:13,717 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:20:13,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:20:13,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:20:13,717 INFO L87 Difference]: Start difference. First operand 142 states and 148 transitions. Second operand 10 states. [2018-02-02 10:20:13,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:13,746 INFO L93 Difference]: Finished difference Result 145 states and 151 transitions. [2018-02-02 10:20:13,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:20:13,747 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2018-02-02 10:20:13,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:13,748 INFO L225 Difference]: With dead ends: 145 [2018-02-02 10:20:13,748 INFO L226 Difference]: Without dead ends: 143 [2018-02-02 10:20:13,748 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:20:13,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-02 10:20:13,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-02-02 10:20:13,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-02 10:20:13,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 149 transitions. [2018-02-02 10:20:13,752 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 149 transitions. Word has length 40 [2018-02-02 10:20:13,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:13,752 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 149 transitions. [2018-02-02 10:20:13,752 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:20:13,752 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 149 transitions. [2018-02-02 10:20:13,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 10:20:13,753 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:13,753 INFO L351 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 10:20:13,753 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_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, 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-02-02 10:20:13,753 INFO L82 PathProgramCache]: Analyzing trace with hash 841969795, now seen corresponding path program 7 times [2018-02-02 10:20:13,754 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:13,766 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:13,841 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:13,841 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:13,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:20:13,841 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:13,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:13,842 INFO L182 omatonBuilderFactory]: Interpolants [4768#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 4769#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 4770#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 4771#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 4772#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 4773#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 4774#(<= |#Ultimate.C_memset_#amount| 7), 4764#true, 4765#false, 4766#(= |#Ultimate.C_memset_#t~loopctr21| 0), 4767#(<= |#Ultimate.C_memset_#t~loopctr21| 1)] [2018-02-02 10:20:13,842 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:13,842 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:20:13,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:20:13,843 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:20:13,843 INFO L87 Difference]: Start difference. First operand 143 states and 149 transitions. Second operand 11 states. [2018-02-02 10:20:13,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:13,870 INFO L93 Difference]: Finished difference Result 146 states and 152 transitions. [2018-02-02 10:20:13,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:20:13,870 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-02-02 10:20:13,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:13,871 INFO L225 Difference]: With dead ends: 146 [2018-02-02 10:20:13,871 INFO L226 Difference]: Without dead ends: 144 [2018-02-02 10:20:13,871 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:20:13,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-02-02 10:20:13,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-02-02 10:20:13,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-02 10:20:13,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 150 transitions. [2018-02-02 10:20:13,875 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 150 transitions. Word has length 41 [2018-02-02 10:20:13,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:13,875 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 150 transitions. [2018-02-02 10:20:13,875 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:20:13,875 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 150 transitions. [2018-02-02 10:20:13,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 10:20:13,875 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:13,876 INFO L351 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 10:20:13,876 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_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, 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-02-02 10:20:13,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1548570312, now seen corresponding path program 8 times [2018-02-02 10:20:13,877 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:13,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:13,887 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:13,966 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:13,966 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:13,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:20:13,966 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:13,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:13,967 INFO L182 omatonBuilderFactory]: Interpolants [5072#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 5073#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 5074#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 5075#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 5076#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 5077#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 5078#(<= |#Ultimate.C_memset_#amount| 8), 5067#true, 5068#false, 5069#(= |#Ultimate.C_memset_#t~loopctr21| 0), 5070#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 5071#(<= |#Ultimate.C_memset_#t~loopctr21| 2)] [2018-02-02 10:20:13,967 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:13,967 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:20:13,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:20:13,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:20:13,968 INFO L87 Difference]: Start difference. First operand 144 states and 150 transitions. Second operand 12 states. [2018-02-02 10:20:13,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:13,998 INFO L93 Difference]: Finished difference Result 147 states and 153 transitions. [2018-02-02 10:20:13,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:20:13,999 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-02-02 10:20:13,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:14,000 INFO L225 Difference]: With dead ends: 147 [2018-02-02 10:20:14,000 INFO L226 Difference]: Without dead ends: 145 [2018-02-02 10:20:14,000 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:20:14,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-02 10:20:14,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-02-02 10:20:14,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-02 10:20:14,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 151 transitions. [2018-02-02 10:20:14,003 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 151 transitions. Word has length 42 [2018-02-02 10:20:14,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:14,003 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 151 transitions. [2018-02-02 10:20:14,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:20:14,003 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 151 transitions. [2018-02-02 10:20:14,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 10:20:14,004 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:14,004 INFO L351 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 10:20:14,004 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_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, 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-02-02 10:20:14,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1654097699, now seen corresponding path program 9 times [2018-02-02 10:20:14,005 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:14,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:14,015 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:14,096 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:14,096 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:14,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:20:14,096 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:14,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:14,097 INFO L182 omatonBuilderFactory]: Interpolants [5376#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 5377#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 5378#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 5379#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 5380#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 5381#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 5382#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 5383#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 5384#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 5385#(<= |#Ultimate.C_memset_#amount| 9), 5373#true, 5374#false, 5375#(= |#Ultimate.C_memset_#t~loopctr21| 0)] [2018-02-02 10:20:14,097 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:14,097 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:20:14,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:20:14,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:20:14,098 INFO L87 Difference]: Start difference. First operand 145 states and 151 transitions. Second operand 13 states. [2018-02-02 10:20:14,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:14,133 INFO L93 Difference]: Finished difference Result 148 states and 154 transitions. [2018-02-02 10:20:14,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:20:14,133 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-02-02 10:20:14,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:14,134 INFO L225 Difference]: With dead ends: 148 [2018-02-02 10:20:14,134 INFO L226 Difference]: Without dead ends: 146 [2018-02-02 10:20:14,135 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:20:14,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-02 10:20:14,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-02-02 10:20:14,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-02 10:20:14,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 152 transitions. [2018-02-02 10:20:14,138 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 152 transitions. Word has length 43 [2018-02-02 10:20:14,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:14,138 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 152 transitions. [2018-02-02 10:20:14,139 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:20:14,139 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 152 transitions. [2018-02-02 10:20:14,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 10:20:14,139 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:14,139 INFO L351 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 10:20:14,139 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_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, 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-02-02 10:20:14,140 INFO L82 PathProgramCache]: Analyzing trace with hash -2142409064, now seen corresponding path program 10 times [2018-02-02 10:20:14,140 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:14,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:14,153 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:14,226 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:14,226 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:14,227 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:20:14,227 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:14,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:14,227 INFO L182 omatonBuilderFactory]: Interpolants [5682#true, 5683#false, 5684#(= |#Ultimate.C_memset_#t~loopctr21| 0), 5685#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 5686#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 5687#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 5688#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 5689#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 5690#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 5691#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 5692#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 5693#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 5694#(<= |#Ultimate.C_memset_#t~loopctr21| 10), 5695#(<= |#Ultimate.C_memset_#amount| 10)] [2018-02-02 10:20:14,227 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:14,228 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:20:14,228 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:20:14,228 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:20:14,228 INFO L87 Difference]: Start difference. First operand 146 states and 152 transitions. Second operand 14 states. [2018-02-02 10:20:14,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:14,253 INFO L93 Difference]: Finished difference Result 149 states and 155 transitions. [2018-02-02 10:20:14,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:20:14,259 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-02-02 10:20:14,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:14,260 INFO L225 Difference]: With dead ends: 149 [2018-02-02 10:20:14,260 INFO L226 Difference]: Without dead ends: 147 [2018-02-02 10:20:14,260 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:20:14,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-02-02 10:20:14,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-02-02 10:20:14,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-02 10:20:14,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 153 transitions. [2018-02-02 10:20:14,264 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 153 transitions. Word has length 44 [2018-02-02 10:20:14,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:14,264 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 153 transitions. [2018-02-02 10:20:14,264 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:20:14,264 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 153 transitions. [2018-02-02 10:20:14,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 10:20:14,265 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:14,265 INFO L351 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 10:20:14,265 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_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, 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-02-02 10:20:14,265 INFO L82 PathProgramCache]: Analyzing trace with hash 424965571, now seen corresponding path program 11 times [2018-02-02 10:20:14,266 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:14,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:14,281 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:14,383 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:14,384 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:14,384 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:20:14,384 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:14,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:14,384 INFO L182 omatonBuilderFactory]: Interpolants [5994#true, 5995#false, 5996#(= |#Ultimate.C_memset_#t~loopctr21| 0), 5997#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 5998#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 5999#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 6000#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 6001#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 6002#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 6003#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 6004#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 6005#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 6006#(<= |#Ultimate.C_memset_#t~loopctr21| 10), 6007#(<= |#Ultimate.C_memset_#t~loopctr21| 11), 6008#(<= |#Ultimate.C_memset_#amount| 11)] [2018-02-02 10:20:14,384 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:14,384 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:20:14,384 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:20:14,384 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:20:14,385 INFO L87 Difference]: Start difference. First operand 147 states and 153 transitions. Second operand 15 states. [2018-02-02 10:20:14,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:14,407 INFO L93 Difference]: Finished difference Result 150 states and 156 transitions. [2018-02-02 10:20:14,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:20:14,408 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2018-02-02 10:20:14,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:14,409 INFO L225 Difference]: With dead ends: 150 [2018-02-02 10:20:14,409 INFO L226 Difference]: Without dead ends: 148 [2018-02-02 10:20:14,409 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=97, Invalid=143, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:20:14,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-02-02 10:20:14,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-02-02 10:20:14,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-02 10:20:14,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 154 transitions. [2018-02-02 10:20:14,412 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 154 transitions. Word has length 45 [2018-02-02 10:20:14,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:14,413 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 154 transitions. [2018-02-02 10:20:14,413 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:20:14,413 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 154 transitions. [2018-02-02 10:20:14,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 10:20:14,413 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:14,414 INFO L351 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 10:20:14,414 INFO L371 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, 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-02-02 10:20:14,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1590799368, now seen corresponding path program 12 times [2018-02-02 10:20:14,415 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:14,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:14,427 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:14,559 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:14,559 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:14,559 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:20:14,559 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:14,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:14,560 INFO L182 omatonBuilderFactory]: Interpolants [6309#true, 6310#false, 6311#(= |#Ultimate.C_memset_#t~loopctr21| 0), 6312#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 6313#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 6314#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 6315#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 6316#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 6317#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 6318#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 6319#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 6320#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 6321#(<= |#Ultimate.C_memset_#t~loopctr21| 10), 6322#(<= |#Ultimate.C_memset_#t~loopctr21| 11), 6323#(<= |#Ultimate.C_memset_#t~loopctr21| 12), 6324#(<= |#Ultimate.C_memset_#amount| 12)] [2018-02-02 10:20:14,560 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:14,560 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:20:14,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:20:14,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:20:14,561 INFO L87 Difference]: Start difference. First operand 148 states and 154 transitions. Second operand 16 states. [2018-02-02 10:20:14,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:14,602 INFO L93 Difference]: Finished difference Result 151 states and 157 transitions. [2018-02-02 10:20:14,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:20:14,602 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2018-02-02 10:20:14,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:14,603 INFO L225 Difference]: With dead ends: 151 [2018-02-02 10:20:14,603 INFO L226 Difference]: Without dead ends: 149 [2018-02-02 10:20:14,603 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=111, Invalid=161, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:20:14,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-02-02 10:20:14,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-02-02 10:20:14,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-02-02 10:20:14,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 155 transitions. [2018-02-02 10:20:14,605 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 155 transitions. Word has length 46 [2018-02-02 10:20:14,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:14,605 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 155 transitions. [2018-02-02 10:20:14,605 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:20:14,605 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 155 transitions. [2018-02-02 10:20:14,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:20:14,605 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:14,605 INFO L351 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 10:20:14,605 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_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, 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-02-02 10:20:14,606 INFO L82 PathProgramCache]: Analyzing trace with hash 344996963, now seen corresponding path program 13 times [2018-02-02 10:20:14,606 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:14,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:14,614 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:14,725 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:14,725 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:14,725 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:20:14,725 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:14,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:14,726 INFO L182 omatonBuilderFactory]: Interpolants [6627#true, 6628#false, 6629#(= |#Ultimate.C_memset_#t~loopctr21| 0), 6630#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 6631#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 6632#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 6633#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 6634#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 6635#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 6636#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 6637#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 6638#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 6639#(<= |#Ultimate.C_memset_#t~loopctr21| 10), 6640#(<= |#Ultimate.C_memset_#t~loopctr21| 11), 6641#(<= |#Ultimate.C_memset_#t~loopctr21| 12), 6642#(<= |#Ultimate.C_memset_#t~loopctr21| 13), 6643#(<= |#Ultimate.C_memset_#amount| 13)] [2018-02-02 10:20:14,726 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:14,726 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:20:14,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:20:14,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:20:14,727 INFO L87 Difference]: Start difference. First operand 149 states and 155 transitions. Second operand 17 states. [2018-02-02 10:20:14,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:14,768 INFO L93 Difference]: Finished difference Result 152 states and 158 transitions. [2018-02-02 10:20:14,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:20:14,769 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2018-02-02 10:20:14,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:14,770 INFO L225 Difference]: With dead ends: 152 [2018-02-02 10:20:14,770 INFO L226 Difference]: Without dead ends: 150 [2018-02-02 10:20:14,770 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=180, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:20:14,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-02 10:20:14,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-02-02 10:20:14,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-02 10:20:14,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 156 transitions. [2018-02-02 10:20:14,772 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 156 transitions. Word has length 47 [2018-02-02 10:20:14,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:14,772 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 156 transitions. [2018-02-02 10:20:14,772 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:20:14,773 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 156 transitions. [2018-02-02 10:20:14,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 10:20:14,773 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:14,773 INFO L351 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 10:20:14,773 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_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, 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-02-02 10:20:14,773 INFO L82 PathProgramCache]: Analyzing trace with hash 225141080, now seen corresponding path program 14 times [2018-02-02 10:20:14,774 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:14,783 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:14,898 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:14,898 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:14,898 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:20:14,898 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:14,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:14,898 INFO L182 omatonBuilderFactory]: Interpolants [6948#true, 6949#false, 6950#(= |#Ultimate.C_memset_#t~loopctr21| 0), 6951#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 6952#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 6953#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 6954#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 6955#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 6956#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 6957#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 6958#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 6959#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 6960#(<= |#Ultimate.C_memset_#t~loopctr21| 10), 6961#(<= |#Ultimate.C_memset_#t~loopctr21| 11), 6962#(<= |#Ultimate.C_memset_#t~loopctr21| 12), 6963#(<= |#Ultimate.C_memset_#t~loopctr21| 13), 6964#(<= |#Ultimate.C_memset_#t~loopctr21| 14), 6965#(<= |#Ultimate.C_memset_#amount| 14)] [2018-02-02 10:20:14,898 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:14,899 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:20:14,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:20:14,899 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:20:14,899 INFO L87 Difference]: Start difference. First operand 150 states and 156 transitions. Second operand 18 states. [2018-02-02 10:20:14,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:14,959 INFO L93 Difference]: Finished difference Result 153 states and 159 transitions. [2018-02-02 10:20:14,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:20:14,971 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2018-02-02 10:20:14,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:14,972 INFO L225 Difference]: With dead ends: 153 [2018-02-02 10:20:14,972 INFO L226 Difference]: Without dead ends: 151 [2018-02-02 10:20:14,972 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=200, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:20:14,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-02 10:20:14,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-02-02 10:20:14,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-02 10:20:14,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 157 transitions. [2018-02-02 10:20:14,975 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 157 transitions. Word has length 48 [2018-02-02 10:20:14,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:14,975 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 157 transitions. [2018-02-02 10:20:14,975 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:20:14,975 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 157 transitions. [2018-02-02 10:20:14,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 10:20:14,976 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:14,976 INFO L351 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 10:20:14,976 INFO L371 AbstractCegarLoop]: === Iteration 24 === [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_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, 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-02-02 10:20:14,976 INFO L82 PathProgramCache]: Analyzing trace with hash 804576003, now seen corresponding path program 15 times [2018-02-02 10:20:14,977 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:14,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:14,990 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:15,308 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:15,308 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:15,308 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:20:15,308 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:15,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:15,309 INFO L182 omatonBuilderFactory]: Interpolants [7272#true, 7273#false, 7274#(= |#Ultimate.C_memset_#t~loopctr21| 0), 7275#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 7276#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 7277#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 7278#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 7279#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 7280#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 7281#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 7282#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 7283#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 7284#(<= |#Ultimate.C_memset_#t~loopctr21| 10), 7285#(<= |#Ultimate.C_memset_#t~loopctr21| 11), 7286#(<= |#Ultimate.C_memset_#t~loopctr21| 12), 7287#(<= |#Ultimate.C_memset_#t~loopctr21| 13), 7288#(<= |#Ultimate.C_memset_#t~loopctr21| 14), 7289#(<= |#Ultimate.C_memset_#t~loopctr21| 15), 7290#(<= |#Ultimate.C_memset_#amount| 15)] [2018-02-02 10:20:15,309 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:15,309 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:20:15,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:20:15,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:20:15,309 INFO L87 Difference]: Start difference. First operand 151 states and 157 transitions. Second operand 19 states. [2018-02-02 10:20:15,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:15,366 INFO L93 Difference]: Finished difference Result 154 states and 160 transitions. [2018-02-02 10:20:15,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:20:15,367 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-02-02 10:20:15,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:15,367 INFO L225 Difference]: With dead ends: 154 [2018-02-02 10:20:15,367 INFO L226 Difference]: Without dead ends: 152 [2018-02-02 10:20:15,367 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=221, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:20:15,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-02 10:20:15,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-02-02 10:20:15,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-02 10:20:15,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 158 transitions. [2018-02-02 10:20:15,370 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 158 transitions. Word has length 49 [2018-02-02 10:20:15,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:15,370 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 158 transitions. [2018-02-02 10:20:15,370 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:20:15,370 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 158 transitions. [2018-02-02 10:20:15,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 10:20:15,371 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:15,371 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 10:20:15,371 INFO L371 AbstractCegarLoop]: === Iteration 25 === [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_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, 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-02-02 10:20:15,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1587189432, now seen corresponding path program 16 times [2018-02-02 10:20:15,372 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:15,380 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:15,559 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:20:15,560 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:20:15,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 10:20:15,560 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:15,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:15,560 INFO L182 omatonBuilderFactory]: Interpolants [7599#true, 7600#false, 7601#(= 0 |ldv_malloc_#t~malloc4.offset|), 7602#(= 0 |ldv_malloc_#res.offset|), 7603#(= 0 |ldv_kobject_create_#t~ret17.offset|), 7604#(= 0 ldv_kobject_create_~kobj~1.offset), 7605#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 7606#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 7607#(and (= 0 |ldv_kobject_init_#in~kobj.offset|) (<= 16 (select |#length| |ldv_kobject_init_#in~kobj.base|))), 7608#(and (= 0 ldv_kobject_init_~kobj.offset) (<= 16 (select |#length| ldv_kobject_init_~kobj.base))), 7609#(and (<= 16 (select |#length| |ldv_kobject_init_internal_#in~kobj.base|)) (= 0 |ldv_kobject_init_internal_#in~kobj.offset|)), 7610#(and (<= 16 (select |#length| ldv_kobject_init_internal_~kobj.base)) (= ldv_kobject_init_internal_~kobj.offset 0)), 7611#(and (<= (+ |ldv_kref_init_#in~kref.offset| 4) (select |#length| |ldv_kref_init_#in~kref.base|)) (<= 12 |ldv_kref_init_#in~kref.offset|)), 7612#(and (<= 12 ldv_kref_init_~kref.offset) (<= (+ ldv_kref_init_~kref.offset 4) (select |#length| ldv_kref_init_~kref.base)))] [2018-02-02 10:20:15,561 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:20:15,561 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:20:15,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:20:15,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:20:15,561 INFO L87 Difference]: Start difference. First operand 152 states and 158 transitions. Second operand 14 states. [2018-02-02 10:20:15,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:15,846 INFO L93 Difference]: Finished difference Result 151 states and 157 transitions. [2018-02-02 10:20:15,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:20:15,846 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2018-02-02 10:20:15,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:15,847 INFO L225 Difference]: With dead ends: 151 [2018-02-02 10:20:15,847 INFO L226 Difference]: Without dead ends: 151 [2018-02-02 10:20:15,847 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:20:15,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-02 10:20:15,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-02-02 10:20:15,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-02 10:20:15,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 157 transitions. [2018-02-02 10:20:15,850 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 157 transitions. Word has length 50 [2018-02-02 10:20:15,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:15,850 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 157 transitions. [2018-02-02 10:20:15,850 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:20:15,850 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 157 transitions. [2018-02-02 10:20:15,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 10:20:15,850 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:15,851 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 10:20:15,851 INFO L371 AbstractCegarLoop]: === Iteration 26 === [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_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, 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-02-02 10:20:15,851 INFO L82 PathProgramCache]: Analyzing trace with hash -480102060, now seen corresponding path program 1 times [2018-02-02 10:20:15,852 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:15,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:15,864 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:15,932 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:20:15,932 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:20:15,932 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:20:15,933 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:15,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:15,933 INFO L182 omatonBuilderFactory]: Interpolants [7923#true, 7924#false, 7925#(= 1 (select |#valid| |#Ultimate.C_memset_#ptr.base|)), 7926#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base)), 7927#(= 1 (select |#valid| |ldv_kobject_init_#in~kobj.base|)), 7928#(= 1 (select |#valid| ldv_kobject_init_~kobj.base)), 7929#(= 1 (select |#valid| |ldv_kobject_init_internal_#in~kobj.base|)), 7930#(= 1 (select |#valid| ldv_kobject_init_internal_~kobj.base)), 7931#(= 1 (select |#valid| |LDV_INIT_LIST_HEAD_#in~list.base|)), 7932#(= 1 (select |#valid| LDV_INIT_LIST_HEAD_~list.base))] [2018-02-02 10:20:15,933 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:20:15,933 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:20:15,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:20:15,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:20:15,934 INFO L87 Difference]: Start difference. First operand 151 states and 157 transitions. Second operand 10 states. [2018-02-02 10:20:16,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:16,158 INFO L93 Difference]: Finished difference Result 149 states and 155 transitions. [2018-02-02 10:20:16,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:20:16,159 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-02-02 10:20:16,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:16,160 INFO L225 Difference]: With dead ends: 149 [2018-02-02 10:20:16,160 INFO L226 Difference]: Without dead ends: 149 [2018-02-02 10:20:16,160 INFO L554 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-02-02 10:20:16,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-02-02 10:20:16,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-02-02 10:20:16,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-02-02 10:20:16,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 155 transitions. [2018-02-02 10:20:16,163 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 155 transitions. Word has length 55 [2018-02-02 10:20:16,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:16,163 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 155 transitions. [2018-02-02 10:20:16,163 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:20:16,163 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 155 transitions. [2018-02-02 10:20:16,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 10:20:16,164 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:16,164 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 10:20:16,164 INFO L371 AbstractCegarLoop]: === Iteration 27 === [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_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, 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-02-02 10:20:16,164 INFO L82 PathProgramCache]: Analyzing trace with hash -480102059, now seen corresponding path program 1 times [2018-02-02 10:20:16,165 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:16,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:16,179 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:16,335 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:20:16,335 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:20:16,335 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 10:20:16,336 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:16,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:16,336 INFO L182 omatonBuilderFactory]: Interpolants [8237#true, 8238#false, 8239#(= 0 |ldv_malloc_#t~malloc4.offset|), 8240#(= 0 |ldv_malloc_#res.offset|), 8241#(= 0 |ldv_kobject_create_#t~ret17.offset|), 8242#(= 0 ldv_kobject_create_~kobj~1.offset), 8243#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 8244#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 8245#(and (= 0 |ldv_kobject_init_#in~kobj.offset|) (<= 16 (select |#length| |ldv_kobject_init_#in~kobj.base|))), 8246#(and (= 0 ldv_kobject_init_~kobj.offset) (<= 16 (select |#length| ldv_kobject_init_~kobj.base))), 8247#(and (<= 16 (select |#length| |ldv_kobject_init_internal_#in~kobj.base|)) (= 0 |ldv_kobject_init_internal_#in~kobj.offset|)), 8248#(and (<= 16 (select |#length| ldv_kobject_init_internal_~kobj.base)) (= ldv_kobject_init_internal_~kobj.offset 0)), 8249#(and (<= 4 |LDV_INIT_LIST_HEAD_#in~list.offset|) (<= (+ |LDV_INIT_LIST_HEAD_#in~list.offset| 12) (select |#length| |LDV_INIT_LIST_HEAD_#in~list.base|))), 8250#(and (<= (+ LDV_INIT_LIST_HEAD_~list.offset 12) (select |#length| LDV_INIT_LIST_HEAD_~list.base)) (<= 4 LDV_INIT_LIST_HEAD_~list.offset))] [2018-02-02 10:20:16,336 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:20:16,336 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:20:16,337 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:20:16,337 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:20:16,337 INFO L87 Difference]: Start difference. First operand 149 states and 155 transitions. Second operand 14 states. [2018-02-02 10:20:16,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:16,666 INFO L93 Difference]: Finished difference Result 147 states and 153 transitions. [2018-02-02 10:20:16,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:20:16,666 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2018-02-02 10:20:16,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:16,667 INFO L225 Difference]: With dead ends: 147 [2018-02-02 10:20:16,667 INFO L226 Difference]: Without dead ends: 147 [2018-02-02 10:20:16,667 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:20:16,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-02-02 10:20:16,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-02-02 10:20:16,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-02 10:20:16,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 153 transitions. [2018-02-02 10:20:16,670 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 153 transitions. Word has length 55 [2018-02-02 10:20:16,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:16,670 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 153 transitions. [2018-02-02 10:20:16,670 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:20:16,670 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 153 transitions. [2018-02-02 10:20:16,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:20:16,671 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:16,671 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 10:20:16,671 INFO L371 AbstractCegarLoop]: === Iteration 28 === [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_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, 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-02-02 10:20:16,671 INFO L82 PathProgramCache]: Analyzing trace with hash 149395253, now seen corresponding path program 1 times [2018-02-02 10:20:16,672 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:16,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:16,684 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:16,755 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:20:16,755 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:20:16,755 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:20:16,756 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:16,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:16,756 INFO L182 omatonBuilderFactory]: Interpolants [8560#(= 0 |ldv_kobject_init_#in~kobj.base|), 8553#true, 8554#false, 8555#(not (= |ldv_malloc_#t~malloc4.base| 0)), 8556#(not (= |ldv_malloc_#res.base| 0)), 8557#(not (= |ldv_kobject_create_#t~ret17.base| 0)), 8558#(not (= ldv_kobject_create_~kobj~1.base 0)), 8559#(= ldv_kobject_init_~kobj.base |ldv_kobject_init_#in~kobj.base|)] [2018-02-02 10:20:16,756 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:20:16,756 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:20:16,756 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:20:16,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:20:16,757 INFO L87 Difference]: Start difference. First operand 147 states and 153 transitions. Second operand 8 states. [2018-02-02 10:20:16,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:16,796 INFO L93 Difference]: Finished difference Result 149 states and 154 transitions. [2018-02-02 10:20:16,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:20:16,796 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2018-02-02 10:20:16,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:16,797 INFO L225 Difference]: With dead ends: 149 [2018-02-02 10:20:16,797 INFO L226 Difference]: Without dead ends: 147 [2018-02-02 10:20:16,797 INFO L554 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-02-02 10:20:16,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-02-02 10:20:16,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-02-02 10:20:16,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-02 10:20:16,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 152 transitions. [2018-02-02 10:20:16,800 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 152 transitions. Word has length 58 [2018-02-02 10:20:16,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:16,800 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 152 transitions. [2018-02-02 10:20:16,800 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:20:16,800 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 152 transitions. [2018-02-02 10:20:16,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 10:20:16,801 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:16,801 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 10:20:16,801 INFO L371 AbstractCegarLoop]: === Iteration 29 === [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_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, 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-02-02 10:20:16,801 INFO L82 PathProgramCache]: Analyzing trace with hash -172085011, now seen corresponding path program 1 times [2018-02-02 10:20:16,802 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:16,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:16,814 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:16,882 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:20:16,882 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:20:16,882 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 10:20:16,882 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:16,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:16,883 INFO L182 omatonBuilderFactory]: Interpolants [8864#(not (= |ldv_malloc_#res.base| 0)), 8865#(not (= |ldv_kobject_create_#t~ret17.base| 0)), 8866#(not (= ldv_kobject_create_~kobj~1.base 0)), 8867#(= ldv_kobject_init_~kobj.base |ldv_kobject_init_#in~kobj.base|), 8868#(= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|), 8869#(= 0 |ldv_kobject_init_internal_#in~kobj.base|), 8870#(= 0 |ldv_kobject_init_#in~kobj.base|), 8861#true, 8862#false, 8863#(not (= |ldv_malloc_#t~malloc4.base| 0))] [2018-02-02 10:20:16,883 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:20:16,883 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:20:16,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:20:16,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:20:16,883 INFO L87 Difference]: Start difference. First operand 147 states and 152 transitions. Second operand 10 states. [2018-02-02 10:20:16,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:16,949 INFO L93 Difference]: Finished difference Result 151 states and 155 transitions. [2018-02-02 10:20:16,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:20:16,950 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2018-02-02 10:20:16,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:16,950 INFO L225 Difference]: With dead ends: 151 [2018-02-02 10:20:16,950 INFO L226 Difference]: Without dead ends: 147 [2018-02-02 10:20:16,951 INFO L554 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-02-02 10:20:16,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-02-02 10:20:16,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-02-02 10:20:16,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-02 10:20:16,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 151 transitions. [2018-02-02 10:20:16,954 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 151 transitions. Word has length 63 [2018-02-02 10:20:16,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:16,954 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 151 transitions. [2018-02-02 10:20:16,954 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:20:16,954 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 151 transitions. [2018-02-02 10:20:16,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 10:20:16,954 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:16,955 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 10:20:16,955 INFO L371 AbstractCegarLoop]: === Iteration 30 === [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_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, 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-02-02 10:20:16,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1593481520, now seen corresponding path program 1 times [2018-02-02 10:20:16,955 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:16,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:16,972 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:17,080 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:20:17,080 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:20:17,080 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 10:20:17,080 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:17,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:17,081 INFO L182 omatonBuilderFactory]: Interpolants [9184#(= 1 (select |#valid| |ldv_kref_get_#in~kref.base|)), 9185#(= 1 (select |#valid| ldv_kref_get_~kref.base)), 9186#(= 1 (select |#valid| |ldv_atomic_add_return_#in~v.base|)), 9187#(= 1 (select |#valid| ldv_atomic_add_return_~v.base)), 9175#true, 9176#false, 9177#(= 1 (select |#valid| |#Ultimate.C_memset_#ptr.base|)), 9178#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base)), 9179#(= 1 (select |#valid| |ldv_kobject_create_#res.base|)), 9180#(= 1 (select |#valid| |entry_point_#t~ret19.base|)), 9181#(= 1 (select |#valid| entry_point_~kobj~2.base)), 9182#(= 1 (select |#valid| |ldv_kobject_get_#in~kobj.base|)), 9183#(= 1 (select |#valid| ldv_kobject_get_~kobj.base))] [2018-02-02 10:20:17,081 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:20:17,081 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:20:17,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:20:17,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:20:17,082 INFO L87 Difference]: Start difference. First operand 147 states and 151 transitions. Second operand 13 states. [2018-02-02 10:20:17,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:17,318 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2018-02-02 10:20:17,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:20:17,319 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 74 [2018-02-02 10:20:17,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:17,319 INFO L225 Difference]: With dead ends: 145 [2018-02-02 10:20:17,319 INFO L226 Difference]: Without dead ends: 145 [2018-02-02 10:20:17,320 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:20:17,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-02 10:20:17,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-02-02 10:20:17,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-02 10:20:17,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 149 transitions. [2018-02-02 10:20:17,322 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 149 transitions. Word has length 74 [2018-02-02 10:20:17,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:17,322 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 149 transitions. [2018-02-02 10:20:17,322 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:20:17,323 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2018-02-02 10:20:17,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 10:20:17,323 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:17,323 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 10:20:17,323 INFO L371 AbstractCegarLoop]: === Iteration 31 === [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_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, 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-02-02 10:20:17,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1593481521, now seen corresponding path program 1 times [2018-02-02 10:20:17,324 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:17,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:17,333 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:17,527 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:20:17,527 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:20:17,527 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-02 10:20:17,528 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:17,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:17,528 INFO L182 omatonBuilderFactory]: Interpolants [9486#true, 9487#false, 9488#(= 0 |ldv_malloc_#t~malloc4.offset|), 9489#(= 0 |ldv_malloc_#res.offset|), 9490#(= 0 |ldv_kobject_create_#t~ret17.offset|), 9491#(= 0 ldv_kobject_create_~kobj~1.offset), 9492#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 9493#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 9494#(and (= 0 |ldv_kobject_create_#res.offset|) (<= 16 (select |#length| |ldv_kobject_create_#res.base|))), 9495#(and (= 0 |entry_point_#t~ret19.offset|) (<= 16 (select |#length| |entry_point_#t~ret19.base|))), 9496#(and (= 0 entry_point_~kobj~2.offset) (<= 16 (select |#length| entry_point_~kobj~2.base))), 9497#(and (<= 16 (select |#length| |ldv_kobject_get_#in~kobj.base|)) (= 0 |ldv_kobject_get_#in~kobj.offset|)), 9498#(and (<= 16 (select |#length| ldv_kobject_get_~kobj.base)) (= ldv_kobject_get_~kobj.offset 0)), 9499#(and (<= 12 |ldv_kref_get_#in~kref.offset|) (<= (+ |ldv_kref_get_#in~kref.offset| 4) (select |#length| |ldv_kref_get_#in~kref.base|))), 9500#(and (<= 12 ldv_kref_get_~kref.offset) (<= (+ ldv_kref_get_~kref.offset 4) (select |#length| ldv_kref_get_~kref.base))), 9501#(and (<= 12 |ldv_atomic_add_return_#in~v.offset|) (<= (+ |ldv_atomic_add_return_#in~v.offset| 4) (select |#length| |ldv_atomic_add_return_#in~v.base|))), 9502#(and (<= 12 ldv_atomic_add_return_~v.offset) (<= (+ ldv_atomic_add_return_~v.offset 4) (select |#length| ldv_atomic_add_return_~v.base)))] [2018-02-02 10:20:17,528 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:20:17,528 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:20:17,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:20:17,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:20:17,529 INFO L87 Difference]: Start difference. First operand 145 states and 149 transitions. Second operand 17 states. [2018-02-02 10:20:17,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:17,811 INFO L93 Difference]: Finished difference Result 143 states and 147 transitions. [2018-02-02 10:20:17,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:20:17,811 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 74 [2018-02-02 10:20:17,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:17,812 INFO L225 Difference]: With dead ends: 143 [2018-02-02 10:20:17,812 INFO L226 Difference]: Without dead ends: 143 [2018-02-02 10:20:17,812 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:20:17,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-02 10:20:17,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-02-02 10:20:17,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-02 10:20:17,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 147 transitions. [2018-02-02 10:20:17,815 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 147 transitions. Word has length 74 [2018-02-02 10:20:17,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:17,815 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 147 transitions. [2018-02-02 10:20:17,815 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:20:17,815 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 147 transitions. [2018-02-02 10:20:17,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-02 10:20:17,816 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:17,816 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 10:20:17,816 INFO L371 AbstractCegarLoop]: === Iteration 32 === [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_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, 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-02-02 10:20:17,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1793118269, now seen corresponding path program 1 times [2018-02-02 10:20:17,817 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:17,832 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:18,000 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:20:18,000 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:20:18,000 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 10:20:18,000 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:18,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:18,001 INFO L182 omatonBuilderFactory]: Interpolants [9808#(= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|), 9809#(= 0 |ldv_kobject_get_#in~kobj.base|), 9799#true, 9800#false, 9801#(not (= |ldv_malloc_#t~malloc4.base| 0)), 9802#(not (= |ldv_malloc_#res.base| 0)), 9803#(not (= |ldv_kobject_create_#t~ret17.base| 0)), 9804#(not (= ldv_kobject_create_~kobj~1.base 0)), 9805#(not (= |ldv_kobject_create_#res.base| 0)), 9806#(not (= |entry_point_#t~ret19.base| 0)), 9807#(not (= entry_point_~kobj~2.base 0))] [2018-02-02 10:20:18,001 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:20:18,001 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:20:18,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:20:18,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:20:18,001 INFO L87 Difference]: Start difference. First operand 143 states and 147 transitions. Second operand 11 states. [2018-02-02 10:20:18,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:18,047 INFO L93 Difference]: Finished difference Result 146 states and 149 transitions. [2018-02-02 10:20:18,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:20:18,047 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2018-02-02 10:20:18,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:18,048 INFO L225 Difference]: With dead ends: 146 [2018-02-02 10:20:18,048 INFO L226 Difference]: Without dead ends: 143 [2018-02-02 10:20:18,049 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:20:18,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-02 10:20:18,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-02-02 10:20:18,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-02 10:20:18,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 146 transitions. [2018-02-02 10:20:18,050 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 146 transitions. Word has length 83 [2018-02-02 10:20:18,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:18,051 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 146 transitions. [2018-02-02 10:20:18,051 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:20:18,051 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 146 transitions. [2018-02-02 10:20:18,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-02-02 10:20:18,051 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:18,051 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 10:20:18,051 INFO L371 AbstractCegarLoop]: === Iteration 33 === [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_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, 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-02-02 10:20:18,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1631294017, now seen corresponding path program 1 times [2018-02-02 10:20:18,052 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:18,062 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:18,226 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:20:18,226 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:20:18,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-02 10:20:18,226 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:18,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:18,226 INFO L182 omatonBuilderFactory]: Interpolants [10112#(= 1 (select |#valid| |ldv_kref_get_#in~kref.base|)), 10113#(= 1 (select |#valid| |ldv_kobject_get_#in~kobj.base|)), 10114#(= 1 (select |#valid| entry_point_~kobj~2.base)), 10115#(= 1 (select |#valid| |ldv_kobject_put_#in~kobj.base|)), 10116#(= 1 (select |#valid| ldv_kobject_put_~kobj.base)), 10117#(= 1 (select |#valid| |ldv_kref_put_#in~kref.base|)), 10118#(= 1 (select |#valid| ldv_kref_put_~kref.base)), 10119#(= 1 (select |#valid| |ldv_kref_sub_#in~kref.base|)), 10120#(= 1 (select |#valid| ldv_kref_sub_~kref.base)), 10121#(= 1 (select |#valid| |ldv_atomic_sub_return_#in~v.base|)), 10122#(= 1 (select |#valid| ldv_atomic_sub_return_~v.base)), 10105#true, 10106#false, 10107#(= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|), 10108#(= ldv_kref_get_~kref.base |ldv_kref_get_#in~kref.base|), 10109#(= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|), 10110#(and (= 1 (select |#valid| ldv_atomic_add_return_~v.base)) (= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|)), 10111#(= 1 (select |#valid| |ldv_atomic_add_return_#in~v.base|))] [2018-02-02 10:20:18,227 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:20:18,227 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:20:18,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:20:18,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:20:18,227 INFO L87 Difference]: Start difference. First operand 143 states and 146 transitions. Second operand 18 states. [2018-02-02 10:20:18,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:18,516 INFO L93 Difference]: Finished difference Result 150 states and 153 transitions. [2018-02-02 10:20:18,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:20:18,517 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 96 [2018-02-02 10:20:18,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:18,518 INFO L225 Difference]: With dead ends: 150 [2018-02-02 10:20:18,518 INFO L226 Difference]: Without dead ends: 150 [2018-02-02 10:20:18,518 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:20:18,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-02 10:20:18,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 141. [2018-02-02 10:20:18,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-02-02 10:20:18,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 144 transitions. [2018-02-02 10:20:18,522 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 144 transitions. Word has length 96 [2018-02-02 10:20:18,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:18,522 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 144 transitions. [2018-02-02 10:20:18,522 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:20:18,522 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 144 transitions. [2018-02-02 10:20:18,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-02-02 10:20:18,523 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:18,523 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 10:20:18,523 INFO L371 AbstractCegarLoop]: === Iteration 34 === [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_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, 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-02-02 10:20:18,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1631294016, now seen corresponding path program 1 times [2018-02-02 10:20:18,524 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:18,542 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:18,859 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:20:18,859 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:20:18,860 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-02 10:20:18,860 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:18,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:18,860 INFO L182 omatonBuilderFactory]: Interpolants [10432#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 10433#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 10434#(and (= 0 |ldv_kobject_create_#res.offset|) (<= 16 (select |#length| |ldv_kobject_create_#res.base|))), 10435#(and (= 0 |entry_point_#t~ret19.offset|) (<= 16 (select |#length| |entry_point_#t~ret19.base|))), 10436#(and (= 0 entry_point_~kobj~2.offset) (<= 16 (select |#length| entry_point_~kobj~2.base))), 10437#(and (<= 16 (select |#length| |ldv_kobject_put_#in~kobj.base|)) (= 0 |ldv_kobject_put_#in~kobj.offset|)), 10438#(and (= ldv_kobject_put_~kobj.offset 0) (<= 16 (select |#length| ldv_kobject_put_~kobj.base))), 10439#(and (<= 12 |ldv_kref_put_#in~kref.offset|) (<= (+ |ldv_kref_put_#in~kref.offset| 4) (select |#length| |ldv_kref_put_#in~kref.base|))), 10440#(and (<= 12 ldv_kref_put_~kref.offset) (<= (+ ldv_kref_put_~kref.offset 4) (select |#length| ldv_kref_put_~kref.base))), 10441#(and (<= (+ |ldv_kref_sub_#in~kref.offset| 4) (select |#length| |ldv_kref_sub_#in~kref.base|)) (<= 12 |ldv_kref_sub_#in~kref.offset|)), 10442#(and (<= (+ ldv_kref_sub_~kref.offset 4) (select |#length| ldv_kref_sub_~kref.base)) (<= 12 ldv_kref_sub_~kref.offset)), 10443#(and (<= (+ |ldv_atomic_sub_return_#in~v.offset| 4) (select |#length| |ldv_atomic_sub_return_#in~v.base|)) (<= 12 |ldv_atomic_sub_return_#in~v.offset|)), 10444#(and (<= (+ ldv_atomic_sub_return_~v.offset 4) (select |#length| ldv_atomic_sub_return_~v.base)) (<= 12 ldv_atomic_sub_return_~v.offset)), 10426#true, 10427#false, 10428#(= 0 |ldv_malloc_#t~malloc4.offset|), 10429#(= 0 |ldv_malloc_#res.offset|), 10430#(= 0 |ldv_kobject_create_#t~ret17.offset|), 10431#(= 0 ldv_kobject_create_~kobj~1.offset)] [2018-02-02 10:20:18,860 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:20:18,860 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:20:18,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:20:18,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:20:18,861 INFO L87 Difference]: Start difference. First operand 141 states and 144 transitions. Second operand 19 states. [2018-02-02 10:20:19,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:19,181 INFO L93 Difference]: Finished difference Result 139 states and 142 transitions. [2018-02-02 10:20:19,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:20:19,181 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 96 [2018-02-02 10:20:19,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:19,182 INFO L225 Difference]: With dead ends: 139 [2018-02-02 10:20:19,182 INFO L226 Difference]: Without dead ends: 139 [2018-02-02 10:20:19,182 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:20:19,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-02 10:20:19,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-02-02 10:20:19,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-02-02 10:20:19,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 142 transitions. [2018-02-02 10:20:19,184 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 142 transitions. Word has length 96 [2018-02-02 10:20:19,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:19,184 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 142 transitions. [2018-02-02 10:20:19,184 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:20:19,184 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 142 transitions. [2018-02-02 10:20:19,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 10:20:19,184 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:19,185 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 10:20:19,185 INFO L371 AbstractCegarLoop]: === Iteration 35 === [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_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, 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-02-02 10:20:19,185 INFO L82 PathProgramCache]: Analyzing trace with hash 921382477, now seen corresponding path program 1 times [2018-02-02 10:20:19,186 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:19,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:19,194 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:19,298 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:20:19,299 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:20:19,299 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 10:20:19,299 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:19,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:19,299 INFO L182 omatonBuilderFactory]: Interpolants [10736#false, 10737#(not (= |ldv_malloc_#t~malloc4.base| 0)), 10738#(not (= |ldv_malloc_#res.base| 0)), 10739#(not (= |ldv_kobject_create_#t~ret17.base| 0)), 10740#(not (= ldv_kobject_create_~kobj~1.base 0)), 10741#(not (= |ldv_kobject_create_#res.base| 0)), 10742#(not (= |entry_point_#t~ret19.base| 0)), 10743#(not (= entry_point_~kobj~2.base 0)), 10744#(= ldv_kobject_put_~kobj.base |ldv_kobject_put_#in~kobj.base|), 10745#(= 0 |ldv_kobject_put_#in~kobj.base|), 10735#true] [2018-02-02 10:20:19,300 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:20:19,300 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:20:19,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:20:19,300 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:20:19,300 INFO L87 Difference]: Start difference. First operand 139 states and 142 transitions. Second operand 11 states. [2018-02-02 10:20:19,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:19,354 INFO L93 Difference]: Finished difference Result 141 states and 143 transitions. [2018-02-02 10:20:19,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:20:19,354 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2018-02-02 10:20:19,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:19,355 INFO L225 Difference]: With dead ends: 141 [2018-02-02 10:20:19,355 INFO L226 Difference]: Without dead ends: 139 [2018-02-02 10:20:19,355 INFO L554 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-02-02 10:20:19,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-02 10:20:19,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-02-02 10:20:19,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-02-02 10:20:19,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 141 transitions. [2018-02-02 10:20:19,358 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 141 transitions. Word has length 94 [2018-02-02 10:20:19,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:19,358 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 141 transitions. [2018-02-02 10:20:19,358 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:20:19,358 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 141 transitions. [2018-02-02 10:20:19,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-02-02 10:20:19,359 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:19,359 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 10:20:19,359 INFO L371 AbstractCegarLoop]: === Iteration 36 === [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_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, 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-02-02 10:20:19,360 INFO L82 PathProgramCache]: Analyzing trace with hash -61442992, now seen corresponding path program 1 times [2018-02-02 10:20:19,360 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:19,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:19,377 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:19,596 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:20:19,596 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:20:19,596 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-02-02 10:20:19,596 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:19,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:19,596 INFO L182 omatonBuilderFactory]: Interpolants [11040#(= 1 (select |#valid| |ldv_kobject_get_#in~kobj.base|)), 11041#(= 1 (select |#valid| entry_point_~kobj~2.base)), 11042#(= 1 (select |#valid| |ldv_kobject_put_#in~kobj.base|)), 11043#(= 1 (select |#valid| ldv_kobject_put_~kobj.base)), 11044#(= 1 (select |#valid| |ldv_kref_put_#in~kref.base|)), 11045#(= 1 (select |#valid| ldv_kref_put_~kref.base)), 11046#(= 1 (select |#valid| |ldv_kref_sub_#in~kref.base|)), 11047#(= 1 (select |#valid| ldv_kref_sub_~kref.base)), 11048#(= 1 (select |#valid| |##fun~$Pointer$~TO~VOID_#in~kref.base|)), 11049#(= 1 (select |#valid| |##fun~$Pointer$~TO~VOID_#~kref.base|)), 11050#(= 1 (select |#valid| |ldv_kobject_release_#in~kref.base|)), 11051#(= 1 (select |#valid| ldv_kobject_release_~kobj~0.base)), 11052#(= 1 (select |#valid| |ldv_kobject_cleanup_#in~kobj.base|)), 11053#(= 1 (select |#valid| ldv_kobject_cleanup_~kobj.base)), 11032#true, 11033#false, 11034#(= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|), 11035#(= ldv_kref_get_~kref.base |ldv_kref_get_#in~kref.base|), 11036#(= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|), 11037#(and (= 1 (select |#valid| ldv_atomic_add_return_~v.base)) (= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|)), 11038#(= 1 (select |#valid| |ldv_atomic_add_return_#in~v.base|)), 11039#(= 1 (select |#valid| |ldv_kref_get_#in~kref.base|))] [2018-02-02 10:20:19,596 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:20:19,596 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:20:19,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:20:19,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:20:19,597 INFO L87 Difference]: Start difference. First operand 139 states and 141 transitions. Second operand 22 states. [2018-02-02 10:20:19,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:19,901 INFO L93 Difference]: Finished difference Result 142 states and 144 transitions. [2018-02-02 10:20:19,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:20:19,902 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 110 [2018-02-02 10:20:19,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:19,903 INFO L225 Difference]: With dead ends: 142 [2018-02-02 10:20:19,903 INFO L226 Difference]: Without dead ends: 142 [2018-02-02 10:20:19,903 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:20:19,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-02-02 10:20:19,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 137. [2018-02-02 10:20:19,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-02 10:20:19,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 139 transitions. [2018-02-02 10:20:19,904 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 139 transitions. Word has length 110 [2018-02-02 10:20:19,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:19,905 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 139 transitions. [2018-02-02 10:20:19,905 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:20:19,905 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 139 transitions. [2018-02-02 10:20:19,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-02-02 10:20:19,905 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:19,905 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 10:20:19,905 INFO L371 AbstractCegarLoop]: === Iteration 37 === [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_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, 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-02-02 10:20:19,905 INFO L82 PathProgramCache]: Analyzing trace with hash -61442991, now seen corresponding path program 1 times [2018-02-02 10:20:19,906 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:19,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:19,922 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:20,329 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:20:20,330 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:20:20,330 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-02-02 10:20:20,330 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:20,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:20,330 INFO L182 omatonBuilderFactory]: Interpolants [11360#(and (<= 16 (select |#length| |ldv_kobject_put_#in~kobj.base|)) (= 0 |ldv_kobject_put_#in~kobj.offset|)), 11361#(and (= ldv_kobject_put_~kobj.offset 0) (<= 16 (select |#length| ldv_kobject_put_~kobj.base))), 11362#(and (<= 12 |ldv_kref_put_#in~kref.offset|) (<= (+ |ldv_kref_put_#in~kref.offset| 4) (select |#length| |ldv_kref_put_#in~kref.base|))), 11363#(and (<= 12 ldv_kref_put_~kref.offset) (<= (+ ldv_kref_put_~kref.offset 4) (select |#length| ldv_kref_put_~kref.base))), 11364#(and (<= (+ |ldv_kref_sub_#in~kref.offset| 4) (select |#length| |ldv_kref_sub_#in~kref.base|)) (<= 12 |ldv_kref_sub_#in~kref.offset|)), 11365#(and (<= (+ ldv_kref_sub_~kref.offset 4) (select |#length| ldv_kref_sub_~kref.base)) (<= 12 ldv_kref_sub_~kref.offset)), 11366#(and (<= 12 |##fun~$Pointer$~TO~VOID_#in~kref.offset|) (<= (+ |##fun~$Pointer$~TO~VOID_#in~kref.offset| 4) (select |#length| |##fun~$Pointer$~TO~VOID_#in~kref.base|))), 11367#(and (<= 12 |##fun~$Pointer$~TO~VOID_#~kref.offset|) (<= (+ |##fun~$Pointer$~TO~VOID_#~kref.offset| 4) (select |#length| |##fun~$Pointer$~TO~VOID_#~kref.base|))), 11368#(and (<= 12 |ldv_kobject_release_#in~kref.offset|) (<= (+ |ldv_kobject_release_#in~kref.offset| 4) (select |#length| |ldv_kobject_release_#in~kref.base|))), 11369#(and (<= (+ ldv_kobject_release_~kobj~0.offset 16) (select |#length| ldv_kobject_release_~kobj~0.base)) (<= 0 ldv_kobject_release_~kobj~0.offset)), 11370#(and (<= (+ |ldv_kobject_cleanup_#in~kobj.offset| 16) (select |#length| |ldv_kobject_cleanup_#in~kobj.base|)) (<= 0 |ldv_kobject_cleanup_#in~kobj.offset|)), 11371#(and (<= 0 ldv_kobject_cleanup_~kobj.offset) (<= (+ ldv_kobject_cleanup_~kobj.offset 16) (select |#length| ldv_kobject_cleanup_~kobj.base))), 11349#true, 11350#false, 11351#(= 0 |ldv_malloc_#t~malloc4.offset|), 11352#(= 0 |ldv_malloc_#res.offset|), 11353#(= 0 |ldv_kobject_create_#t~ret17.offset|), 11354#(= 0 ldv_kobject_create_~kobj~1.offset), 11355#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 11356#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 11357#(and (= 0 |ldv_kobject_create_#res.offset|) (<= 16 (select |#length| |ldv_kobject_create_#res.base|))), 11358#(and (= 0 |entry_point_#t~ret19.offset|) (<= 16 (select |#length| |entry_point_#t~ret19.base|))), 11359#(and (= 0 entry_point_~kobj~2.offset) (<= 16 (select |#length| entry_point_~kobj~2.base)))] [2018-02-02 10:20:20,331 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:20:20,331 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:20:20,331 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:20:20,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:20:20,331 INFO L87 Difference]: Start difference. First operand 137 states and 139 transitions. Second operand 23 states. [2018-02-02 10:20:20,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:20,855 INFO L93 Difference]: Finished difference Result 136 states and 138 transitions. [2018-02-02 10:20:20,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:20:20,855 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 110 [2018-02-02 10:20:20,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:20,856 INFO L225 Difference]: With dead ends: 136 [2018-02-02 10:20:20,856 INFO L226 Difference]: Without dead ends: 136 [2018-02-02 10:20:20,856 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=853, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:20:20,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-02-02 10:20:20,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-02-02 10:20:20,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-02-02 10:20:20,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2018-02-02 10:20:20,858 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 138 transitions. Word has length 110 [2018-02-02 10:20:20,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:20,858 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 138 transitions. [2018-02-02 10:20:20,858 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:20:20,858 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 138 transitions. [2018-02-02 10:20:20,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-02-02 10:20:20,859 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:20,859 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 10:20:20,859 INFO L371 AbstractCegarLoop]: === Iteration 38 === [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_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, 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-02-02 10:20:20,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1082829329, now seen corresponding path program 1 times [2018-02-02 10:20:20,860 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:20,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:20,875 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:21,161 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:20:21,162 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:20:21,162 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-02-02 10:20:21,162 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:21,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:21,162 INFO L182 omatonBuilderFactory]: Interpolants [11680#(<= ldv_kobject_cleanup_~kobj.offset 0), 11681#(and (<= 0 ldv_kobject_cleanup_~kobj.offset) (<= ldv_kobject_cleanup_~kobj.offset 0)), 11660#true, 11661#false, 11662#(= 0 |ldv_malloc_#t~malloc4.offset|), 11663#(= 0 |ldv_malloc_#res.offset|), 11664#(= 0 |ldv_kobject_create_#t~ret17.offset|), 11665#(= 0 ldv_kobject_create_~kobj~1.offset), 11666#(= 0 |ldv_kobject_create_#res.offset|), 11667#(= 0 |entry_point_#t~ret19.offset|), 11668#(= 0 entry_point_~kobj~2.offset), 11669#(= 0 |ldv_kobject_put_#in~kobj.offset|), 11670#(= ldv_kobject_put_~kobj.offset 0), 11671#(<= |ldv_kref_put_#in~kref.offset| 12), 11672#(<= ldv_kref_put_~kref.offset 12), 11673#(<= |ldv_kref_sub_#in~kref.offset| 12), 11674#(<= ldv_kref_sub_~kref.offset 12), 11675#(<= |##fun~$Pointer$~TO~VOID_#in~kref.offset| 12), 11676#(<= |##fun~$Pointer$~TO~VOID_#~kref.offset| 12), 11677#(<= |ldv_kobject_release_#in~kref.offset| 12), 11678#(<= ldv_kobject_release_~kobj~0.offset 0), 11679#(<= |ldv_kobject_cleanup_#in~kobj.offset| 0)] [2018-02-02 10:20:21,162 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:20:21,163 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:20:21,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:20:21,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:20:21,163 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. Second operand 22 states. [2018-02-02 10:20:21,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:21,431 INFO L93 Difference]: Finished difference Result 135 states and 137 transitions. [2018-02-02 10:20:21,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:20:21,431 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 112 [2018-02-02 10:20:21,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:21,432 INFO L225 Difference]: With dead ends: 135 [2018-02-02 10:20:21,432 INFO L226 Difference]: Without dead ends: 135 [2018-02-02 10:20:21,432 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=850, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:20:21,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-02 10:20:21,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-02-02 10:20:21,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-02 10:20:21,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 137 transitions. [2018-02-02 10:20:21,435 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 137 transitions. Word has length 112 [2018-02-02 10:20:21,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:21,435 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 137 transitions. [2018-02-02 10:20:21,435 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:20:21,435 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 137 transitions. [2018-02-02 10:20:21,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-02-02 10:20:21,436 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:21,436 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 10:20:21,436 INFO L371 AbstractCegarLoop]: === Iteration 39 === [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_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, 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-02-02 10:20:21,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1216902226, now seen corresponding path program 1 times [2018-02-02 10:20:21,437 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:21,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:21,485 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:23,078 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-02-02 10:20:23,078 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:20:23,078 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2018-02-02 10:20:23,078 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:23,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:23,079 INFO L182 omatonBuilderFactory]: Interpolants [11970#true, 11971#false, 11972#(= 0 |ldv_malloc_#t~malloc4.offset|), 11973#(= 0 |ldv_malloc_#res.offset|), 11974#(= 0 |ldv_kobject_create_#t~ret17.offset|), 11975#(= 0 ldv_kobject_create_~kobj~1.offset), 11976#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= |#Ultimate.C_memset_#t~loopctr21| |#Ultimate.C_memset_#amount|)), 11977#(and (= |ldv_kobject_init_#in~kobj.offset| ldv_kobject_init_~kobj.offset) (= ldv_kobject_init_~kobj.base |ldv_kobject_init_#in~kobj.base|)), 11978#(and (or (= ldv_kobject_init_internal_~kobj.offset |ldv_kobject_init_internal_#in~kobj.offset|) (= ldv_kobject_init_internal_~kobj.offset 0)) (or (not (= ldv_kobject_init_internal_~kobj.offset 0)) (= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|))), 11979#(and (or (= ldv_kobject_init_internal_~kobj.offset 0) (not (= |ldv_kobject_init_internal_#in~kobj.offset| 0))) (or (not (= ldv_kobject_init_internal_~kobj.offset 0)) (= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|))), 11980#(and (<= ldv_kref_init_~kref.offset |ldv_kref_init_#in~kref.offset|) (<= |ldv_kref_init_#in~kref.offset| ldv_kref_init_~kref.offset) (= ldv_kref_init_~kref.base |ldv_kref_init_#in~kref.base|)), 11981#(= 1 (select (select |#memory_int| |ldv_kref_init_#in~kref.base|) (- (- |ldv_kref_init_#in~kref.offset|)))), 11982#(and (or (and (= 1 (select (select |#memory_int| ldv_kobject_init_internal_~kobj.base) (- (+ (- ldv_kobject_init_internal_~kobj.offset) (- 12))))) (= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|)) (not (= ldv_kobject_init_internal_~kobj.offset 0))) (or (= ldv_kobject_init_internal_~kobj.offset 0) (not (= |ldv_kobject_init_internal_#in~kobj.offset| 0)))), 11983#(= |#memory_int| |old(#memory_int)|), 11984#(and (= LDV_INIT_LIST_HEAD_~list.base |LDV_INIT_LIST_HEAD_#in~list.base|) (= |#memory_int| |old(#memory_int)|) (<= LDV_INIT_LIST_HEAD_~list.offset |LDV_INIT_LIST_HEAD_#in~list.offset|)), 11985#(and (= LDV_INIT_LIST_HEAD_~list.base |LDV_INIT_LIST_HEAD_#in~list.base|) (= (store (select |old(#memory_int)| LDV_INIT_LIST_HEAD_~list.base) LDV_INIT_LIST_HEAD_~list.offset (select (select |#memory_int| LDV_INIT_LIST_HEAD_~list.base) LDV_INIT_LIST_HEAD_~list.offset)) (select |#memory_int| LDV_INIT_LIST_HEAD_~list.base)) (<= LDV_INIT_LIST_HEAD_~list.offset |LDV_INIT_LIST_HEAD_#in~list.offset|)), 11986#(and (or (<= (@diff (select |old(#memory_int)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_int| |LDV_INIT_LIST_HEAD_#in~list.base|)) (+ |LDV_INIT_LIST_HEAD_#in~list.offset| 4)) (= (select |old(#memory_int)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_int| |LDV_INIT_LIST_HEAD_#in~list.base|))) (= (store (store (select |old(#memory_int)| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_int)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_int| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_int| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_int)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_int| |LDV_INIT_LIST_HEAD_#in~list.base|)))) (@diff (store (select |old(#memory_int)| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_int)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_int| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_int| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_int)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_int| |LDV_INIT_LIST_HEAD_#in~list.base|)))) (select |#memory_int| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_int| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (store (select |old(#memory_int)| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_int)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_int| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_int| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_int)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_int| |LDV_INIT_LIST_HEAD_#in~list.base|)))) (select |#memory_int| |LDV_INIT_LIST_HEAD_#in~list.base|)))) (select |#memory_int| |LDV_INIT_LIST_HEAD_#in~list.base|)) (or (= (store (select |old(#memory_int)| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_int)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_int| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_int| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_int)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_int| |LDV_INIT_LIST_HEAD_#in~list.base|)))) (select |#memory_int| |LDV_INIT_LIST_HEAD_#in~list.base|)) (<= (@diff (store (select |old(#memory_int)| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_int)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_int| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_int| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_int)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_int| |LDV_INIT_LIST_HEAD_#in~list.base|)))) (select |#memory_int| |LDV_INIT_LIST_HEAD_#in~list.base|)) (+ |LDV_INIT_LIST_HEAD_#in~list.offset| 4)))), 11987#(or (= 1 (select (select |#memory_int| |ldv_kobject_init_internal_#in~kobj.base|) (- (- 12)))) (not (= |ldv_kobject_init_internal_#in~kobj.offset| 0))), 11988#(or (= 1 (select (select |#memory_int| |ldv_kobject_init_#in~kobj.base|) (- (- 12)))) (not (= |ldv_kobject_init_#in~kobj.offset| 0))), 11989#(and (= 0 ldv_kobject_create_~kobj~1.offset) (= 1 (select (select |#memory_int| ldv_kobject_create_~kobj~1.base) 12))), 11990#(and (= 1 (select (select |#memory_int| |ldv_kobject_create_#res.base|) 12)) (= 0 |ldv_kobject_create_#res.offset|)), 11991#(and (= 0 |entry_point_#t~ret19.offset|) (= 1 (select (select |#memory_int| |entry_point_#t~ret19.base|) 12))), 11992#(and (= 0 entry_point_~kobj~2.offset) (= 1 (select (select |#memory_int| entry_point_~kobj~2.base) 12))), 11993#(and (or (and (= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|) (= |#memory_int| |old(#memory_int)|)) (not (= ldv_kobject_get_~kobj.offset 0))) (or (= ldv_kobject_get_~kobj.offset |ldv_kobject_get_#in~kobj.offset|) (= ldv_kobject_get_~kobj.offset 0))), 11994#(and (or (and (= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|) (= |#memory_int| |old(#memory_int)|)) (not (= ldv_kobject_get_~kobj.offset 0))) (or (not (= 0 |ldv_kobject_get_#in~kobj.offset|)) (= ldv_kobject_get_~kobj.offset 0))), 11995#(and (<= ldv_kref_get_~kref.offset |ldv_kref_get_#in~kref.offset|) (= |#memory_int| |old(#memory_int)|) (= ldv_kref_get_~kref.base |ldv_kref_get_#in~kref.base|) (<= |ldv_kref_get_#in~kref.offset| ldv_kref_get_~kref.offset)), 11996#(and (<= |ldv_atomic_add_return_#in~v.offset| ldv_atomic_add_return_~v.offset) (<= ldv_atomic_add_return_~v.offset |ldv_atomic_add_return_#in~v.offset|) (or (= |ldv_atomic_add_return_#in~i| ldv_atomic_add_return_~i) (= ldv_atomic_add_return_~i 1)) (or (and (= |#memory_int| |old(#memory_int)|) (= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|)) (not (= ldv_atomic_add_return_~i 1)))), 11997#(and (or (not (= ldv_atomic_add_return_~i 1)) (and (or (= (select (select |#memory_int| ldv_atomic_add_return_~v.base) ldv_atomic_add_return_~v.offset) |ldv_atomic_add_return_#t~mem7|) (= |ldv_atomic_add_return_#t~mem7| 1)) (= |#memory_int| |old(#memory_int)|) (= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|))) (<= |ldv_atomic_add_return_#in~v.offset| ldv_atomic_add_return_~v.offset) (<= ldv_atomic_add_return_~v.offset |ldv_atomic_add_return_#in~v.offset|) (or (= |ldv_atomic_add_return_#in~i| ldv_atomic_add_return_~i) (= ldv_atomic_add_return_~i 1))), 11998#(and (or (not (= |ldv_atomic_add_return_#in~i| 1)) (and (or (<= 2 ldv_atomic_add_return_~temp~0) (not (= (select (select |#memory_int| ldv_atomic_add_return_~v.base) ldv_atomic_add_return_~v.offset) 1))) (= |#memory_int| |old(#memory_int)|) (= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|))) (<= |ldv_atomic_add_return_#in~v.offset| ldv_atomic_add_return_~v.offset) (<= ldv_atomic_add_return_~v.offset |ldv_atomic_add_return_#in~v.offset|)), 11999#(or (not (= |ldv_atomic_add_return_#in~i| 1)) (and (<= 2 ldv_atomic_add_return_~temp~0) (= ldv_atomic_add_return_~temp~0 (select (select |#memory_int| |ldv_atomic_add_return_#in~v.base|) (- (- |ldv_atomic_add_return_#in~v.offset|))))) (not (= (select (select |old(#memory_int)| |ldv_atomic_add_return_#in~v.base|) (- (- |ldv_atomic_add_return_#in~v.offset|))) 1))), 12000#(or (not (= |ldv_atomic_add_return_#in~i| 1)) (<= 2 (select (select |#memory_int| |ldv_atomic_add_return_#in~v.base|) (- (- |ldv_atomic_add_return_#in~v.offset|)))) (not (= (select (select |old(#memory_int)| |ldv_atomic_add_return_#in~v.base|) (- (- |ldv_atomic_add_return_#in~v.offset|))) 1))), 12001#(or (not (= (select (select |old(#memory_int)| |ldv_kref_get_#in~kref.base|) (- (- |ldv_kref_get_#in~kref.offset|))) 1)) (<= 2 (select (select |#memory_int| |ldv_kref_get_#in~kref.base|) (- (- |ldv_kref_get_#in~kref.offset|))))), 12002#(and (or (<= 2 (select (select |#memory_int| |ldv_kobject_get_#in~kobj.base|) (- (+ (- ldv_kobject_get_~kobj.offset) (- 12))))) (not (= (select (select |old(#memory_int)| |ldv_kobject_get_#in~kobj.base|) (- (+ (- ldv_kobject_get_~kobj.offset) (- 12)))) 1)) (not (= ldv_kobject_get_~kobj.offset 0))) (or (not (= 0 |ldv_kobject_get_#in~kobj.offset|)) (= ldv_kobject_get_~kobj.offset 0))), 12003#(or (not (= 0 |ldv_kobject_get_#in~kobj.offset|)) (<= 2 (select (select |#memory_int| |ldv_kobject_get_#in~kobj.base|) (- (- 12)))) (not (= (select (select |old(#memory_int)| |ldv_kobject_get_#in~kobj.base|) (- (- 12))) 1))), 12004#(and (<= 2 (select (select |#memory_int| entry_point_~kobj~2.base) 12)) (= 0 entry_point_~kobj~2.offset)), 12005#(and (<= 2 (select (select |#memory_int| |ldv_kobject_put_#in~kobj.base|) 12)) (= 0 |ldv_kobject_put_#in~kobj.offset|)), 12006#(and (= ldv_kobject_put_~kobj.offset 0) (<= 2 (select (select |#memory_int| ldv_kobject_put_~kobj.base) 12))), 12007#(<= 2 (select (select |#memory_int| |ldv_kref_put_#in~kref.base|) |ldv_kref_put_#in~kref.offset|)), 12008#(<= 2 (select (select |#memory_int| ldv_kref_put_~kref.base) ldv_kref_put_~kref.offset)), 12009#(and (<= 2 (select (select |#memory_int| |ldv_kref_sub_#in~kref.base|) |ldv_kref_sub_#in~kref.offset|)) (= 1 |ldv_kref_sub_#in~count|)), 12010#(and (= ldv_kref_sub_~count 1) (<= 2 (select (select |#memory_int| ldv_kref_sub_~kref.base) ldv_kref_sub_~kref.offset))), 12011#(and (= ldv_atomic_sub_return_~i |ldv_atomic_sub_return_#in~i|) (<= ldv_atomic_sub_return_~v.offset |ldv_atomic_sub_return_#in~v.offset|) (<= |ldv_atomic_sub_return_#in~v.offset| ldv_atomic_sub_return_~v.offset) (= |#memory_int| |old(#memory_int)|) (= ldv_atomic_sub_return_~v.base |ldv_atomic_sub_return_#in~v.base|)), 12012#(and (= ldv_atomic_sub_return_~i |ldv_atomic_sub_return_#in~i|) (<= ldv_atomic_sub_return_~v.offset |ldv_atomic_sub_return_#in~v.offset|) (<= |ldv_atomic_sub_return_#in~v.offset| ldv_atomic_sub_return_~v.offset) (= (select (select |#memory_int| ldv_atomic_sub_return_~v.base) ldv_atomic_sub_return_~v.offset) |ldv_atomic_sub_return_#t~mem9|) (= |#memory_int| |old(#memory_int)|) (= ldv_atomic_sub_return_~v.base |ldv_atomic_sub_return_#in~v.base|)), 12013#(and (<= (select (select |#memory_int| ldv_atomic_sub_return_~v.base) ldv_atomic_sub_return_~v.offset) (+ |ldv_atomic_sub_return_#in~i| ldv_atomic_sub_return_~temp~1)) (<= ldv_atomic_sub_return_~v.offset |ldv_atomic_sub_return_#in~v.offset|) (<= |ldv_atomic_sub_return_#in~v.offset| ldv_atomic_sub_return_~v.offset) (= |#memory_int| |old(#memory_int)|) (= ldv_atomic_sub_return_~v.base |ldv_atomic_sub_return_#in~v.base|)), 12014#(<= (select (select |old(#memory_int)| |ldv_atomic_sub_return_#in~v.base|) (- (- |ldv_atomic_sub_return_#in~v.offset|))) (+ |ldv_atomic_sub_return_#in~i| ldv_atomic_sub_return_~temp~1)), 12015#(<= (select (select |old(#memory_int)| |ldv_atomic_sub_return_#in~v.base|) (- (- |ldv_atomic_sub_return_#in~v.offset|))) (+ |ldv_atomic_sub_return_#in~i| |ldv_atomic_sub_return_#res|)), 12016#(<= 1 |ldv_kref_sub_#t~ret11|)] [2018-02-02 10:20:23,079 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-02-02 10:20:23,079 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-02 10:20:23,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-02 10:20:23,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=2048, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 10:20:23,080 INFO L87 Difference]: Start difference. First operand 135 states and 137 transitions. Second operand 47 states. [2018-02-02 10:20:24,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:24,654 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-02-02 10:20:24,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-02 10:20:24,658 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 114 [2018-02-02 10:20:24,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:24,659 INFO L225 Difference]: With dead ends: 115 [2018-02-02 10:20:24,659 INFO L226 Difference]: Without dead ends: 115 [2018-02-02 10:20:24,660 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=243, Invalid=4587, Unknown=0, NotChecked=0, Total=4830 [2018-02-02 10:20:24,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-02 10:20:24,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-02-02 10:20:24,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-02 10:20:24,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-02-02 10:20:24,661 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 114 [2018-02-02 10:20:24,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:24,661 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-02-02 10:20:24,661 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-02 10:20:24,661 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-02-02 10:20:24,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-02-02 10:20:24,662 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:24,662 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 10:20:24,662 INFO L371 AbstractCegarLoop]: === Iteration 40 === [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_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, 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-02-02 10:20:24,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1949365629, now seen corresponding path program 1 times [2018-02-02 10:20:24,663 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:24,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-02 10:20:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-02 10:20:24,808 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-02 10:20:24,823 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-02-02 10:20:24,829 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-02 10:20:24,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:20:24 BoogieIcfgContainer [2018-02-02 10:20:24,846 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:20:24,847 INFO L168 Benchmark]: Toolchain (without parser) took 13958.34 ms. Allocated memory was 399.0 MB in the beginning and 950.0 MB in the end (delta: 551.0 MB). Free memory was 355.9 MB in the beginning and 485.0 MB in the end (delta: -129.2 MB). Peak memory consumption was 421.9 MB. Max. memory is 5.3 GB. [2018-02-02 10:20:24,848 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 399.0 MB. Free memory is still 362.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:20:24,849 INFO L168 Benchmark]: CACSL2BoogieTranslator took 189.31 ms. Allocated memory is still 399.0 MB. Free memory was 355.9 MB in the beginning and 341.3 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. [2018-02-02 10:20:24,849 INFO L168 Benchmark]: Boogie Preprocessor took 37.21 ms. Allocated memory is still 399.0 MB. Free memory was 341.3 MB in the beginning and 340.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:20:24,849 INFO L168 Benchmark]: RCFGBuilder took 381.89 ms. Allocated memory is still 399.0 MB. Free memory was 340.0 MB in the beginning and 303.4 MB in the end (delta: 36.6 MB). Peak memory consumption was 36.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:20:24,849 INFO L168 Benchmark]: TraceAbstraction took 13346.57 ms. Allocated memory was 399.0 MB in the beginning and 950.0 MB in the end (delta: 551.0 MB). Free memory was 303.4 MB in the beginning and 485.0 MB in the end (delta: -181.6 MB). Peak memory consumption was 369.4 MB. Max. memory is 5.3 GB. [2018-02-02 10:20:24,850 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 399.0 MB. Free memory is still 362.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 189.31 ms. Allocated memory is still 399.0 MB. Free memory was 355.9 MB in the beginning and 341.3 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.21 ms. Allocated memory is still 399.0 MB. Free memory was 341.3 MB in the beginning and 340.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 381.89 ms. Allocated memory is still 399.0 MB. Free memory was 340.0 MB in the beginning and 303.4 MB in the end (delta: 36.6 MB). Peak memory consumption was 36.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 13346.57 ms. Allocated memory was 399.0 MB in the beginning and 950.0 MB in the end (delta: 551.0 MB). Free memory was 303.4 MB in the beginning and 485.0 MB in the end (delta: -181.6 MB). Peak memory consumption was 369.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1443]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1443. Possible FailurePath: [L1444] CALL entry_point() [L1436] struct ldv_kobject *kobj; [L1437] CALL, EXPR ldv_kobject_create() [L1406] struct ldv_kobject *kobj; [L1408] CALL, EXPR ldv_malloc(sizeof(*kobj)) VAL [\old(size)=16] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=16, malloc(size)={19:0}, size=16] [L1074] RET return malloc(size); VAL [\old(size)=16, \result={19:0}, malloc(size)={19:0}, size=16] [L1408] EXPR ldv_malloc(sizeof(*kobj)) VAL [ldv_malloc(sizeof(*kobj))={19:0}] [L1408] kobj = ldv_malloc(sizeof(*kobj)) [L1409] COND FALSE !(!kobj) VAL [kobj={19:0}] [L1411] FCALL memset(kobj, 0, sizeof(*kobj)) VAL [kobj={19:0}, memset(kobj, 0, sizeof(*kobj))={19:0}] [L1413] CALL ldv_kobject_init(kobj) VAL [kobj={19:0}] [L1394] COND FALSE !(!kobj) VAL [kobj={19:0}, kobj={19:0}] [L1398] CALL ldv_kobject_init_internal(kobj) VAL [kobj={19:0}] [L1380] COND FALSE !(!kobj) VAL [kobj={19:0}, kobj={19:0}] [L1382] CALL ldv_kref_init(&kobj->kref) VAL [kref={19:12}] [L1294] RET, FCALL ((&kref->refcount)->counter) = (1) VAL [kref={19:12}, kref={19:12}] [L1382] ldv_kref_init(&kobj->kref) VAL [kobj={19:0}, kobj={19:0}] [L1383] CALL LDV_INIT_LIST_HEAD(&kobj->entry) VAL [list={19:4}] [L1099] FCALL list->next = list VAL [list={19:4}, list={19:4}] [L1100] FCALL list->prev = list VAL [list={19:4}, list={19:4}] [L1383] RET, FCALL LDV_INIT_LIST_HEAD(&kobj->entry) VAL [kobj={19:0}, kobj={19:0}] [L1413] ldv_kobject_init(kobj) VAL [kobj={19:0}] [L1414] RET return kobj; VAL [\result={19:0}, kobj={19:0}] [L1437] EXPR ldv_kobject_create() VAL [ldv_kobject_create()={19:0}] [L1437] kobj = ldv_kobject_create() [L1438] CALL ldv_kobject_get(kobj) VAL [kobj={19:0}] [L1373] COND TRUE \read(*kobj) VAL [kobj={19:0}, kobj={19:0}] [L1374] CALL ldv_kref_get(&kobj->kref) VAL [kref={19:12}] [L1308] CALL ldv_atomic_add_return(1, (&kref->refcount)) VAL [\old(i)=1, v={19:12}] [L1255] int temp; VAL [\old(i)=1, i=1, v={19:12}, v={19:12}] [L1256] EXPR, FCALL v->counter VAL [\old(i)=1, i=1, v={19:12}, v={19:12}, v->counter=1] [L1256] temp = v->counter [L1257] temp += i VAL [\old(i)=1, i=1, temp=2, v={19:12}, v={19:12}] [L1258] FCALL v->counter = temp VAL [\old(i)=1, i=1, temp=2, v={19:12}, v={19:12}] [L1259] RET return temp; VAL [\old(i)=1, \result=2, i=1, temp=2, v={19:12}, v={19:12}] [L1308] RET ldv_atomic_add_return(1, (&kref->refcount)) VAL [kref={19:12}, kref={19:12}, ldv_atomic_add_return(1, (&kref->refcount))=2] [L1374] ldv_kref_get(&kobj->kref) VAL [kobj={19:0}, kobj={19:0}] [L1375] RET return kobj; VAL [\result={19:0}, kobj={19:0}, kobj={19:0}] [L1438] ldv_kobject_get(kobj) VAL [kobj={19:0}, ldv_kobject_get(kobj)={19:0}] [L1440] CALL ldv_kobject_put(kobj) VAL [kobj={19:0}] [L1361] COND TRUE \read(*kobj) VAL [kobj={19:0}, kobj={19:0}] [L1363] CALL ldv_kref_put(&kobj->kref, ldv_kobject_release) VAL [kref={19:12}, release={-1:0}] [L1313] CALL, EXPR ldv_kref_sub(kref, 1, release) VAL [\old(count)=1, kref={19:12}, release={-1:0}] [L1281] CALL, EXPR ldv_atomic_sub_return(((int) count), (&kref->refcount)) VAL [\old(i)=1, v={19:12}] [L1264] int temp; VAL [\old(i)=1, i=1, v={19:12}, v={19:12}] [L1265] EXPR, FCALL v->counter VAL [\old(i)=1, i=1, v={19:12}, v={19:12}, v->counter=2] [L1265] temp = v->counter [L1266] temp -= i VAL [\old(i)=1, i=1, temp=1, v={19:12}, v={19:12}] [L1267] FCALL v->counter = temp VAL [\old(i)=1, i=1, temp=1, v={19:12}, v={19:12}] [L1268] RET return temp; VAL [\old(i)=1, \result=1, i=1, temp=1, v={19:12}, v={19:12}] [L1281] EXPR ldv_atomic_sub_return(((int) count), (&kref->refcount)) VAL [\old(count)=1, count=1, kref={19:12}, kref={19:12}, ldv_atomic_sub_return(((int) count), (&kref->refcount))=1, release={-1:0}, release={-1:0}] [L1281] COND FALSE !((ldv_atomic_sub_return(((int) count), (&kref->refcount)) == 0)) [L1285] RET return 0; VAL [\old(count)=1, \result=0, count=1, kref={19:12}, kref={19:12}, release={-1:0}, release={-1:0}] [L1313] EXPR ldv_kref_sub(kref, 1, release) VAL [kref={19:12}, kref={19:12}, ldv_kref_sub(kref, 1, release)=0, release={-1:0}, release={-1:0}] [L1313] RET return ldv_kref_sub(kref, 1, release); [L1363] ldv_kref_put(&kobj->kref, ldv_kobject_release) VAL [kobj={19:0}, kobj={19:0}, ldv_kref_put(&kobj->kref, ldv_kobject_release)=0] [L1440] FCALL ldv_kobject_put(kobj) - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 142 locations, 23 error locations. UNSAFE Result, 13.3s OverallTime, 40 OverallIterations, 16 TraceHistogramMax, 6.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5008 SDtfs, 640 SDslu, 43097 SDs, 0 SdLazy, 8652 SolverSat, 154 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 622 GetRequests, 85 SyntacticMatches, 5 SemanticMatches, 532 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1103 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 2040/2720 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 39 MinimizatonAttempts, 39 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 2244 NumberOfCodeBlocks, 2244 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 2091 ConstructedInterpolants, 0 QuantifiedInterpolants, 496459 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 24 PerfectInterpolantSequences, 2040/2720 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-20-24-856.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_10-20-24-856.csv Received shutdown request...