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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_3_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 03:23:52,683 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 03:23:52,685 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 03:23:52,694 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 03:23:52,695 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 03:23:52,695 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 03:23:52,696 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 03:23:52,698 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 03:23:52,699 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 03:23:52,699 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 03:23:52,700 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 03:23:52,700 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 03:23:52,701 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 03:23:52,702 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 03:23:52,703 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 03:23:52,705 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 03:23:52,706 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 03:23:52,707 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 03:23:52,708 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 03:23:52,709 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 03:23:52,711 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 03:23:52,711 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 03:23:52,711 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 03:23:52,712 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 03:23:52,713 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 03:23:52,714 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 03:23:52,714 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 03:23:52,714 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 03:23:52,714 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 03:23:52,715 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 03:23:52,715 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 03:23:52,715 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-04 03:23:52,725 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 03:23:52,725 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 03:23:52,726 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 03:23:52,726 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 03:23:52,727 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 03:23:52,727 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 03:23:52,727 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 03:23:52,727 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 03:23:52,727 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 03:23:52,727 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 03:23:52,728 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 03:23:52,728 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 03:23:52,728 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 03:23:52,728 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 03:23:52,728 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 03:23:52,728 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 03:23:52,729 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 03:23:52,729 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 03:23:52,729 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 03:23:52,729 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 03:23:52,729 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 03:23:52,729 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 03:23:52,730 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 03:23:52,759 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 03:23:52,776 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 03:23:52,779 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 03:23:52,780 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 03:23:52,781 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 03:23:52,781 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_3_true-valid-memsafety_true-termination.i [2018-02-04 03:23:52,929 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 03:23:52,930 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 03:23:52,931 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 03:23:52,931 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 03:23:52,935 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 03:23:52,935 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:23:52" (1/1) ... [2018-02-04 03:23:52,938 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f13972f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:23:52, skipping insertion in model container [2018-02-04 03:23:52,938 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:23:52" (1/1) ... [2018-02-04 03:23:52,952 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 03:23:52,989 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 03:23:53,082 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 03:23:53,099 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 03:23:53,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:23:53 WrapperNode [2018-02-04 03:23:53,108 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 03:23:53,108 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 03:23:53,109 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 03:23:53,109 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 03:23:53,119 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:23:53" (1/1) ... [2018-02-04 03:23:53,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:23:53" (1/1) ... [2018-02-04 03:23:53,127 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:23:53" (1/1) ... [2018-02-04 03:23:53,127 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:23:53" (1/1) ... [2018-02-04 03:23:53,133 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:23:53" (1/1) ... [2018-02-04 03:23:53,136 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:23:53" (1/1) ... [2018-02-04 03:23:53,137 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:23:53" (1/1) ... [2018-02-04 03:23:53,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 03:23:53,140 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 03:23:53,140 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 03:23:53,140 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 03:23:53,141 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:23:53" (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-04 03:23:53,175 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 03:23:53,175 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 03:23:53,176 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-02-04 03:23:53,176 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 03:23:53,176 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-02-04 03:23:53,176 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2018-02-04 03:23:53,176 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-02-04 03:23:53,176 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-02-04 03:23:53,176 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-02-04 03:23:53,176 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2018-02-04 03:23:53,176 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-02-04 03:23:53,176 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-02-04 03:23:53,176 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-02-04 03:23:53,176 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-02-04 03:23:53,177 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2018-02-04 03:23:53,177 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-02-04 03:23:53,177 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-02-04 03:23:53,177 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-02-04 03:23:53,177 INFO L136 BoogieDeclarations]: Found implementation of procedure f_22_get [2018-02-04 03:23:53,177 INFO L136 BoogieDeclarations]: Found implementation of procedure f_22_put [2018-02-04 03:23:53,177 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 03:23:53,177 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 03:23:53,177 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 03:23:53,177 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 03:23:53,177 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 03:23:53,177 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 03:23:53,177 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 03:23:53,177 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 03:23:53,178 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 03:23:53,178 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-04 03:23:53,178 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-04 03:23:53,178 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 03:23:53,178 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 03:23:53,178 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 03:23:53,178 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-04 03:23:53,178 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 03:23:53,178 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-02-04 03:23:53,178 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2018-02-04 03:23:53,178 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-02-04 03:23:53,178 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-02-04 03:23:53,178 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-02-04 03:23:53,179 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-02-04 03:23:53,179 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2018-02-04 03:23:53,179 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-02-04 03:23:53,179 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-02-04 03:23:53,179 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-02-04 03:23:53,179 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-02-04 03:23:53,179 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2018-02-04 03:23:53,179 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-02-04 03:23:53,179 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-02-04 03:23:53,179 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-02-04 03:23:53,179 INFO L128 BoogieDeclarations]: Found specification of procedure f_22_get [2018-02-04 03:23:53,179 INFO L128 BoogieDeclarations]: Found specification of procedure f_22_put [2018-02-04 03:23:53,179 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 03:23:53,179 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 03:23:53,180 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 03:23:53,180 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 03:23:53,356 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-04 03:23:53,486 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 03:23:53,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:23:53 BoogieIcfgContainer [2018-02-04 03:23:53,487 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 03:23:53,488 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 03:23:53,488 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 03:23:53,490 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 03:23:53,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 03:23:52" (1/3) ... [2018-02-04 03:23:53,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30122072 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:23:53, skipping insertion in model container [2018-02-04 03:23:53,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:23:53" (2/3) ... [2018-02-04 03:23:53,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30122072 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:23:53, skipping insertion in model container [2018-02-04 03:23:53,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:23:53" (3/3) ... [2018-02-04 03:23:53,492 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test22_3_true-valid-memsafety_true-termination.i [2018-02-04 03:23:53,498 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 03:23:53,503 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-02-04 03:23:53,526 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 03:23:53,526 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 03:23:53,526 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 03:23:53,526 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 03:23:53,526 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 03:23:53,526 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 03:23:53,526 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 03:23:53,526 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 03:23:53,527 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 03:23:53,537 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2018-02-04 03:23:53,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 03:23:53,545 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:23:53,545 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:23:53,545 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-04 03:23:53,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1245228870, now seen corresponding path program 1 times [2018-02-04 03:23:53,584 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:23:53,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:23:53,620 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:23:53,781 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-04 03:23:53,783 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:23:53,783 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:23:53,784 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:23:53,785 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-04 03:23:53,785 INFO L182 omatonBuilderFactory]: Interpolants [154#true, 155#false, 156#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 157#(and (= 0 |ldv_kobject_create_#t~ret17.base|) (= 0 |ldv_kobject_create_#t~ret17.offset|)), 158#(and (= ldv_kobject_create_~kobj~1.offset 0) (= ldv_kobject_create_~kobj~1.base 0))] [2018-02-04 03:23:53,785 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-04 03:23:53,786 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:23:53,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:23:53,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:23:53,800 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 5 states. [2018-02-04 03:23:53,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:23:53,851 INFO L93 Difference]: Finished difference Result 157 states and 166 transitions. [2018-02-04 03:23:53,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:23:53,853 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 03:23:53,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:23:53,861 INFO L225 Difference]: With dead ends: 157 [2018-02-04 03:23:53,861 INFO L226 Difference]: Without dead ends: 154 [2018-02-04 03:23:53,863 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-04 03:23:53,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-02-04 03:23:53,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2018-02-04 03:23:53,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-04 03:23:53,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 161 transitions. [2018-02-04 03:23:53,899 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 161 transitions. Word has length 17 [2018-02-04 03:23:53,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:23:53,899 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 161 transitions. [2018-02-04 03:23:53,899 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:23:53,900 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 161 transitions. [2018-02-04 03:23:53,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 03:23:53,900 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:23:53,900 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-04 03:23:53,900 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-04 03:23:53,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1572748952, now seen corresponding path program 1 times [2018-02-04 03:23:53,902 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:23:53,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:23:53,919 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:23:53,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:23:53,966 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:23:53,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:23:53,966 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:23:53,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:23:53,967 INFO L182 omatonBuilderFactory]: Interpolants [468#true, 469#false, 470#(= 1 (select |#valid| |ldv_malloc_#t~malloc4.base|)), 471#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 472#(= 1 (select |#valid| |ldv_kobject_create_#t~ret17.base|)), 473#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base))] [2018-02-04 03:23:53,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-04 03:23:53,968 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:23:53,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:23:53,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:23:53,969 INFO L87 Difference]: Start difference. First operand 152 states and 161 transitions. Second operand 6 states. [2018-02-04 03:23:54,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:23:54,096 INFO L93 Difference]: Finished difference Result 153 states and 162 transitions. [2018-02-04 03:23:54,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:23:54,096 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 03:23:54,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:23:54,098 INFO L225 Difference]: With dead ends: 153 [2018-02-04 03:23:54,098 INFO L226 Difference]: Without dead ends: 153 [2018-02-04 03:23:54,099 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-04 03:23:54,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-02-04 03:23:54,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2018-02-04 03:23:54,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-04 03:23:54,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2018-02-04 03:23:54,109 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 19 [2018-02-04 03:23:54,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:23:54,109 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2018-02-04 03:23:54,109 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:23:54,109 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2018-02-04 03:23:54,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 03:23:54,110 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:23:54,110 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-04 03:23:54,110 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-04 03:23:54,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1572748951, now seen corresponding path program 1 times [2018-02-04 03:23:54,112 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:23:54,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:23:54,131 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:23:54,282 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-04 03:23:54,282 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:23:54,283 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 03:23:54,283 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:23:54,283 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-04 03:23:54,283 INFO L182 omatonBuilderFactory]: Interpolants [784#(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|))), 785#(and (<= 16 (select |#length| |ldv_kobject_create_#t~ret17.base|)) (= 0 |ldv_kobject_create_#t~ret17.offset|)), 786#(and (= ldv_kobject_create_~kobj~1.offset 0) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 780#true, 781#false, 782#(and (or (< 0 (+ (div ldv_malloc_~size 4294967296) 1)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= (+ (div ldv_malloc_~size 4294967296) 1) 0) (and (<= ldv_malloc_~size |ldv_malloc_#in~size|) (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))))), 783#(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|)))] [2018-02-04 03:23:54,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-04 03:23:54,284 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 03:23:54,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 03:23:54,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:23:54,285 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand 7 states. [2018-02-04 03:23:54,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:23:54,511 INFO L93 Difference]: Finished difference Result 152 states and 161 transitions. [2018-02-04 03:23:54,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:23:54,512 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-02-04 03:23:54,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:23:54,514 INFO L225 Difference]: With dead ends: 152 [2018-02-04 03:23:54,514 INFO L226 Difference]: Without dead ends: 152 [2018-02-04 03:23:54,514 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-04 03:23:54,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-04 03:23:54,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2018-02-04 03:23:54,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-04 03:23:54,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 159 transitions. [2018-02-04 03:23:54,520 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 159 transitions. Word has length 19 [2018-02-04 03:23:54,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:23:54,520 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 159 transitions. [2018-02-04 03:23:54,520 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 03:23:54,520 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 159 transitions. [2018-02-04 03:23:54,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 03:23:54,521 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:23:54,521 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] [2018-02-04 03:23:54,521 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-04 03:23:54,522 INFO L82 PathProgramCache]: Analyzing trace with hash -336004596, now seen corresponding path program 1 times [2018-02-04 03:23:54,523 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:23:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:23:54,538 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:23:54,628 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-04 03:23:54,628 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:23:54,628 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 03:23:54,628 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:23:54,629 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-04 03:23:54,629 INFO L182 omatonBuilderFactory]: Interpolants [1093#true, 1094#false, 1095#(and (= 0 |ldv_kobject_create_#res.base|) (= 0 |ldv_kobject_create_#res.offset|)), 1096#(and (= 0 |entry_point_#t~ret20.base|) (= 0 |entry_point_#t~ret20.offset|)), 1097#(and (= 0 entry_point_~kobj~2.base) (= 0 entry_point_~kobj~2.offset)), 1098#(and (= 0 |f_22_get_#in~kobj.offset|) (= 0 |f_22_get_#in~kobj.base|)), 1099#(and (= 0 f_22_get_~kobj.offset) (= 0 f_22_get_~kobj.base)), 1100#(and (= 0 |ldv_kobject_get_#in~kobj.base|) (= 0 |ldv_kobject_get_#in~kobj.offset|)), 1101#(and (= 0 ldv_kobject_get_~kobj.offset) (= ldv_kobject_get_~kobj.base 0))] [2018-02-04 03:23:54,629 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-04 03:23:54,629 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 03:23:54,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 03:23:54,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:23:54,629 INFO L87 Difference]: Start difference. First operand 150 states and 159 transitions. Second operand 9 states. [2018-02-04 03:23:54,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:23:54,691 INFO L93 Difference]: Finished difference Result 171 states and 182 transitions. [2018-02-04 03:23:54,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:23:54,691 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-02-04 03:23:54,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:23:54,692 INFO L225 Difference]: With dead ends: 171 [2018-02-04 03:23:54,692 INFO L226 Difference]: Without dead ends: 171 [2018-02-04 03:23:54,692 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:23:54,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-04 03:23:54,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 164. [2018-02-04 03:23:54,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-02-04 03:23:54,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 173 transitions. [2018-02-04 03:23:54,699 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 173 transitions. Word has length 29 [2018-02-04 03:23:54,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:23:54,700 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 173 transitions. [2018-02-04 03:23:54,700 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 03:23:54,700 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 173 transitions. [2018-02-04 03:23:54,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 03:23:54,700 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:23:54,700 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-04 03:23:54,700 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-04 03:23:54,700 INFO L82 PathProgramCache]: Analyzing trace with hash 610577100, now seen corresponding path program 1 times [2018-02-04 03:23:54,701 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:23:54,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:23:54,710 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:23:54,769 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-04 03:23:54,770 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:23:54,770 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 03:23:54,770 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:23:54,770 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-04 03:23:54,770 INFO L182 omatonBuilderFactory]: Interpolants [1441#true, 1442#false, 1443#(= 1 (select |#valid| |#Ultimate.C_memset_#ptr.base|)), 1444#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base)), 1445#(= 1 (select |#valid| |ldv_kobject_init_#in~kobj.base|)), 1446#(= 1 (select |#valid| ldv_kobject_init_~kobj.base)), 1447#(= 1 (select |#valid| |ldv_kobject_init_internal_#in~kobj.base|)), 1448#(= 1 (select |#valid| ldv_kobject_init_internal_~kobj.base)), 1449#(= 1 (select |#valid| |ldv_kref_init_#in~kref.base|)), 1450#(= 1 (select |#valid| ldv_kref_init_~kref.base))] [2018-02-04 03:23:54,771 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-04 03:23:54,771 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 03:23:54,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 03:23:54,771 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:23:54,771 INFO L87 Difference]: Start difference. First operand 164 states and 173 transitions. Second operand 10 states. [2018-02-04 03:23:54,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:23:54,959 INFO L93 Difference]: Finished difference Result 163 states and 172 transitions. [2018-02-04 03:23:54,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:23:54,959 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-02-04 03:23:54,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:23:54,960 INFO L225 Difference]: With dead ends: 163 [2018-02-04 03:23:54,960 INFO L226 Difference]: Without dead ends: 163 [2018-02-04 03:23:54,961 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-04 03:23:54,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-04 03:23:54,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-02-04 03:23:54,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-02-04 03:23:54,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 172 transitions. [2018-02-04 03:23:54,969 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 172 transitions. Word has length 34 [2018-02-04 03:23:54,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:23:54,969 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 172 transitions. [2018-02-04 03:23:54,969 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 03:23:54,970 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 172 transitions. [2018-02-04 03:23:54,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 03:23:54,971 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:23:54,971 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-04 03:23:54,971 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-04 03:23:54,971 INFO L82 PathProgramCache]: Analyzing trace with hash 610577101, now seen corresponding path program 1 times [2018-02-04 03:23:54,972 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:23:54,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:23:54,987 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:23:55,008 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-04 03:23:55,008 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:23:55,008 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 03:23:55,008 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:23:55,009 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-04 03:23:55,009 INFO L182 omatonBuilderFactory]: Interpolants [1783#true, 1784#false, 1785#(= |#Ultimate.C_memset_#t~loopctr21| 0), 1786#(<= |#Ultimate.C_memset_#amount| 0)] [2018-02-04 03:23:55,009 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-04 03:23:55,009 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 03:23:55,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 03:23:55,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 03:23:55,010 INFO L87 Difference]: Start difference. First operand 163 states and 172 transitions. Second operand 4 states. [2018-02-04 03:23:55,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:23:55,020 INFO L93 Difference]: Finished difference Result 166 states and 175 transitions. [2018-02-04 03:23:55,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 03:23:55,023 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-02-04 03:23:55,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:23:55,024 INFO L225 Difference]: With dead ends: 166 [2018-02-04 03:23:55,024 INFO L226 Difference]: Without dead ends: 164 [2018-02-04 03:23:55,025 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-04 03:23:55,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-02-04 03:23:55,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-02-04 03:23:55,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-02-04 03:23:55,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 173 transitions. [2018-02-04 03:23:55,032 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 173 transitions. Word has length 34 [2018-02-04 03:23:55,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:23:55,032 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 173 transitions. [2018-02-04 03:23:55,032 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 03:23:55,032 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 173 transitions. [2018-02-04 03:23:55,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 03:23:55,033 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:23:55,033 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-04 03:23:55,033 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-04 03:23:55,033 INFO L82 PathProgramCache]: Analyzing trace with hash -838244594, now seen corresponding path program 1 times [2018-02-04 03:23:55,034 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:23:55,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:23:55,047 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:23:55,071 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-04 03:23:55,072 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:23:55,072 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-04 03:23:55,072 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:23:55,072 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-04 03:23:55,072 INFO L182 omatonBuilderFactory]: Interpolants [2119#true, 2120#false, 2121#(= |#Ultimate.C_memset_#t~loopctr21| 0), 2122#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 2123#(<= |#Ultimate.C_memset_#amount| 1)] [2018-02-04 03:23:55,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:23:55,073 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:23:55,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:23:55,073 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:23:55,073 INFO L87 Difference]: Start difference. First operand 164 states and 173 transitions. Second operand 5 states. [2018-02-04 03:23:55,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:23:55,091 INFO L93 Difference]: Finished difference Result 167 states and 176 transitions. [2018-02-04 03:23:55,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:23:55,092 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-02-04 03:23:55,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:23:55,093 INFO L225 Difference]: With dead ends: 167 [2018-02-04 03:23:55,093 INFO L226 Difference]: Without dead ends: 165 [2018-02-04 03:23:55,094 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-04 03:23:55,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-02-04 03:23:55,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-02-04 03:23:55,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-04 03:23:55,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 174 transitions. [2018-02-04 03:23:55,100 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 174 transitions. Word has length 35 [2018-02-04 03:23:55,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:23:55,100 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 174 transitions. [2018-02-04 03:23:55,100 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:23:55,100 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 174 transitions. [2018-02-04 03:23:55,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 03:23:55,101 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:23:55,101 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-04 03:23:55,101 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-04 03:23:55,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1492923117, now seen corresponding path program 2 times [2018-02-04 03:23:55,103 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:23:55,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:23:55,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:23:55,146 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-04 03:23:55,147 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:23:55,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 03:23:55,147 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:23:55,147 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-04 03:23:55,148 INFO L182 omatonBuilderFactory]: Interpolants [2458#true, 2459#false, 2460#(= |#Ultimate.C_memset_#t~loopctr21| 0), 2461#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 2462#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 2463#(<= |#Ultimate.C_memset_#amount| 2)] [2018-02-04 03:23:55,148 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-04 03:23:55,148 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:23:55,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:23:55,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:23:55,148 INFO L87 Difference]: Start difference. First operand 165 states and 174 transitions. Second operand 6 states. [2018-02-04 03:23:55,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:23:55,167 INFO L93 Difference]: Finished difference Result 168 states and 177 transitions. [2018-02-04 03:23:55,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:23:55,167 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-02-04 03:23:55,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:23:55,168 INFO L225 Difference]: With dead ends: 168 [2018-02-04 03:23:55,168 INFO L226 Difference]: Without dead ends: 166 [2018-02-04 03:23:55,169 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-04 03:23:55,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-02-04 03:23:55,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-02-04 03:23:55,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-02-04 03:23:55,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 175 transitions. [2018-02-04 03:23:55,174 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 175 transitions. Word has length 36 [2018-02-04 03:23:55,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:23:55,174 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 175 transitions. [2018-02-04 03:23:55,174 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:23:55,174 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 175 transitions. [2018-02-04 03:23:55,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 03:23:55,175 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:23:55,175 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-04 03:23:55,175 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-04 03:23:55,176 INFO L82 PathProgramCache]: Analyzing trace with hash 744678126, now seen corresponding path program 3 times [2018-02-04 03:23:55,177 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:23:55,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:23:55,189 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:23:55,230 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-04 03:23:55,230 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:23:55,231 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 03:23:55,231 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:23:55,231 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-04 03:23:55,231 INFO L182 omatonBuilderFactory]: Interpolants [2800#true, 2801#false, 2802#(= |#Ultimate.C_memset_#t~loopctr21| 0), 2803#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 2804#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 2805#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 2806#(<= |#Ultimate.C_memset_#amount| 3)] [2018-02-04 03:23:55,232 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-04 03:23:55,232 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 03:23:55,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 03:23:55,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:23:55,232 INFO L87 Difference]: Start difference. First operand 166 states and 175 transitions. Second operand 7 states. [2018-02-04 03:23:55,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:23:55,253 INFO L93 Difference]: Finished difference Result 169 states and 178 transitions. [2018-02-04 03:23:55,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:23:55,253 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-02-04 03:23:55,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:23:55,255 INFO L225 Difference]: With dead ends: 169 [2018-02-04 03:23:55,255 INFO L226 Difference]: Without dead ends: 167 [2018-02-04 03:23:55,255 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-04 03:23:55,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-02-04 03:23:55,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-02-04 03:23:55,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-02-04 03:23:55,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 176 transitions. [2018-02-04 03:23:55,259 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 176 transitions. Word has length 37 [2018-02-04 03:23:55,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:23:55,260 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 176 transitions. [2018-02-04 03:23:55,260 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 03:23:55,260 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 176 transitions. [2018-02-04 03:23:55,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 03:23:55,261 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:23:55,261 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-04 03:23:55,261 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-04 03:23:55,261 INFO L82 PathProgramCache]: Analyzing trace with hash -976080115, now seen corresponding path program 4 times [2018-02-04 03:23:55,262 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:23:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:23:55,275 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:23:55,318 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-04 03:23:55,318 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:23:55,318 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 03:23:55,318 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:23:55,319 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-04 03:23:55,319 INFO L182 omatonBuilderFactory]: Interpolants [3152#(<= |#Ultimate.C_memset_#amount| 4), 3145#true, 3146#false, 3147#(= |#Ultimate.C_memset_#t~loopctr21| 0), 3148#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 3149#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 3150#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 3151#(<= |#Ultimate.C_memset_#t~loopctr21| 4)] [2018-02-04 03:23:55,319 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-04 03:23:55,319 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:23:55,319 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:23:55,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:23:55,320 INFO L87 Difference]: Start difference. First operand 167 states and 176 transitions. Second operand 8 states. [2018-02-04 03:23:55,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:23:55,343 INFO L93 Difference]: Finished difference Result 170 states and 179 transitions. [2018-02-04 03:23:55,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 03:23:55,355 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-02-04 03:23:55,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:23:55,356 INFO L225 Difference]: With dead ends: 170 [2018-02-04 03:23:55,356 INFO L226 Difference]: Without dead ends: 168 [2018-02-04 03:23:55,356 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-04 03:23:55,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-02-04 03:23:55,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-02-04 03:23:55,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-02-04 03:23:55,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 177 transitions. [2018-02-04 03:23:55,360 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 177 transitions. Word has length 38 [2018-02-04 03:23:55,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:23:55,361 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 177 transitions. [2018-02-04 03:23:55,361 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:23:55,361 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 177 transitions. [2018-02-04 03:23:55,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 03:23:55,362 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:23:55,362 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-04 03:23:55,362 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-04 03:23:55,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1514989262, now seen corresponding path program 5 times [2018-02-04 03:23:55,363 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:23:55,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:23:55,374 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:23:55,421 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-04 03:23:55,421 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:23:55,422 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 03:23:55,422 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:23:55,422 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-04 03:23:55,422 INFO L182 omatonBuilderFactory]: Interpolants [3493#true, 3494#false, 3495#(= |#Ultimate.C_memset_#t~loopctr21| 0), 3496#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 3497#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 3498#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 3499#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 3500#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 3501#(<= |#Ultimate.C_memset_#amount| 5)] [2018-02-04 03:23:55,422 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-04 03:23:55,422 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 03:23:55,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 03:23:55,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:23:55,422 INFO L87 Difference]: Start difference. First operand 168 states and 177 transitions. Second operand 9 states. [2018-02-04 03:23:55,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:23:55,446 INFO L93 Difference]: Finished difference Result 171 states and 180 transitions. [2018-02-04 03:23:55,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 03:23:55,446 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-02-04 03:23:55,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:23:55,450 INFO L225 Difference]: With dead ends: 171 [2018-02-04 03:23:55,451 INFO L226 Difference]: Without dead ends: 169 [2018-02-04 03:23:55,451 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-04 03:23:55,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-02-04 03:23:55,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-02-04 03:23:55,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-02-04 03:23:55,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 178 transitions. [2018-02-04 03:23:55,455 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 178 transitions. Word has length 39 [2018-02-04 03:23:55,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:23:55,455 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 178 transitions. [2018-02-04 03:23:55,455 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 03:23:55,455 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 178 transitions. [2018-02-04 03:23:55,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 03:23:55,456 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:23:55,456 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, 1, 1, 1, 1, 1, 1] [2018-02-04 03:23:55,456 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-04 03:23:55,456 INFO L82 PathProgramCache]: Analyzing trace with hash 278126369, now seen corresponding path program 1 times [2018-02-04 03:23:55,457 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:23:55,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:23:55,465 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:23:55,518 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-04 03:23:55,518 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:23:55,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 03:23:55,519 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:23:55,519 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-04 03:23:55,519 INFO L182 omatonBuilderFactory]: Interpolants [3844#true, 3845#false, 3846#(and (= 0 |ldv_kobject_create_#res.base|) (= 0 |ldv_kobject_create_#res.offset|)), 3847#(and (= 0 |entry_point_#t~ret20.base|) (= 0 |entry_point_#t~ret20.offset|)), 3848#(and (= 0 entry_point_~kobj~2.base) (= 0 entry_point_~kobj~2.offset)), 3849#(and (= 0 |f_22_put_#in~kobj.offset|) (= 0 |f_22_put_#in~kobj.base|)), 3850#(and (= 0 f_22_put_~kobj.base) (= 0 f_22_put_~kobj.offset)), 3851#(and (= 0 |ldv_kobject_put_#in~kobj.offset|) (= 0 |ldv_kobject_put_#in~kobj.base|)), 3852#(and (= ldv_kobject_put_~kobj.offset 0) (= 0 ldv_kobject_put_~kobj.base))] [2018-02-04 03:23:55,519 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-04 03:23:55,519 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 03:23:55,519 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 03:23:55,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:23:55,520 INFO L87 Difference]: Start difference. First operand 169 states and 178 transitions. Second operand 9 states. [2018-02-04 03:23:55,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:23:55,569 INFO L93 Difference]: Finished difference Result 183 states and 194 transitions. [2018-02-04 03:23:55,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:23:55,569 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-02-04 03:23:55,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:23:55,570 INFO L225 Difference]: With dead ends: 183 [2018-02-04 03:23:55,570 INFO L226 Difference]: Without dead ends: 183 [2018-02-04 03:23:55,570 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:23:55,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-02-04 03:23:55,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 179. [2018-02-04 03:23:55,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-02-04 03:23:55,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 189 transitions. [2018-02-04 03:23:55,576 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 189 transitions. Word has length 42 [2018-02-04 03:23:55,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:23:55,576 INFO L432 AbstractCegarLoop]: Abstraction has 179 states and 189 transitions. [2018-02-04 03:23:55,576 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 03:23:55,576 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 189 transitions. [2018-02-04 03:23:55,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 03:23:55,577 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:23:55,577 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-04 03:23:55,577 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-04 03:23:55,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1428728621, now seen corresponding path program 6 times [2018-02-04 03:23:55,578 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:23:55,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:23:55,592 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:23:55,663 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-04 03:23:55,663 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:23:55,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 03:23:55,663 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:23:55,663 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-04 03:23:55,664 INFO L182 omatonBuilderFactory]: Interpolants [4224#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 4225#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 4226#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 4227#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 4228#(<= |#Ultimate.C_memset_#amount| 6), 4219#true, 4220#false, 4221#(= |#Ultimate.C_memset_#t~loopctr21| 0), 4222#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 4223#(<= |#Ultimate.C_memset_#t~loopctr21| 2)] [2018-02-04 03:23:55,664 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-04 03:23:55,664 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 03:23:55,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 03:23:55,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:23:55,665 INFO L87 Difference]: Start difference. First operand 179 states and 189 transitions. Second operand 10 states. [2018-02-04 03:23:55,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:23:55,696 INFO L93 Difference]: Finished difference Result 182 states and 192 transitions. [2018-02-04 03:23:55,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:23:55,698 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2018-02-04 03:23:55,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:23:55,699 INFO L225 Difference]: With dead ends: 182 [2018-02-04 03:23:55,699 INFO L226 Difference]: Without dead ends: 180 [2018-02-04 03:23:55,700 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-04 03:23:55,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-02-04 03:23:55,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-02-04 03:23:55,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-02-04 03:23:55,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 190 transitions. [2018-02-04 03:23:55,705 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 190 transitions. Word has length 40 [2018-02-04 03:23:55,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:23:55,705 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 190 transitions. [2018-02-04 03:23:55,705 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 03:23:55,705 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 190 transitions. [2018-02-04 03:23:55,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 03:23:55,706 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:23:55,706 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-04 03:23:55,706 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-04 03:23:55,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1245351250, now seen corresponding path program 7 times [2018-02-04 03:23:55,707 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:23:55,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:23:55,719 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:23:55,782 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-04 03:23:55,782 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:23:55,782 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 03:23:55,782 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:23:55,783 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-04 03:23:55,783 INFO L182 omatonBuilderFactory]: Interpolants [4593#true, 4594#false, 4595#(= |#Ultimate.C_memset_#t~loopctr21| 0), 4596#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 4597#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 4598#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 4599#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 4600#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 4601#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 4602#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 4603#(<= |#Ultimate.C_memset_#amount| 7)] [2018-02-04 03:23:55,783 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-04 03:23:55,783 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 03:23:55,784 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 03:23:55,784 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:23:55,784 INFO L87 Difference]: Start difference. First operand 180 states and 190 transitions. Second operand 11 states. [2018-02-04 03:23:55,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:23:55,813 INFO L93 Difference]: Finished difference Result 183 states and 193 transitions. [2018-02-04 03:23:55,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 03:23:55,813 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-02-04 03:23:55,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:23:55,814 INFO L225 Difference]: With dead ends: 183 [2018-02-04 03:23:55,814 INFO L226 Difference]: Without dead ends: 181 [2018-02-04 03:23:55,814 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-04 03:23:55,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-02-04 03:23:55,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-02-04 03:23:55,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-02-04 03:23:55,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 191 transitions. [2018-02-04 03:23:55,819 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 191 transitions. Word has length 41 [2018-02-04 03:23:55,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:23:55,819 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 191 transitions. [2018-02-04 03:23:55,819 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 03:23:55,820 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 191 transitions. [2018-02-04 03:23:55,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 03:23:55,820 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:23:55,820 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-04 03:23:55,820 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-04 03:23:55,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1757518669, now seen corresponding path program 8 times [2018-02-04 03:23:55,821 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:23:55,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:23:55,833 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:23:55,907 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-04 03:23:55,908 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:23:55,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 03:23:55,908 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:23:55,908 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-04 03:23:55,908 INFO L182 omatonBuilderFactory]: Interpolants [4976#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 4977#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 4978#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 4979#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 4980#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 4981#(<= |#Ultimate.C_memset_#amount| 8), 4970#true, 4971#false, 4972#(= |#Ultimate.C_memset_#t~loopctr21| 0), 4973#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 4974#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 4975#(<= |#Ultimate.C_memset_#t~loopctr21| 3)] [2018-02-04 03:23:55,908 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-04 03:23:55,909 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 03:23:55,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 03:23:55,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-02-04 03:23:55,909 INFO L87 Difference]: Start difference. First operand 181 states and 191 transitions. Second operand 12 states. [2018-02-04 03:23:55,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:23:55,938 INFO L93 Difference]: Finished difference Result 184 states and 194 transitions. [2018-02-04 03:23:55,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 03:23:55,943 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-02-04 03:23:55,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:23:55,944 INFO L225 Difference]: With dead ends: 184 [2018-02-04 03:23:55,944 INFO L226 Difference]: Without dead ends: 182 [2018-02-04 03:23:55,944 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-04 03:23:55,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-04 03:23:55,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-02-04 03:23:55,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-04 03:23:55,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 192 transitions. [2018-02-04 03:23:55,952 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 192 transitions. Word has length 42 [2018-02-04 03:23:55,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:23:55,952 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 192 transitions. [2018-02-04 03:23:55,952 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 03:23:55,952 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 192 transitions. [2018-02-04 03:23:55,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 03:23:55,953 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:23:55,953 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-04 03:23:55,953 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-04 03:23:55,953 INFO L82 PathProgramCache]: Analyzing trace with hash 357205646, now seen corresponding path program 9 times [2018-02-04 03:23:55,954 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:23:55,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:23:55,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:23:56,042 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-04 03:23:56,042 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:23:56,042 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 03:23:56,042 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:23:56,043 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-04 03:23:56,043 INFO L182 omatonBuilderFactory]: Interpolants [5350#true, 5351#false, 5352#(= |#Ultimate.C_memset_#t~loopctr21| 0), 5353#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 5354#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 5355#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 5356#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 5357#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 5358#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 5359#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 5360#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 5361#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 5362#(<= |#Ultimate.C_memset_#amount| 9)] [2018-02-04 03:23:56,043 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-04 03:23:56,043 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 03:23:56,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 03:23:56,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:23:56,044 INFO L87 Difference]: Start difference. First operand 182 states and 192 transitions. Second operand 13 states. [2018-02-04 03:23:56,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:23:56,072 INFO L93 Difference]: Finished difference Result 185 states and 195 transitions. [2018-02-04 03:23:56,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 03:23:56,073 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-02-04 03:23:56,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:23:56,074 INFO L225 Difference]: With dead ends: 185 [2018-02-04 03:23:56,074 INFO L226 Difference]: Without dead ends: 183 [2018-02-04 03:23:56,075 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-04 03:23:56,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-02-04 03:23:56,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-02-04 03:23:56,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-02-04 03:23:56,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 193 transitions. [2018-02-04 03:23:56,079 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 193 transitions. Word has length 43 [2018-02-04 03:23:56,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:23:56,079 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 193 transitions. [2018-02-04 03:23:56,080 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 03:23:56,080 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 193 transitions. [2018-02-04 03:23:56,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 03:23:56,080 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:23:56,080 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-04 03:23:56,080 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-04 03:23:56,081 INFO L82 PathProgramCache]: Analyzing trace with hash -102825107, now seen corresponding path program 10 times [2018-02-04 03:23:56,081 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:23:56,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:23:56,093 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:23:56,156 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-04 03:23:56,157 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:23:56,157 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 03:23:56,157 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:23:56,157 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-04 03:23:56,157 INFO L182 omatonBuilderFactory]: Interpolants [5733#true, 5734#false, 5735#(= |#Ultimate.C_memset_#t~loopctr21| 0), 5736#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 5737#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 5738#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 5739#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 5740#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 5741#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 5742#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 5743#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 5744#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 5745#(<= |#Ultimate.C_memset_#t~loopctr21| 10), 5746#(<= |#Ultimate.C_memset_#amount| 10)] [2018-02-04 03:23:56,157 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-04 03:23:56,157 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 03:23:56,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 03:23:56,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:23:56,158 INFO L87 Difference]: Start difference. First operand 183 states and 193 transitions. Second operand 14 states. [2018-02-04 03:23:56,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:23:56,192 INFO L93 Difference]: Finished difference Result 186 states and 196 transitions. [2018-02-04 03:23:56,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 03:23:56,193 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-02-04 03:23:56,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:23:56,194 INFO L225 Difference]: With dead ends: 186 [2018-02-04 03:23:56,194 INFO L226 Difference]: Without dead ends: 184 [2018-02-04 03:23:56,195 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-04 03:23:56,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-02-04 03:23:56,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-02-04 03:23:56,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-02-04 03:23:56,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 194 transitions. [2018-02-04 03:23:56,198 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 194 transitions. Word has length 44 [2018-02-04 03:23:56,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:23:56,198 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 194 transitions. [2018-02-04 03:23:56,198 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 03:23:56,198 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 194 transitions. [2018-02-04 03:23:56,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 03:23:56,198 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:23:56,198 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-04 03:23:56,198 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-04 03:23:56,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1478876562, now seen corresponding path program 11 times [2018-02-04 03:23:56,200 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:23:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:23:56,213 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:23:56,287 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-04 03:23:56,287 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:23:56,287 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 03:23:56,288 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:23:56,288 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-04 03:23:56,288 INFO L182 omatonBuilderFactory]: Interpolants [6119#true, 6120#false, 6121#(= |#Ultimate.C_memset_#t~loopctr21| 0), 6122#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 6123#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 6124#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 6125#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 6126#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 6127#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 6128#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 6129#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 6130#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 6131#(<= |#Ultimate.C_memset_#t~loopctr21| 10), 6132#(<= |#Ultimate.C_memset_#t~loopctr21| 11), 6133#(<= |#Ultimate.C_memset_#amount| 11)] [2018-02-04 03:23:56,288 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-04 03:23:56,288 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 03:23:56,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 03:23:56,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-02-04 03:23:56,288 INFO L87 Difference]: Start difference. First operand 184 states and 194 transitions. Second operand 15 states. [2018-02-04 03:23:56,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:23:56,310 INFO L93 Difference]: Finished difference Result 187 states and 197 transitions. [2018-02-04 03:23:56,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 03:23:56,310 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2018-02-04 03:23:56,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:23:56,311 INFO L225 Difference]: With dead ends: 187 [2018-02-04 03:23:56,311 INFO L226 Difference]: Without dead ends: 185 [2018-02-04 03:23:56,311 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-04 03:23:56,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-02-04 03:23:56,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-02-04 03:23:56,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-02-04 03:23:56,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 195 transitions. [2018-02-04 03:23:56,316 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 195 transitions. Word has length 45 [2018-02-04 03:23:56,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:23:56,317 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 195 transitions. [2018-02-04 03:23:56,317 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 03:23:56,317 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 195 transitions. [2018-02-04 03:23:56,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 03:23:56,318 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:23:56,318 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-04 03:23:56,318 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-04 03:23:56,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1186798707, now seen corresponding path program 12 times [2018-02-04 03:23:56,319 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:23:56,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:23:56,332 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:23:56,442 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-04 03:23:56,442 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:23:56,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 03:23:56,442 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:23:56,443 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-04 03:23:56,443 INFO L182 omatonBuilderFactory]: Interpolants [6508#true, 6509#false, 6510#(= |#Ultimate.C_memset_#t~loopctr21| 0), 6511#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 6512#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 6513#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 6514#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 6515#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 6516#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 6517#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 6518#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 6519#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 6520#(<= |#Ultimate.C_memset_#t~loopctr21| 10), 6521#(<= |#Ultimate.C_memset_#t~loopctr21| 11), 6522#(<= |#Ultimate.C_memset_#t~loopctr21| 12), 6523#(<= |#Ultimate.C_memset_#amount| 12)] [2018-02-04 03:23:56,443 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-04 03:23:56,443 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 03:23:56,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 03:23:56,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2018-02-04 03:23:56,444 INFO L87 Difference]: Start difference. First operand 185 states and 195 transitions. Second operand 16 states. [2018-02-04 03:23:56,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:23:56,483 INFO L93 Difference]: Finished difference Result 188 states and 198 transitions. [2018-02-04 03:23:56,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 03:23:56,483 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2018-02-04 03:23:56,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:23:56,484 INFO L225 Difference]: With dead ends: 188 [2018-02-04 03:23:56,484 INFO L226 Difference]: Without dead ends: 186 [2018-02-04 03:23:56,485 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-04 03:23:56,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-02-04 03:23:56,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2018-02-04 03:23:56,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-02-04 03:23:56,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 196 transitions. [2018-02-04 03:23:56,489 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 196 transitions. Word has length 46 [2018-02-04 03:23:56,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:23:56,489 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 196 transitions. [2018-02-04 03:23:56,489 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 03:23:56,489 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 196 transitions. [2018-02-04 03:23:56,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 03:23:56,490 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:23:56,490 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:23:56,490 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-04 03:23:56,490 INFO L82 PathProgramCache]: Analyzing trace with hash 689381786, now seen corresponding path program 1 times [2018-02-04 03:23:56,491 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:23:56,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:23:56,497 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:23:56,516 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:23:56,516 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:23:56,516 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 03:23:56,516 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:23:56,516 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:23:56,517 INFO L182 omatonBuilderFactory]: Interpolants [6900#true, 6901#false, 6902#(= |#valid| |old(#valid)|)] [2018-02-04 03:23:56,517 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:23:56,517 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 03:23:56,517 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 03:23:56,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 03:23:56,517 INFO L87 Difference]: Start difference. First operand 186 states and 196 transitions. Second operand 3 states. [2018-02-04 03:23:56,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:23:56,612 INFO L93 Difference]: Finished difference Result 205 states and 218 transitions. [2018-02-04 03:23:56,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 03:23:56,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-02-04 03:23:56,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:23:56,613 INFO L225 Difference]: With dead ends: 205 [2018-02-04 03:23:56,614 INFO L226 Difference]: Without dead ends: 192 [2018-02-04 03:23:56,614 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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-04 03:23:56,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-02-04 03:23:56,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 182. [2018-02-04 03:23:56,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-04 03:23:56,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 191 transitions. [2018-02-04 03:23:56,622 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 191 transitions. Word has length 47 [2018-02-04 03:23:56,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:23:56,622 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 191 transitions. [2018-02-04 03:23:56,622 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 03:23:56,622 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 191 transitions. [2018-02-04 03:23:56,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 03:23:56,623 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:23:56,623 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-04 03:23:56,623 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-04 03:23:56,623 INFO L82 PathProgramCache]: Analyzing trace with hash -722319794, now seen corresponding path program 13 times [2018-02-04 03:23:56,624 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:23:56,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:23:56,638 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:23:56,754 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-04 03:23:56,755 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:23:56,755 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 03:23:56,755 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:23:56,755 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-04 03:23:56,755 INFO L182 omatonBuilderFactory]: Interpolants [7296#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 7297#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 7298#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 7299#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 7300#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 7301#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 7302#(<= |#Ultimate.C_memset_#t~loopctr21| 10), 7303#(<= |#Ultimate.C_memset_#t~loopctr21| 11), 7304#(<= |#Ultimate.C_memset_#t~loopctr21| 12), 7305#(<= |#Ultimate.C_memset_#t~loopctr21| 13), 7306#(<= |#Ultimate.C_memset_#amount| 13), 7290#true, 7291#false, 7292#(= |#Ultimate.C_memset_#t~loopctr21| 0), 7293#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 7294#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 7295#(<= |#Ultimate.C_memset_#t~loopctr21| 3)] [2018-02-04 03:23:56,756 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-04 03:23:56,756 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 03:23:56,756 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 03:23:56,756 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-02-04 03:23:56,756 INFO L87 Difference]: Start difference. First operand 182 states and 191 transitions. Second operand 17 states. [2018-02-04 03:23:56,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:23:56,794 INFO L93 Difference]: Finished difference Result 185 states and 194 transitions. [2018-02-04 03:23:56,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 03:23:56,794 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2018-02-04 03:23:56,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:23:56,795 INFO L225 Difference]: With dead ends: 185 [2018-02-04 03:23:56,795 INFO L226 Difference]: Without dead ends: 183 [2018-02-04 03:23:56,796 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=126, Invalid=180, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:23:56,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-02-04 03:23:56,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-02-04 03:23:56,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-02-04 03:23:56,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 192 transitions. [2018-02-04 03:23:56,800 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 192 transitions. Word has length 47 [2018-02-04 03:23:56,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:23:56,800 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 192 transitions. [2018-02-04 03:23:56,800 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 03:23:56,800 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 192 transitions. [2018-02-04 03:23:56,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 03:23:56,801 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:23:56,801 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:23:56,801 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-04 03:23:56,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1335931844, now seen corresponding path program 1 times [2018-02-04 03:23:56,802 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:23:56,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:23:56,806 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:23:56,828 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:23:56,828 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:23:56,829 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 03:23:56,829 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:23:56,829 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:23:56,829 INFO L182 omatonBuilderFactory]: Interpolants [7680#(not (= |ldv_malloc_#res.base| 0)), 7681#(not (= |ldv_kobject_create_#t~ret17.base| 0)), 7682#(not (= ldv_kobject_create_~kobj~1.base 0)), 7677#true, 7678#false, 7679#(not (= |ldv_malloc_#t~malloc4.base| 0))] [2018-02-04 03:23:56,829 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:23:56,829 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:23:56,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:23:56,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:23:56,830 INFO L87 Difference]: Start difference. First operand 183 states and 192 transitions. Second operand 6 states. [2018-02-04 03:23:56,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:23:56,844 INFO L93 Difference]: Finished difference Result 159 states and 166 transitions. [2018-02-04 03:23:56,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:23:56,845 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2018-02-04 03:23:56,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:23:56,845 INFO L225 Difference]: With dead ends: 159 [2018-02-04 03:23:56,845 INFO L226 Difference]: Without dead ends: 159 [2018-02-04 03:23:56,846 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-04 03:23:56,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-02-04 03:23:56,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-02-04 03:23:56,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-04 03:23:56,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 166 transitions. [2018-02-04 03:23:56,849 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 166 transitions. Word has length 49 [2018-02-04 03:23:56,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:23:56,849 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 166 transitions. [2018-02-04 03:23:56,849 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:23:56,849 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 166 transitions. [2018-02-04 03:23:56,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 03:23:56,850 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:23:56,850 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-04 03:23:56,850 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-04 03:23:56,850 INFO L82 PathProgramCache]: Analyzing trace with hash 791624621, now seen corresponding path program 14 times [2018-02-04 03:23:56,851 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:23:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:23:56,863 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:23:56,986 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-04 03:23:56,986 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:23:56,986 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 03:23:56,987 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:23:56,987 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-04 03:23:56,987 INFO L182 omatonBuilderFactory]: Interpolants [8003#true, 8004#false, 8005#(= |#Ultimate.C_memset_#t~loopctr21| 0), 8006#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 8007#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 8008#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 8009#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 8010#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 8011#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 8012#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 8013#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 8014#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 8015#(<= |#Ultimate.C_memset_#t~loopctr21| 10), 8016#(<= |#Ultimate.C_memset_#t~loopctr21| 11), 8017#(<= |#Ultimate.C_memset_#t~loopctr21| 12), 8018#(<= |#Ultimate.C_memset_#t~loopctr21| 13), 8019#(<= |#Ultimate.C_memset_#t~loopctr21| 14), 8020#(<= |#Ultimate.C_memset_#amount| 14)] [2018-02-04 03:23:56,987 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-04 03:23:56,987 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 03:23:56,988 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 03:23:56,988 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:23:56,988 INFO L87 Difference]: Start difference. First operand 159 states and 166 transitions. Second operand 18 states. [2018-02-04 03:23:57,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:23:57,035 INFO L93 Difference]: Finished difference Result 162 states and 169 transitions. [2018-02-04 03:23:57,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 03:23:57,035 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2018-02-04 03:23:57,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:23:57,036 INFO L225 Difference]: With dead ends: 162 [2018-02-04 03:23:57,036 INFO L226 Difference]: Without dead ends: 160 [2018-02-04 03:23:57,036 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-04 03:23:57,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-02-04 03:23:57,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-02-04 03:23:57,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-02-04 03:23:57,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 167 transitions. [2018-02-04 03:23:57,040 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 167 transitions. Word has length 48 [2018-02-04 03:23:57,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:23:57,041 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 167 transitions. [2018-02-04 03:23:57,041 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 03:23:57,041 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 167 transitions. [2018-02-04 03:23:57,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 03:23:57,041 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:23:57,041 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-04 03:23:57,041 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-04 03:23:57,042 INFO L82 PathProgramCache]: Analyzing trace with hash 479261230, now seen corresponding path program 15 times [2018-02-04 03:23:57,042 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:23:57,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:23:57,056 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:23:57,230 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-04 03:23:57,230 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:23:57,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 03:23:57,230 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:23:57,230 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-04 03:23:57,231 INFO L182 omatonBuilderFactory]: Interpolants [8352#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 8353#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 8354#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 8355#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 8356#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 8357#(<= |#Ultimate.C_memset_#t~loopctr21| 10), 8358#(<= |#Ultimate.C_memset_#t~loopctr21| 11), 8359#(<= |#Ultimate.C_memset_#t~loopctr21| 12), 8360#(<= |#Ultimate.C_memset_#t~loopctr21| 13), 8361#(<= |#Ultimate.C_memset_#t~loopctr21| 14), 8362#(<= |#Ultimate.C_memset_#t~loopctr21| 15), 8363#(<= |#Ultimate.C_memset_#amount| 15), 8345#true, 8346#false, 8347#(= |#Ultimate.C_memset_#t~loopctr21| 0), 8348#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 8349#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 8350#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 8351#(<= |#Ultimate.C_memset_#t~loopctr21| 4)] [2018-02-04 03:23:57,231 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-04 03:23:57,231 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 03:23:57,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 03:23:57,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-02-04 03:23:57,232 INFO L87 Difference]: Start difference. First operand 160 states and 167 transitions. Second operand 19 states. [2018-02-04 03:23:57,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:23:57,269 INFO L93 Difference]: Finished difference Result 163 states and 170 transitions. [2018-02-04 03:23:57,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 03:23:57,270 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-02-04 03:23:57,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:23:57,271 INFO L225 Difference]: With dead ends: 163 [2018-02-04 03:23:57,271 INFO L226 Difference]: Without dead ends: 161 [2018-02-04 03:23:57,271 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=159, Invalid=221, Unknown=0, NotChecked=0, Total=380 [2018-02-04 03:23:57,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-04 03:23:57,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-02-04 03:23:57,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-02-04 03:23:57,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 168 transitions. [2018-02-04 03:23:57,275 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 168 transitions. Word has length 49 [2018-02-04 03:23:57,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:23:57,276 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 168 transitions. [2018-02-04 03:23:57,276 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 03:23:57,276 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 168 transitions. [2018-02-04 03:23:57,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-04 03:23:57,276 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:23:57,277 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-04 03:23:57,277 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-04 03:23:57,277 INFO L82 PathProgramCache]: Analyzing trace with hash -614069299, now seen corresponding path program 16 times [2018-02-04 03:23:57,279 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:23:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:23:57,296 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:23:57,462 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-04 03:23:57,463 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:23:57,463 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-04 03:23:57,463 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:23:57,463 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-04 03:23:57,463 INFO L182 omatonBuilderFactory]: Interpolants [8690#true, 8691#false, 8692#(= 0 |ldv_malloc_#t~malloc4.offset|), 8693#(= 0 |ldv_malloc_#res.offset|), 8694#(= 0 |ldv_kobject_create_#t~ret17.offset|), 8695#(= 0 ldv_kobject_create_~kobj~1.offset), 8696#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 8697#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 8698#(and (= 0 |ldv_kobject_init_#in~kobj.offset|) (<= 16 (select |#length| |ldv_kobject_init_#in~kobj.base|))), 8699#(and (= 0 ldv_kobject_init_~kobj.offset) (<= 16 (select |#length| ldv_kobject_init_~kobj.base))), 8700#(and (<= 16 (select |#length| |ldv_kobject_init_internal_#in~kobj.base|)) (= 0 |ldv_kobject_init_internal_#in~kobj.offset|)), 8701#(and (<= 16 (select |#length| ldv_kobject_init_internal_~kobj.base)) (= ldv_kobject_init_internal_~kobj.offset 0)), 8702#(and (<= (+ |ldv_kref_init_#in~kref.offset| 4) (select |#length| |ldv_kref_init_#in~kref.base|)) (<= 12 |ldv_kref_init_#in~kref.offset|)), 8703#(and (<= 12 ldv_kref_init_~kref.offset) (<= (+ ldv_kref_init_~kref.offset 4) (select |#length| ldv_kref_init_~kref.base)))] [2018-02-04 03:23:57,463 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-04 03:23:57,464 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 03:23:57,464 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 03:23:57,464 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:23:57,464 INFO L87 Difference]: Start difference. First operand 161 states and 168 transitions. Second operand 14 states. [2018-02-04 03:23:57,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:23:57,667 INFO L93 Difference]: Finished difference Result 160 states and 167 transitions. [2018-02-04 03:23:57,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 03:23:57,667 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2018-02-04 03:23:57,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:23:57,668 INFO L225 Difference]: With dead ends: 160 [2018-02-04 03:23:57,668 INFO L226 Difference]: Without dead ends: 160 [2018-02-04 03:23:57,668 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-04 03:23:57,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-02-04 03:23:57,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-02-04 03:23:57,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-02-04 03:23:57,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 167 transitions. [2018-02-04 03:23:57,670 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 167 transitions. Word has length 50 [2018-02-04 03:23:57,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:23:57,670 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 167 transitions. [2018-02-04 03:23:57,670 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 03:23:57,671 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 167 transitions. [2018-02-04 03:23:57,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 03:23:57,671 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:23:57,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] [2018-02-04 03:23:57,671 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-04 03:23:57,671 INFO L82 PathProgramCache]: Analyzing trace with hash 2018632319, now seen corresponding path program 1 times [2018-02-04 03:23:57,672 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:23:57,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:23:57,688 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:23:57,817 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-04 03:23:57,818 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:23:57,818 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 03:23:57,818 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:23:57,818 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-04 03:23:57,819 INFO L182 omatonBuilderFactory]: Interpolants [9040#(= 1 (select |#valid| |LDV_INIT_LIST_HEAD_#in~list.base|)), 9041#(= 1 (select |#valid| LDV_INIT_LIST_HEAD_~list.base)), 9032#true, 9033#false, 9034#(= 1 (select |#valid| |#Ultimate.C_memset_#ptr.base|)), 9035#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base)), 9036#(= 1 (select |#valid| |ldv_kobject_init_#in~kobj.base|)), 9037#(= 1 (select |#valid| ldv_kobject_init_~kobj.base)), 9038#(= 1 (select |#valid| |ldv_kobject_init_internal_#in~kobj.base|)), 9039#(= 1 (select |#valid| ldv_kobject_init_internal_~kobj.base))] [2018-02-04 03:23:57,819 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-04 03:23:57,819 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 03:23:57,819 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 03:23:57,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:23:57,820 INFO L87 Difference]: Start difference. First operand 160 states and 167 transitions. Second operand 10 states. [2018-02-04 03:23:58,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:23:58,051 INFO L93 Difference]: Finished difference Result 158 states and 165 transitions. [2018-02-04 03:23:58,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:23:58,051 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-02-04 03:23:58,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:23:58,052 INFO L225 Difference]: With dead ends: 158 [2018-02-04 03:23:58,052 INFO L226 Difference]: Without dead ends: 158 [2018-02-04 03:23:58,053 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:23:58,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-04 03:23:58,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-02-04 03:23:58,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-04 03:23:58,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 165 transitions. [2018-02-04 03:23:58,056 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 165 transitions. Word has length 55 [2018-02-04 03:23:58,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:23:58,057 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 165 transitions. [2018-02-04 03:23:58,057 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 03:23:58,057 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 165 transitions. [2018-02-04 03:23:58,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 03:23:58,057 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:23:58,057 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-04 03:23:58,058 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-04 03:23:58,058 INFO L82 PathProgramCache]: Analyzing trace with hash 2018632320, now seen corresponding path program 1 times [2018-02-04 03:23:58,059 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:23:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:23:58,074 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:23:58,224 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-04 03:23:58,224 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:23:58,224 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-04 03:23:58,224 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:23:58,224 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-04 03:23:58,225 INFO L182 omatonBuilderFactory]: Interpolants [9376#(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|))), 9377#(and (<= (+ LDV_INIT_LIST_HEAD_~list.offset 12) (select |#length| LDV_INIT_LIST_HEAD_~list.base)) (<= 4 LDV_INIT_LIST_HEAD_~list.offset)), 9364#true, 9365#false, 9366#(= 0 |ldv_malloc_#t~malloc4.offset|), 9367#(= 0 |ldv_malloc_#res.offset|), 9368#(= 0 |ldv_kobject_create_#t~ret17.offset|), 9369#(= 0 ldv_kobject_create_~kobj~1.offset), 9370#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 9371#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 9372#(and (= 0 |ldv_kobject_init_#in~kobj.offset|) (<= 16 (select |#length| |ldv_kobject_init_#in~kobj.base|))), 9373#(and (= 0 ldv_kobject_init_~kobj.offset) (<= 16 (select |#length| ldv_kobject_init_~kobj.base))), 9374#(and (<= 16 (select |#length| |ldv_kobject_init_internal_#in~kobj.base|)) (= 0 |ldv_kobject_init_internal_#in~kobj.offset|)), 9375#(and (<= 16 (select |#length| ldv_kobject_init_internal_~kobj.base)) (= ldv_kobject_init_internal_~kobj.offset 0))] [2018-02-04 03:23:58,225 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-04 03:23:58,225 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 03:23:58,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 03:23:58,225 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:23:58,225 INFO L87 Difference]: Start difference. First operand 158 states and 165 transitions. Second operand 14 states. [2018-02-04 03:23:58,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:23:58,401 INFO L93 Difference]: Finished difference Result 156 states and 163 transitions. [2018-02-04 03:23:58,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 03:23:58,401 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2018-02-04 03:23:58,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:23:58,401 INFO L225 Difference]: With dead ends: 156 [2018-02-04 03:23:58,402 INFO L226 Difference]: Without dead ends: 156 [2018-02-04 03:23:58,402 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-04 03:23:58,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-02-04 03:23:58,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-02-04 03:23:58,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-02-04 03:23:58,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 163 transitions. [2018-02-04 03:23:58,405 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 163 transitions. Word has length 55 [2018-02-04 03:23:58,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:23:58,406 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 163 transitions. [2018-02-04 03:23:58,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 03:23:58,406 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 163 transitions. [2018-02-04 03:23:58,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 03:23:58,406 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:23:58,407 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] [2018-02-04 03:23:58,407 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-04 03:23:58,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1509185372, now seen corresponding path program 1 times [2018-02-04 03:23:58,408 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:23:58,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:23:58,420 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:23:58,459 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-04 03:23:58,459 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:23:58,460 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 03:23:58,460 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:23:58,460 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-04 03:23:58,460 INFO L182 omatonBuilderFactory]: Interpolants [9698#true, 9699#false, 9700#(not (= |ldv_malloc_#t~malloc4.base| 0)), 9701#(not (= |ldv_malloc_#res.base| 0)), 9702#(not (= |ldv_kobject_create_#t~ret17.base| 0)), 9703#(not (= ldv_kobject_create_~kobj~1.base 0)), 9704#(= ldv_kobject_init_~kobj.base |ldv_kobject_init_#in~kobj.base|), 9705#(= 0 |ldv_kobject_init_#in~kobj.base|)] [2018-02-04 03:23:58,460 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-04 03:23:58,461 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:23:58,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:23:58,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:23:58,461 INFO L87 Difference]: Start difference. First operand 156 states and 163 transitions. Second operand 8 states. [2018-02-04 03:23:58,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:23:58,500 INFO L93 Difference]: Finished difference Result 158 states and 164 transitions. [2018-02-04 03:23:58,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 03:23:58,500 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2018-02-04 03:23:58,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:23:58,501 INFO L225 Difference]: With dead ends: 158 [2018-02-04 03:23:58,501 INFO L226 Difference]: Without dead ends: 156 [2018-02-04 03:23:58,502 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-04 03:23:58,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-02-04 03:23:58,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-02-04 03:23:58,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-02-04 03:23:58,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 162 transitions. [2018-02-04 03:23:58,504 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 162 transitions. Word has length 60 [2018-02-04 03:23:58,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:23:58,505 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 162 transitions. [2018-02-04 03:23:58,505 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:23:58,505 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 162 transitions. [2018-02-04 03:23:58,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-04 03:23:58,505 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:23:58,505 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] [2018-02-04 03:23:58,505 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-04 03:23:58,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1200464284, now seen corresponding path program 1 times [2018-02-04 03:23:58,506 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:23:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:23:58,517 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:23:58,573 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-04 03:23:58,573 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:23:58,573 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 03:23:58,573 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:23:58,574 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-04 03:23:58,574 INFO L182 omatonBuilderFactory]: Interpolants [10032#(= 0 |ldv_kobject_init_internal_#in~kobj.base|), 10033#(= 0 |ldv_kobject_init_#in~kobj.base|), 10024#true, 10025#false, 10026#(not (= |ldv_malloc_#t~malloc4.base| 0)), 10027#(not (= |ldv_malloc_#res.base| 0)), 10028#(not (= |ldv_kobject_create_#t~ret17.base| 0)), 10029#(not (= ldv_kobject_create_~kobj~1.base 0)), 10030#(= ldv_kobject_init_~kobj.base |ldv_kobject_init_#in~kobj.base|), 10031#(= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|)] [2018-02-04 03:23:58,574 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-04 03:23:58,574 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 03:23:58,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 03:23:58,574 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:23:58,575 INFO L87 Difference]: Start difference. First operand 156 states and 162 transitions. Second operand 10 states. [2018-02-04 03:23:58,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:23:58,636 INFO L93 Difference]: Finished difference Result 160 states and 165 transitions. [2018-02-04 03:23:58,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:23:58,636 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2018-02-04 03:23:58,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:23:58,637 INFO L225 Difference]: With dead ends: 160 [2018-02-04 03:23:58,637 INFO L226 Difference]: Without dead ends: 156 [2018-02-04 03:23:58,638 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-04 03:23:58,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-02-04 03:23:58,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-02-04 03:23:58,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-02-04 03:23:58,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 161 transitions. [2018-02-04 03:23:58,641 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 161 transitions. Word has length 65 [2018-02-04 03:23:58,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:23:58,641 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 161 transitions. [2018-02-04 03:23:58,641 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 03:23:58,641 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 161 transitions. [2018-02-04 03:23:58,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-04 03:23:58,642 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:23:58,642 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] [2018-02-04 03:23:58,642 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-04 03:23:58,642 INFO L82 PathProgramCache]: Analyzing trace with hash -801417679, now seen corresponding path program 1 times [2018-02-04 03:23:58,643 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:23:58,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:23:58,658 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:23:58,774 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-04 03:23:58,775 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:23:58,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-04 03:23:58,775 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:23:58,775 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-04 03:23:58,775 INFO L182 omatonBuilderFactory]: Interpolants [10368#(= 1 (select |#valid| ldv_kref_get_~kref.base)), 10369#(= 1 (select |#valid| |ldv_atomic_add_return_#in~v.base|)), 10370#(= 1 (select |#valid| ldv_atomic_add_return_~v.base)), 10356#true, 10357#false, 10358#(= 1 (select |#valid| |#Ultimate.C_memset_#ptr.base|)), 10359#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base)), 10360#(= 1 (select |#valid| |ldv_kobject_create_#res.base|)), 10361#(= 1 (select |#valid| |entry_point_#t~ret20.base|)), 10362#(= 1 (select |#valid| entry_point_~kobj~2.base)), 10363#(= 1 (select |#valid| |f_22_get_#in~kobj.base|)), 10364#(= 1 (select |#valid| f_22_get_~kobj.base)), 10365#(= 1 (select |#valid| |ldv_kobject_get_#in~kobj.base|)), 10366#(= 1 (select |#valid| ldv_kobject_get_~kobj.base)), 10367#(= 1 (select |#valid| |ldv_kref_get_#in~kref.base|))] [2018-02-04 03:23:58,775 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-04 03:23:58,775 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 03:23:58,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 03:23:58,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-02-04 03:23:58,776 INFO L87 Difference]: Start difference. First operand 156 states and 161 transitions. Second operand 15 states. [2018-02-04 03:23:59,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:23:59,002 INFO L93 Difference]: Finished difference Result 154 states and 159 transitions. [2018-02-04 03:23:59,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 03:23:59,002 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 76 [2018-02-04 03:23:59,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:23:59,003 INFO L225 Difference]: With dead ends: 154 [2018-02-04 03:23:59,003 INFO L226 Difference]: Without dead ends: 154 [2018-02-04 03:23:59,003 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-02-04 03:23:59,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-02-04 03:23:59,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-02-04 03:23:59,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-02-04 03:23:59,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 159 transitions. [2018-02-04 03:23:59,006 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 159 transitions. Word has length 76 [2018-02-04 03:23:59,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:23:59,006 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 159 transitions. [2018-02-04 03:23:59,007 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 03:23:59,007 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 159 transitions. [2018-02-04 03:23:59,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-04 03:23:59,007 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:23:59,007 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] [2018-02-04 03:23:59,007 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-04 03:23:59,007 INFO L82 PathProgramCache]: Analyzing trace with hash -801417678, now seen corresponding path program 1 times [2018-02-04 03:23:59,008 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:23:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:23:59,025 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:23:59,286 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-04 03:23:59,287 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:23:59,287 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-04 03:23:59,287 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:23:59,287 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-04 03:23:59,287 INFO L182 omatonBuilderFactory]: Interpolants [10689#true, 10690#false, 10691#(= 0 |ldv_malloc_#t~malloc4.offset|), 10692#(= 0 |ldv_malloc_#res.offset|), 10693#(= 0 |ldv_kobject_create_#t~ret17.offset|), 10694#(= 0 ldv_kobject_create_~kobj~1.offset), 10695#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 10696#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 10697#(and (= 0 |ldv_kobject_create_#res.offset|) (<= 16 (select |#length| |ldv_kobject_create_#res.base|))), 10698#(and (<= 16 (select |#length| |entry_point_#t~ret20.base|)) (= 0 |entry_point_#t~ret20.offset|)), 10699#(and (= 0 entry_point_~kobj~2.offset) (<= 16 (select |#length| entry_point_~kobj~2.base))), 10700#(and (= 0 |f_22_get_#in~kobj.offset|) (<= 16 (select |#length| |f_22_get_#in~kobj.base|))), 10701#(and (= 0 f_22_get_~kobj.offset) (<= 16 (select |#length| f_22_get_~kobj.base))), 10702#(and (<= 16 (select |#length| |ldv_kobject_get_#in~kobj.base|)) (= 0 |ldv_kobject_get_#in~kobj.offset|)), 10703#(and (<= 16 (select |#length| ldv_kobject_get_~kobj.base)) (= ldv_kobject_get_~kobj.offset 0)), 10704#(and (<= 12 |ldv_kref_get_#in~kref.offset|) (<= (+ |ldv_kref_get_#in~kref.offset| 4) (select |#length| |ldv_kref_get_#in~kref.base|))), 10705#(and (<= 12 ldv_kref_get_~kref.offset) (<= (+ ldv_kref_get_~kref.offset 4) (select |#length| ldv_kref_get_~kref.base))), 10706#(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|))), 10707#(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-04 03:23:59,288 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-04 03:23:59,288 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 03:23:59,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 03:23:59,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-02-04 03:23:59,288 INFO L87 Difference]: Start difference. First operand 154 states and 159 transitions. Second operand 19 states. [2018-02-04 03:23:59,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:23:59,607 INFO L93 Difference]: Finished difference Result 152 states and 157 transitions. [2018-02-04 03:23:59,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 03:23:59,607 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 76 [2018-02-04 03:23:59,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:23:59,608 INFO L225 Difference]: With dead ends: 152 [2018-02-04 03:23:59,608 INFO L226 Difference]: Without dead ends: 152 [2018-02-04 03:23:59,609 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:23:59,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-04 03:23:59,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-02-04 03:23:59,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-04 03:23:59,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 157 transitions. [2018-02-04 03:23:59,611 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 157 transitions. Word has length 76 [2018-02-04 03:23:59,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:23:59,611 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 157 transitions. [2018-02-04 03:23:59,611 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 03:23:59,611 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 157 transitions. [2018-02-04 03:23:59,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-04 03:23:59,611 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:23:59,611 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] [2018-02-04 03:23:59,611 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-04 03:23:59,611 INFO L82 PathProgramCache]: Analyzing trace with hash 18163484, now seen corresponding path program 1 times [2018-02-04 03:23:59,612 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:23:59,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:23:59,622 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:23:59,715 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-04 03:23:59,716 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:23:59,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-04 03:23:59,716 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:23:59,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-04 03:23:59,717 INFO L182 omatonBuilderFactory]: Interpolants [11024#true, 11025#false, 11026#(not (= |ldv_malloc_#t~malloc4.base| 0)), 11027#(not (= |ldv_malloc_#res.base| 0)), 11028#(not (= |ldv_kobject_create_#t~ret17.base| 0)), 11029#(not (= ldv_kobject_create_~kobj~1.base 0)), 11030#(not (= |ldv_kobject_create_#res.base| 0)), 11031#(not (= |entry_point_#t~ret20.base| 0)), 11032#(not (= entry_point_~kobj~2.base 0)), 11033#(= f_22_get_~kobj.base |f_22_get_#in~kobj.base|), 11034#(= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|), 11035#(= 0 |ldv_kobject_get_#in~kobj.base|), 11036#(= 0 |f_22_get_#in~kobj.base|)] [2018-02-04 03:23:59,717 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-04 03:23:59,717 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 03:23:59,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 03:23:59,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:23:59,718 INFO L87 Difference]: Start difference. First operand 152 states and 157 transitions. Second operand 13 states. [2018-02-04 03:23:59,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:23:59,797 INFO L93 Difference]: Finished difference Result 158 states and 162 transitions. [2018-02-04 03:23:59,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 03:23:59,797 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 89 [2018-02-04 03:23:59,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:23:59,798 INFO L225 Difference]: With dead ends: 158 [2018-02-04 03:23:59,798 INFO L226 Difference]: Without dead ends: 152 [2018-02-04 03:23:59,798 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 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-04 03:23:59,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-04 03:23:59,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-02-04 03:23:59,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-04 03:23:59,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 156 transitions. [2018-02-04 03:23:59,802 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 156 transitions. Word has length 89 [2018-02-04 03:23:59,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:23:59,802 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 156 transitions. [2018-02-04 03:23:59,802 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 03:23:59,802 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 156 transitions. [2018-02-04 03:23:59,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-04 03:23:59,802 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:23:59,803 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] [2018-02-04 03:23:59,803 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-04 03:23:59,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1782732078, now seen corresponding path program 1 times [2018-02-04 03:23:59,804 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:23:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:23:59,820 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:00,082 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-04 03:24:00,083 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:24:00,083 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-02-04 03:24:00,083 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:00,083 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-04 03:24:00,083 INFO L182 omatonBuilderFactory]: Interpolants [11360#(= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|), 11361#(and (= 1 (select |#valid| ldv_atomic_add_return_~v.base)) (= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|)), 11362#(= 1 (select |#valid| |ldv_atomic_add_return_#in~v.base|)), 11363#(= 1 (select |#valid| |ldv_kref_get_#in~kref.base|)), 11364#(= 1 (select |#valid| |ldv_kobject_get_#in~kobj.base|)), 11365#(= 1 (select |#valid| |f_22_get_#in~kobj.base|)), 11366#(= 1 (select |#valid| entry_point_~kobj~2.base)), 11367#(= 1 (select |#valid| |f_22_put_#in~kobj.base|)), 11368#(= 1 (select |#valid| f_22_put_~kobj.base)), 11369#(= 1 (select |#valid| |ldv_kobject_put_#in~kobj.base|)), 11370#(= 1 (select |#valid| ldv_kobject_put_~kobj.base)), 11371#(= 1 (select |#valid| |ldv_kref_put_#in~kref.base|)), 11372#(= 1 (select |#valid| ldv_kref_put_~kref.base)), 11373#(= 1 (select |#valid| |ldv_kref_sub_#in~kref.base|)), 11374#(= 1 (select |#valid| ldv_kref_sub_~kref.base)), 11375#(= 1 (select |#valid| |ldv_atomic_sub_return_#in~v.base|)), 11376#(= 1 (select |#valid| ldv_atomic_sub_return_~v.base)), 11355#true, 11356#false, 11357#(= f_22_get_~kobj.base |f_22_get_#in~kobj.base|), 11358#(= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|), 11359#(= ldv_kref_get_~kref.base |ldv_kref_get_#in~kref.base|)] [2018-02-04 03:24:00,084 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-04 03:24:00,084 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 03:24:00,084 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 03:24:00,084 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2018-02-04 03:24:00,084 INFO L87 Difference]: Start difference. First operand 152 states and 156 transitions. Second operand 22 states. [2018-02-04 03:24:00,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:00,475 INFO L93 Difference]: Finished difference Result 179 states and 188 transitions. [2018-02-04 03:24:00,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 03:24:00,475 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 102 [2018-02-04 03:24:00,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:00,476 INFO L225 Difference]: With dead ends: 179 [2018-02-04 03:24:00,476 INFO L226 Difference]: Without dead ends: 179 [2018-02-04 03:24:00,476 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2018-02-04 03:24:00,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-02-04 03:24:00,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 174. [2018-02-04 03:24:00,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-04 03:24:00,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 184 transitions. [2018-02-04 03:24:00,479 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 184 transitions. Word has length 102 [2018-02-04 03:24:00,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:00,479 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 184 transitions. [2018-02-04 03:24:00,479 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 03:24:00,479 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 184 transitions. [2018-02-04 03:24:00,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-04 03:24:00,479 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:00,479 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] [2018-02-04 03:24:00,479 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-04 03:24:00,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1782732077, now seen corresponding path program 1 times [2018-02-04 03:24:00,480 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:00,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:00,492 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:00,776 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-04 03:24:00,777 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:24:00,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-02-04 03:24:00,777 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:00,777 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-04 03:24:00,777 INFO L182 omatonBuilderFactory]: Interpolants [11746#true, 11747#false, 11748#(= 0 |ldv_malloc_#t~malloc4.offset|), 11749#(= 0 |ldv_malloc_#res.offset|), 11750#(= 0 |ldv_kobject_create_#t~ret17.offset|), 11751#(= 0 ldv_kobject_create_~kobj~1.offset), 11752#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 11753#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 11754#(and (= 0 |ldv_kobject_create_#res.offset|) (<= 16 (select |#length| |ldv_kobject_create_#res.base|))), 11755#(and (<= 16 (select |#length| |entry_point_#t~ret20.base|)) (= 0 |entry_point_#t~ret20.offset|)), 11756#(and (= 0 entry_point_~kobj~2.offset) (<= 16 (select |#length| entry_point_~kobj~2.base))), 11757#(and (<= 16 (select |#length| |f_22_put_#in~kobj.base|)) (= 0 |f_22_put_#in~kobj.offset|)), 11758#(and (= 0 f_22_put_~kobj.offset) (<= 16 (select |#length| f_22_put_~kobj.base))), 11759#(and (<= 16 (select |#length| |ldv_kobject_put_#in~kobj.base|)) (= 0 |ldv_kobject_put_#in~kobj.offset|)), 11760#(and (= ldv_kobject_put_~kobj.offset 0) (<= 16 (select |#length| ldv_kobject_put_~kobj.base))), 11761#(and (<= 12 |ldv_kref_put_#in~kref.offset|) (<= (+ |ldv_kref_put_#in~kref.offset| 4) (select |#length| |ldv_kref_put_#in~kref.base|))), 11762#(and (<= 12 ldv_kref_put_~kref.offset) (<= (+ ldv_kref_put_~kref.offset 4) (select |#length| ldv_kref_put_~kref.base))), 11763#(and (<= (+ |ldv_kref_sub_#in~kref.offset| 4) (select |#length| |ldv_kref_sub_#in~kref.base|)) (<= 12 |ldv_kref_sub_#in~kref.offset|)), 11764#(and (<= (+ ldv_kref_sub_~kref.offset 4) (select |#length| ldv_kref_sub_~kref.base)) (<= 12 ldv_kref_sub_~kref.offset)), 11765#(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|)), 11766#(and (<= (+ ldv_atomic_sub_return_~v.offset 4) (select |#length| ldv_atomic_sub_return_~v.base)) (<= 12 ldv_atomic_sub_return_~v.offset))] [2018-02-04 03:24:00,778 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-04 03:24:00,778 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 03:24:00,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 03:24:00,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2018-02-04 03:24:00,778 INFO L87 Difference]: Start difference. First operand 174 states and 184 transitions. Second operand 21 states. [2018-02-04 03:24:01,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:01,156 INFO L93 Difference]: Finished difference Result 172 states and 180 transitions. [2018-02-04 03:24:01,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 03:24:01,156 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 102 [2018-02-04 03:24:01,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:01,156 INFO L225 Difference]: With dead ends: 172 [2018-02-04 03:24:01,157 INFO L226 Difference]: Without dead ends: 172 [2018-02-04 03:24:01,157 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2018-02-04 03:24:01,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-02-04 03:24:01,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-02-04 03:24:01,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-02-04 03:24:01,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 180 transitions. [2018-02-04 03:24:01,160 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 180 transitions. Word has length 102 [2018-02-04 03:24:01,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:01,160 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 180 transitions. [2018-02-04 03:24:01,161 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 03:24:01,161 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 180 transitions. [2018-02-04 03:24:01,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-02-04 03:24:01,161 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:01,161 INFO L351 BasicCegarLoop]: trace histogram [16, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:24:01,162 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-04 03:24:01,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1973215805, now seen corresponding path program 1 times [2018-02-04 03:24:01,162 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:01,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:01,179 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:01,283 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-04 03:24:01,283 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:24:01,283 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-04 03:24:01,283 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:01,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-04 03:24:01,284 INFO L182 omatonBuilderFactory]: Interpolants [12128#(not (= |ldv_malloc_#res.base| 0)), 12129#(not (= |ldv_kobject_create_#t~ret17.base| 0)), 12130#(not (= ldv_kobject_create_~kobj~1.base 0)), 12131#(not (= |ldv_kobject_create_#res.base| 0)), 12132#(not (= |entry_point_#t~ret20.base| 0)), 12133#(not (= entry_point_~kobj~2.base 0)), 12134#(= f_22_put_~kobj.base |f_22_put_#in~kobj.base|), 12135#(= ldv_kobject_put_~kobj.base |ldv_kobject_put_#in~kobj.base|), 12136#(= 0 |ldv_kobject_put_#in~kobj.base|), 12137#(= 0 |f_22_put_#in~kobj.base|), 12125#true, 12126#false, 12127#(not (= |ldv_malloc_#t~malloc4.base| 0))] [2018-02-04 03:24:01,284 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-04 03:24:01,284 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 03:24:01,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 03:24:01,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:24:01,285 INFO L87 Difference]: Start difference. First operand 172 states and 180 transitions. Second operand 13 states. [2018-02-04 03:24:01,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:01,371 INFO L93 Difference]: Finished difference Result 176 states and 182 transitions. [2018-02-04 03:24:01,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 03:24:01,371 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 109 [2018-02-04 03:24:01,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:01,372 INFO L225 Difference]: With dead ends: 176 [2018-02-04 03:24:01,372 INFO L226 Difference]: Without dead ends: 170 [2018-02-04 03:24:01,373 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 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-04 03:24:01,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-02-04 03:24:01,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2018-02-04 03:24:01,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-02-04 03:24:01,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 176 transitions. [2018-02-04 03:24:01,376 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 176 transitions. Word has length 109 [2018-02-04 03:24:01,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:01,377 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 176 transitions. [2018-02-04 03:24:01,377 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 03:24:01,377 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 176 transitions. [2018-02-04 03:24:01,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-02-04 03:24:01,377 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:01,378 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, 1, 1] [2018-02-04 03:24:01,378 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-04 03:24:01,378 INFO L82 PathProgramCache]: Analyzing trace with hash 842639827, now seen corresponding path program 1 times [2018-02-04 03:24:01,379 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:01,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:01,396 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:01,762 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-04 03:24:01,762 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:24:01,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-02-04 03:24:01,762 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:01,763 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-04 03:24:01,763 INFO L182 omatonBuilderFactory]: Interpolants [12492#true, 12493#false, 12494#(= f_22_get_~kobj.base |f_22_get_#in~kobj.base|), 12495#(= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|), 12496#(= ldv_kref_get_~kref.base |ldv_kref_get_#in~kref.base|), 12497#(= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|), 12498#(= 1 (select |#valid| |ldv_atomic_add_return_#in~v.base|)), 12499#(= 1 (select |#valid| |ldv_kref_get_#in~kref.base|)), 12500#(= 1 (select |#valid| |ldv_kobject_get_#in~kobj.base|)), 12501#(= 1 (select |#valid| |f_22_get_#in~kobj.base|)), 12502#(= 1 (select |#valid| entry_point_~kobj~2.base)), 12503#(= 1 (select |#valid| |f_22_put_#in~kobj.base|)), 12504#(= 1 (select |#valid| f_22_put_~kobj.base)), 12505#(= 1 (select |#valid| |ldv_kobject_put_#in~kobj.base|)), 12506#(= 1 (select |#valid| ldv_kobject_put_~kobj.base)), 12507#(= 1 (select |#valid| |ldv_kref_put_#in~kref.base|)), 12508#(= 1 (select |#valid| ldv_kref_put_~kref.base)), 12509#(= 1 (select |#valid| |ldv_kref_sub_#in~kref.base|)), 12510#(= 1 (select |#valid| ldv_kref_sub_~kref.base)), 12511#(= 1 (select |#valid| |##fun~$Pointer$~TO~VOID_#in~kref.base|)), 12512#(= 1 (select |#valid| |##fun~$Pointer$~TO~VOID_#~kref.base|)), 12513#(= 1 (select |#valid| |ldv_kobject_release_#in~kref.base|)), 12514#(= 1 (select |#valid| ldv_kobject_release_~kobj~0.base)), 12515#(= 1 (select |#valid| |ldv_kobject_cleanup_#in~kobj.base|)), 12516#(= 1 (select |#valid| ldv_kobject_cleanup_~kobj.base))] [2018-02-04 03:24:01,763 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-04 03:24:01,763 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 03:24:01,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 03:24:01,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:24:01,763 INFO L87 Difference]: Start difference. First operand 170 states and 176 transitions. Second operand 25 states. [2018-02-04 03:24:02,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:02,336 INFO L93 Difference]: Finished difference Result 180 states and 189 transitions. [2018-02-04 03:24:02,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 03:24:02,336 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 116 [2018-02-04 03:24:02,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:02,337 INFO L225 Difference]: With dead ends: 180 [2018-02-04 03:24:02,337 INFO L226 Difference]: Without dead ends: 180 [2018-02-04 03:24:02,337 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=1169, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 03:24:02,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-02-04 03:24:02,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 176. [2018-02-04 03:24:02,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-02-04 03:24:02,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 186 transitions. [2018-02-04 03:24:02,341 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 186 transitions. Word has length 116 [2018-02-04 03:24:02,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:02,341 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 186 transitions. [2018-02-04 03:24:02,341 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 03:24:02,341 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 186 transitions. [2018-02-04 03:24:02,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-02-04 03:24:02,342 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:02,342 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, 1, 1] [2018-02-04 03:24:02,342 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-04 03:24:02,342 INFO L82 PathProgramCache]: Analyzing trace with hash 842639828, now seen corresponding path program 1 times [2018-02-04 03:24:02,343 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:02,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:02,360 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:02,876 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-04 03:24:02,876 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:24:02,876 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-02-04 03:24:02,876 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:02,877 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-04 03:24:02,877 INFO L182 omatonBuilderFactory]: Interpolants [12895#true, 12896#false, 12897#(= 0 |ldv_malloc_#t~malloc4.offset|), 12898#(= 0 |ldv_malloc_#res.offset|), 12899#(= 0 |ldv_kobject_create_#t~ret17.offset|), 12900#(= 0 ldv_kobject_create_~kobj~1.offset), 12901#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 12902#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 12903#(and (= 0 |ldv_kobject_create_#res.offset|) (<= 16 (select |#length| |ldv_kobject_create_#res.base|))), 12904#(and (<= 16 (select |#length| |entry_point_#t~ret20.base|)) (= 0 |entry_point_#t~ret20.offset|)), 12905#(and (= 0 entry_point_~kobj~2.offset) (<= 16 (select |#length| entry_point_~kobj~2.base))), 12906#(and (<= 16 (select |#length| |f_22_put_#in~kobj.base|)) (= 0 |f_22_put_#in~kobj.offset|)), 12907#(and (= 0 f_22_put_~kobj.offset) (<= 16 (select |#length| f_22_put_~kobj.base))), 12908#(and (<= 16 (select |#length| |ldv_kobject_put_#in~kobj.base|)) (= 0 |ldv_kobject_put_#in~kobj.offset|)), 12909#(and (= ldv_kobject_put_~kobj.offset 0) (<= 16 (select |#length| ldv_kobject_put_~kobj.base))), 12910#(and (<= 12 |ldv_kref_put_#in~kref.offset|) (<= (+ |ldv_kref_put_#in~kref.offset| 4) (select |#length| |ldv_kref_put_#in~kref.base|))), 12911#(and (<= 12 ldv_kref_put_~kref.offset) (<= (+ ldv_kref_put_~kref.offset 4) (select |#length| ldv_kref_put_~kref.base))), 12912#(and (<= (+ |ldv_kref_sub_#in~kref.offset| 4) (select |#length| |ldv_kref_sub_#in~kref.base|)) (<= 12 |ldv_kref_sub_#in~kref.offset|)), 12913#(and (<= (+ ldv_kref_sub_~kref.offset 4) (select |#length| ldv_kref_sub_~kref.base)) (<= 12 ldv_kref_sub_~kref.offset)), 12914#(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|))), 12915#(and (<= 12 |##fun~$Pointer$~TO~VOID_#~kref.offset|) (<= (+ |##fun~$Pointer$~TO~VOID_#~kref.offset| 4) (select |#length| |##fun~$Pointer$~TO~VOID_#~kref.base|))), 12916#(and (<= 12 |ldv_kobject_release_#in~kref.offset|) (<= (+ |ldv_kobject_release_#in~kref.offset| 4) (select |#length| |ldv_kobject_release_#in~kref.base|))), 12917#(and (<= (+ ldv_kobject_release_~kobj~0.offset 16) (select |#length| ldv_kobject_release_~kobj~0.base)) (<= 0 ldv_kobject_release_~kobj~0.offset)), 12918#(and (<= (+ |ldv_kobject_cleanup_#in~kobj.offset| 16) (select |#length| |ldv_kobject_cleanup_#in~kobj.base|)) (<= 0 |ldv_kobject_cleanup_#in~kobj.offset|)), 12919#(and (<= 0 ldv_kobject_cleanup_~kobj.offset) (<= (+ ldv_kobject_cleanup_~kobj.offset 16) (select |#length| ldv_kobject_cleanup_~kobj.base)))] [2018-02-04 03:24:02,877 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-04 03:24:02,877 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 03:24:02,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 03:24:02,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:24:02,877 INFO L87 Difference]: Start difference. First operand 176 states and 186 transitions. Second operand 25 states. [2018-02-04 03:24:03,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:03,585 INFO L93 Difference]: Finished difference Result 175 states and 184 transitions. [2018-02-04 03:24:03,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 03:24:03,585 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 116 [2018-02-04 03:24:03,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:03,586 INFO L225 Difference]: With dead ends: 175 [2018-02-04 03:24:03,586 INFO L226 Difference]: Without dead ends: 175 [2018-02-04 03:24:03,586 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 03:24:03,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-02-04 03:24:03,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-02-04 03:24:03,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-02-04 03:24:03,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 184 transitions. [2018-02-04 03:24:03,588 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 184 transitions. Word has length 116 [2018-02-04 03:24:03,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:03,588 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 184 transitions. [2018-02-04 03:24:03,588 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 03:24:03,589 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 184 transitions. [2018-02-04 03:24:03,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-02-04 03:24:03,589 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:03,589 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, 1, 1, 1, 1] [2018-02-04 03:24:03,589 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-04 03:24:03,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1971942700, now seen corresponding path program 1 times [2018-02-04 03:24:03,590 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:03,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:03,605 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:03,815 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-04 03:24:03,816 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:24:03,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-02-04 03:24:03,816 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:03,816 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-04 03:24:03,816 INFO L182 omatonBuilderFactory]: Interpolants [13288#true, 13289#false, 13290#(= 0 |ldv_malloc_#t~malloc4.offset|), 13291#(= 0 |ldv_malloc_#res.offset|), 13292#(= 0 |ldv_kobject_create_#t~ret17.offset|), 13293#(= 0 ldv_kobject_create_~kobj~1.offset), 13294#(= 0 |ldv_kobject_create_#res.offset|), 13295#(= 0 |entry_point_#t~ret20.offset|), 13296#(= 0 entry_point_~kobj~2.offset), 13297#(= 0 |f_22_put_#in~kobj.offset|), 13298#(= 0 f_22_put_~kobj.offset), 13299#(= 0 |ldv_kobject_put_#in~kobj.offset|), 13300#(= ldv_kobject_put_~kobj.offset 0), 13301#(<= |ldv_kref_put_#in~kref.offset| 12), 13302#(<= ldv_kref_put_~kref.offset 12), 13303#(<= |ldv_kref_sub_#in~kref.offset| 12), 13304#(<= ldv_kref_sub_~kref.offset 12), 13305#(<= |##fun~$Pointer$~TO~VOID_#in~kref.offset| 12), 13306#(<= |##fun~$Pointer$~TO~VOID_#~kref.offset| 12), 13307#(<= |ldv_kobject_release_#in~kref.offset| 12), 13308#(<= ldv_kobject_release_~kobj~0.offset 0), 13309#(<= |ldv_kobject_cleanup_#in~kobj.offset| 0), 13310#(<= ldv_kobject_cleanup_~kobj.offset 0), 13311#(and (<= 0 ldv_kobject_cleanup_~kobj.offset) (<= ldv_kobject_cleanup_~kobj.offset 0))] [2018-02-04 03:24:03,817 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-04 03:24:03,817 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 03:24:03,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 03:24:03,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2018-02-04 03:24:03,817 INFO L87 Difference]: Start difference. First operand 175 states and 184 transitions. Second operand 24 states. [2018-02-04 03:24:04,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:04,049 INFO L93 Difference]: Finished difference Result 174 states and 183 transitions. [2018-02-04 03:24:04,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 03:24:04,050 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 118 [2018-02-04 03:24:04,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:04,051 INFO L225 Difference]: With dead ends: 174 [2018-02-04 03:24:04,051 INFO L226 Difference]: Without dead ends: 174 [2018-02-04 03:24:04,051 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=1034, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 03:24:04,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-02-04 03:24:04,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-02-04 03:24:04,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-04 03:24:04,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 183 transitions. [2018-02-04 03:24:04,055 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 183 transitions. Word has length 118 [2018-02-04 03:24:04,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:04,055 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 183 transitions. [2018-02-04 03:24:04,055 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 03:24:04,055 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 183 transitions. [2018-02-04 03:24:04,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-02-04 03:24:04,056 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:04,056 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, 1, 1, 1, 1, 1, 1] [2018-02-04 03:24:04,056 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-04 03:24:04,056 INFO L82 PathProgramCache]: Analyzing trace with hash -956354475, now seen corresponding path program 1 times [2018-02-04 03:24:04,057 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:04,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:04,110 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:05,700 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-04 03:24:05,700 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:24:05,700 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2018-02-04 03:24:05,700 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:05,700 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-04 03:24:05,701 INFO L182 omatonBuilderFactory]: Interpolants [13696#(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)))), 13697#(or (= 1 (select (select |#memory_int| |ldv_kobject_init_internal_#in~kobj.base|) (- (- 12)))) (not (= |ldv_kobject_init_internal_#in~kobj.offset| 0))), 13698#(or (= 1 (select (select |#memory_int| |ldv_kobject_init_#in~kobj.base|) (- (- 12)))) (not (= |ldv_kobject_init_#in~kobj.offset| 0))), 13699#(and (= 0 ldv_kobject_create_~kobj~1.offset) (= 1 (select (select |#memory_int| ldv_kobject_create_~kobj~1.base) 12))), 13700#(and (= 1 (select (select |#memory_int| |ldv_kobject_create_#res.base|) 12)) (= 0 |ldv_kobject_create_#res.offset|)), 13701#(and (= 0 |entry_point_#t~ret20.offset|) (= 1 (select (select |#memory_int| |entry_point_#t~ret20.base|) 12))), 13702#(and (= 0 entry_point_~kobj~2.offset) (= 1 (select (select |#memory_int| entry_point_~kobj~2.base) 12))), 13703#(and (= |f_22_get_#in~kobj.base| f_22_get_~kobj.base) (= |#memory_int| |old(#memory_int)|) (= f_22_get_~kobj.offset |f_22_get_#in~kobj.offset|)), 13704#(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))), 13705#(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))), 13706#(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)), 13707#(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)))), 13708#(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))), 13709#(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|)), 13710#(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))), 13711#(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))), 13712#(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|))))), 13713#(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))), 13714#(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))), 13715#(or (<= 2 (select (select |#memory_int| |f_22_get_#in~kobj.base|) (- (- 12)))) (not (= 0 |f_22_get_#in~kobj.offset|)) (not (= (select (select |old(#memory_int)| |f_22_get_#in~kobj.base|) (- (- 12))) 1))), 13716#(and (<= 2 (select (select |#memory_int| entry_point_~kobj~2.base) 12)) (= 0 entry_point_~kobj~2.offset)), 13717#(and (<= 2 (select (select |#memory_int| |f_22_put_#in~kobj.base|) 12)) (= 0 |f_22_put_#in~kobj.offset|)), 13718#(and (= 0 f_22_put_~kobj.offset) (<= 2 (select (select |#memory_int| f_22_put_~kobj.base) 12))), 13719#(and (<= 2 (select (select |#memory_int| |ldv_kobject_put_#in~kobj.base|) 12)) (= 0 |ldv_kobject_put_#in~kobj.offset|)), 13720#(and (= ldv_kobject_put_~kobj.offset 0) (<= 2 (select (select |#memory_int| ldv_kobject_put_~kobj.base) 12))), 13721#(<= 2 (select (select |#memory_int| |ldv_kref_put_#in~kref.base|) |ldv_kref_put_#in~kref.offset|)), 13722#(<= 2 (select (select |#memory_int| ldv_kref_put_~kref.base) ldv_kref_put_~kref.offset)), 13723#(and (<= 2 (select (select |#memory_int| |ldv_kref_sub_#in~kref.base|) |ldv_kref_sub_#in~kref.offset|)) (= 1 |ldv_kref_sub_#in~count|)), 13724#(and (= ldv_kref_sub_~count 1) (<= 2 (select (select |#memory_int| ldv_kref_sub_~kref.base) ldv_kref_sub_~kref.offset))), 13725#(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|)), 13726#(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|)), 13727#(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|)), 13728#(<= (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)), 13729#(<= (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|)), 13730#(<= 1 |ldv_kref_sub_#t~ret11|), 13680#true, 13681#false, 13682#(= 0 |ldv_malloc_#t~malloc4.offset|), 13683#(= 0 |ldv_malloc_#res.offset|), 13684#(= 0 |ldv_kobject_create_#t~ret17.offset|), 13685#(= 0 ldv_kobject_create_~kobj~1.offset), 13686#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= |#Ultimate.C_memset_#t~loopctr21| |#Ultimate.C_memset_#amount|)), 13687#(and (= |ldv_kobject_init_#in~kobj.offset| ldv_kobject_init_~kobj.offset) (= ldv_kobject_init_~kobj.base |ldv_kobject_init_#in~kobj.base|)), 13688#(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|))), 13689#(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|))), 13690#(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|)), 13691#(= 1 (select (select |#memory_int| |ldv_kref_init_#in~kref.base|) (- (- |ldv_kref_init_#in~kref.offset|)))), 13692#(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)))), 13693#(= |#memory_int| |old(#memory_int)|), 13694#(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|)), 13695#(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|))] [2018-02-04 03:24:05,701 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-04 03:24:05,701 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-04 03:24:05,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-04 03:24:05,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=2426, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 03:24:05,702 INFO L87 Difference]: Start difference. First operand 174 states and 183 transitions. Second operand 51 states. [2018-02-04 03:24:08,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:08,027 INFO L93 Difference]: Finished difference Result 167 states and 170 transitions. [2018-02-04 03:24:08,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-04 03:24:08,027 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 120 [2018-02-04 03:24:08,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:08,028 INFO L225 Difference]: With dead ends: 167 [2018-02-04 03:24:08,028 INFO L226 Difference]: Without dead ends: 167 [2018-02-04 03:24:08,029 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=265, Invalid=5435, Unknown=0, NotChecked=0, Total=5700 [2018-02-04 03:24:08,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-02-04 03:24:08,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-02-04 03:24:08,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-02-04 03:24:08,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 170 transitions. [2018-02-04 03:24:08,032 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 170 transitions. Word has length 120 [2018-02-04 03:24:08,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:08,032 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 170 transitions. [2018-02-04 03:24:08,032 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-04 03:24:08,032 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 170 transitions. [2018-02-04 03:24:08,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-02-04 03:24:08,033 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:08,033 INFO L351 BasicCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:24:08,033 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-04 03:24:08,034 INFO L82 PathProgramCache]: Analyzing trace with hash -413026264, now seen corresponding path program 1 times [2018-02-04 03:24:08,034 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:08,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:08,057 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:08,279 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-04 03:24:08,279 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:24:08,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 03:24:08,280 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:08,280 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-04 03:24:08,280 INFO L182 omatonBuilderFactory]: Interpolants [14115#true, 14116#false, 14117#(= f_22_get_~kobj.base |f_22_get_#in~kobj.base|), 14118#(= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|), 14119#(= ldv_kref_get_~kref.base |ldv_kref_get_#in~kref.base|), 14120#(= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|), 14121#(and (= 1 (select |#valid| ldv_atomic_add_return_~v.base)) (= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|)), 14122#(= 1 (select |#valid| |ldv_atomic_add_return_#in~v.base|)), 14123#(= 1 (select |#valid| |ldv_kref_get_#in~kref.base|)), 14124#(= 1 (select |#valid| |ldv_kobject_get_#in~kobj.base|)), 14125#(= 1 (select |#valid| |f_22_get_#in~kobj.base|)), 14126#(= 1 (select |#valid| entry_point_~kobj~2.base)), 14127#(= |#valid| |old(#valid)|), 14128#(= 1 (select |#valid| |ldv_kobject_put_#in~kobj.base|)), 14129#(= 1 (select |#valid| ldv_kobject_put_~kobj.base)), 14130#(= 1 (select |#valid| |ldv_kref_put_#in~kref.base|)), 14131#(= 1 (select |#valid| ldv_kref_put_~kref.base)), 14132#(= 1 (select |#valid| |ldv_kref_sub_#in~kref.base|)), 14133#(= 1 (select |#valid| ldv_kref_sub_~kref.base)), 14134#(= 1 (select |#valid| |ldv_atomic_sub_return_#in~v.base|)), 14135#(= 1 (select |#valid| ldv_atomic_sub_return_~v.base))] [2018-02-04 03:24:08,280 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-04 03:24:08,280 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 03:24:08,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 03:24:08,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-02-04 03:24:08,281 INFO L87 Difference]: Start difference. First operand 167 states and 170 transitions. Second operand 21 states. [2018-02-04 03:24:08,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:08,999 INFO L93 Difference]: Finished difference Result 179 states and 181 transitions. [2018-02-04 03:24:08,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 03:24:08,999 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 129 [2018-02-04 03:24:08,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:08,999 INFO L225 Difference]: With dead ends: 179 [2018-02-04 03:24:09,000 INFO L226 Difference]: Without dead ends: 179 [2018-02-04 03:24:09,000 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=1279, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 03:24:09,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-02-04 03:24:09,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 169. [2018-02-04 03:24:09,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-02-04 03:24:09,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 171 transitions. [2018-02-04 03:24:09,003 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 171 transitions. Word has length 129 [2018-02-04 03:24:09,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:09,003 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 171 transitions. [2018-02-04 03:24:09,004 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 03:24:09,004 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 171 transitions. [2018-02-04 03:24:09,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-02-04 03:24:09,004 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:09,005 INFO L351 BasicCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:24:09,005 INFO L371 AbstractCegarLoop]: === Iteration 41 === [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-04 03:24:09,005 INFO L82 PathProgramCache]: Analyzing trace with hash 687384745, now seen corresponding path program 1 times [2018-02-04 03:24:09,006 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:09,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:09,029 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:09,357 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2018-02-04 03:24:09,358 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:24:09,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 03:24:09,358 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:09,358 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-04 03:24:09,358 INFO L182 omatonBuilderFactory]: Interpolants [14528#(= 1 (select |#valid| entry_point_~kobj~2.base)), 14529#(= |#valid| |old(#valid)|), 14530#(= 1 (select |#valid| |ldv_kobject_put_#in~kobj.base|)), 14531#(= 1 (select |#valid| ldv_kobject_put_~kobj.base)), 14532#(= 1 (select |#valid| |ldv_kref_put_#in~kref.base|)), 14533#(= 1 (select |#valid| ldv_kref_put_~kref.base)), 14534#(= 1 (select |#valid| |ldv_kref_sub_#in~kref.base|)), 14535#(= 1 (select |#valid| ldv_kref_sub_~kref.base)), 14536#(= 1 (select |#valid| |##fun~$Pointer$~TO~VOID_#in~kref.base|)), 14537#(= 1 (select |#valid| |##fun~$Pointer$~TO~VOID_#~kref.base|)), 14538#(= 1 (select |#valid| |ldv_kobject_release_#in~kref.base|)), 14539#(= 1 (select |#valid| ldv_kobject_release_~kobj~0.base)), 14540#(= 1 (select |#valid| |ldv_kobject_cleanup_#in~kobj.base|)), 14541#(= 1 (select |#valid| ldv_kobject_cleanup_~kobj.base)), 14518#true, 14519#false, 14520#(= f_22_get_~kobj.base |f_22_get_#in~kobj.base|), 14521#(= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|), 14522#(= ldv_kref_get_~kref.base |ldv_kref_get_#in~kref.base|), 14523#(= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|), 14524#(= 1 (select |#valid| |ldv_atomic_add_return_#in~v.base|)), 14525#(= 1 (select |#valid| |ldv_kref_get_#in~kref.base|)), 14526#(= 1 (select |#valid| |ldv_kobject_get_#in~kobj.base|)), 14527#(= 1 (select |#valid| |f_22_get_#in~kobj.base|))] [2018-02-04 03:24:09,359 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2018-02-04 03:24:09,359 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 03:24:09,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 03:24:09,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-02-04 03:24:09,359 INFO L87 Difference]: Start difference. First operand 169 states and 171 transitions. Second operand 24 states. [2018-02-04 03:24:10,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:10,159 INFO L93 Difference]: Finished difference Result 178 states and 180 transitions. [2018-02-04 03:24:10,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 03:24:10,159 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 143 [2018-02-04 03:24:10,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:10,160 INFO L225 Difference]: With dead ends: 178 [2018-02-04 03:24:10,160 INFO L226 Difference]: Without dead ends: 178 [2018-02-04 03:24:10,160 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=1747, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 03:24:10,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-02-04 03:24:10,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 168. [2018-02-04 03:24:10,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-02-04 03:24:10,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 170 transitions. [2018-02-04 03:24:10,162 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 170 transitions. Word has length 143 [2018-02-04 03:24:10,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:10,163 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 170 transitions. [2018-02-04 03:24:10,163 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 03:24:10,163 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 170 transitions. [2018-02-04 03:24:10,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-02-04 03:24:10,163 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:10,163 INFO L351 BasicCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:24:10,163 INFO L371 AbstractCegarLoop]: === Iteration 42 === [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-04 03:24:10,163 INFO L82 PathProgramCache]: Analyzing trace with hash 903271467, now seen corresponding path program 1 times [2018-02-04 03:24:10,164 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:10,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:10,214 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:15,007 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 129 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 03:24:15,008 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:24:15,008 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-02-04 03:24:15,008 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:15,008 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-04 03:24:15,009 INFO L182 omatonBuilderFactory]: Interpolants [14976#(and (= (select |#memory_$Pointer$.offset| |f_22_get_#in~kobj.base|) (store (select |old(#memory_$Pointer$.offset)| |f_22_get_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |f_22_get_#in~kobj.base|) (select |#memory_$Pointer$.offset| |f_22_get_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |f_22_get_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |f_22_get_#in~kobj.base|) (select |#memory_$Pointer$.offset| |f_22_get_#in~kobj.base|))))) (or (<= 12 (@diff (select |old(#memory_$Pointer$.offset)| |f_22_get_#in~kobj.base|) (select |#memory_$Pointer$.offset| |f_22_get_#in~kobj.base|))) (not (= 0 |f_22_get_#in~kobj.offset|)) (= (select |#memory_$Pointer$.offset| |f_22_get_#in~kobj.base|) (select |old(#memory_$Pointer$.offset)| |f_22_get_#in~kobj.base|)))), 14977#(and (= |f_22_put_#in~kobj.offset| f_22_put_~kobj.offset) (= |f_22_put_#in~kobj.base| f_22_put_~kobj.base) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14978#(and (= |ldv_kobject_put_#in~kobj.base| ldv_kobject_put_~kobj.base) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (or (= ldv_kobject_put_~kobj.offset 0) (= ldv_kobject_put_~kobj.offset |ldv_kobject_put_#in~kobj.offset|))), 14979#(and (or (= ldv_kobject_put_~kobj.offset 0) (not (= |ldv_kobject_put_#in~kobj.offset| 0))) (= |ldv_kobject_put_#in~kobj.base| ldv_kobject_put_~kobj.base) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14980#(and (<= |ldv_kref_put_#in~kref.offset| ldv_kref_put_~kref.offset) (= ldv_kref_put_~kref.base |ldv_kref_put_#in~kref.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14981#(and (<= |ldv_kref_sub_#in~kref.offset| ldv_kref_sub_~kref.offset) (= ldv_kref_sub_~kref.base |ldv_kref_sub_#in~kref.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14982#(and (<= |ldv_atomic_sub_return_#in~v.offset| ldv_atomic_sub_return_~v.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ldv_atomic_sub_return_~v.base |ldv_atomic_sub_return_#in~v.base|)), 14983#(and (= (select |#memory_$Pointer$.offset| |ldv_atomic_sub_return_#in~v.base|) (store (select |old(#memory_$Pointer$.offset)| |ldv_atomic_sub_return_#in~v.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_atomic_sub_return_#in~v.base|) (select |#memory_$Pointer$.offset| |ldv_atomic_sub_return_#in~v.base|)) (select (select |#memory_$Pointer$.offset| |ldv_atomic_sub_return_#in~v.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_atomic_sub_return_#in~v.base|) (select |#memory_$Pointer$.offset| |ldv_atomic_sub_return_#in~v.base|))))) (or (= (select |#memory_$Pointer$.offset| |ldv_atomic_sub_return_#in~v.base|) (select |old(#memory_$Pointer$.offset)| |ldv_atomic_sub_return_#in~v.base|)) (<= |ldv_atomic_sub_return_#in~v.offset| (@diff (select |old(#memory_$Pointer$.offset)| |ldv_atomic_sub_return_#in~v.base|) (select |#memory_$Pointer$.offset| |ldv_atomic_sub_return_#in~v.base|))))), 14984#(and (= (select |#memory_$Pointer$.offset| |ldv_kref_sub_#in~kref.base|) (store (select |old(#memory_$Pointer$.offset)| |ldv_kref_sub_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kref_sub_#in~kref.base|) (select |#memory_$Pointer$.offset| |ldv_kref_sub_#in~kref.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kref_sub_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kref_sub_#in~kref.base|) (select |#memory_$Pointer$.offset| |ldv_kref_sub_#in~kref.base|))))) (or (= (select |#memory_$Pointer$.offset| |ldv_kref_sub_#in~kref.base|) (select |old(#memory_$Pointer$.offset)| |ldv_kref_sub_#in~kref.base|)) (<= |ldv_kref_sub_#in~kref.offset| (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kref_sub_#in~kref.base|) (select |#memory_$Pointer$.offset| |ldv_kref_sub_#in~kref.base|))))), 14985#(and (or (<= |ldv_kref_put_#in~kref.offset| (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kref_put_#in~kref.base|) (select |#memory_$Pointer$.offset| |ldv_kref_put_#in~kref.base|))) (= (select |old(#memory_$Pointer$.offset)| |ldv_kref_put_#in~kref.base|) (select |#memory_$Pointer$.offset| |ldv_kref_put_#in~kref.base|))) (= (store (select |old(#memory_$Pointer$.offset)| |ldv_kref_put_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kref_put_#in~kref.base|) (select |#memory_$Pointer$.offset| |ldv_kref_put_#in~kref.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kref_put_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kref_put_#in~kref.base|) (select |#memory_$Pointer$.offset| |ldv_kref_put_#in~kref.base|)))) (select |#memory_$Pointer$.offset| |ldv_kref_put_#in~kref.base|))), 14986#(and (= (select |#memory_$Pointer$.offset| |ldv_kobject_put_#in~kobj.base|) (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_put_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_put_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_put_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_put_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_put_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_put_#in~kobj.base|))))) (or (= (select |old(#memory_$Pointer$.offset)| |ldv_kobject_put_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_put_#in~kobj.base|)) (not (= |ldv_kobject_put_#in~kobj.offset| 0)) (<= 12 (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_put_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_put_#in~kobj.base|))))), 14987#(and (or (not (= |f_22_put_#in~kobj.offset| 0)) (<= 12 (@diff (select |old(#memory_$Pointer$.offset)| |f_22_put_#in~kobj.base|) (select |#memory_$Pointer$.offset| |f_22_put_#in~kobj.base|))) (= (select |old(#memory_$Pointer$.offset)| |f_22_put_#in~kobj.base|) (select |#memory_$Pointer$.offset| |f_22_put_#in~kobj.base|))) (= (select |#memory_$Pointer$.offset| |f_22_put_#in~kobj.base|) (store (select |old(#memory_$Pointer$.offset)| |f_22_put_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |f_22_put_#in~kobj.base|) (select |#memory_$Pointer$.offset| |f_22_put_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |f_22_put_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |f_22_put_#in~kobj.base|) (select |#memory_$Pointer$.offset| |f_22_put_#in~kobj.base|)))))), 14988#(and (= 0 |ldv_kobject_put_#in~kobj.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ldv_kobject_put_#in~kobj.base|) 0))), 14989#(and (= ldv_kobject_put_~kobj.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| ldv_kobject_put_~kobj.base) 0))), 14990#(and (<= 12 |ldv_kref_put_#in~kref.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ldv_kref_put_#in~kref.base|) 0))), 14991#(and (<= 12 ldv_kref_put_~kref.offset) (= 0 (select (select |#memory_$Pointer$.offset| ldv_kref_put_~kref.base) 0))), 14992#(and (<= 12 |ldv_kref_sub_#in~kref.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ldv_kref_sub_#in~kref.base|) 0))), 14993#(and (= 0 (select (select |#memory_$Pointer$.offset| ldv_kref_sub_~kref.base) 0)) (<= 12 ldv_kref_sub_~kref.offset)), 14994#(= 0 (select (select |#memory_$Pointer$.offset| ldv_kref_sub_~kref.base) 0)), 14995#(= 0 (select (select |#memory_$Pointer$.offset| |##fun~$Pointer$~TO~VOID_#in~kref.base|) 0)), 14996#(= 0 (select (select |#memory_$Pointer$.offset| |##fun~$Pointer$~TO~VOID_#~kref.base|) 0)), 14997#(= 0 (select (select |#memory_$Pointer$.offset| |ldv_kobject_release_#in~kref.base|) 0)), 14998#(= 0 (select (select |#memory_$Pointer$.offset| ldv_kobject_release_~kobj~0.base) 0)), 14999#(= 0 (select (select |#memory_$Pointer$.offset| |ldv_kobject_cleanup_#in~kobj.base|) 0)), 15000#(or (not (= 0 ldv_kobject_cleanup_~kobj.offset)) (= 0 (select (select |#memory_$Pointer$.offset| ldv_kobject_cleanup_~kobj.base) ldv_kobject_cleanup_~kobj.offset))), 15001#(or (= 0 |ldv_kobject_cleanup_#t~mem15.offset|) (not (= 0 ldv_kobject_cleanup_~kobj.offset))), 15002#(or (not (= 0 ldv_kobject_cleanup_~kobj.offset)) (= 0 ldv_kobject_cleanup_~name~0.offset)), 15003#(= 0 ldv_kobject_cleanup_~name~0.offset), 14928#true, 14929#false, 14930#(= 0 |ldv_malloc_#t~malloc4.offset|), 14931#(= 0 |ldv_malloc_#res.offset|), 14932#(= 0 |ldv_kobject_create_#t~ret17.offset|), 14933#(= 0 ldv_kobject_create_~kobj~1.offset), 14934#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (not (= |#Ultimate.C_memset_#value| 0)) (<= 2 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 0)), 14935#(or (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr21| |#Ultimate.C_memset_#ptr.offset|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= 3 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (not (= |#Ultimate.C_memset_#value| 0)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 1)), 14936#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= 4 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (not (= |#Ultimate.C_memset_#value| 0)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 2) (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0))), 14937#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 3) (<= 5 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (not (= |#Ultimate.C_memset_#value| 0)) (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0))), 14938#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 4) (not (= |#Ultimate.C_memset_#value| 0)) (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0)) (<= 6 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|))), 14939#(or (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr21| |#Ultimate.C_memset_#ptr.offset|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (not (= |#Ultimate.C_memset_#value| 0)) (<= 7 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 5)), 14940#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 6) (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr21| |#Ultimate.C_memset_#ptr.offset|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= 8 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (not (= |#Ultimate.C_memset_#value| 0))), 14941#(or (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr21| |#Ultimate.C_memset_#ptr.offset|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= 9 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (not (= |#Ultimate.C_memset_#value| 0)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 7)), 14942#(or (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr21| |#Ultimate.C_memset_#ptr.offset|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 8) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= 10 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (not (= |#Ultimate.C_memset_#value| 0))), 14943#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= 11 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (not (= |#Ultimate.C_memset_#value| 0)) (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 9)), 14944#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 10) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (not (= |#Ultimate.C_memset_#value| 0)) (<= 12 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0))), 14945#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (not (= |#Ultimate.C_memset_#value| 0)) (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0)) (<= 13 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 11)), 14946#(or (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr21| |#Ultimate.C_memset_#ptr.offset|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (not (= |#Ultimate.C_memset_#value| 0)) (<= 14 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 12)), 14947#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 13) (not (= |#Ultimate.C_memset_#value| 0)) (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0)) (<= 15 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|))), 14948#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (not (= |#Ultimate.C_memset_#value| 0)) (<= 16 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 14)), 14949#(or (<= 17 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|)) (and (= 0 (select (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) 0)) (<= 16 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|))) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 15) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (not (= |#Ultimate.C_memset_#value| 0))), 14950#(or (<= 17 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) 15) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (= 0 (select (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) 0)) (not (= |#Ultimate.C_memset_#value| 0))), 14951#(and (= 0 ldv_kobject_create_~kobj~1.offset) (= 0 (select (select |#memory_$Pointer$.offset| ldv_kobject_create_~kobj~1.base) 0))), 14952#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 14953#(and (= |ldv_kobject_init_#in~kobj.offset| ldv_kobject_init_~kobj.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |ldv_kobject_init_#in~kobj.base| ldv_kobject_init_~kobj.base)), 14954#(and (or (= ldv_kobject_init_internal_~kobj.offset |ldv_kobject_init_internal_#in~kobj.offset|) (= ldv_kobject_init_internal_~kobj.offset 0)) (or (and (= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ldv_kobject_init_internal_~kobj.offset 0)))), 14955#(and (or (= ldv_kobject_init_internal_~kobj.offset 0) (not (= |ldv_kobject_init_internal_#in~kobj.offset| 0))) (or (and (= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ldv_kobject_init_internal_~kobj.offset 0)))), 14956#(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|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14957#(and (or (= (select |old(#memory_$Pointer$.offset)| |ldv_kref_init_#in~kref.base|) (select |#memory_$Pointer$.offset| |ldv_kref_init_#in~kref.base|)) (<= |ldv_kref_init_#in~kref.offset| (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kref_init_#in~kref.base|) (select |#memory_$Pointer$.offset| |ldv_kref_init_#in~kref.base|)))) (= (store (select |old(#memory_$Pointer$.offset)| |ldv_kref_init_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kref_init_#in~kref.base|) (select |#memory_$Pointer$.offset| |ldv_kref_init_#in~kref.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kref_init_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kref_init_#in~kref.base|) (select |#memory_$Pointer$.offset| |ldv_kref_init_#in~kref.base|)))) (select |#memory_$Pointer$.offset| |ldv_kref_init_#in~kref.base|))), 14958#(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)) (and (= |ldv_kobject_init_internal_#in~kobj.base| ldv_kobject_init_internal_~kobj.base) (or (= (select |#memory_$Pointer$.offset| ldv_kobject_init_internal_~kobj.base) (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|)) (<= (+ ldv_kobject_init_internal_~kobj.offset 12) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| ldv_kobject_init_internal_~kobj.base)))) (= (select |#memory_$Pointer$.offset| ldv_kobject_init_internal_~kobj.base) (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| ldv_kobject_init_internal_~kobj.base)) (select (select |#memory_$Pointer$.offset| ldv_kobject_init_internal_~kobj.base) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| ldv_kobject_init_internal_~kobj.base)))))))), 14959#(and (= LDV_INIT_LIST_HEAD_~list.base |LDV_INIT_LIST_HEAD_#in~list.base|) (<= |LDV_INIT_LIST_HEAD_#in~list.offset| LDV_INIT_LIST_HEAD_~list.offset) (<= LDV_INIT_LIST_HEAD_~list.offset |LDV_INIT_LIST_HEAD_#in~list.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14960#(and (= LDV_INIT_LIST_HEAD_~list.base |LDV_INIT_LIST_HEAD_#in~list.base|) (= (store (select |old(#memory_$Pointer$.offset)| LDV_INIT_LIST_HEAD_~list.base) LDV_INIT_LIST_HEAD_~list.offset (select (select |#memory_$Pointer$.offset| LDV_INIT_LIST_HEAD_~list.base) LDV_INIT_LIST_HEAD_~list.offset)) (select |#memory_$Pointer$.offset| LDV_INIT_LIST_HEAD_~list.base)) (<= |LDV_INIT_LIST_HEAD_#in~list.offset| LDV_INIT_LIST_HEAD_~list.offset) (<= LDV_INIT_LIST_HEAD_~list.offset |LDV_INIT_LIST_HEAD_#in~list.offset|)), 14961#(and (= (store (store (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|)))) (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|)))) (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|)))) (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|)) (or (= (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|) (store (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|))))) (<= |LDV_INIT_LIST_HEAD_#in~list.offset| (@diff (store (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|)))) (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|)))) (or (= (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|)) (<= |LDV_INIT_LIST_HEAD_#in~list.offset| (@diff (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|))))), 14962#(or (and (or (<= 4 (@diff (store (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|))) (= (store (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|))) (= (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (store (store (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)))) (@diff (store (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (store (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|))))) (or (<= 4 (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|))) (= (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|))) (or (= (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)) (<= 4 (@diff (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|))))) (not (= |ldv_kobject_init_internal_#in~kobj.offset| 0))), 14963#(or (and (or (<= 4 (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|))) (= (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|))) (= (store (store (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)))) (@diff (store (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (@diff (store (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (or (= (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|))))) (<= 4 (@diff (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)))) (or (= (store (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (<= 4 (@diff (store (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|))))) (not (= |ldv_kobject_init_#in~kobj.offset| 0))), 14964#(and (= 0 (select (select |#memory_$Pointer$.offset| |ldv_kobject_create_#res.base|) 0)) (= 0 |ldv_kobject_create_#res.offset|)), 14965#(and (= 0 |entry_point_#t~ret20.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |entry_point_#t~ret20.base|) 0))), 14966#(and (= 0 entry_point_~kobj~2.offset) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~kobj~2.base) 0))), 14967#(and (= |f_22_get_#in~kobj.base| f_22_get_~kobj.base) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= f_22_get_~kobj.offset |f_22_get_#in~kobj.offset|)), 14968#(and (or (= ldv_kobject_get_~kobj.offset |ldv_kobject_get_#in~kobj.offset|) (= ldv_kobject_get_~kobj.offset 0)) (= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14969#(and (= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|) (or (not (= 0 |ldv_kobject_get_#in~kobj.offset|)) (= ldv_kobject_get_~kobj.offset 0)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14970#(and (= ldv_kref_get_~kref.base |ldv_kref_get_#in~kref.base|) (<= |ldv_kref_get_#in~kref.offset| ldv_kref_get_~kref.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14971#(and (<= |ldv_atomic_add_return_#in~v.offset| ldv_atomic_add_return_~v.offset) (= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14972#(and (= (store (select |old(#memory_$Pointer$.offset)| |ldv_atomic_add_return_#in~v.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_atomic_add_return_#in~v.base|) (select |#memory_$Pointer$.offset| |ldv_atomic_add_return_#in~v.base|)) (select (select |#memory_$Pointer$.offset| |ldv_atomic_add_return_#in~v.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_atomic_add_return_#in~v.base|) (select |#memory_$Pointer$.offset| |ldv_atomic_add_return_#in~v.base|)))) (select |#memory_$Pointer$.offset| |ldv_atomic_add_return_#in~v.base|)) (or (<= |ldv_atomic_add_return_#in~v.offset| (@diff (select |old(#memory_$Pointer$.offset)| |ldv_atomic_add_return_#in~v.base|) (select |#memory_$Pointer$.offset| |ldv_atomic_add_return_#in~v.base|))) (= (select |old(#memory_$Pointer$.offset)| |ldv_atomic_add_return_#in~v.base|) (select |#memory_$Pointer$.offset| |ldv_atomic_add_return_#in~v.base|)))), 14973#(and (or (<= |ldv_kref_get_#in~kref.offset| (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kref_get_#in~kref.base|) (select |#memory_$Pointer$.offset| |ldv_kref_get_#in~kref.base|))) (= (select |#memory_$Pointer$.offset| |ldv_kref_get_#in~kref.base|) (select |old(#memory_$Pointer$.offset)| |ldv_kref_get_#in~kref.base|))) (= (select |#memory_$Pointer$.offset| |ldv_kref_get_#in~kref.base|) (store (select |old(#memory_$Pointer$.offset)| |ldv_kref_get_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kref_get_#in~kref.base|) (select |#memory_$Pointer$.offset| |ldv_kref_get_#in~kref.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kref_get_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kref_get_#in~kref.base|) (select |#memory_$Pointer$.offset| |ldv_kref_get_#in~kref.base|)))))), 14974#(and (or (= (select |#memory_$Pointer$.offset| |ldv_kobject_get_#in~kobj.base|) (select |old(#memory_$Pointer$.offset)| |ldv_kobject_get_#in~kobj.base|)) (and (or (<= (+ ldv_kobject_get_~kobj.offset 12) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_get_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_get_#in~kobj.base|))) (not (= ldv_kobject_get_~kobj.offset 0))) (or (not (= 0 |ldv_kobject_get_#in~kobj.offset|)) (= ldv_kobject_get_~kobj.offset 0)))) (= (select |#memory_$Pointer$.offset| |ldv_kobject_get_#in~kobj.base|) (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_get_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_get_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_get_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_get_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_get_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_get_#in~kobj.base|)))))), 14975#(and (= (select |#memory_$Pointer$.offset| |ldv_kobject_get_#in~kobj.base|) (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_get_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_get_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_get_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_get_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_get_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_get_#in~kobj.base|))))) (or (<= 12 (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_get_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_get_#in~kobj.base|))) (not (= 0 |ldv_kobject_get_#in~kobj.offset|)) (= (select |#memory_$Pointer$.offset| |ldv_kobject_get_#in~kobj.base|) (select |old(#memory_$Pointer$.offset)| |ldv_kobject_get_#in~kobj.base|))))] [2018-02-04 03:24:15,009 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 129 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 03:24:15,009 INFO L409 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-02-04 03:24:15,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-02-04 03:24:15,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=5313, Unknown=0, NotChecked=0, Total=5700 [2018-02-04 03:24:15,010 INFO L87 Difference]: Start difference. First operand 168 states and 170 transitions. Second operand 76 states. [2018-02-04 03:24:16,127 WARN L146 SmtUtils]: Spent 319ms on a formula simplification. DAG size of input: 98 DAG size of output 97 [2018-02-04 03:24:18,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:18,651 INFO L93 Difference]: Finished difference Result 167 states and 169 transitions. [2018-02-04 03:24:18,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-02-04 03:24:18,651 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 147 [2018-02-04 03:24:18,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:18,652 INFO L225 Difference]: With dead ends: 167 [2018-02-04 03:24:18,652 INFO L226 Difference]: Without dead ends: 167 [2018-02-04 03:24:18,653 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1604 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=878, Invalid=9628, Unknown=0, NotChecked=0, Total=10506 [2018-02-04 03:24:18,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-02-04 03:24:18,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-02-04 03:24:18,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-02-04 03:24:18,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 169 transitions. [2018-02-04 03:24:18,655 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 169 transitions. Word has length 147 [2018-02-04 03:24:18,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:18,655 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 169 transitions. [2018-02-04 03:24:18,655 INFO L433 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-02-04 03:24:18,655 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 169 transitions. [2018-02-04 03:24:18,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-02-04 03:24:18,656 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:18,656 INFO L351 BasicCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:24:18,656 INFO L371 AbstractCegarLoop]: === Iteration 43 === [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-04 03:24:18,656 INFO L82 PathProgramCache]: Analyzing trace with hash 903271468, now seen corresponding path program 1 times [2018-02-04 03:24:18,657 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:18,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:18,699 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:22,363 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 129 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 03:24:22,363 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:24:22,363 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-02-04 03:24:22,363 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:22,363 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-04 03:24:22,364 INFO L182 omatonBuilderFactory]: Interpolants [15392#true, 15393#false, 15394#(= 0 |ldv_malloc_#t~malloc4.offset|), 15395#(= 0 |ldv_malloc_#res.offset|), 15396#(= 0 |ldv_kobject_create_#t~ret17.offset|), 15397#(= 0 ldv_kobject_create_~kobj~1.offset), 15398#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= 2 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 0)), 15399#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr21| |#Ultimate.C_memset_#ptr.offset|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= 3 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 1)), 15400#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= 4 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 2)), 15401#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 3) (<= 5 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 15402#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 4) (<= 6 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|))), 15403#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr21| |#Ultimate.C_memset_#ptr.offset|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= 7 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 5)), 15404#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr21| |#Ultimate.C_memset_#ptr.offset|) 0) 0)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 6) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= 8 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|))), 15405#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr21| |#Ultimate.C_memset_#ptr.offset|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= 9 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 7)), 15406#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr21| |#Ultimate.C_memset_#ptr.offset|) 0) 0)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 8) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= 10 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|))), 15407#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= 11 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 9)), 15408#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 10) (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= 12 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|))), 15409#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= 13 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 11)), 15410#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr21| |#Ultimate.C_memset_#ptr.offset|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= 14 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 12)), 15411#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 13) (<= 15 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|))), 15412#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= 16 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 14)), 15413#(or (<= 17 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 15) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (and (= 0 (select (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) 0)) (<= 16 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|)))), 15414#(or (<= 17 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) 15) (= 0 (select (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 15415#(and (= 0 ldv_kobject_create_~kobj~1.offset) (= 0 (select (select |#memory_$Pointer$.base| ldv_kobject_create_~kobj~1.base) 0))), 15416#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 15417#(and (= |ldv_kobject_init_#in~kobj.offset| ldv_kobject_init_~kobj.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |ldv_kobject_init_#in~kobj.base| ldv_kobject_init_~kobj.base)), 15418#(and (or (and (= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (not (= ldv_kobject_init_internal_~kobj.offset 0))) (or (= ldv_kobject_init_internal_~kobj.offset |ldv_kobject_init_internal_#in~kobj.offset|) (= ldv_kobject_init_internal_~kobj.offset 0))), 15419#(and (or (and (= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.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)))), 15420#(and (<= ldv_kref_init_~kref.offset |ldv_kref_init_#in~kref.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (<= |ldv_kref_init_#in~kref.offset| ldv_kref_init_~kref.offset) (= ldv_kref_init_~kref.base |ldv_kref_init_#in~kref.base|)), 15421#(and (or (= (select |old(#memory_$Pointer$.base)| |ldv_kref_init_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_init_#in~kref.base|)) (<= |ldv_kref_init_#in~kref.offset| (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_init_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_init_#in~kref.base|)))) (= (store (select |old(#memory_$Pointer$.base)| |ldv_kref_init_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_init_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_init_#in~kref.base|)) (select (select |#memory_$Pointer$.base| |ldv_kref_init_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_init_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_init_#in~kref.base|)))) (select |#memory_$Pointer$.base| |ldv_kref_init_#in~kref.base|))), 15422#(and (or (= ldv_kobject_init_internal_~kobj.offset 0) (not (= |ldv_kobject_init_internal_#in~kobj.offset| 0))) (or (and (or (= (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| ldv_kobject_init_internal_~kobj.base)) (<= (+ ldv_kobject_init_internal_~kobj.offset 12) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| ldv_kobject_init_internal_~kobj.base)))) (= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|) (= (select |#memory_$Pointer$.base| ldv_kobject_init_internal_~kobj.base) (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| ldv_kobject_init_internal_~kobj.base)) (select (select |#memory_$Pointer$.base| ldv_kobject_init_internal_~kobj.base) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| ldv_kobject_init_internal_~kobj.base)))))) (not (= ldv_kobject_init_internal_~kobj.offset 0)))), 15423#(and (= LDV_INIT_LIST_HEAD_~list.base |LDV_INIT_LIST_HEAD_#in~list.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (<= |LDV_INIT_LIST_HEAD_#in~list.offset| LDV_INIT_LIST_HEAD_~list.offset) (<= LDV_INIT_LIST_HEAD_~list.offset |LDV_INIT_LIST_HEAD_#in~list.offset|)), 15424#(and (= LDV_INIT_LIST_HEAD_~list.base |LDV_INIT_LIST_HEAD_#in~list.base|) (= (select |#memory_$Pointer$.base| LDV_INIT_LIST_HEAD_~list.base) (store (select |old(#memory_$Pointer$.base)| LDV_INIT_LIST_HEAD_~list.base) LDV_INIT_LIST_HEAD_~list.offset (select (select |#memory_$Pointer$.base| LDV_INIT_LIST_HEAD_~list.base) LDV_INIT_LIST_HEAD_~list.offset))) (<= |LDV_INIT_LIST_HEAD_#in~list.offset| LDV_INIT_LIST_HEAD_~list.offset) (<= LDV_INIT_LIST_HEAD_~list.offset |LDV_INIT_LIST_HEAD_#in~list.offset|)), 15425#(and (or (<= |LDV_INIT_LIST_HEAD_#in~list.offset| (@diff (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|))) (= (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|))) (= (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|) (store (store (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|)))) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|)))) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|))))) (or (<= |LDV_INIT_LIST_HEAD_#in~list.offset| (@diff (store (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|)))) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|))) (= (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|) (store (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|))))))), 15426#(or (and (or (= (store (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (<= 4 (@diff (store (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (= (store (store (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (@diff (store (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (store (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (or (<= 4 (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|))) (= (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|))) (or (= (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|))))) (<= 4 (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|))))) (not (= |ldv_kobject_init_internal_#in~kobj.offset| 0))), 15427#(or (and (or (= (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|))))) (<= 4 (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (or (<= 4 (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|))) (= (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|))) (= (store (store (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (@diff (store (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (store (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (or (<= 4 (@diff (store (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|))) (= (store (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (not (= |ldv_kobject_init_#in~kobj.offset| 0))), 15428#(and (= 0 (select (select |#memory_$Pointer$.base| |ldv_kobject_create_#res.base|) 0)) (= 0 |ldv_kobject_create_#res.offset|)), 15429#(and (= 0 (select (select |#memory_$Pointer$.base| |entry_point_#t~ret20.base|) 0)) (= 0 |entry_point_#t~ret20.offset|)), 15430#(and (= 0 entry_point_~kobj~2.offset) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~kobj~2.base) 0))), 15431#(and (= |f_22_get_#in~kobj.base| f_22_get_~kobj.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= f_22_get_~kobj.offset |f_22_get_#in~kobj.offset|)), 15432#(and (or (= ldv_kobject_get_~kobj.offset |ldv_kobject_get_#in~kobj.offset|) (= ldv_kobject_get_~kobj.offset 0)) (= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 15433#(and (= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (or (not (= 0 |ldv_kobject_get_#in~kobj.offset|)) (= ldv_kobject_get_~kobj.offset 0))), 15434#(and (= ldv_kref_get_~kref.base |ldv_kref_get_#in~kref.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (<= |ldv_kref_get_#in~kref.offset| ldv_kref_get_~kref.offset)), 15435#(and (<= |ldv_atomic_add_return_#in~v.offset| ldv_atomic_add_return_~v.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|)), 15436#(and (or (<= |ldv_atomic_add_return_#in~v.offset| (@diff (select |old(#memory_$Pointer$.base)| |ldv_atomic_add_return_#in~v.base|) (select |#memory_$Pointer$.base| |ldv_atomic_add_return_#in~v.base|))) (= (select |old(#memory_$Pointer$.base)| |ldv_atomic_add_return_#in~v.base|) (select |#memory_$Pointer$.base| |ldv_atomic_add_return_#in~v.base|))) (= (store (select |old(#memory_$Pointer$.base)| |ldv_atomic_add_return_#in~v.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_atomic_add_return_#in~v.base|) (select |#memory_$Pointer$.base| |ldv_atomic_add_return_#in~v.base|)) (select (select |#memory_$Pointer$.base| |ldv_atomic_add_return_#in~v.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_atomic_add_return_#in~v.base|) (select |#memory_$Pointer$.base| |ldv_atomic_add_return_#in~v.base|)))) (select |#memory_$Pointer$.base| |ldv_atomic_add_return_#in~v.base|))), 15437#(and (or (= (select |#memory_$Pointer$.base| |ldv_kref_get_#in~kref.base|) (select |old(#memory_$Pointer$.base)| |ldv_kref_get_#in~kref.base|)) (<= |ldv_kref_get_#in~kref.offset| (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_get_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_get_#in~kref.base|)))) (= (select |#memory_$Pointer$.base| |ldv_kref_get_#in~kref.base|) (store (select |old(#memory_$Pointer$.base)| |ldv_kref_get_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_get_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_get_#in~kref.base|)) (select (select |#memory_$Pointer$.base| |ldv_kref_get_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_get_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_get_#in~kref.base|)))))), 15438#(and (or (= (select |old(#memory_$Pointer$.base)| |ldv_kobject_get_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|)) (and (or (<= (+ ldv_kobject_get_~kobj.offset 12) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_get_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|))) (not (= ldv_kobject_get_~kobj.offset 0))) (or (not (= 0 |ldv_kobject_get_#in~kobj.offset|)) (= ldv_kobject_get_~kobj.offset 0)))) (= (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_get_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_get_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_get_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|))), 15439#(and (or (not (= 0 |ldv_kobject_get_#in~kobj.offset|)) (= (select |old(#memory_$Pointer$.base)| |ldv_kobject_get_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|)) (<= 12 (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_get_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|)))) (= (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_get_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_get_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_get_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|))), 15440#(and (= (select |#memory_$Pointer$.base| |f_22_get_#in~kobj.base|) (store (select |old(#memory_$Pointer$.base)| |f_22_get_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |f_22_get_#in~kobj.base|) (select |#memory_$Pointer$.base| |f_22_get_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |f_22_get_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |f_22_get_#in~kobj.base|) (select |#memory_$Pointer$.base| |f_22_get_#in~kobj.base|))))) (or (<= 12 (@diff (select |old(#memory_$Pointer$.base)| |f_22_get_#in~kobj.base|) (select |#memory_$Pointer$.base| |f_22_get_#in~kobj.base|))) (not (= 0 |f_22_get_#in~kobj.offset|)) (= (select |old(#memory_$Pointer$.base)| |f_22_get_#in~kobj.base|) (select |#memory_$Pointer$.base| |f_22_get_#in~kobj.base|)))), 15441#(and (= |f_22_put_#in~kobj.offset| f_22_put_~kobj.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |f_22_put_#in~kobj.base| f_22_put_~kobj.base)), 15442#(and (= |ldv_kobject_put_#in~kobj.base| ldv_kobject_put_~kobj.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (or (= ldv_kobject_put_~kobj.offset 0) (= ldv_kobject_put_~kobj.offset |ldv_kobject_put_#in~kobj.offset|))), 15443#(and (or (= ldv_kobject_put_~kobj.offset 0) (not (= |ldv_kobject_put_#in~kobj.offset| 0))) (= |ldv_kobject_put_#in~kobj.base| ldv_kobject_put_~kobj.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 15444#(and (<= |ldv_kref_put_#in~kref.offset| ldv_kref_put_~kref.offset) (= ldv_kref_put_~kref.base |ldv_kref_put_#in~kref.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 15445#(and (<= |ldv_kref_sub_#in~kref.offset| ldv_kref_sub_~kref.offset) (= ldv_kref_sub_~kref.base |ldv_kref_sub_#in~kref.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 15446#(and (<= |ldv_atomic_sub_return_#in~v.offset| ldv_atomic_sub_return_~v.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ldv_atomic_sub_return_~v.base |ldv_atomic_sub_return_#in~v.base|)), 15447#(and (or (<= |ldv_atomic_sub_return_#in~v.offset| (@diff (select |old(#memory_$Pointer$.base)| |ldv_atomic_sub_return_#in~v.base|) (select |#memory_$Pointer$.base| |ldv_atomic_sub_return_#in~v.base|))) (= (select |old(#memory_$Pointer$.base)| |ldv_atomic_sub_return_#in~v.base|) (select |#memory_$Pointer$.base| |ldv_atomic_sub_return_#in~v.base|))) (= (select |#memory_$Pointer$.base| |ldv_atomic_sub_return_#in~v.base|) (store (select |old(#memory_$Pointer$.base)| |ldv_atomic_sub_return_#in~v.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_atomic_sub_return_#in~v.base|) (select |#memory_$Pointer$.base| |ldv_atomic_sub_return_#in~v.base|)) (select (select |#memory_$Pointer$.base| |ldv_atomic_sub_return_#in~v.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_atomic_sub_return_#in~v.base|) (select |#memory_$Pointer$.base| |ldv_atomic_sub_return_#in~v.base|)))))), 15448#(and (= (select |#memory_$Pointer$.base| |ldv_kref_sub_#in~kref.base|) (store (select |old(#memory_$Pointer$.base)| |ldv_kref_sub_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_sub_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_sub_#in~kref.base|)) (select (select |#memory_$Pointer$.base| |ldv_kref_sub_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_sub_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_sub_#in~kref.base|))))) (or (= (select |#memory_$Pointer$.base| |ldv_kref_sub_#in~kref.base|) (select |old(#memory_$Pointer$.base)| |ldv_kref_sub_#in~kref.base|)) (<= |ldv_kref_sub_#in~kref.offset| (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_sub_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_sub_#in~kref.base|))))), 15449#(and (= (select |#memory_$Pointer$.base| |ldv_kref_put_#in~kref.base|) (store (select |old(#memory_$Pointer$.base)| |ldv_kref_put_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_put_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_put_#in~kref.base|)) (select (select |#memory_$Pointer$.base| |ldv_kref_put_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_put_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_put_#in~kref.base|))))) (or (<= |ldv_kref_put_#in~kref.offset| (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_put_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_put_#in~kref.base|))) (= (select |old(#memory_$Pointer$.base)| |ldv_kref_put_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_put_#in~kref.base|)))), 15450#(and (= (select |#memory_$Pointer$.base| |ldv_kobject_put_#in~kobj.base|) (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_put_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_put_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_put_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_put_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_put_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_put_#in~kobj.base|))))) (or (not (= |ldv_kobject_put_#in~kobj.offset| 0)) (= (select |old(#memory_$Pointer$.base)| |ldv_kobject_put_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_put_#in~kobj.base|)) (<= 12 (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_put_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_put_#in~kobj.base|))))), 15451#(and (or (not (= |f_22_put_#in~kobj.offset| 0)) (= (select |old(#memory_$Pointer$.base)| |f_22_put_#in~kobj.base|) (select |#memory_$Pointer$.base| |f_22_put_#in~kobj.base|)) (<= 12 (@diff (select |old(#memory_$Pointer$.base)| |f_22_put_#in~kobj.base|) (select |#memory_$Pointer$.base| |f_22_put_#in~kobj.base|)))) (= (store (select |old(#memory_$Pointer$.base)| |f_22_put_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |f_22_put_#in~kobj.base|) (select |#memory_$Pointer$.base| |f_22_put_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |f_22_put_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |f_22_put_#in~kobj.base|) (select |#memory_$Pointer$.base| |f_22_put_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |f_22_put_#in~kobj.base|))), 15452#(and (= 0 |ldv_kobject_put_#in~kobj.offset|) (= 0 (select (select |#memory_$Pointer$.base| |ldv_kobject_put_#in~kobj.base|) 0))), 15453#(and (= ldv_kobject_put_~kobj.offset 0) (= 0 (select (select |#memory_$Pointer$.base| ldv_kobject_put_~kobj.base) 0))), 15454#(and (<= 12 |ldv_kref_put_#in~kref.offset|) (= 0 (select (select |#memory_$Pointer$.base| |ldv_kref_put_#in~kref.base|) 0))), 15455#(and (<= 12 ldv_kref_put_~kref.offset) (= 0 (select (select |#memory_$Pointer$.base| ldv_kref_put_~kref.base) 0))), 15456#(and (<= 12 |ldv_kref_sub_#in~kref.offset|) (= 0 (select (select |#memory_$Pointer$.base| |ldv_kref_sub_#in~kref.base|) 0))), 15457#(and (= 0 (select (select |#memory_$Pointer$.base| ldv_kref_sub_~kref.base) 0)) (<= 12 ldv_kref_sub_~kref.offset)), 15458#(= 0 (select (select |#memory_$Pointer$.base| ldv_kref_sub_~kref.base) 0)), 15459#(= 0 (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~kref.base|) 0)), 15460#(= 0 (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#~kref.base|) 0)), 15461#(= 0 (select (select |#memory_$Pointer$.base| |ldv_kobject_release_#in~kref.base|) 0)), 15462#(= 0 (select (select |#memory_$Pointer$.base| ldv_kobject_release_~kobj~0.base) 0)), 15463#(= 0 (select (select |#memory_$Pointer$.base| |ldv_kobject_cleanup_#in~kobj.base|) 0)), 15464#(or (not (= 0 ldv_kobject_cleanup_~kobj.offset)) (= 0 (select (select |#memory_$Pointer$.base| ldv_kobject_cleanup_~kobj.base) ldv_kobject_cleanup_~kobj.offset))), 15465#(or (= 0 |ldv_kobject_cleanup_#t~mem15.base|) (not (= 0 ldv_kobject_cleanup_~kobj.offset))), 15466#(or (not (= 0 ldv_kobject_cleanup_~kobj.offset)) (= ldv_kobject_cleanup_~name~0.base 0)), 15467#(= ldv_kobject_cleanup_~name~0.base 0)] [2018-02-04 03:24:22,364 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 129 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 03:24:22,364 INFO L409 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-02-04 03:24:22,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-02-04 03:24:22,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=5313, Unknown=0, NotChecked=0, Total=5700 [2018-02-04 03:24:22,366 INFO L87 Difference]: Start difference. First operand 167 states and 169 transitions. Second operand 76 states. [2018-02-04 03:24:23,391 WARN L146 SmtUtils]: Spent 225ms on a formula simplification. DAG size of input: 90 DAG size of output 89 [2018-02-04 03:24:25,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:25,871 INFO L93 Difference]: Finished difference Result 166 states and 168 transitions. [2018-02-04 03:24:25,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-02-04 03:24:25,871 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 147 [2018-02-04 03:24:25,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:25,872 INFO L225 Difference]: With dead ends: 166 [2018-02-04 03:24:25,872 INFO L226 Difference]: Without dead ends: 166 [2018-02-04 03:24:25,874 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1593 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=878, Invalid=9628, Unknown=0, NotChecked=0, Total=10506 [2018-02-04 03:24:25,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-02-04 03:24:25,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-02-04 03:24:25,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-02-04 03:24:25,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 168 transitions. [2018-02-04 03:24:25,876 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 168 transitions. Word has length 147 [2018-02-04 03:24:25,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:25,877 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 168 transitions. [2018-02-04 03:24:25,877 INFO L433 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-02-04 03:24:25,877 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 168 transitions. [2018-02-04 03:24:25,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-02-04 03:24:25,877 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:25,878 INFO L351 BasicCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:24:25,878 INFO L371 AbstractCegarLoop]: === Iteration 44 === [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-04 03:24:25,878 INFO L82 PathProgramCache]: Analyzing trace with hash 560354601, now seen corresponding path program 1 times [2018-02-04 03:24:25,879 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:25,919 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:28,185 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 19 proven. 15 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-02-04 03:24:28,185 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:24:28,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-02-04 03:24:28,185 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:28,185 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-04 03:24:28,186 INFO L182 omatonBuilderFactory]: Interpolants [15872#(or (= 1 (select (select |#memory_int| |ldv_kobject_init_#in~kobj.base|) (- (- 12)))) (not (= |ldv_kobject_init_#in~kobj.offset| 0))), 15873#(and (= 0 ldv_kobject_create_~kobj~1.offset) (= 1 (select (select |#memory_int| ldv_kobject_create_~kobj~1.base) 12))), 15874#(and (= 1 (select (select |#memory_int| |ldv_kobject_create_#res.base|) 12)) (= 0 |ldv_kobject_create_#res.offset|)), 15875#(and (= 0 |entry_point_#t~ret20.offset|) (= 1 (select (select |#memory_int| |entry_point_#t~ret20.base|) 12))), 15876#(and (= 0 entry_point_~kobj~2.offset) (= 1 (select (select |#memory_int| entry_point_~kobj~2.base) 12))), 15877#(and (= |f_22_get_#in~kobj.base| f_22_get_~kobj.base) (= |#memory_int| |old(#memory_int)|) (= f_22_get_~kobj.offset |f_22_get_#in~kobj.offset|)), 15878#(and (or (= ldv_kobject_get_~kobj.offset |ldv_kobject_get_#in~kobj.offset|) (= ldv_kobject_get_~kobj.offset 0)) (= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|) (= |#memory_int| |old(#memory_int)|)), 15879#(and (= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|) (= |#memory_int| |old(#memory_int)|) (or (not (= 0 |ldv_kobject_get_#in~kobj.offset|)) (= ldv_kobject_get_~kobj.offset 0))), 15880#(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)), 15881#(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)))), 15882#(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 (or (and (= (select (select |#memory_int| ldv_atomic_add_return_~v.base) ldv_atomic_add_return_~v.offset) |ldv_atomic_add_return_#t~mem7|) (= |#memory_int| |old(#memory_int)|)) (= |ldv_atomic_add_return_#t~mem7| 1)) (= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|)) (not (= ldv_atomic_add_return_~i 1)))), 15883#(and (or (not (= |ldv_atomic_add_return_#in~i| 1)) (and (<= 2 ldv_atomic_add_return_~temp~0) (<= ldv_atomic_add_return_~temp~0 2) (= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|)) (and (= |#memory_int| |old(#memory_int)|) (= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|) (not (= (select (select |#memory_int| ldv_atomic_add_return_~v.base) ldv_atomic_add_return_~v.offset) 1)))) (<= |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|)), 15884#(or (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|)))) (<= ldv_atomic_add_return_~temp~0 2)) (not (= |ldv_atomic_add_return_#in~i| 1)) (not (= (select (select |old(#memory_int)| |ldv_atomic_add_return_#in~v.base|) (- (- |ldv_atomic_add_return_#in~v.offset|))) 1))), 15885#(or (not (= |ldv_atomic_add_return_#in~i| 1)) (not (= (select (select |old(#memory_int)| |ldv_atomic_add_return_#in~v.base|) (- (- |ldv_atomic_add_return_#in~v.offset|))) 1)) (and (<= (select (select |#memory_int| |ldv_atomic_add_return_#in~v.base|) (- (- |ldv_atomic_add_return_#in~v.offset|))) 2) (<= 2 (select (select |#memory_int| |ldv_atomic_add_return_#in~v.base|) (- (- |ldv_atomic_add_return_#in~v.offset|)))))), 15886#(or (not (= (select (select |old(#memory_int)| |ldv_kref_get_#in~kref.base|) (- (- |ldv_kref_get_#in~kref.offset|))) 1)) (and (<= (select (select |#memory_int| |ldv_kref_get_#in~kref.base|) (- (- |ldv_kref_get_#in~kref.offset|))) 2) (<= 2 (select (select |#memory_int| |ldv_kref_get_#in~kref.base|) (- (- |ldv_kref_get_#in~kref.offset|)))))), 15887#(and (or (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)) (and (<= 2 (select (select |#memory_int| |ldv_kobject_get_#in~kobj.base|) (- (+ (- ldv_kobject_get_~kobj.offset) (- 12))))) (<= (select (select |#memory_int| |ldv_kobject_get_#in~kobj.base|) (- (+ (- ldv_kobject_get_~kobj.offset) (- 12)))) 2))) (or (not (= 0 |ldv_kobject_get_#in~kobj.offset|)) (= ldv_kobject_get_~kobj.offset 0))), 15888#(or (not (= 0 |ldv_kobject_get_#in~kobj.offset|)) (not (= (select (select |old(#memory_int)| |ldv_kobject_get_#in~kobj.base|) (- (- 12))) 1)) (and (<= 2 (select (select |#memory_int| |ldv_kobject_get_#in~kobj.base|) (- (- 12)))) (<= (select (select |#memory_int| |ldv_kobject_get_#in~kobj.base|) (- (- 12))) 2))), 15889#(or (not (= 0 |f_22_get_#in~kobj.offset|)) (and (<= 2 (select (select |#memory_int| |f_22_get_#in~kobj.base|) (- (- 12)))) (<= (select (select |#memory_int| |f_22_get_#in~kobj.base|) (- (- 12))) 2)) (not (= (select (select |old(#memory_int)| |f_22_get_#in~kobj.base|) (- (- 12))) 1))), 15890#(and (<= (select (select |#memory_int| entry_point_~kobj~2.base) 12) 2) (<= 2 (select (select |#memory_int| entry_point_~kobj~2.base) 12)) (= 0 entry_point_~kobj~2.offset)), 15891#(and (= |f_22_put_#in~kobj.offset| f_22_put_~kobj.offset) (= |#memory_int| |old(#memory_int)|) (= |f_22_put_#in~kobj.base| f_22_put_~kobj.base)), 15892#(and (= |ldv_kobject_put_#in~kobj.base| ldv_kobject_put_~kobj.base) (= |#memory_int| |old(#memory_int)|) (or (= ldv_kobject_put_~kobj.offset 0) (= ldv_kobject_put_~kobj.offset |ldv_kobject_put_#in~kobj.offset|))), 15893#(and (or (= ldv_kobject_put_~kobj.offset 0) (not (= |ldv_kobject_put_#in~kobj.offset| 0))) (= |ldv_kobject_put_#in~kobj.base| ldv_kobject_put_~kobj.base) (= |#memory_int| |old(#memory_int)|)), 15894#(and (<= |ldv_kref_put_#in~kref.offset| ldv_kref_put_~kref.offset) (= ldv_kref_put_~kref.base |ldv_kref_put_#in~kref.base|) (= |#memory_int| |old(#memory_int)|) (<= ldv_kref_put_~kref.offset |ldv_kref_put_#in~kref.offset|)), 15895#(and (or (and (<= |ldv_kref_sub_#in~kref.offset| ldv_kref_sub_~kref.offset) (= ldv_kref_sub_~kref.base |ldv_kref_sub_#in~kref.base|) (<= ldv_kref_sub_~kref.offset |ldv_kref_sub_#in~kref.offset|) (= |#memory_int| |old(#memory_int)|)) (not (= ldv_kref_sub_~count 1))) (or (= |ldv_kref_sub_#in~count| ldv_kref_sub_~count) (= ldv_kref_sub_~count 1))), 15896#(and (or (and (= |#memory_int| |old(#memory_int)|) (= ldv_atomic_sub_return_~v.base |ldv_atomic_sub_return_#in~v.base|)) (not (= ldv_atomic_sub_return_~i 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) (or (= ldv_atomic_sub_return_~i 1) (= ldv_atomic_sub_return_~i |ldv_atomic_sub_return_#in~i|))), 15897#(and (or (not (= ldv_atomic_sub_return_~i 1)) (and (= (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|))) (<= 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) (or (= ldv_atomic_sub_return_~i 1) (= ldv_atomic_sub_return_~i |ldv_atomic_sub_return_#in~i|))), 15898#(and (<= 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) (or (not (= 1 |ldv_atomic_sub_return_#in~i|)) (and (<= (+ ldv_atomic_sub_return_~temp~1 1) (select (select |#memory_int| ldv_atomic_sub_return_~v.base) ldv_atomic_sub_return_~v.offset)) (= |#memory_int| |old(#memory_int)|) (= ldv_atomic_sub_return_~v.base |ldv_atomic_sub_return_#in~v.base|) (<= (select (select |#memory_int| ldv_atomic_sub_return_~v.base) ldv_atomic_sub_return_~v.offset) (+ ldv_atomic_sub_return_~temp~1 1))))), 15899#(or (not (= 1 |ldv_atomic_sub_return_#in~i|)) (and (= ldv_atomic_sub_return_~temp~1 (select (select |#memory_int| |ldv_atomic_sub_return_#in~v.base|) (- (- |ldv_atomic_sub_return_#in~v.offset|)))) (<= (+ ldv_atomic_sub_return_~temp~1 1) (select (select |old(#memory_int)| |ldv_atomic_sub_return_#in~v.base|) (- (- |ldv_atomic_sub_return_#in~v.offset|)))) (<= (select (select |old(#memory_int)| |ldv_atomic_sub_return_#in~v.base|) (- (- |ldv_atomic_sub_return_#in~v.offset|))) (+ ldv_atomic_sub_return_~temp~1 1)))), 15900#(or (not (= 1 |ldv_atomic_sub_return_#in~i|)) (and (<= (+ (select (select |#memory_int| |ldv_atomic_sub_return_#in~v.base|) (- (- |ldv_atomic_sub_return_#in~v.offset|))) 1) (select (select |old(#memory_int)| |ldv_atomic_sub_return_#in~v.base|) (- (- |ldv_atomic_sub_return_#in~v.offset|)))) (<= (select (select |old(#memory_int)| |ldv_atomic_sub_return_#in~v.base|) (- (- |ldv_atomic_sub_return_#in~v.offset|))) (+ (select (select |#memory_int| |ldv_atomic_sub_return_#in~v.base|) (- (- |ldv_atomic_sub_return_#in~v.offset|))) 1)))), 15901#(or (and (<= (select (select |old(#memory_int)| |ldv_kref_sub_#in~kref.base|) (- (- |ldv_kref_sub_#in~kref.offset|))) (+ (select (select |#memory_int| |ldv_kref_sub_#in~kref.base|) (- (- |ldv_kref_sub_#in~kref.offset|))) 1)) (<= (+ (select (select |#memory_int| |ldv_kref_sub_#in~kref.base|) (- (- |ldv_kref_sub_#in~kref.offset|))) 1) (select (select |old(#memory_int)| |ldv_kref_sub_#in~kref.base|) (- (- |ldv_kref_sub_#in~kref.offset|))))) (not (= |ldv_kref_sub_#in~count| 1))), 15902#(and (<= (select (select |old(#memory_int)| |ldv_kref_put_#in~kref.base|) (- (- |ldv_kref_put_#in~kref.offset|))) (+ (select (select |#memory_int| |ldv_kref_put_#in~kref.base|) (- (- |ldv_kref_put_#in~kref.offset|))) 1)) (<= (+ (select (select |#memory_int| |ldv_kref_put_#in~kref.base|) (- (- |ldv_kref_put_#in~kref.offset|))) 1) (select (select |old(#memory_int)| |ldv_kref_put_#in~kref.base|) (- (- |ldv_kref_put_#in~kref.offset|))))), 15903#(or (not (= |ldv_kobject_put_#in~kobj.offset| 0)) (and (<= (select (select |old(#memory_int)| |ldv_kobject_put_#in~kobj.base|) (- (- 12))) (+ (select (select |#memory_int| |ldv_kobject_put_#in~kobj.base|) (- (- 12))) 1)) (<= (+ (select (select |#memory_int| |ldv_kobject_put_#in~kobj.base|) (- (- 12))) 1) (select (select |old(#memory_int)| |ldv_kobject_put_#in~kobj.base|) (- (- 12)))))), 15904#(or (not (= |f_22_put_#in~kobj.offset| 0)) (and (<= (select (select |old(#memory_int)| |f_22_put_#in~kobj.base|) (- (- 12))) (+ (select (select |#memory_int| |f_22_put_#in~kobj.base|) (- (- 12))) 1)) (<= (+ (select (select |#memory_int| |f_22_put_#in~kobj.base|) (- (- 12))) 1) (select (select |old(#memory_int)| |f_22_put_#in~kobj.base|) (- (- 12)))))), 15905#(and (or (not (= ldv_kobject_put_~kobj.offset 0)) (and (= |ldv_kobject_put_#in~kobj.base| ldv_kobject_put_~kobj.base) (= |#memory_int| |old(#memory_int)|))) (or (= ldv_kobject_put_~kobj.offset 0) (= ldv_kobject_put_~kobj.offset |ldv_kobject_put_#in~kobj.offset|))), 15906#(and (or (= ldv_kobject_put_~kobj.offset 0) (not (= |ldv_kobject_put_#in~kobj.offset| 0))) (or (not (= ldv_kobject_put_~kobj.offset 0)) (and (= |ldv_kobject_put_#in~kobj.base| ldv_kobject_put_~kobj.base) (= |#memory_int| |old(#memory_int)|)))), 15907#(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|)), 15908#(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|)), 15909#(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~i| ldv_atomic_sub_return_~temp~1) (select (select |#memory_int| ldv_atomic_sub_return_~v.base) ldv_atomic_sub_return_~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|)), 15910#(and (<= (+ |ldv_atomic_sub_return_#in~i| ldv_atomic_sub_return_~temp~1) (select (select |old(#memory_int)| |ldv_atomic_sub_return_#in~v.base|) (- (- |ldv_atomic_sub_return_#in~v.offset|)))) (<= (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))), 15911#(and (<= (+ |ldv_atomic_sub_return_#in~i| |ldv_atomic_sub_return_#res|) (select (select |old(#memory_int)| |ldv_atomic_sub_return_#in~v.base|) (- (- |ldv_atomic_sub_return_#in~v.offset|)))) (<= (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|))), 15912#(or (and (or (<= (+ |ldv_kref_sub_#t~ret11| 1) (select (select |old(#memory_int)| |ldv_kref_sub_#in~kref.base|) (- (- |ldv_kref_sub_#in~kref.offset|)))) (<= |ldv_kref_sub_#t~ret11| 0)) (or (<= (select (select |old(#memory_int)| |ldv_kref_sub_#in~kref.base|) (- (- |ldv_kref_sub_#in~kref.offset|))) (+ |ldv_kref_sub_#t~ret11| 1)) (< 0 (+ |ldv_kref_sub_#t~ret11| 1)))) (not (= |ldv_kref_sub_#in~count| 1))), 15913#(or (<= 2 (select (select |old(#memory_int)| |ldv_kref_sub_#in~kref.base|) (- (- |ldv_kref_sub_#in~kref.offset|)))) (<= (select (select |old(#memory_int)| |ldv_kref_sub_#in~kref.base|) (- (- |ldv_kref_sub_#in~kref.offset|))) 0) (not (= |ldv_kref_sub_#in~count| 1))), 15914#(or (<= 2 (select (select |old(#memory_int)| |ldv_kref_put_#in~kref.base|) (- (- |ldv_kref_put_#in~kref.offset|)))) (<= (select (select |old(#memory_int)| |ldv_kref_put_#in~kref.base|) (- (- |ldv_kref_put_#in~kref.offset|))) 0)), 15915#(or (<= 2 (select (select |old(#memory_int)| |ldv_kobject_put_#in~kobj.base|) (- (- 12)))) (<= (select (select |old(#memory_int)| |ldv_kobject_put_#in~kobj.base|) (- (- 12))) 0) (not (= |ldv_kobject_put_#in~kobj.offset| 0))), 15854#true, 15855#false, 15856#(= 0 |ldv_malloc_#t~malloc4.offset|), 15857#(= 0 |ldv_malloc_#res.offset|), 15858#(= 0 |ldv_kobject_create_#t~ret17.offset|), 15859#(= 0 ldv_kobject_create_~kobj~1.offset), 15860#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= |#Ultimate.C_memset_#t~loopctr21| |#Ultimate.C_memset_#amount|)), 15861#(and (= |ldv_kobject_init_#in~kobj.offset| ldv_kobject_init_~kobj.offset) (= ldv_kobject_init_~kobj.base |ldv_kobject_init_#in~kobj.base|)), 15862#(and (or (= ldv_kobject_init_internal_~kobj.offset |ldv_kobject_init_internal_#in~kobj.offset|) (= ldv_kobject_init_internal_~kobj.offset 0)) (= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|)), 15863#(and (or (= ldv_kobject_init_internal_~kobj.offset 0) (not (= |ldv_kobject_init_internal_#in~kobj.offset| 0))) (= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|)), 15864#(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|)), 15865#(= 1 (select (select |#memory_int| |ldv_kref_init_#in~kref.base|) (- (- |ldv_kref_init_#in~kref.offset|)))), 15866#(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)))), 15867#(= |#memory_int| |old(#memory_int)|), 15868#(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|)), 15869#(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|)), 15870#(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)))), 15871#(or (= 1 (select (select |#memory_int| |ldv_kobject_init_internal_#in~kobj.base|) (- (- 12)))) (not (= |ldv_kobject_init_internal_#in~kobj.offset| 0)))] [2018-02-04 03:24:28,186 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 19 proven. 15 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-02-04 03:24:28,186 INFO L409 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-02-04 03:24:28,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-02-04 03:24:28,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=3615, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 03:24:28,186 INFO L87 Difference]: Start difference. First operand 166 states and 168 transitions. Second operand 62 states. [2018-02-04 03:24:30,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:30,689 INFO L93 Difference]: Finished difference Result 174 states and 175 transitions. [2018-02-04 03:24:30,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-04 03:24:30,689 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 147 [2018-02-04 03:24:30,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:30,690 INFO L225 Difference]: With dead ends: 174 [2018-02-04 03:24:30,690 INFO L226 Difference]: Without dead ends: 166 [2018-02-04 03:24:30,691 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 16 SyntacticMatches, 9 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1119 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=285, Invalid=6687, Unknown=0, NotChecked=0, Total=6972 [2018-02-04 03:24:30,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-02-04 03:24:30,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-02-04 03:24:30,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-02-04 03:24:30,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 167 transitions. [2018-02-04 03:24:30,693 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 167 transitions. Word has length 147 [2018-02-04 03:24:30,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:30,693 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 167 transitions. [2018-02-04 03:24:30,694 INFO L433 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-02-04 03:24:30,694 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 167 transitions. [2018-02-04 03:24:30,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-02-04 03:24:30,694 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:30,695 INFO L351 BasicCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:24:30,695 INFO L371 AbstractCegarLoop]: === Iteration 45 === [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-04 03:24:30,695 INFO L82 PathProgramCache]: Analyzing trace with hash -776492123, now seen corresponding path program 1 times [2018-02-04 03:24:30,696 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:30,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:30,724 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:31,117 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-02-04 03:24:31,117 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:24:31,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 03:24:31,117 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:31,118 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-04 03:24:31,118 INFO L182 omatonBuilderFactory]: Interpolants [16320#(or (= 0 |ldv_kref_put_#in~kref.base|) (and (= |old(#valid)| (store |#valid| |ldv_kref_put_#in~kref.base| (select |old(#valid)| |ldv_kref_put_#in~kref.base|))) (= 0 (select |#valid| |ldv_kref_put_#in~kref.base|)))), 16321#(or (and (= (store |#valid| |ldv_kobject_put_#in~kobj.base| (select |old(#valid)| |ldv_kobject_put_#in~kobj.base|)) |old(#valid)|) (= 0 (select |#valid| |ldv_kobject_put_#in~kobj.base|))) (= 0 |ldv_kobject_put_#in~kobj.base|)), 16300#true, 16301#false, 16302#(= |#valid| |old(#valid)|), 16303#(and (= |old(#valid)| (store |#valid| |ldv_malloc_#t~malloc4.base| (select |old(#valid)| |ldv_malloc_#t~malloc4.base|))) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc4.base|)) (not (= |ldv_malloc_#t~malloc4.base| 0))), 16304#(and (= (store |#valid| |ldv_malloc_#res.base| (select |old(#valid)| |ldv_malloc_#res.base|)) |old(#valid)|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= |ldv_malloc_#res.base| 0))), 16305#(and (not (= |ldv_kobject_create_#t~ret17.base| 0)) (= 0 (select |old(#valid)| |ldv_kobject_create_#t~ret17.base|)) (= (store |#valid| |ldv_kobject_create_#t~ret17.base| (select |old(#valid)| |ldv_kobject_create_#t~ret17.base|)) |old(#valid)|)), 16306#(and (= (store |#valid| ldv_kobject_create_~kobj~1.base (select |old(#valid)| ldv_kobject_create_~kobj~1.base)) |old(#valid)|) (= 0 (select |old(#valid)| ldv_kobject_create_~kobj~1.base)) (not (= ldv_kobject_create_~kobj~1.base 0))), 16307#(and (= |old(#valid)| (store |#valid| |ldv_kobject_create_#res.base| (select |old(#valid)| |ldv_kobject_create_#res.base|))) (= 0 (select |old(#valid)| |ldv_kobject_create_#res.base|)) (not (= |ldv_kobject_create_#res.base| 0))), 16308#(and (= 0 (select |old(#valid)| |entry_point_#t~ret20.base|)) (= (store |#valid| |entry_point_#t~ret20.base| (select |old(#valid)| |entry_point_#t~ret20.base|)) |old(#valid)|) (not (= |entry_point_#t~ret20.base| 0))), 16309#(and (not (= entry_point_~kobj~2.base 0)) (= (store |#valid| entry_point_~kobj~2.base (select |old(#valid)| entry_point_~kobj~2.base)) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~kobj~2.base))), 16310#(and (= |#valid| |old(#valid)|) (= |ldv_kobject_put_#in~kobj.base| ldv_kobject_put_~kobj.base)), 16311#(and (= |#valid| |old(#valid)|) (= ldv_kref_put_~kref.base |ldv_kref_put_#in~kref.base|)), 16312#(and (= |#valid| |old(#valid)|) (= ldv_kref_sub_~kref.base |ldv_kref_sub_#in~kref.base|)), 16313#(and (= |#valid| |old(#valid)|) (= |##fun~$Pointer$~TO~VOID_#in~kref.base| |##fun~$Pointer$~TO~VOID_#~kref.base|)), 16314#(and (= |#valid| |old(#valid)|) (= |ldv_kobject_release_#in~kref.base| ldv_kobject_release_~kobj~0.base)), 16315#(and (= ldv_kobject_cleanup_~kobj.base |ldv_kobject_cleanup_#in~kobj.base|) (= |#valid| |old(#valid)|)), 16316#(or (= 0 |ldv_kobject_cleanup_#in~kobj.base|) (and (= 0 (select |#valid| |ldv_kobject_cleanup_#in~kobj.base|)) (= |old(#valid)| (store |#valid| |ldv_kobject_cleanup_#in~kobj.base| (select |old(#valid)| |ldv_kobject_cleanup_#in~kobj.base|))))), 16317#(or (= 0 |ldv_kobject_release_#in~kref.base|) (and (= (store |#valid| |ldv_kobject_release_#in~kref.base| (select |old(#valid)| |ldv_kobject_release_#in~kref.base|)) |old(#valid)|) (= 0 (select |#valid| |ldv_kobject_release_#in~kref.base|)))), 16318#(or (and (= 0 (select |#valid| |##fun~$Pointer$~TO~VOID_#in~kref.base|)) (= (store |#valid| |##fun~$Pointer$~TO~VOID_#in~kref.base| (select |old(#valid)| |##fun~$Pointer$~TO~VOID_#in~kref.base|)) |old(#valid)|)) (= 0 |##fun~$Pointer$~TO~VOID_#in~kref.base|)), 16319#(or (and (= (store |#valid| |ldv_kref_sub_#in~kref.base| (select |old(#valid)| |ldv_kref_sub_#in~kref.base|)) |old(#valid)|) (= 0 (select |#valid| |ldv_kref_sub_#in~kref.base|))) (= 0 |ldv_kref_sub_#in~kref.base|))] [2018-02-04 03:24:31,118 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-02-04 03:24:31,118 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 03:24:31,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 03:24:31,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2018-02-04 03:24:31,118 INFO L87 Difference]: Start difference. First operand 166 states and 167 transitions. Second operand 22 states. [2018-02-04 03:24:31,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:31,745 INFO L93 Difference]: Finished difference Result 184 states and 184 transitions. [2018-02-04 03:24:31,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 03:24:31,745 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 164 [2018-02-04 03:24:31,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:31,746 INFO L225 Difference]: With dead ends: 184 [2018-02-04 03:24:31,746 INFO L226 Difference]: Without dead ends: 166 [2018-02-04 03:24:31,746 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:24:31,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-02-04 03:24:31,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-02-04 03:24:31,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-02-04 03:24:31,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-02-04 03:24:31,748 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 164 [2018-02-04 03:24:31,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:31,748 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-02-04 03:24:31,748 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 03:24:31,748 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-02-04 03:24:31,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-02-04 03:24:31,749 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:31,749 INFO L351 BasicCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:24:31,749 INFO L371 AbstractCegarLoop]: === Iteration 46 === [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-04 03:24:31,749 INFO L82 PathProgramCache]: Analyzing trace with hash 504328033, now seen corresponding path program 1 times [2018-02-04 03:24:31,749 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:31,777 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:35,356 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 16 proven. 130 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-04 03:24:35,356 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:24:35,356 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-02-04 03:24:35,356 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:35,356 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-04 03:24:35,357 INFO L182 omatonBuilderFactory]: Interpolants [16678#true, 16679#false, 16680#(= 0 |ldv_malloc_#t~malloc4.offset|), 16681#(= 0 |ldv_malloc_#res.offset|), 16682#(= 0 |ldv_kobject_create_#t~ret17.offset|), 16683#(= 0 ldv_kobject_create_~kobj~1.offset), 16684#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= 2 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 0)), 16685#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr21| |#Ultimate.C_memset_#ptr.offset|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= 3 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 1)), 16686#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= 4 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 2)), 16687#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 3) (<= 5 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 16688#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 4) (<= 6 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|))), 16689#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr21| |#Ultimate.C_memset_#ptr.offset|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= 7 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 5)), 16690#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr21| |#Ultimate.C_memset_#ptr.offset|) 0) 0)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 6) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= 8 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|))), 16691#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr21| |#Ultimate.C_memset_#ptr.offset|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= 9 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 7)), 16692#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr21| |#Ultimate.C_memset_#ptr.offset|) 0) 0)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 8) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= 10 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|))), 16693#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= 11 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 9)), 16694#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 10) (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= 12 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|))), 16695#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= 13 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 11)), 16696#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr21| |#Ultimate.C_memset_#ptr.offset|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= 14 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 12)), 16697#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 13) (<= 15 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|))), 16698#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= 16 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 14)), 16699#(or (<= 17 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 15) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (and (= 0 (select (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) 0)) (<= 16 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|)))), 16700#(or (<= 17 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) 15) (= 0 (select (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 16701#(and (= 0 ldv_kobject_create_~kobj~1.offset) (= 0 (select (select |#memory_$Pointer$.base| ldv_kobject_create_~kobj~1.base) 0))), 16702#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 16703#(and (= |ldv_kobject_init_#in~kobj.offset| ldv_kobject_init_~kobj.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |ldv_kobject_init_#in~kobj.base| ldv_kobject_init_~kobj.base)), 16704#(and (or (and (= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (not (= ldv_kobject_init_internal_~kobj.offset 0))) (or (= ldv_kobject_init_internal_~kobj.offset |ldv_kobject_init_internal_#in~kobj.offset|) (= ldv_kobject_init_internal_~kobj.offset 0))), 16705#(and (or (and (= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.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)))), 16706#(and (<= ldv_kref_init_~kref.offset |ldv_kref_init_#in~kref.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (<= |ldv_kref_init_#in~kref.offset| ldv_kref_init_~kref.offset) (= ldv_kref_init_~kref.base |ldv_kref_init_#in~kref.base|)), 16707#(and (or (= (select |old(#memory_$Pointer$.base)| |ldv_kref_init_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_init_#in~kref.base|)) (<= |ldv_kref_init_#in~kref.offset| (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_init_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_init_#in~kref.base|)))) (= (store (select |old(#memory_$Pointer$.base)| |ldv_kref_init_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_init_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_init_#in~kref.base|)) (select (select |#memory_$Pointer$.base| |ldv_kref_init_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_init_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_init_#in~kref.base|)))) (select |#memory_$Pointer$.base| |ldv_kref_init_#in~kref.base|))), 16708#(and (or (= ldv_kobject_init_internal_~kobj.offset 0) (not (= |ldv_kobject_init_internal_#in~kobj.offset| 0))) (or (and (or (= (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| ldv_kobject_init_internal_~kobj.base)) (<= (+ ldv_kobject_init_internal_~kobj.offset 12) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| ldv_kobject_init_internal_~kobj.base)))) (= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|) (= (select |#memory_$Pointer$.base| ldv_kobject_init_internal_~kobj.base) (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| ldv_kobject_init_internal_~kobj.base)) (select (select |#memory_$Pointer$.base| ldv_kobject_init_internal_~kobj.base) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| ldv_kobject_init_internal_~kobj.base)))))) (not (= ldv_kobject_init_internal_~kobj.offset 0)))), 16709#(and (= LDV_INIT_LIST_HEAD_~list.base |LDV_INIT_LIST_HEAD_#in~list.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (<= |LDV_INIT_LIST_HEAD_#in~list.offset| LDV_INIT_LIST_HEAD_~list.offset) (<= LDV_INIT_LIST_HEAD_~list.offset |LDV_INIT_LIST_HEAD_#in~list.offset|)), 16710#(and (= LDV_INIT_LIST_HEAD_~list.base |LDV_INIT_LIST_HEAD_#in~list.base|) (= (select |#memory_$Pointer$.base| LDV_INIT_LIST_HEAD_~list.base) (store (select |old(#memory_$Pointer$.base)| LDV_INIT_LIST_HEAD_~list.base) LDV_INIT_LIST_HEAD_~list.offset (select (select |#memory_$Pointer$.base| LDV_INIT_LIST_HEAD_~list.base) LDV_INIT_LIST_HEAD_~list.offset))) (<= |LDV_INIT_LIST_HEAD_#in~list.offset| LDV_INIT_LIST_HEAD_~list.offset) (<= LDV_INIT_LIST_HEAD_~list.offset |LDV_INIT_LIST_HEAD_#in~list.offset|)), 16711#(and (or (<= |LDV_INIT_LIST_HEAD_#in~list.offset| (@diff (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|))) (= (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|))) (= (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|) (store (store (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|)))) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|)))) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|))))) (or (<= |LDV_INIT_LIST_HEAD_#in~list.offset| (@diff (store (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|)))) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|))) (= (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|) (store (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|))))))), 16712#(or (and (or (= (store (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (<= 4 (@diff (store (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (= (store (store (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (@diff (store (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (store (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (or (<= 4 (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|))) (= (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|))) (or (= (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|))))) (<= 4 (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|))))) (not (= |ldv_kobject_init_internal_#in~kobj.offset| 0))), 16713#(or (and (or (= (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|))))) (<= 4 (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (or (<= 4 (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|))) (= (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|))) (= (store (store (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (@diff (store (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (store (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (or (<= 4 (@diff (store (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|))) (= (store (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (not (= |ldv_kobject_init_#in~kobj.offset| 0))), 16714#(and (= 0 (select (select |#memory_$Pointer$.base| |ldv_kobject_create_#res.base|) 0)) (= 0 |ldv_kobject_create_#res.offset|)), 16715#(and (= 0 (select (select |#memory_$Pointer$.base| |entry_point_#t~ret20.base|) 0)) (= 0 |entry_point_#t~ret20.offset|)), 16716#(and (= 0 entry_point_~kobj~2.offset) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~kobj~2.base) 0))), 16717#(and (= |f_22_get_#in~kobj.base| f_22_get_~kobj.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= f_22_get_~kobj.offset |f_22_get_#in~kobj.offset|)), 16718#(and (or (= ldv_kobject_get_~kobj.offset |ldv_kobject_get_#in~kobj.offset|) (= ldv_kobject_get_~kobj.offset 0)) (= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 16719#(and (= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (or (not (= 0 |ldv_kobject_get_#in~kobj.offset|)) (= ldv_kobject_get_~kobj.offset 0))), 16720#(and (= ldv_kref_get_~kref.base |ldv_kref_get_#in~kref.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (<= |ldv_kref_get_#in~kref.offset| ldv_kref_get_~kref.offset)), 16721#(and (<= |ldv_atomic_add_return_#in~v.offset| ldv_atomic_add_return_~v.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|)), 16722#(and (or (<= |ldv_atomic_add_return_#in~v.offset| (@diff (select |old(#memory_$Pointer$.base)| |ldv_atomic_add_return_#in~v.base|) (select |#memory_$Pointer$.base| |ldv_atomic_add_return_#in~v.base|))) (= (select |old(#memory_$Pointer$.base)| |ldv_atomic_add_return_#in~v.base|) (select |#memory_$Pointer$.base| |ldv_atomic_add_return_#in~v.base|))) (= (store (select |old(#memory_$Pointer$.base)| |ldv_atomic_add_return_#in~v.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_atomic_add_return_#in~v.base|) (select |#memory_$Pointer$.base| |ldv_atomic_add_return_#in~v.base|)) (select (select |#memory_$Pointer$.base| |ldv_atomic_add_return_#in~v.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_atomic_add_return_#in~v.base|) (select |#memory_$Pointer$.base| |ldv_atomic_add_return_#in~v.base|)))) (select |#memory_$Pointer$.base| |ldv_atomic_add_return_#in~v.base|))), 16723#(and (or (= (select |#memory_$Pointer$.base| |ldv_kref_get_#in~kref.base|) (select |old(#memory_$Pointer$.base)| |ldv_kref_get_#in~kref.base|)) (<= |ldv_kref_get_#in~kref.offset| (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_get_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_get_#in~kref.base|)))) (= (select |#memory_$Pointer$.base| |ldv_kref_get_#in~kref.base|) (store (select |old(#memory_$Pointer$.base)| |ldv_kref_get_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_get_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_get_#in~kref.base|)) (select (select |#memory_$Pointer$.base| |ldv_kref_get_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_get_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_get_#in~kref.base|)))))), 16724#(and (or (= (select |old(#memory_$Pointer$.base)| |ldv_kobject_get_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|)) (and (or (<= (+ ldv_kobject_get_~kobj.offset 12) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_get_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|))) (not (= ldv_kobject_get_~kobj.offset 0))) (or (not (= 0 |ldv_kobject_get_#in~kobj.offset|)) (= ldv_kobject_get_~kobj.offset 0)))) (= (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_get_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_get_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_get_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|))), 16725#(and (or (not (= 0 |ldv_kobject_get_#in~kobj.offset|)) (= (select |old(#memory_$Pointer$.base)| |ldv_kobject_get_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|)) (<= 12 (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_get_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|)))) (= (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_get_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_get_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_get_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|))), 16726#(and (= (select |#memory_$Pointer$.base| |f_22_get_#in~kobj.base|) (store (select |old(#memory_$Pointer$.base)| |f_22_get_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |f_22_get_#in~kobj.base|) (select |#memory_$Pointer$.base| |f_22_get_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |f_22_get_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |f_22_get_#in~kobj.base|) (select |#memory_$Pointer$.base| |f_22_get_#in~kobj.base|))))) (or (<= 12 (@diff (select |old(#memory_$Pointer$.base)| |f_22_get_#in~kobj.base|) (select |#memory_$Pointer$.base| |f_22_get_#in~kobj.base|))) (not (= 0 |f_22_get_#in~kobj.offset|)) (= (select |old(#memory_$Pointer$.base)| |f_22_get_#in~kobj.base|) (select |#memory_$Pointer$.base| |f_22_get_#in~kobj.base|)))), 16727#(and (= |f_22_put_#in~kobj.offset| f_22_put_~kobj.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |f_22_put_#in~kobj.base| f_22_put_~kobj.base)), 16728#(and (= |ldv_kobject_put_#in~kobj.base| ldv_kobject_put_~kobj.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (or (= ldv_kobject_put_~kobj.offset 0) (= ldv_kobject_put_~kobj.offset |ldv_kobject_put_#in~kobj.offset|))), 16729#(and (or (= ldv_kobject_put_~kobj.offset 0) (not (= |ldv_kobject_put_#in~kobj.offset| 0))) (= |ldv_kobject_put_#in~kobj.base| ldv_kobject_put_~kobj.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 16730#(and (<= |ldv_kref_put_#in~kref.offset| ldv_kref_put_~kref.offset) (= ldv_kref_put_~kref.base |ldv_kref_put_#in~kref.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 16731#(and (<= |ldv_kref_sub_#in~kref.offset| ldv_kref_sub_~kref.offset) (= ldv_kref_sub_~kref.base |ldv_kref_sub_#in~kref.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 16732#(and (<= |ldv_atomic_sub_return_#in~v.offset| ldv_atomic_sub_return_~v.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ldv_atomic_sub_return_~v.base |ldv_atomic_sub_return_#in~v.base|)), 16733#(and (or (<= |ldv_atomic_sub_return_#in~v.offset| (@diff (select |old(#memory_$Pointer$.base)| |ldv_atomic_sub_return_#in~v.base|) (select |#memory_$Pointer$.base| |ldv_atomic_sub_return_#in~v.base|))) (= (select |old(#memory_$Pointer$.base)| |ldv_atomic_sub_return_#in~v.base|) (select |#memory_$Pointer$.base| |ldv_atomic_sub_return_#in~v.base|))) (= (select |#memory_$Pointer$.base| |ldv_atomic_sub_return_#in~v.base|) (store (select |old(#memory_$Pointer$.base)| |ldv_atomic_sub_return_#in~v.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_atomic_sub_return_#in~v.base|) (select |#memory_$Pointer$.base| |ldv_atomic_sub_return_#in~v.base|)) (select (select |#memory_$Pointer$.base| |ldv_atomic_sub_return_#in~v.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_atomic_sub_return_#in~v.base|) (select |#memory_$Pointer$.base| |ldv_atomic_sub_return_#in~v.base|)))))), 16734#(and (= (select |#memory_$Pointer$.base| |ldv_kref_sub_#in~kref.base|) (store (select |old(#memory_$Pointer$.base)| |ldv_kref_sub_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_sub_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_sub_#in~kref.base|)) (select (select |#memory_$Pointer$.base| |ldv_kref_sub_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_sub_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_sub_#in~kref.base|))))) (or (= (select |#memory_$Pointer$.base| |ldv_kref_sub_#in~kref.base|) (select |old(#memory_$Pointer$.base)| |ldv_kref_sub_#in~kref.base|)) (<= |ldv_kref_sub_#in~kref.offset| (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_sub_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_sub_#in~kref.base|))))), 16735#(and (= (select |#memory_$Pointer$.base| |ldv_kref_put_#in~kref.base|) (store (select |old(#memory_$Pointer$.base)| |ldv_kref_put_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_put_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_put_#in~kref.base|)) (select (select |#memory_$Pointer$.base| |ldv_kref_put_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_put_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_put_#in~kref.base|))))) (or (<= |ldv_kref_put_#in~kref.offset| (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_put_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_put_#in~kref.base|))) (= (select |old(#memory_$Pointer$.base)| |ldv_kref_put_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_put_#in~kref.base|)))), 16736#(and (= (select |#memory_$Pointer$.base| |ldv_kobject_put_#in~kobj.base|) (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_put_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_put_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_put_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_put_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_put_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_put_#in~kobj.base|))))) (or (not (= |ldv_kobject_put_#in~kobj.offset| 0)) (= (select |old(#memory_$Pointer$.base)| |ldv_kobject_put_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_put_#in~kobj.base|)) (<= 12 (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_put_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_put_#in~kobj.base|))))), 16737#(and (or (not (= |f_22_put_#in~kobj.offset| 0)) (= (select |old(#memory_$Pointer$.base)| |f_22_put_#in~kobj.base|) (select |#memory_$Pointer$.base| |f_22_put_#in~kobj.base|)) (<= 12 (@diff (select |old(#memory_$Pointer$.base)| |f_22_put_#in~kobj.base|) (select |#memory_$Pointer$.base| |f_22_put_#in~kobj.base|)))) (= (store (select |old(#memory_$Pointer$.base)| |f_22_put_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |f_22_put_#in~kobj.base|) (select |#memory_$Pointer$.base| |f_22_put_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |f_22_put_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |f_22_put_#in~kobj.base|) (select |#memory_$Pointer$.base| |f_22_put_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |f_22_put_#in~kobj.base|))), 16738#(and (or (<= |ldv_kref_sub_#in~kref.offset| (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_sub_#in~kref.base|) (select |#memory_$Pointer$.base| ldv_kref_sub_~kref.base))) (= (select |#memory_$Pointer$.base| ldv_kref_sub_~kref.base) (select |old(#memory_$Pointer$.base)| |ldv_kref_sub_#in~kref.base|))) (= (store (select |old(#memory_$Pointer$.base)| |ldv_kref_sub_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_sub_#in~kref.base|) (select |#memory_$Pointer$.base| ldv_kref_sub_~kref.base)) (select (select |#memory_$Pointer$.base| ldv_kref_sub_~kref.base) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_sub_#in~kref.base|) (select |#memory_$Pointer$.base| ldv_kref_sub_~kref.base)))) (select |#memory_$Pointer$.base| ldv_kref_sub_~kref.base))), 16739#(= |##fun~$Pointer$~TO~VOID_#in~kref.base| |##fun~$Pointer$~TO~VOID_#~kref.base|), 16740#(= |ldv_kobject_release_#in~kref.base| ldv_kobject_release_~kobj~0.base), 16741#(or (= ldv_kobject_cleanup_~kobj.base |ldv_kobject_cleanup_#in~kobj.base|) (not (= 0 ldv_kobject_cleanup_~kobj.offset))), 16742#(or (not (= 0 ldv_kobject_cleanup_~kobj.offset)) (and (= ldv_kobject_cleanup_~kobj.base |ldv_kobject_cleanup_#in~kobj.base|) (= (select (select |#memory_$Pointer$.base| ldv_kobject_cleanup_~kobj.base) ldv_kobject_cleanup_~kobj.offset) |ldv_kobject_cleanup_#t~mem15.base|))), 16743#(or (and (= ldv_kobject_cleanup_~name~0.base (select (select |#memory_$Pointer$.base| ldv_kobject_cleanup_~kobj.base) ldv_kobject_cleanup_~kobj.offset)) (= ldv_kobject_cleanup_~kobj.base |ldv_kobject_cleanup_#in~kobj.base|)) (not (= 0 ldv_kobject_cleanup_~kobj.offset))), 16744#(= ldv_kobject_cleanup_~name~0.base (select (select |#memory_$Pointer$.base| |ldv_kobject_cleanup_#in~kobj.base|) 0)), 16745#(and (or (not (= 0 ldv_kobject_cleanup_~name~0.offset)) (not (= ldv_kobject_cleanup_~name~0.base 0))) (or (= (select (select |#memory_$Pointer$.base| |ldv_kobject_cleanup_#in~kobj.base|) 0) ldv_kobject_cleanup_~name~0.base) (= ldv_kobject_cleanup_~name~0.base 0))), 16746#(not (= (select (select |#memory_$Pointer$.base| |ldv_kobject_cleanup_#in~kobj.base|) 0) 0)), 16747#(not (= (select (select |#memory_$Pointer$.base| |ldv_kobject_release_#in~kref.base|) 0) 0)), 16748#(not (= (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~kref.base|) 0) 0)), 16749#(or (not (= (select (select |old(#memory_$Pointer$.base)| |ldv_kref_sub_#in~kref.base|) 0) 0)) (<= |ldv_kref_sub_#in~kref.offset| 0)), 16750#(or (<= |ldv_kref_put_#in~kref.offset| 0) (not (= (select (select |old(#memory_$Pointer$.base)| |ldv_kref_put_#in~kref.base|) 0) 0))), 16751#(or (not (= (select (select |old(#memory_$Pointer$.base)| |ldv_kobject_put_#in~kobj.base|) 0) 0)) (not (= |ldv_kobject_put_#in~kobj.offset| 0)))] [2018-02-04 03:24:35,357 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 16 proven. 130 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-04 03:24:35,357 INFO L409 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-02-04 03:24:35,357 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-02-04 03:24:35,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=384, Invalid=5018, Unknown=0, NotChecked=0, Total=5402 [2018-02-04 03:24:35,358 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 74 states. [2018-02-04 03:24:36,294 WARN L146 SmtUtils]: Spent 212ms on a formula simplification. DAG size of input: 90 DAG size of output 89 [2018-02-04 03:24:38,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:38,690 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-02-04 03:24:38,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-02-04 03:24:38,690 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 165 [2018-02-04 03:24:38,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:38,690 INFO L225 Difference]: With dead ends: 162 [2018-02-04 03:24:38,690 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 03:24:38,691 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1533 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=780, Invalid=8532, Unknown=0, NotChecked=0, Total=9312 [2018-02-04 03:24:38,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 03:24:38,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 03:24:38,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 03:24:38,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 03:24:38,691 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 165 [2018-02-04 03:24:38,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:38,692 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 03:24:38,692 INFO L433 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-02-04 03:24:38,692 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 03:24:38,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 03:24:38,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 03:24:38 BoogieIcfgContainer [2018-02-04 03:24:38,695 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 03:24:38,696 INFO L168 Benchmark]: Toolchain (without parser) took 45766.71 ms. Allocated memory was 403.2 MB in the beginning and 1.8 GB in the end (delta: 1.4 GB). Free memory was 357.2 MB in the beginning and 416.1 MB in the end (delta: -58.9 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. [2018-02-04 03:24:38,697 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 403.2 MB. Free memory is still 363.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 03:24:38,697 INFO L168 Benchmark]: CACSL2BoogieTranslator took 177.77 ms. Allocated memory is still 403.2 MB. Free memory was 357.2 MB in the beginning and 342.7 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. [2018-02-04 03:24:38,697 INFO L168 Benchmark]: Boogie Preprocessor took 31.33 ms. Allocated memory is still 403.2 MB. Free memory was 342.7 MB in the beginning and 341.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 03:24:38,697 INFO L168 Benchmark]: RCFGBuilder took 346.96 ms. Allocated memory is still 403.2 MB. Free memory was 341.4 MB in the beginning and 302.7 MB in the end (delta: 38.6 MB). Peak memory consumption was 38.6 MB. Max. memory is 5.3 GB. [2018-02-04 03:24:38,697 INFO L168 Benchmark]: TraceAbstraction took 45207.51 ms. Allocated memory was 403.2 MB in the beginning and 1.8 GB in the end (delta: 1.4 GB). Free memory was 302.7 MB in the beginning and 416.1 MB in the end (delta: -113.3 MB). Peak memory consumption was 1.3 GB. Max. memory is 5.3 GB. [2018-02-04 03:24:38,699 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.13 ms. Allocated memory is still 403.2 MB. Free memory is still 363.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 177.77 ms. Allocated memory is still 403.2 MB. Free memory was 357.2 MB in the beginning and 342.7 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.33 ms. Allocated memory is still 403.2 MB. Free memory was 342.7 MB in the beginning and 341.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 346.96 ms. Allocated memory is still 403.2 MB. Free memory was 341.4 MB in the beginning and 302.7 MB in the end (delta: 38.6 MB). Peak memory consumption was 38.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 45207.51 ms. Allocated memory was 403.2 MB in the beginning and 1.8 GB in the end (delta: 1.4 GB). Free memory was 302.7 MB in the beginning and 416.1 MB in the end (delta: -113.3 MB). Peak memory consumption was 1.3 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1452]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 23 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 23 procedures, 151 locations, 23 error locations. SAFE Result, 45.1s OverallTime, 46 OverallIterations, 16 TraceHistogramMax, 22.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6107 SDtfs, 1716 SDslu, 60254 SDs, 0 SdLazy, 35530 SolverSat, 1105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1292 GetRequests, 211 SyntacticMatches, 24 SemanticMatches, 1057 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7542 ImplicationChecksByTransitivity, 21.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 2704/3811 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 46 MinimizatonAttempts, 56 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 21.0s InterpolantComputationTime, 3271 NumberOfCodeBlocks, 3271 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 3225 ConstructedInterpolants, 0 QuantifiedInterpolants, 3455824 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 46 InterpolantComputations, 24 PerfectInterpolantSequences, 2704/3811 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_03-24-38-705.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_03-24-38-705.csv Received shutdown request...