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_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 03:05:53,300 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 03:05:53,301 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 03:05:53,312 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 03:05:53,313 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 03:05:53,313 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 03:05:53,314 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 03:05:53,316 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 03:05:53,317 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 03:05:53,318 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 03:05:53,318 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 03:05:53,319 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 03:05:53,319 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 03:05:53,320 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 03:05:53,321 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 03:05:53,323 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 03:05:53,324 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 03:05:53,325 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 03:05:53,326 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 03:05:53,327 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 03:05:53,329 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 03:05:53,329 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 03:05:53,329 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 03:05:53,330 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 03:05:53,331 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 03:05:53,332 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 03:05:53,332 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 03:05:53,332 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 03:05:53,333 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 03:05:53,333 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 03:05:53,333 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 03:05:53,333 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:05:53,342 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 03:05:53,342 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 03:05:53,343 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 03:05:53,343 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 03:05:53,343 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 03:05:53,343 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 03:05:53,343 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 03:05:53,343 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 03:05:53,343 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 03:05:53,343 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 03:05:53,343 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 03:05:53,344 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 03:05:53,344 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 03:05:53,344 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 03:05:53,344 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 03:05:53,344 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 03:05:53,344 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 03:05:53,344 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 03:05:53,344 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 03:05:53,344 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 03:05:53,344 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 03:05:53,345 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 03:05:53,345 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 03:05:53,370 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 03:05:53,377 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 03:05:53,379 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 03:05:53,380 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 03:05:53,381 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 03:05:53,381 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_false-valid-deref.i [2018-02-04 03:05:53,525 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 03:05:53,526 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 03:05:53,527 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 03:05:53,527 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 03:05:53,530 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 03:05:53,531 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:05:53" (1/1) ... [2018-02-04 03:05:53,533 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@581e1694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:05:53, skipping insertion in model container [2018-02-04 03:05:53,533 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:05:53" (1/1) ... [2018-02-04 03:05:53,543 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 03:05:53,578 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 03:05:53,680 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 03:05:53,696 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 03:05:53,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:05:53 WrapperNode [2018-02-04 03:05:53,704 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 03:05:53,704 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 03:05:53,705 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 03:05:53,705 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 03:05:53,717 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:05:53" (1/1) ... [2018-02-04 03:05:53,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:05:53" (1/1) ... [2018-02-04 03:05:53,726 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:05:53" (1/1) ... [2018-02-04 03:05:53,726 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:05:53" (1/1) ... [2018-02-04 03:05:53,730 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:05:53" (1/1) ... [2018-02-04 03:05:53,733 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:05:53" (1/1) ... [2018-02-04 03:05:53,734 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:05:53" (1/1) ... [2018-02-04 03:05:53,735 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 03:05:53,736 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 03:05:53,736 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 03:05:53,736 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 03:05:53,737 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:05: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:05:53,772 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 03:05:53,773 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 03:05:53,773 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-02-04 03:05:53,773 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 03:05:53,773 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-02-04 03:05:53,773 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-02-04 03:05:53,773 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-02-04 03:05:53,773 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-02-04 03:05:53,773 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-02-04 03:05:53,773 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-02-04 03:05:53,773 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-02-04 03:05:53,773 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-02-04 03:05:53,773 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-02-04 03:05:53,774 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-02-04 03:05:53,774 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-02-04 03:05:53,774 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 03:05:53,774 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 03:05:53,774 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 03:05:53,774 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 03:05:53,774 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 03:05:53,774 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 03:05:53,774 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 03:05:53,774 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 03:05:53,774 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 03:05:53,774 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-04 03:05:53,774 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-04 03:05:53,774 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 03:05:53,775 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 03:05:53,775 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 03:05:53,775 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-04 03:05:53,775 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 03:05:53,775 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-02-04 03:05:53,775 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-02-04 03:05:53,775 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-02-04 03:05:53,775 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-02-04 03:05:53,775 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-02-04 03:05:53,775 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-02-04 03:05:53,775 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-02-04 03:05:53,775 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-02-04 03:05:53,775 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-02-04 03:05:53,776 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-02-04 03:05:53,776 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-02-04 03:05:53,776 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-02-04 03:05:53,776 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 03:05:53,776 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 03:05:53,776 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 03:05:53,776 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 03:05:53,960 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-04 03:05:54,047 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 03:05:54,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:05:54 BoogieIcfgContainer [2018-02-04 03:05:54,047 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 03:05:54,047 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 03:05:54,047 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 03:05:54,049 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 03:05:54,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 03:05:53" (1/3) ... [2018-02-04 03:05:54,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5629d92c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:05:54, skipping insertion in model container [2018-02-04 03:05:54,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:05:53" (2/3) ... [2018-02-04 03:05:54,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5629d92c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:05:54, skipping insertion in model container [2018-02-04 03:05:54,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:05:54" (3/3) ... [2018-02-04 03:05:54,051 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test22_3_false-valid-deref.i [2018-02-04 03:05:54,056 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 03:05:54,061 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-02-04 03:05:54,083 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 03:05:54,083 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 03:05:54,083 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 03:05:54,083 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 03:05:54,083 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 03:05:54,083 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 03:05:54,083 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 03:05:54,084 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 03:05:54,084 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 03:05:54,093 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states. [2018-02-04 03:05:54,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 03:05:54,101 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:54,101 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:05:54,101 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:05:54,104 INFO L82 PathProgramCache]: Analyzing trace with hash 556227080, now seen corresponding path program 1 times [2018-02-04 03:05:54,142 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:54,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:54,180 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:54,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:54,287 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:05:54,288 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:05:54,288 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:54,289 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:05:54,289 INFO L182 omatonBuilderFactory]: Interpolants [122#true, 123#false, 124#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 125#(and (= 0 |ldv_kobject_create_#t~ret14.base|) (= 0 |ldv_kobject_create_#t~ret14.offset|)), 126#(and (= ldv_kobject_create_~kobj~1.offset 0) (= ldv_kobject_create_~kobj~1.base 0))] [2018-02-04 03:05:54,289 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:05:54,354 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:05:54,363 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:05:54,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:05:54,365 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 5 states. [2018-02-04 03:05:54,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:54,403 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2018-02-04 03:05:54,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:05:54,404 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 03:05:54,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:54,411 INFO L225 Difference]: With dead ends: 125 [2018-02-04 03:05:54,411 INFO L226 Difference]: Without dead ends: 122 [2018-02-04 03:05:54,412 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:05:54,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-04 03:05:54,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2018-02-04 03:05:54,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-04 03:05:54,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-02-04 03:05:54,446 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 17 [2018-02-04 03:05:54,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:54,446 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-02-04 03:05:54,447 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:05:54,447 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-02-04 03:05:54,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 03:05:54,447 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:54,447 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:05:54,448 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:05:54,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1895274134, now seen corresponding path program 1 times [2018-02-04 03:05:54,449 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:54,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:54,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:05:54,513 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:05:54,513 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:05:54,513 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:05:54,513 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:54,514 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:05:54,514 INFO L182 omatonBuilderFactory]: Interpolants [372#true, 373#false, 374#(= 1 (select |#valid| |ldv_malloc_#t~malloc4.base|)), 375#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 376#(= 1 (select |#valid| |ldv_kobject_create_#t~ret14.base|)), 377#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base))] [2018-02-04 03:05:54,514 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:05:54,515 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:05:54,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:05:54,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:05:54,516 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 6 states. [2018-02-04 03:05:54,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:54,637 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2018-02-04 03:05:54,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:05:54,638 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 03:05:54,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:54,639 INFO L225 Difference]: With dead ends: 121 [2018-02-04 03:05:54,639 INFO L226 Difference]: Without dead ends: 121 [2018-02-04 03:05:54,640 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:05:54,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-04 03:05:54,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-02-04 03:05:54,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-04 03:05:54,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2018-02-04 03:05:54,648 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 19 [2018-02-04 03:05:54,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:54,649 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2018-02-04 03:05:54,649 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:05:54,649 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2018-02-04 03:05:54,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 03:05:54,649 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:54,650 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:05:54,650 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:05:54,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1895274133, now seen corresponding path program 1 times [2018-02-04 03:05:54,651 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:54,667 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:54,828 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:05:54,828 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:05:54,828 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 03:05:54,828 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:54,829 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:05:54,829 INFO L182 omatonBuilderFactory]: Interpolants [624#(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|))), 625#(and (<= 16 (select |#length| |ldv_kobject_create_#t~ret14.base|)) (= 0 |ldv_kobject_create_#t~ret14.offset|)), 626#(and (= ldv_kobject_create_~kobj~1.offset 0) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 620#true, 621#false, 622#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0))), 623#(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:05:54,829 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:05:54,829 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 03:05:54,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 03:05:54,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:05:54,830 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 7 states. [2018-02-04 03:05:54,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:54,968 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2018-02-04 03:05:54,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:05:54,968 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-02-04 03:05:54,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:54,969 INFO L225 Difference]: With dead ends: 120 [2018-02-04 03:05:54,969 INFO L226 Difference]: Without dead ends: 120 [2018-02-04 03:05:54,969 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:05:54,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-04 03:05:54,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-02-04 03:05:54,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-04 03:05:54,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2018-02-04 03:05:54,974 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 19 [2018-02-04 03:05:54,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:54,975 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2018-02-04 03:05:54,975 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 03:05:54,975 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2018-02-04 03:05:54,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 03:05:54,976 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:54,976 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:05:54,976 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:05:54,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1715794329, now seen corresponding path program 1 times [2018-02-04 03:05:54,978 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:54,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:54,997 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:55,065 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:05:55,066 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:05:55,066 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 03:05:55,066 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:55,066 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:05:55,066 INFO L182 omatonBuilderFactory]: Interpolants [869#true, 870#false, 871#(and (= 0 |ldv_kobject_create_#res.base|) (= 0 |ldv_kobject_create_#res.offset|)), 872#(and (= 0 |entry_point_#t~ret16.base|) (= 0 |entry_point_#t~ret16.offset|)), 873#(and (= 0 entry_point_~kobj~2.base) (= 0 entry_point_~kobj~2.offset)), 874#(and (= 0 |ldv_kobject_put_#in~kobj.offset|) (= 0 |ldv_kobject_put_#in~kobj.base|)), 875#(and (= ldv_kobject_put_~kobj.offset 0) (= 0 ldv_kobject_put_~kobj.base))] [2018-02-04 03:05:55,067 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:05:55,067 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 03:05:55,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 03:05:55,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:05:55,067 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand 7 states. [2018-02-04 03:05:55,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:55,117 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2018-02-04 03:05:55,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 03:05:55,118 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-02-04 03:05:55,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:55,119 INFO L225 Difference]: With dead ends: 131 [2018-02-04 03:05:55,119 INFO L226 Difference]: Without dead ends: 131 [2018-02-04 03:05:55,119 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:05:55,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-04 03:05:55,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2018-02-04 03:05:55,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-04 03:05:55,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 136 transitions. [2018-02-04 03:05:55,128 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 136 transitions. Word has length 29 [2018-02-04 03:05:55,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:55,129 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 136 transitions. [2018-02-04 03:05:55,129 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 03:05:55,129 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 136 transitions. [2018-02-04 03:05:55,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 03:05:55,130 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:55,130 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:05:55,130 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:05:55,130 INFO L82 PathProgramCache]: Analyzing trace with hash -785661208, now seen corresponding path program 1 times [2018-02-04 03:05:55,131 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:55,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:55,144 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:55,219 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:05:55,219 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:05:55,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 03:05:55,219 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:55,220 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:05:55,220 INFO L182 omatonBuilderFactory]: Interpolants [1136#true, 1137#false, 1138#(= 1 (select |#valid| |#Ultimate.C_memset_#ptr.base|)), 1139#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base)), 1140#(= 1 (select |#valid| |ldv_kobject_init_#in~kobj.base|)), 1141#(= 1 (select |#valid| ldv_kobject_init_~kobj.base)), 1142#(= 1 (select |#valid| |ldv_kobject_init_internal_#in~kobj.base|)), 1143#(= 1 (select |#valid| ldv_kobject_init_internal_~kobj.base)), 1144#(= 1 (select |#valid| |ldv_kref_init_#in~kref.base|)), 1145#(= 1 (select |#valid| ldv_kref_init_~kref.base))] [2018-02-04 03:05:55,220 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:05:55,220 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 03:05:55,221 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 03:05:55,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:05:55,221 INFO L87 Difference]: Start difference. First operand 127 states and 136 transitions. Second operand 10 states. [2018-02-04 03:05:55,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:55,429 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2018-02-04 03:05:55,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:05:55,429 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-02-04 03:05:55,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:55,430 INFO L225 Difference]: With dead ends: 126 [2018-02-04 03:05:55,430 INFO L226 Difference]: Without dead ends: 126 [2018-02-04 03:05:55,430 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:05:55,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-04 03:05:55,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-02-04 03:05:55,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-04 03:05:55,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2018-02-04 03:05:55,435 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 34 [2018-02-04 03:05:55,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:55,435 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2018-02-04 03:05:55,436 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 03:05:55,436 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2018-02-04 03:05:55,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 03:05:55,436 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:55,437 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:05:55,437 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:05:55,437 INFO L82 PathProgramCache]: Analyzing trace with hash -785661207, now seen corresponding path program 1 times [2018-02-04 03:05:55,437 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:55,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:55,450 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:55,469 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:05:55,470 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:05:55,470 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 03:05:55,470 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:55,470 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:05:55,470 INFO L182 omatonBuilderFactory]: Interpolants [1404#true, 1405#false, 1406#(= |#Ultimate.C_memset_#t~loopctr17| 0), 1407#(<= |#Ultimate.C_memset_#amount| 0)] [2018-02-04 03:05:55,470 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:05:55,471 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 03:05:55,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 03:05:55,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 03:05:55,471 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand 4 states. [2018-02-04 03:05:55,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:55,480 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2018-02-04 03:05:55,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 03:05:55,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-02-04 03:05:55,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:55,482 INFO L225 Difference]: With dead ends: 129 [2018-02-04 03:05:55,482 INFO L226 Difference]: Without dead ends: 127 [2018-02-04 03:05:55,482 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:05:55,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-04 03:05:55,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-02-04 03:05:55,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-04 03:05:55,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 136 transitions. [2018-02-04 03:05:55,488 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 136 transitions. Word has length 34 [2018-02-04 03:05:55,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:55,488 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 136 transitions. [2018-02-04 03:05:55,488 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 03:05:55,488 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 136 transitions. [2018-02-04 03:05:55,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 03:05:55,489 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:55,489 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] [2018-02-04 03:05:55,489 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:05:55,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1322241719, now seen corresponding path program 1 times [2018-02-04 03:05:55,490 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:55,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:55,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:05:55,538 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:05:55,538 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:05:55,538 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 03:05:55,538 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:55,539 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:05:55,539 INFO L182 omatonBuilderFactory]: Interpolants [1666#true, 1667#false, 1668#(= |#valid| |old(#valid)|)] [2018-02-04 03:05:55,539 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:05:55,539 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 03:05:55,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 03:05:55,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 03:05:55,539 INFO L87 Difference]: Start difference. First operand 127 states and 136 transitions. Second operand 3 states. [2018-02-04 03:05:55,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:55,611 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2018-02-04 03:05:55,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 03:05:55,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-02-04 03:05:55,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:55,612 INFO L225 Difference]: With dead ends: 143 [2018-02-04 03:05:55,612 INFO L226 Difference]: Without dead ends: 131 [2018-02-04 03:05:55,612 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 03:05:55,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-04 03:05:55,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2018-02-04 03:05:55,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-04 03:05:55,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2018-02-04 03:05:55,618 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 32 [2018-02-04 03:05:55,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:55,618 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2018-02-04 03:05:55,618 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 03:05:55,618 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2018-02-04 03:05:55,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 03:05:55,619 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:55,619 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:05:55,619 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:05:55,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1082750419, now seen corresponding path program 1 times [2018-02-04 03:05:55,620 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:55,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:55,630 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:55,658 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:05:55,659 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:55,659 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-04 03:05:55,659 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:55,659 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:05:55,659 INFO L182 omatonBuilderFactory]: Interpolants [1936#false, 1937#(= |#Ultimate.C_memset_#t~loopctr17| 0), 1938#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 1939#(<= |#Ultimate.C_memset_#amount| 1), 1935#true] [2018-02-04 03:05:55,660 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:05:55,660 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:05:55,660 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:05:55,660 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:05:55,660 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand 5 states. [2018-02-04 03:05:55,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:55,678 INFO L93 Difference]: Finished difference Result 126 states and 134 transitions. [2018-02-04 03:05:55,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:05:55,679 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-02-04 03:05:55,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:55,680 INFO L225 Difference]: With dead ends: 126 [2018-02-04 03:05:55,680 INFO L226 Difference]: Without dead ends: 124 [2018-02-04 03:05:55,680 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:05:55,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-04 03:05:55,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-02-04 03:05:55,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-04 03:05:55,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2018-02-04 03:05:55,685 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 35 [2018-02-04 03:05:55,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:55,685 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2018-02-04 03:05:55,685 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:05:55,685 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2018-02-04 03:05:55,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 03:05:55,686 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:55,686 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] [2018-02-04 03:05:55,686 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:05:55,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1962528345, now seen corresponding path program 1 times [2018-02-04 03:05:55,687 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:55,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:55,693 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:55,719 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:05:55,719 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:05:55,719 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 03:05:55,719 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:55,720 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:05:55,720 INFO L182 omatonBuilderFactory]: Interpolants [2192#true, 2193#false, 2194#(not (= |ldv_malloc_#t~malloc4.base| 0)), 2195#(not (= |ldv_malloc_#res.base| 0)), 2196#(not (= |ldv_kobject_create_#t~ret14.base| 0)), 2197#(not (= ldv_kobject_create_~kobj~1.base 0))] [2018-02-04 03:05:55,720 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:05:55,720 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:05:55,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:05:55,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:05:55,721 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand 6 states. [2018-02-04 03:05:55,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:55,739 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2018-02-04 03:05:55,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:05:55,743 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-02-04 03:05:55,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:55,744 INFO L225 Difference]: With dead ends: 115 [2018-02-04 03:05:55,744 INFO L226 Difference]: Without dead ends: 115 [2018-02-04 03:05:55,744 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:05:55,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-04 03:05:55,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-02-04 03:05:55,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-04 03:05:55,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2018-02-04 03:05:55,748 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 34 [2018-02-04 03:05:55,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:55,748 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2018-02-04 03:05:55,748 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:05:55,748 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2018-02-04 03:05:55,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 03:05:55,749 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:55,749 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:05:55,749 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:05:55,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1126031319, now seen corresponding path program 2 times [2018-02-04 03:05:55,750 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:55,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:55,761 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:55,788 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:05:55,788 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:55,788 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 03:05:55,788 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:55,789 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:05:55,789 INFO L182 omatonBuilderFactory]: Interpolants [2432#(= |#Ultimate.C_memset_#t~loopctr17| 0), 2433#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 2434#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 2435#(<= |#Ultimate.C_memset_#amount| 2), 2430#true, 2431#false] [2018-02-04 03:05:55,789 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:05:55,789 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:05:55,790 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:05:55,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:05:55,790 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand 6 states. [2018-02-04 03:05:55,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:55,808 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2018-02-04 03:05:55,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:05:55,815 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-02-04 03:05:55,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:55,816 INFO L225 Difference]: With dead ends: 118 [2018-02-04 03:05:55,816 INFO L226 Difference]: Without dead ends: 116 [2018-02-04 03:05:55,816 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:05:55,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-04 03:05:55,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-02-04 03:05:55,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-04 03:05:55,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 122 transitions. [2018-02-04 03:05:55,819 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 122 transitions. Word has length 36 [2018-02-04 03:05:55,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:55,820 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 122 transitions. [2018-02-04 03:05:55,820 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:05:55,820 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2018-02-04 03:05:55,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 03:05:55,821 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:55,821 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:05:55,821 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:05:55,821 INFO L82 PathProgramCache]: Analyzing trace with hash -878788461, now seen corresponding path program 3 times [2018-02-04 03:05:55,822 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:55,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05: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:05:55,868 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:05:55,868 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:55,868 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 03:05:55,868 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:55,869 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:05:55,869 INFO L182 omatonBuilderFactory]: Interpolants [2672#true, 2673#false, 2674#(= |#Ultimate.C_memset_#t~loopctr17| 0), 2675#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 2676#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 2677#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 2678#(<= |#Ultimate.C_memset_#amount| 3)] [2018-02-04 03:05:55,869 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:05:55,869 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 03:05:55,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 03:05:55,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:05:55,870 INFO L87 Difference]: Start difference. First operand 116 states and 122 transitions. Second operand 7 states. [2018-02-04 03:05:55,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:55,891 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2018-02-04 03:05:55,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:05:55,892 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-02-04 03:05:55,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:55,893 INFO L225 Difference]: With dead ends: 119 [2018-02-04 03:05:55,893 INFO L226 Difference]: Without dead ends: 117 [2018-02-04 03:05:55,893 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:05:55,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-04 03:05:55,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-02-04 03:05:55,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-04 03:05:55,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 123 transitions. [2018-02-04 03:05:55,897 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 123 transitions. Word has length 37 [2018-02-04 03:05:55,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:55,897 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 123 transitions. [2018-02-04 03:05:55,897 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 03:05:55,897 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2018-02-04 03:05:55,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 03:05:55,898 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:55,898 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:05:55,898 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:05:55,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1804194455, now seen corresponding path program 4 times [2018-02-04 03:05:55,899 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:55,910 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:55,949 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:05:55,949 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:55,950 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 03:05:55,950 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:55,950 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:05:55,950 INFO L182 omatonBuilderFactory]: Interpolants [2917#true, 2918#false, 2919#(= |#Ultimate.C_memset_#t~loopctr17| 0), 2920#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 2921#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 2922#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 2923#(<= |#Ultimate.C_memset_#t~loopctr17| 4), 2924#(<= |#Ultimate.C_memset_#amount| 4)] [2018-02-04 03:05:55,950 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:05:55,951 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:05:55,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:05:55,951 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:05:55,951 INFO L87 Difference]: Start difference. First operand 117 states and 123 transitions. Second operand 8 states. [2018-02-04 03:05:55,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:55,974 INFO L93 Difference]: Finished difference Result 120 states and 126 transitions. [2018-02-04 03:05:55,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 03:05:55,974 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-02-04 03:05:55,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:55,975 INFO L225 Difference]: With dead ends: 120 [2018-02-04 03:05:55,975 INFO L226 Difference]: Without dead ends: 118 [2018-02-04 03:05:55,975 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:05:55,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-02-04 03:05:55,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-02-04 03:05:55,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-04 03:05:55,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 124 transitions. [2018-02-04 03:05:55,978 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 124 transitions. Word has length 38 [2018-02-04 03:05:55,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:55,979 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 124 transitions. [2018-02-04 03:05:55,979 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:05:55,979 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2018-02-04 03:05:55,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 03:05:55,980 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:55,980 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:05:55,980 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:05:55,980 INFO L82 PathProgramCache]: Analyzing trace with hash -427009197, now seen corresponding path program 5 times [2018-02-04 03:05:55,981 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:55,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:55,992 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:56,037 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:05:56,037 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:56,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 03:05:56,037 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:56,038 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:05:56,038 INFO L182 omatonBuilderFactory]: Interpolants [3168#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 3169#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 3170#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 3171#(<= |#Ultimate.C_memset_#t~loopctr17| 4), 3172#(<= |#Ultimate.C_memset_#t~loopctr17| 5), 3173#(<= |#Ultimate.C_memset_#amount| 5), 3165#true, 3166#false, 3167#(= |#Ultimate.C_memset_#t~loopctr17| 0)] [2018-02-04 03:05:56,038 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:05:56,038 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 03:05:56,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 03:05:56,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:05:56,039 INFO L87 Difference]: Start difference. First operand 118 states and 124 transitions. Second operand 9 states. [2018-02-04 03:05:56,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:56,062 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2018-02-04 03:05:56,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 03:05:56,063 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-02-04 03:05:56,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:56,064 INFO L225 Difference]: With dead ends: 121 [2018-02-04 03:05:56,064 INFO L226 Difference]: Without dead ends: 119 [2018-02-04 03:05:56,064 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:05:56,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-04 03:05:56,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-02-04 03:05:56,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-04 03:05:56,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 125 transitions. [2018-02-04 03:05:56,067 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 125 transitions. Word has length 39 [2018-02-04 03:05:56,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:56,068 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 125 transitions. [2018-02-04 03:05:56,068 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 03:05:56,068 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2018-02-04 03:05:56,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 03:05:56,068 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:56,068 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:05:56,069 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:05:56,069 INFO L82 PathProgramCache]: Analyzing trace with hash -683939159, now seen corresponding path program 6 times [2018-02-04 03:05:56,070 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:56,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:56,081 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:56,130 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:05:56,130 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:56,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 03:05:56,131 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:56,131 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:05:56,131 INFO L182 omatonBuilderFactory]: Interpolants [3424#(<= |#Ultimate.C_memset_#t~loopctr17| 6), 3425#(<= |#Ultimate.C_memset_#amount| 6), 3416#true, 3417#false, 3418#(= |#Ultimate.C_memset_#t~loopctr17| 0), 3419#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 3420#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 3421#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 3422#(<= |#Ultimate.C_memset_#t~loopctr17| 4), 3423#(<= |#Ultimate.C_memset_#t~loopctr17| 5)] [2018-02-04 03:05:56,131 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:05:56,132 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 03:05:56,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 03:05:56,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:05:56,132 INFO L87 Difference]: Start difference. First operand 119 states and 125 transitions. Second operand 10 states. [2018-02-04 03:05:56,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:56,159 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2018-02-04 03:05:56,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:05:56,160 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2018-02-04 03:05:56,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:56,161 INFO L225 Difference]: With dead ends: 122 [2018-02-04 03:05:56,161 INFO L226 Difference]: Without dead ends: 120 [2018-02-04 03:05:56,161 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:05:56,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-04 03:05:56,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-02-04 03:05:56,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-04 03:05:56,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 126 transitions. [2018-02-04 03:05:56,181 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 126 transitions. Word has length 40 [2018-02-04 03:05:56,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:56,181 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 126 transitions. [2018-02-04 03:05:56,182 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 03:05:56,182 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 126 transitions. [2018-02-04 03:05:56,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 03:05:56,182 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:56,182 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:05:56,182 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:05:56,183 INFO L82 PathProgramCache]: Analyzing trace with hash -58833389, now seen corresponding path program 7 times [2018-02-04 03:05:56,184 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:56,196 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:56,261 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:05:56,261 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:56,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 03:05:56,261 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:56,262 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:05:56,262 INFO L182 omatonBuilderFactory]: Interpolants [3680#(<= |#Ultimate.C_memset_#amount| 7), 3670#true, 3671#false, 3672#(= |#Ultimate.C_memset_#t~loopctr17| 0), 3673#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 3674#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 3675#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 3676#(<= |#Ultimate.C_memset_#t~loopctr17| 4), 3677#(<= |#Ultimate.C_memset_#t~loopctr17| 5), 3678#(<= |#Ultimate.C_memset_#t~loopctr17| 6), 3679#(<= |#Ultimate.C_memset_#t~loopctr17| 7)] [2018-02-04 03:05:56,262 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:05:56,262 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 03:05:56,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 03:05:56,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:05:56,263 INFO L87 Difference]: Start difference. First operand 120 states and 126 transitions. Second operand 11 states. [2018-02-04 03:05:56,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:56,287 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2018-02-04 03:05:56,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 03:05:56,288 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-02-04 03:05:56,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:56,289 INFO L225 Difference]: With dead ends: 123 [2018-02-04 03:05:56,289 INFO L226 Difference]: Without dead ends: 121 [2018-02-04 03:05:56,290 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:05:56,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-04 03:05:56,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-02-04 03:05:56,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-04 03:05:56,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 127 transitions. [2018-02-04 03:05:56,294 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 127 transitions. Word has length 41 [2018-02-04 03:05:56,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:56,294 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 127 transitions. [2018-02-04 03:05:56,294 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 03:05:56,294 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 127 transitions. [2018-02-04 03:05:56,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 03:05:56,295 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:56,295 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:05:56,295 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:05:56,295 INFO L82 PathProgramCache]: Analyzing trace with hash 2139576297, now seen corresponding path program 8 times [2018-02-04 03:05:56,296 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:56,310 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:56,372 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:05:56,373 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:56,373 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 03:05:56,373 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:56,375 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:05:56,375 INFO L182 omatonBuilderFactory]: Interpolants [3936#(<= |#Ultimate.C_memset_#t~loopctr17| 7), 3937#(<= |#Ultimate.C_memset_#t~loopctr17| 8), 3938#(<= |#Ultimate.C_memset_#amount| 8), 3927#true, 3928#false, 3929#(= |#Ultimate.C_memset_#t~loopctr17| 0), 3930#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 3931#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 3932#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 3933#(<= |#Ultimate.C_memset_#t~loopctr17| 4), 3934#(<= |#Ultimate.C_memset_#t~loopctr17| 5), 3935#(<= |#Ultimate.C_memset_#t~loopctr17| 6)] [2018-02-04 03:05:56,375 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:05:56,375 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 03:05:56,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 03:05:56,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-02-04 03:05:56,375 INFO L87 Difference]: Start difference. First operand 121 states and 127 transitions. Second operand 12 states. [2018-02-04 03:05:56,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:56,401 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions. [2018-02-04 03:05:56,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 03:05:56,401 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-02-04 03:05:56,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:56,402 INFO L225 Difference]: With dead ends: 124 [2018-02-04 03:05:56,402 INFO L226 Difference]: Without dead ends: 122 [2018-02-04 03:05:56,402 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:05:56,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-04 03:05:56,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-02-04 03:05:56,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-04 03:05:56,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 128 transitions. [2018-02-04 03:05:56,406 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 128 transitions. Word has length 42 [2018-02-04 03:05:56,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:56,406 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 128 transitions. [2018-02-04 03:05:56,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 03:05:56,406 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 128 transitions. [2018-02-04 03:05:56,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 03:05:56,407 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:56,407 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:05:56,407 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:05:56,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1570799827, now seen corresponding path program 9 times [2018-02-04 03:05:56,408 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:56,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:56,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:05:56,495 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:05:56,496 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:56,496 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 03:05:56,496 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:56,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:56,496 INFO L182 omatonBuilderFactory]: Interpolants [4192#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 4193#(<= |#Ultimate.C_memset_#t~loopctr17| 4), 4194#(<= |#Ultimate.C_memset_#t~loopctr17| 5), 4195#(<= |#Ultimate.C_memset_#t~loopctr17| 6), 4196#(<= |#Ultimate.C_memset_#t~loopctr17| 7), 4197#(<= |#Ultimate.C_memset_#t~loopctr17| 8), 4198#(<= |#Ultimate.C_memset_#t~loopctr17| 9), 4199#(<= |#Ultimate.C_memset_#amount| 9), 4187#true, 4188#false, 4189#(= |#Ultimate.C_memset_#t~loopctr17| 0), 4190#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 4191#(<= |#Ultimate.C_memset_#t~loopctr17| 2)] [2018-02-04 03:05:56,496 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:05:56,496 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 03:05:56,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 03:05:56,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:05:56,497 INFO L87 Difference]: Start difference. First operand 122 states and 128 transitions. Second operand 13 states. [2018-02-04 03:05:56,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:56,522 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2018-02-04 03:05:56,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 03:05:56,526 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-02-04 03:05:56,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:56,527 INFO L225 Difference]: With dead ends: 125 [2018-02-04 03:05:56,527 INFO L226 Difference]: Without dead ends: 123 [2018-02-04 03:05:56,527 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:05:56,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-04 03:05:56,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-02-04 03:05:56,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-04 03:05:56,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 129 transitions. [2018-02-04 03:05:56,534 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 129 transitions. Word has length 43 [2018-02-04 03:05:56,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:56,534 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 129 transitions. [2018-02-04 03:05:56,534 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 03:05:56,534 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 129 transitions. [2018-02-04 03:05:56,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 03:05:56,535 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:56,535 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:05:56,535 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:05:56,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1118598441, now seen corresponding path program 10 times [2018-02-04 03:05:56,536 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:56,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:56,556 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:56,632 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:05:56,633 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:56,633 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 03:05:56,633 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:56,633 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:05:56,633 INFO L182 omatonBuilderFactory]: Interpolants [4450#true, 4451#false, 4452#(= |#Ultimate.C_memset_#t~loopctr17| 0), 4453#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 4454#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 4455#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 4456#(<= |#Ultimate.C_memset_#t~loopctr17| 4), 4457#(<= |#Ultimate.C_memset_#t~loopctr17| 5), 4458#(<= |#Ultimate.C_memset_#t~loopctr17| 6), 4459#(<= |#Ultimate.C_memset_#t~loopctr17| 7), 4460#(<= |#Ultimate.C_memset_#t~loopctr17| 8), 4461#(<= |#Ultimate.C_memset_#t~loopctr17| 9), 4462#(<= |#Ultimate.C_memset_#t~loopctr17| 10), 4463#(<= |#Ultimate.C_memset_#amount| 10)] [2018-02-04 03:05:56,633 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:05:56,633 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 03:05:56,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 03:05:56,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:05:56,634 INFO L87 Difference]: Start difference. First operand 123 states and 129 transitions. Second operand 14 states. [2018-02-04 03:05:56,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:56,683 INFO L93 Difference]: Finished difference Result 126 states and 132 transitions. [2018-02-04 03:05:56,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 03:05:56,683 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-02-04 03:05:56,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:56,684 INFO L225 Difference]: With dead ends: 126 [2018-02-04 03:05:56,684 INFO L226 Difference]: Without dead ends: 124 [2018-02-04 03:05:56,684 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:05:56,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-04 03:05:56,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-02-04 03:05:56,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-04 03:05:56,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 130 transitions. [2018-02-04 03:05:56,686 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 130 transitions. Word has length 44 [2018-02-04 03:05:56,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:56,686 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 130 transitions. [2018-02-04 03:05:56,686 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 03:05:56,686 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2018-02-04 03:05:56,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 03:05:56,686 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:56,686 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:05:56,686 INFO L371 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:05:56,686 INFO L82 PathProgramCache]: Analyzing trace with hash -14742637, now seen corresponding path program 11 times [2018-02-04 03:05:56,687 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:56,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:56,694 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:56,787 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:05:56,787 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:56,787 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 03:05:56,787 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:56,787 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:05:56,787 INFO L182 omatonBuilderFactory]: Interpolants [4716#true, 4717#false, 4718#(= |#Ultimate.C_memset_#t~loopctr17| 0), 4719#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 4720#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 4721#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 4722#(<= |#Ultimate.C_memset_#t~loopctr17| 4), 4723#(<= |#Ultimate.C_memset_#t~loopctr17| 5), 4724#(<= |#Ultimate.C_memset_#t~loopctr17| 6), 4725#(<= |#Ultimate.C_memset_#t~loopctr17| 7), 4726#(<= |#Ultimate.C_memset_#t~loopctr17| 8), 4727#(<= |#Ultimate.C_memset_#t~loopctr17| 9), 4728#(<= |#Ultimate.C_memset_#t~loopctr17| 10), 4729#(<= |#Ultimate.C_memset_#t~loopctr17| 11), 4730#(<= |#Ultimate.C_memset_#amount| 11)] [2018-02-04 03:05:56,788 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:05:56,788 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 03:05:56,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 03:05:56,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-02-04 03:05:56,788 INFO L87 Difference]: Start difference. First operand 124 states and 130 transitions. Second operand 15 states. [2018-02-04 03:05:56,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:56,813 INFO L93 Difference]: Finished difference Result 127 states and 133 transitions. [2018-02-04 03:05:56,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 03:05:56,813 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2018-02-04 03:05:56,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:56,814 INFO L225 Difference]: With dead ends: 127 [2018-02-04 03:05:56,814 INFO L226 Difference]: Without dead ends: 125 [2018-02-04 03:05:56,814 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:05:56,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-04 03:05:56,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-02-04 03:05:56,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-04 03:05:56,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 131 transitions. [2018-02-04 03:05:56,816 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 131 transitions. Word has length 45 [2018-02-04 03:05:56,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:56,816 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 131 transitions. [2018-02-04 03:05:56,816 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 03:05:56,816 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 131 transitions. [2018-02-04 03:05:56,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 03:05:56,816 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:56,816 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:05:56,816 INFO L371 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:05:56,816 INFO L82 PathProgramCache]: Analyzing trace with hash -788577687, now seen corresponding path program 12 times [2018-02-04 03:05:56,817 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:56,825 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:56,912 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:05:56,913 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:56,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 03:05:56,913 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:56,913 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:05:56,913 INFO L182 omatonBuilderFactory]: Interpolants [4992#(<= |#Ultimate.C_memset_#t~loopctr17| 5), 4993#(<= |#Ultimate.C_memset_#t~loopctr17| 6), 4994#(<= |#Ultimate.C_memset_#t~loopctr17| 7), 4995#(<= |#Ultimate.C_memset_#t~loopctr17| 8), 4996#(<= |#Ultimate.C_memset_#t~loopctr17| 9), 4997#(<= |#Ultimate.C_memset_#t~loopctr17| 10), 4998#(<= |#Ultimate.C_memset_#t~loopctr17| 11), 4999#(<= |#Ultimate.C_memset_#t~loopctr17| 12), 5000#(<= |#Ultimate.C_memset_#amount| 12), 4985#true, 4986#false, 4987#(= |#Ultimate.C_memset_#t~loopctr17| 0), 4988#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 4989#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 4990#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 4991#(<= |#Ultimate.C_memset_#t~loopctr17| 4)] [2018-02-04 03:05:56,914 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:05:56,914 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 03:05:56,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 03:05:56,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2018-02-04 03:05:56,914 INFO L87 Difference]: Start difference. First operand 125 states and 131 transitions. Second operand 16 states. [2018-02-04 03:05:56,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:56,951 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2018-02-04 03:05:56,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 03:05:56,951 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2018-02-04 03:05:56,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:56,951 INFO L225 Difference]: With dead ends: 128 [2018-02-04 03:05:56,952 INFO L226 Difference]: Without dead ends: 126 [2018-02-04 03:05:56,952 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:05:56,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-04 03:05:56,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-02-04 03:05:56,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-04 03:05:56,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 132 transitions. [2018-02-04 03:05:56,955 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 132 transitions. Word has length 46 [2018-02-04 03:05:56,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:56,955 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 132 transitions. [2018-02-04 03:05:56,955 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 03:05:56,955 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 132 transitions. [2018-02-04 03:05:56,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 03:05:56,956 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:56,956 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:05:56,956 INFO L371 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:05:56,956 INFO L82 PathProgramCache]: Analyzing trace with hash 992339539, now seen corresponding path program 13 times [2018-02-04 03:05:56,957 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:56,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:56,969 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:57,076 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:05:57,076 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:57,076 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 03:05:57,076 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:57,076 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:05:57,076 INFO L182 omatonBuilderFactory]: Interpolants [5257#true, 5258#false, 5259#(= |#Ultimate.C_memset_#t~loopctr17| 0), 5260#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 5261#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 5262#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 5263#(<= |#Ultimate.C_memset_#t~loopctr17| 4), 5264#(<= |#Ultimate.C_memset_#t~loopctr17| 5), 5265#(<= |#Ultimate.C_memset_#t~loopctr17| 6), 5266#(<= |#Ultimate.C_memset_#t~loopctr17| 7), 5267#(<= |#Ultimate.C_memset_#t~loopctr17| 8), 5268#(<= |#Ultimate.C_memset_#t~loopctr17| 9), 5269#(<= |#Ultimate.C_memset_#t~loopctr17| 10), 5270#(<= |#Ultimate.C_memset_#t~loopctr17| 11), 5271#(<= |#Ultimate.C_memset_#t~loopctr17| 12), 5272#(<= |#Ultimate.C_memset_#t~loopctr17| 13), 5273#(<= |#Ultimate.C_memset_#amount| 13)] [2018-02-04 03:05:57,076 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:05:57,077 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 03:05:57,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 03:05:57,077 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-02-04 03:05:57,077 INFO L87 Difference]: Start difference. First operand 126 states and 132 transitions. Second operand 17 states. [2018-02-04 03:05:57,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:57,105 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2018-02-04 03:05:57,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 03:05:57,105 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2018-02-04 03:05:57,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:57,106 INFO L225 Difference]: With dead ends: 129 [2018-02-04 03:05:57,106 INFO L226 Difference]: Without dead ends: 127 [2018-02-04 03:05:57,106 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:05:57,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-04 03:05:57,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-02-04 03:05:57,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-04 03:05:57,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 133 transitions. [2018-02-04 03:05:57,109 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 133 transitions. Word has length 47 [2018-02-04 03:05:57,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:57,109 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 133 transitions. [2018-02-04 03:05:57,109 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 03:05:57,109 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 133 transitions. [2018-02-04 03:05:57,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 03:05:57,110 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:57,110 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:05:57,110 INFO L371 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:05:57,110 INFO L82 PathProgramCache]: Analyzing trace with hash 366198697, now seen corresponding path program 14 times [2018-02-04 03:05:57,111 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:57,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:57,120 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:57,235 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:05:57,235 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:57,235 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 03:05:57,235 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:57,236 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:05:57,236 INFO L182 omatonBuilderFactory]: Interpolants [5536#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 5537#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 5538#(<= |#Ultimate.C_memset_#t~loopctr17| 4), 5539#(<= |#Ultimate.C_memset_#t~loopctr17| 5), 5540#(<= |#Ultimate.C_memset_#t~loopctr17| 6), 5541#(<= |#Ultimate.C_memset_#t~loopctr17| 7), 5542#(<= |#Ultimate.C_memset_#t~loopctr17| 8), 5543#(<= |#Ultimate.C_memset_#t~loopctr17| 9), 5544#(<= |#Ultimate.C_memset_#t~loopctr17| 10), 5545#(<= |#Ultimate.C_memset_#t~loopctr17| 11), 5546#(<= |#Ultimate.C_memset_#t~loopctr17| 12), 5547#(<= |#Ultimate.C_memset_#t~loopctr17| 13), 5548#(<= |#Ultimate.C_memset_#t~loopctr17| 14), 5549#(<= |#Ultimate.C_memset_#amount| 14), 5532#true, 5533#false, 5534#(= |#Ultimate.C_memset_#t~loopctr17| 0), 5535#(<= |#Ultimate.C_memset_#t~loopctr17| 1)] [2018-02-04 03:05:57,236 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:05:57,236 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 03:05:57,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 03:05:57,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:05:57,237 INFO L87 Difference]: Start difference. First operand 127 states and 133 transitions. Second operand 18 states. [2018-02-04 03:05:57,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:57,267 INFO L93 Difference]: Finished difference Result 130 states and 136 transitions. [2018-02-04 03:05:57,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 03:05:57,268 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2018-02-04 03:05:57,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:57,269 INFO L225 Difference]: With dead ends: 130 [2018-02-04 03:05:57,269 INFO L226 Difference]: Without dead ends: 128 [2018-02-04 03:05:57,269 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:05:57,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-04 03:05:57,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-02-04 03:05:57,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-02-04 03:05:57,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 134 transitions. [2018-02-04 03:05:57,271 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 134 transitions. Word has length 48 [2018-02-04 03:05:57,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:57,271 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 134 transitions. [2018-02-04 03:05:57,271 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 03:05:57,271 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 134 transitions. [2018-02-04 03:05:57,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 03:05:57,272 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:57,272 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:05:57,272 INFO L371 AbstractCegarLoop]: === Iteration 23 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:05:57,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1864298221, now seen corresponding path program 15 times [2018-02-04 03:05:57,273 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:57,281 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:57,418 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:05:57,418 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:57,418 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 03:05:57,418 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:57,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:57,419 INFO L182 omatonBuilderFactory]: Interpolants [5824#(<= |#Ultimate.C_memset_#t~loopctr17| 12), 5825#(<= |#Ultimate.C_memset_#t~loopctr17| 13), 5826#(<= |#Ultimate.C_memset_#t~loopctr17| 14), 5827#(<= |#Ultimate.C_memset_#t~loopctr17| 15), 5828#(<= |#Ultimate.C_memset_#amount| 15), 5810#true, 5811#false, 5812#(= |#Ultimate.C_memset_#t~loopctr17| 0), 5813#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 5814#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 5815#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 5816#(<= |#Ultimate.C_memset_#t~loopctr17| 4), 5817#(<= |#Ultimate.C_memset_#t~loopctr17| 5), 5818#(<= |#Ultimate.C_memset_#t~loopctr17| 6), 5819#(<= |#Ultimate.C_memset_#t~loopctr17| 7), 5820#(<= |#Ultimate.C_memset_#t~loopctr17| 8), 5821#(<= |#Ultimate.C_memset_#t~loopctr17| 9), 5822#(<= |#Ultimate.C_memset_#t~loopctr17| 10), 5823#(<= |#Ultimate.C_memset_#t~loopctr17| 11)] [2018-02-04 03:05:57,419 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:05:57,419 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 03:05:57,419 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 03:05:57,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-02-04 03:05:57,420 INFO L87 Difference]: Start difference. First operand 128 states and 134 transitions. Second operand 19 states. [2018-02-04 03:05:57,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:57,452 INFO L93 Difference]: Finished difference Result 131 states and 137 transitions. [2018-02-04 03:05:57,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 03:05:57,452 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-02-04 03:05:57,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:57,453 INFO L225 Difference]: With dead ends: 131 [2018-02-04 03:05:57,453 INFO L226 Difference]: Without dead ends: 129 [2018-02-04 03:05:57,453 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:05:57,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-04 03:05:57,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-02-04 03:05:57,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-04 03:05:57,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 135 transitions. [2018-02-04 03:05:57,456 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 135 transitions. Word has length 49 [2018-02-04 03:05:57,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:57,456 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 135 transitions. [2018-02-04 03:05:57,456 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 03:05:57,456 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions. [2018-02-04 03:05:57,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-04 03:05:57,457 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:57,457 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:05:57,457 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_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:05:57,457 INFO L82 PathProgramCache]: Analyzing trace with hash 2004741353, now seen corresponding path program 16 times [2018-02-04 03:05:57,458 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:57,476 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:57,663 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:05:57,664 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:05:57,664 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-04 03:05:57,664 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:57,664 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:05:57,664 INFO L182 omatonBuilderFactory]: Interpolants [6091#true, 6092#false, 6093#(= 0 |ldv_malloc_#t~malloc4.offset|), 6094#(= 0 |ldv_malloc_#res.offset|), 6095#(= 0 |ldv_kobject_create_#t~ret14.offset|), 6096#(= 0 ldv_kobject_create_~kobj~1.offset), 6097#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 6098#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 6099#(and (= 0 |ldv_kobject_init_#in~kobj.offset|) (<= 16 (select |#length| |ldv_kobject_init_#in~kobj.base|))), 6100#(and (= 0 ldv_kobject_init_~kobj.offset) (<= 16 (select |#length| ldv_kobject_init_~kobj.base))), 6101#(and (<= 16 (select |#length| |ldv_kobject_init_internal_#in~kobj.base|)) (= 0 |ldv_kobject_init_internal_#in~kobj.offset|)), 6102#(and (<= 16 (select |#length| ldv_kobject_init_internal_~kobj.base)) (= ldv_kobject_init_internal_~kobj.offset 0)), 6103#(and (<= (+ |ldv_kref_init_#in~kref.offset| 4) (select |#length| |ldv_kref_init_#in~kref.base|)) (<= 12 |ldv_kref_init_#in~kref.offset|)), 6104#(and (<= 12 ldv_kref_init_~kref.offset) (<= (+ ldv_kref_init_~kref.offset 4) (select |#length| ldv_kref_init_~kref.base)))] [2018-02-04 03:05:57,664 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:05:57,664 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 03:05:57,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 03:05:57,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:05:57,665 INFO L87 Difference]: Start difference. First operand 129 states and 135 transitions. Second operand 14 states. [2018-02-04 03:05:57,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:57,831 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2018-02-04 03:05:57,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 03:05:57,832 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2018-02-04 03:05:57,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:57,832 INFO L225 Difference]: With dead ends: 128 [2018-02-04 03:05:57,832 INFO L226 Difference]: Without dead ends: 128 [2018-02-04 03:05:57,833 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:05:57,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-04 03:05:57,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-02-04 03:05:57,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-02-04 03:05:57,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 134 transitions. [2018-02-04 03:05:57,835 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 134 transitions. Word has length 50 [2018-02-04 03:05:57,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:57,836 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 134 transitions. [2018-02-04 03:05:57,836 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 03:05:57,836 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 134 transitions. [2018-02-04 03:05:57,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 03:05:57,836 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:57,836 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:05:57,837 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_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:05:57,837 INFO L82 PathProgramCache]: Analyzing trace with hash -194054402, now seen corresponding path program 1 times [2018-02-04 03:05:57,838 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:57,850 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:57,948 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:05:57,948 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:05:57,948 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 03:05:57,948 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:57,948 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:05:57,948 INFO L182 omatonBuilderFactory]: Interpolants [6369#true, 6370#false, 6371#(= 1 (select |#valid| |#Ultimate.C_memset_#ptr.base|)), 6372#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base)), 6373#(= 1 (select |#valid| |ldv_kobject_init_#in~kobj.base|)), 6374#(= 1 (select |#valid| ldv_kobject_init_~kobj.base)), 6375#(= 1 (select |#valid| |ldv_kobject_init_internal_#in~kobj.base|)), 6376#(= 1 (select |#valid| ldv_kobject_init_internal_~kobj.base)), 6377#(= 1 (select |#valid| |LDV_INIT_LIST_HEAD_#in~list.base|)), 6378#(= 1 (select |#valid| LDV_INIT_LIST_HEAD_~list.base))] [2018-02-04 03:05:57,949 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:05:57,949 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 03:05:57,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 03:05:57,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:05:57,949 INFO L87 Difference]: Start difference. First operand 128 states and 134 transitions. Second operand 10 states. [2018-02-04 03:05:58,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:58,061 INFO L93 Difference]: Finished difference Result 126 states and 132 transitions. [2018-02-04 03:05:58,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:05:58,061 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-02-04 03:05:58,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:58,061 INFO L225 Difference]: With dead ends: 126 [2018-02-04 03:05:58,061 INFO L226 Difference]: Without dead ends: 126 [2018-02-04 03:05:58,061 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:05:58,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-04 03:05:58,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-02-04 03:05:58,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-04 03:05:58,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 132 transitions. [2018-02-04 03:05:58,063 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 132 transitions. Word has length 55 [2018-02-04 03:05:58,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:58,063 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 132 transitions. [2018-02-04 03:05:58,063 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 03:05:58,063 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 132 transitions. [2018-02-04 03:05:58,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 03:05:58,064 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:58,064 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:05:58,064 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_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:05:58,064 INFO L82 PathProgramCache]: Analyzing trace with hash -194054401, now seen corresponding path program 1 times [2018-02-04 03:05:58,065 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:58,075 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:58,194 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:05:58,194 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:05:58,194 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-04 03:05:58,194 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:58,194 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:05:58,195 INFO L182 omatonBuilderFactory]: Interpolants [6637#true, 6638#false, 6639#(= 0 |ldv_malloc_#t~malloc4.offset|), 6640#(= 0 |ldv_malloc_#res.offset|), 6641#(= 0 |ldv_kobject_create_#t~ret14.offset|), 6642#(= 0 ldv_kobject_create_~kobj~1.offset), 6643#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 6644#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 6645#(and (= 0 |ldv_kobject_init_#in~kobj.offset|) (<= 16 (select |#length| |ldv_kobject_init_#in~kobj.base|))), 6646#(and (= 0 ldv_kobject_init_~kobj.offset) (<= 16 (select |#length| ldv_kobject_init_~kobj.base))), 6647#(and (<= 16 (select |#length| |ldv_kobject_init_internal_#in~kobj.base|)) (= 0 |ldv_kobject_init_internal_#in~kobj.offset|)), 6648#(and (<= 16 (select |#length| ldv_kobject_init_internal_~kobj.base)) (= ldv_kobject_init_internal_~kobj.offset 0)), 6649#(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|))), 6650#(and (<= (+ LDV_INIT_LIST_HEAD_~list.offset 12) (select |#length| LDV_INIT_LIST_HEAD_~list.base)) (<= 4 LDV_INIT_LIST_HEAD_~list.offset))] [2018-02-04 03:05:58,195 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:05:58,195 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 03:05:58,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 03:05:58,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:05:58,195 INFO L87 Difference]: Start difference. First operand 126 states and 132 transitions. Second operand 14 states. [2018-02-04 03:05:58,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:58,356 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions. [2018-02-04 03:05:58,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 03:05:58,357 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2018-02-04 03:05:58,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:58,357 INFO L225 Difference]: With dead ends: 124 [2018-02-04 03:05:58,357 INFO L226 Difference]: Without dead ends: 124 [2018-02-04 03:05:58,357 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:05:58,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-04 03:05:58,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-02-04 03:05:58,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-04 03:05:58,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 130 transitions. [2018-02-04 03:05:58,360 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 130 transitions. Word has length 55 [2018-02-04 03:05:58,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:58,360 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 130 transitions. [2018-02-04 03:05:58,360 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 03:05:58,360 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2018-02-04 03:05:58,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 03:05:58,360 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:58,361 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:05:58,361 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_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:05:58,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1776850097, now seen corresponding path program 1 times [2018-02-04 03:05:58,361 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:58,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:58,368 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:58,401 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:05:58,402 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:05:58,402 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 03:05:58,402 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:58,402 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:05:58,402 INFO L182 omatonBuilderFactory]: Interpolants [6912#(not (= ldv_kobject_create_~kobj~1.base 0)), 6913#(= ldv_kobject_init_~kobj.base |ldv_kobject_init_#in~kobj.base|), 6914#(= 0 |ldv_kobject_init_#in~kobj.base|), 6907#true, 6908#false, 6909#(not (= |ldv_malloc_#t~malloc4.base| 0)), 6910#(not (= |ldv_malloc_#res.base| 0)), 6911#(not (= |ldv_kobject_create_#t~ret14.base| 0))] [2018-02-04 03:05:58,402 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:05:58,402 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:05:58,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:05:58,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:05:58,403 INFO L87 Difference]: Start difference. First operand 124 states and 130 transitions. Second operand 8 states. [2018-02-04 03:05:58,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:58,431 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2018-02-04 03:05:58,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 03:05:58,431 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2018-02-04 03:05:58,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:58,431 INFO L225 Difference]: With dead ends: 126 [2018-02-04 03:05:58,431 INFO L226 Difference]: Without dead ends: 124 [2018-02-04 03:05:58,431 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:05:58,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-04 03:05:58,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-02-04 03:05:58,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-04 03:05:58,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 129 transitions. [2018-02-04 03:05:58,434 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 129 transitions. Word has length 60 [2018-02-04 03:05:58,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:58,434 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 129 transitions. [2018-02-04 03:05:58,434 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:05:58,434 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 129 transitions. [2018-02-04 03:05:58,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-04 03:05:58,435 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:58,435 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:05:58,435 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_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:05:58,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1832725770, now seen corresponding path program 1 times [2018-02-04 03:05:58,436 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:58,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:58,450 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:58,533 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:05:58,533 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:05:58,533 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 03:05:58,534 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:58,534 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:05:58,534 INFO L182 omatonBuilderFactory]: Interpolants [7169#true, 7170#false, 7171#(not (= |ldv_malloc_#t~malloc4.base| 0)), 7172#(not (= |ldv_malloc_#res.base| 0)), 7173#(not (= |ldv_kobject_create_#t~ret14.base| 0)), 7174#(not (= ldv_kobject_create_~kobj~1.base 0)), 7175#(= ldv_kobject_init_~kobj.base |ldv_kobject_init_#in~kobj.base|), 7176#(= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|), 7177#(= 0 |ldv_kobject_init_internal_#in~kobj.base|), 7178#(= 0 |ldv_kobject_init_#in~kobj.base|)] [2018-02-04 03:05:58,534 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:05:58,534 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 03:05:58,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 03:05:58,535 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:05:58,535 INFO L87 Difference]: Start difference. First operand 124 states and 129 transitions. Second operand 10 states. [2018-02-04 03:05:58,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:58,619 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2018-02-04 03:05:58,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:05:58,620 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2018-02-04 03:05:58,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:58,620 INFO L225 Difference]: With dead ends: 128 [2018-02-04 03:05:58,620 INFO L226 Difference]: Without dead ends: 124 [2018-02-04 03:05:58,621 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:05:58,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-04 03:05:58,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-02-04 03:05:58,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-04 03:05:58,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 128 transitions. [2018-02-04 03:05:58,624 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 128 transitions. Word has length 65 [2018-02-04 03:05:58,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:58,624 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 128 transitions. [2018-02-04 03:05:58,624 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 03:05:58,624 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 128 transitions. [2018-02-04 03:05:58,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-04 03:05:58,625 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:58,625 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:05:58,625 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_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:05:58,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1936088896, now seen corresponding path program 1 times [2018-02-04 03:05:58,626 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:58,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:58,649 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:58,858 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:05:58,859 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:05:58,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-02-04 03:05:58,859 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:58,859 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:05:58,860 INFO L182 omatonBuilderFactory]: Interpolants [7456#(= 1 (select |#valid| |ldv_atomic_sub_return_#in~v.base|)), 7457#(= 1 (select |#valid| ldv_atomic_sub_return_~v.base)), 7437#true, 7438#false, 7439#(= ldv_kobject_init_~kobj.base |ldv_kobject_init_#in~kobj.base|), 7440#(= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|), 7441#(= LDV_INIT_LIST_HEAD_~list.base |LDV_INIT_LIST_HEAD_#in~list.base|), 7442#(and (= 1 (select |#valid| LDV_INIT_LIST_HEAD_~list.base)) (= LDV_INIT_LIST_HEAD_~list.base |LDV_INIT_LIST_HEAD_#in~list.base|)), 7443#(= 1 (select |#valid| |LDV_INIT_LIST_HEAD_#in~list.base|)), 7444#(= 1 (select |#valid| |ldv_kobject_init_internal_#in~kobj.base|)), 7445#(= 1 (select |#valid| |ldv_kobject_init_#in~kobj.base|)), 7446#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base)), 7447#(= 1 (select |#valid| |ldv_kobject_create_#res.base|)), 7448#(= 1 (select |#valid| |entry_point_#t~ret16.base|)), 7449#(= 1 (select |#valid| entry_point_~kobj~2.base)), 7450#(= 1 (select |#valid| |ldv_kobject_put_#in~kobj.base|)), 7451#(= 1 (select |#valid| ldv_kobject_put_~kobj.base)), 7452#(= 1 (select |#valid| |ldv_kref_put_#in~kref.base|)), 7453#(= 1 (select |#valid| ldv_kref_put_~kref.base)), 7454#(= 1 (select |#valid| |ldv_kref_sub_#in~kref.base|)), 7455#(= 1 (select |#valid| ldv_kref_sub_~kref.base))] [2018-02-04 03:05:58,860 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-04 03:05:58,860 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 03:05:58,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 03:05:58,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-02-04 03:05:58,861 INFO L87 Difference]: Start difference. First operand 124 states and 128 transitions. Second operand 21 states. [2018-02-04 03:05:59,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:59,249 INFO L93 Difference]: Finished difference Result 152 states and 163 transitions. [2018-02-04 03:05:59,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 03:05:59,250 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 76 [2018-02-04 03:05:59,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:59,250 INFO L225 Difference]: With dead ends: 152 [2018-02-04 03:05:59,250 INFO L226 Difference]: Without dead ends: 152 [2018-02-04 03:05:59,251 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2018-02-04 03:05:59,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-04 03:05:59,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 147. [2018-02-04 03:05:59,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-04 03:05:59,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 159 transitions. [2018-02-04 03:05:59,255 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 159 transitions. Word has length 76 [2018-02-04 03:05:59,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:59,255 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 159 transitions. [2018-02-04 03:05:59,255 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 03:05:59,255 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 159 transitions. [2018-02-04 03:05:59,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-04 03:05:59,256 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:59,256 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:05:59,256 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_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:05:59,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1936088897, now seen corresponding path program 1 times [2018-02-04 03:05:59,257 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:59,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:59,267 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:59,470 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:05:59,470 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:05:59,470 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-04 03:05:59,470 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:59,471 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:05:59,471 INFO L182 omatonBuilderFactory]: Interpolants [7776#(= 0 ldv_kobject_create_~kobj~1.offset), 7777#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 7778#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 7779#(and (= 0 |ldv_kobject_create_#res.offset|) (<= 16 (select |#length| |ldv_kobject_create_#res.base|))), 7780#(and (<= 16 (select |#length| |entry_point_#t~ret16.base|)) (= 0 |entry_point_#t~ret16.offset|)), 7781#(and (= 0 entry_point_~kobj~2.offset) (<= 16 (select |#length| entry_point_~kobj~2.base))), 7782#(and (<= 16 (select |#length| |ldv_kobject_put_#in~kobj.base|)) (= 0 |ldv_kobject_put_#in~kobj.offset|)), 7783#(and (= ldv_kobject_put_~kobj.offset 0) (<= 16 (select |#length| ldv_kobject_put_~kobj.base))), 7784#(and (<= 12 |ldv_kref_put_#in~kref.offset|) (<= (+ |ldv_kref_put_#in~kref.offset| 4) (select |#length| |ldv_kref_put_#in~kref.base|))), 7785#(and (<= 12 ldv_kref_put_~kref.offset) (<= (+ ldv_kref_put_~kref.offset 4) (select |#length| ldv_kref_put_~kref.base))), 7786#(and (<= (+ |ldv_kref_sub_#in~kref.offset| 4) (select |#length| |ldv_kref_sub_#in~kref.base|)) (<= 12 |ldv_kref_sub_#in~kref.offset|)), 7787#(and (<= (+ ldv_kref_sub_~kref.offset 4) (select |#length| ldv_kref_sub_~kref.base)) (<= 12 ldv_kref_sub_~kref.offset)), 7788#(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|)), 7789#(and (<= (+ ldv_atomic_sub_return_~v.offset 4) (select |#length| ldv_atomic_sub_return_~v.base)) (<= 12 ldv_atomic_sub_return_~v.offset)), 7771#true, 7772#false, 7773#(= 0 |ldv_malloc_#t~malloc4.offset|), 7774#(= 0 |ldv_malloc_#res.offset|), 7775#(= 0 |ldv_kobject_create_#t~ret14.offset|)] [2018-02-04 03:05:59,471 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:05:59,471 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 03:05:59,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 03:05:59,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-02-04 03:05:59,471 INFO L87 Difference]: Start difference. First operand 147 states and 159 transitions. Second operand 19 states. [2018-02-04 03:05:59,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:59,727 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2018-02-04 03:05:59,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 03:05:59,728 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 76 [2018-02-04 03:05:59,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:59,728 INFO L225 Difference]: With dead ends: 145 [2018-02-04 03:05:59,728 INFO L226 Difference]: Without dead ends: 145 [2018-02-04 03:05:59,729 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:05:59,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-04 03:05:59,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-02-04 03:05:59,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-04 03:05:59,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 155 transitions. [2018-02-04 03:05:59,732 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 155 transitions. Word has length 76 [2018-02-04 03:05:59,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:59,732 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 155 transitions. [2018-02-04 03:05:59,732 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 03:05:59,732 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 155 transitions. [2018-02-04 03:05:59,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-04 03:05:59,733 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:59,733 INFO L351 BasicCegarLoop]: trace histogram [16, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:59,733 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_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:05:59,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1236824510, now seen corresponding path program 1 times [2018-02-04 03:05:59,734 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:59,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:59,747 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:59,820 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-02-04 03:05:59,820 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:59,820 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 03:05:59,821 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:59,821 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 03:05:59,821 INFO L182 omatonBuilderFactory]: Interpolants [8096#(not (= |ldv_kobject_create_#t~ret14.base| 0)), 8097#(not (= ldv_kobject_create_~kobj~1.base 0)), 8098#(not (= |ldv_kobject_create_#res.base| 0)), 8099#(not (= |entry_point_#t~ret16.base| 0)), 8100#(not (= entry_point_~kobj~2.base 0)), 8101#(= ldv_kobject_put_~kobj.base |ldv_kobject_put_#in~kobj.base|), 8102#(= 0 |ldv_kobject_put_#in~kobj.base|), 8092#true, 8093#false, 8094#(not (= |ldv_malloc_#t~malloc4.base| 0)), 8095#(not (= |ldv_malloc_#res.base| 0))] [2018-02-04 03:05:59,821 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-02-04 03:05:59,821 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 03:05:59,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 03:05:59,822 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:05:59,822 INFO L87 Difference]: Start difference. First operand 145 states and 155 transitions. Second operand 11 states. [2018-02-04 03:05:59,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:59,883 INFO L93 Difference]: Finished difference Result 146 states and 152 transitions. [2018-02-04 03:05:59,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 03:05:59,883 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 79 [2018-02-04 03:05:59,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:59,884 INFO L225 Difference]: With dead ends: 146 [2018-02-04 03:05:59,885 INFO L226 Difference]: Without dead ends: 142 [2018-02-04 03:05:59,885 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:05:59,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-02-04 03:05:59,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-02-04 03:05:59,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-04 03:05:59,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 148 transitions. [2018-02-04 03:05:59,888 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 148 transitions. Word has length 79 [2018-02-04 03:05:59,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:59,888 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 148 transitions. [2018-02-04 03:05:59,888 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 03:05:59,888 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 148 transitions. [2018-02-04 03:05:59,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-02-04 03:05:59,889 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:59,889 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] [2018-02-04 03:05:59,889 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_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:05:59,889 INFO L82 PathProgramCache]: Analyzing trace with hash 2027437998, now seen corresponding path program 1 times [2018-02-04 03:05:59,890 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:59,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:59,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:06:00,150 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:06:00,150 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:06:00,150 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-02-04 03:06:00,151 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:06:00,151 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:06:00,151 INFO L182 omatonBuilderFactory]: Interpolants [8397#true, 8398#false, 8399#(= ldv_kobject_init_~kobj.base |ldv_kobject_init_#in~kobj.base|), 8400#(= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|), 8401#(= LDV_INIT_LIST_HEAD_~list.base |LDV_INIT_LIST_HEAD_#in~list.base|), 8402#(and (= 1 (select |#valid| LDV_INIT_LIST_HEAD_~list.base)) (= LDV_INIT_LIST_HEAD_~list.base |LDV_INIT_LIST_HEAD_#in~list.base|)), 8403#(= 1 (select |#valid| |LDV_INIT_LIST_HEAD_#in~list.base|)), 8404#(= 1 (select |#valid| |ldv_kobject_init_internal_#in~kobj.base|)), 8405#(= 1 (select |#valid| |ldv_kobject_init_#in~kobj.base|)), 8406#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base)), 8407#(= 1 (select |#valid| |ldv_kobject_create_#res.base|)), 8408#(= 1 (select |#valid| |entry_point_#t~ret16.base|)), 8409#(= 1 (select |#valid| entry_point_~kobj~2.base)), 8410#(= 1 (select |#valid| |ldv_kobject_put_#in~kobj.base|)), 8411#(= 1 (select |#valid| ldv_kobject_put_~kobj.base)), 8412#(= 1 (select |#valid| |ldv_kref_put_#in~kref.base|)), 8413#(= 1 (select |#valid| ldv_kref_put_~kref.base)), 8414#(= 1 (select |#valid| |ldv_kref_sub_#in~kref.base|)), 8415#(= 1 (select |#valid| ldv_kref_sub_~kref.base)), 8416#(= 1 (select |#valid| |##fun~$Pointer$~TO~VOID_#in~kref.base|)), 8417#(= 1 (select |#valid| |##fun~$Pointer$~TO~VOID_#~kref.base|)), 8418#(= 1 (select |#valid| |ldv_kobject_release_#in~kref.base|)), 8419#(= 1 (select |#valid| ldv_kobject_release_~kobj~0.base)), 8420#(= 1 (select |#valid| |ldv_kobject_cleanup_#in~kobj.base|)), 8421#(= 1 (select |#valid| ldv_kobject_cleanup_~kobj.base))] [2018-02-04 03:06:00,151 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:06:00,151 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 03:06:00,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 03:06:00,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:06:00,152 INFO L87 Difference]: Start difference. First operand 142 states and 148 transitions. Second operand 25 states. [2018-02-04 03:06:00,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:06:00,548 INFO L93 Difference]: Finished difference Result 152 states and 161 transitions. [2018-02-04 03:06:00,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 03:06:00,548 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 90 [2018-02-04 03:06:00,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:06:00,548 INFO L225 Difference]: With dead ends: 152 [2018-02-04 03:06:00,549 INFO L226 Difference]: Without dead ends: 152 [2018-02-04 03:06:00,549 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 03:06:00,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-04 03:06:00,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 148. [2018-02-04 03:06:00,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-04 03:06:00,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 158 transitions. [2018-02-04 03:06:00,551 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 158 transitions. Word has length 90 [2018-02-04 03:06:00,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:06:00,552 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 158 transitions. [2018-02-04 03:06:00,552 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 03:06:00,552 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 158 transitions. [2018-02-04 03:06:00,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-02-04 03:06:00,552 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:06:00,552 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] [2018-02-04 03:06:00,552 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_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:06:00,552 INFO L82 PathProgramCache]: Analyzing trace with hash 2027437999, now seen corresponding path program 1 times [2018-02-04 03:06:00,553 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:06:00,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:06:00,572 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:06:00,865 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:06:00,865 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:06:00,865 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-02-04 03:06:00,866 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:06:00,866 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:06:00,866 INFO L182 omatonBuilderFactory]: Interpolants [8740#true, 8741#false, 8742#(= 0 |ldv_malloc_#t~malloc4.offset|), 8743#(= 0 |ldv_malloc_#res.offset|), 8744#(= 0 |ldv_kobject_create_#t~ret14.offset|), 8745#(= 0 ldv_kobject_create_~kobj~1.offset), 8746#(= 0 |ldv_kobject_create_#res.offset|), 8747#(= 0 |entry_point_#t~ret16.offset|), 8748#(= 0 entry_point_~kobj~2.offset), 8749#(= 0 |ldv_kobject_put_#in~kobj.offset|), 8750#(= ldv_kobject_put_~kobj.offset 0), 8751#(<= 12 |ldv_kref_put_#in~kref.offset|), 8752#(<= 12 ldv_kref_put_~kref.offset), 8753#(<= 12 |ldv_kref_sub_#in~kref.offset|), 8754#(<= 12 ldv_kref_sub_~kref.offset), 8755#(and (<= |ldv_atomic_sub_return_#in~v.offset| ldv_atomic_sub_return_~v.offset) (= ldv_atomic_sub_return_~v.base |ldv_atomic_sub_return_#in~v.base|)), 8756#(and (<= (+ |ldv_atomic_sub_return_#in~v.offset| 4) (select |#length| ldv_atomic_sub_return_~v.base)) (= ldv_atomic_sub_return_~v.base |ldv_atomic_sub_return_#in~v.base|)), 8757#(<= (+ |ldv_atomic_sub_return_#in~v.offset| 4) (select |#length| |ldv_atomic_sub_return_#in~v.base|)), 8758#(and (<= (+ ldv_kref_sub_~kref.offset 4) (select |#length| ldv_kref_sub_~kref.base)) (<= 12 ldv_kref_sub_~kref.offset)), 8759#(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|))), 8760#(and (<= 12 |##fun~$Pointer$~TO~VOID_#~kref.offset|) (<= (+ |##fun~$Pointer$~TO~VOID_#~kref.offset| 4) (select |#length| |##fun~$Pointer$~TO~VOID_#~kref.base|))), 8761#(and (<= 12 |ldv_kobject_release_#in~kref.offset|) (<= (+ |ldv_kobject_release_#in~kref.offset| 4) (select |#length| |ldv_kobject_release_#in~kref.base|))), 8762#(and (<= (+ ldv_kobject_release_~kobj~0.offset 16) (select |#length| ldv_kobject_release_~kobj~0.base)) (<= 0 ldv_kobject_release_~kobj~0.offset)), 8763#(and (<= (+ |ldv_kobject_cleanup_#in~kobj.offset| 16) (select |#length| |ldv_kobject_cleanup_#in~kobj.base|)) (<= 0 |ldv_kobject_cleanup_#in~kobj.offset|)), 8764#(and (<= 0 ldv_kobject_cleanup_~kobj.offset) (<= (+ ldv_kobject_cleanup_~kobj.offset 16) (select |#length| ldv_kobject_cleanup_~kobj.base)))] [2018-02-04 03:06:00,866 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:06:00,866 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 03:06:00,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 03:06:00,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:06:00,867 INFO L87 Difference]: Start difference. First operand 148 states and 158 transitions. Second operand 25 states. [2018-02-04 03:06:01,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:06:01,222 INFO L93 Difference]: Finished difference Result 147 states and 156 transitions. [2018-02-04 03:06:01,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 03:06:01,222 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 90 [2018-02-04 03:06:01,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:06:01,223 INFO L225 Difference]: With dead ends: 147 [2018-02-04 03:06:01,223 INFO L226 Difference]: Without dead ends: 147 [2018-02-04 03:06:01,223 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=1098, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 03:06:01,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-02-04 03:06:01,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-02-04 03:06:01,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-04 03:06:01,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 156 transitions. [2018-02-04 03:06:01,225 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 156 transitions. Word has length 90 [2018-02-04 03:06:01,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:06:01,225 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 156 transitions. [2018-02-04 03:06:01,225 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 03:06:01,225 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 156 transitions. [2018-02-04 03:06:01,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-04 03:06:01,226 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:06:01,226 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] [2018-02-04 03:06:01,226 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_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:06:01,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1547234289, now seen corresponding path program 1 times [2018-02-04 03:06:01,227 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:06:01,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:06:01,242 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:06:01,482 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:06:01,483 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:06:01,483 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-02-04 03:06:01,483 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:06:01,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:06:01,483 INFO L182 omatonBuilderFactory]: Interpolants [9088#(= 0 |ldv_kobject_put_#in~kobj.offset|), 9089#(= ldv_kobject_put_~kobj.offset 0), 9090#(<= |ldv_kref_put_#in~kref.offset| 12), 9091#(<= ldv_kref_put_~kref.offset 12), 9092#(<= |ldv_kref_sub_#in~kref.offset| 12), 9093#(<= ldv_kref_sub_~kref.offset 12), 9094#(<= |##fun~$Pointer$~TO~VOID_#in~kref.offset| 12), 9095#(<= |##fun~$Pointer$~TO~VOID_#~kref.offset| 12), 9096#(<= |ldv_kobject_release_#in~kref.offset| 12), 9097#(<= ldv_kobject_release_~kobj~0.offset 0), 9098#(<= |ldv_kobject_cleanup_#in~kobj.offset| 0), 9099#(<= ldv_kobject_cleanup_~kobj.offset 0), 9100#(and (<= 0 ldv_kobject_cleanup_~kobj.offset) (<= ldv_kobject_cleanup_~kobj.offset 0)), 9079#true, 9080#false, 9081#(= 0 |ldv_malloc_#t~malloc4.offset|), 9082#(= 0 |ldv_malloc_#res.offset|), 9083#(= 0 |ldv_kobject_create_#t~ret14.offset|), 9084#(= 0 ldv_kobject_create_~kobj~1.offset), 9085#(= 0 |ldv_kobject_create_#res.offset|), 9086#(= 0 |entry_point_#t~ret16.offset|), 9087#(= 0 entry_point_~kobj~2.offset)] [2018-02-04 03:06:01,484 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:06:01,484 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 03:06:01,484 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 03:06:01,484 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-02-04 03:06:01,484 INFO L87 Difference]: Start difference. First operand 147 states and 156 transitions. Second operand 22 states. [2018-02-04 03:06:01,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:06:01,820 INFO L93 Difference]: Finished difference Result 146 states and 155 transitions. [2018-02-04 03:06:01,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 03:06:01,821 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 92 [2018-02-04 03:06:01,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:06:01,822 INFO L225 Difference]: With dead ends: 146 [2018-02-04 03:06:01,822 INFO L226 Difference]: Without dead ends: 146 [2018-02-04 03:06:01,822 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=850, Unknown=0, NotChecked=0, Total=930 [2018-02-04 03:06:01,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-04 03:06:01,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-02-04 03:06:01,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-04 03:06:01,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 155 transitions. [2018-02-04 03:06:01,826 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 155 transitions. Word has length 92 [2018-02-04 03:06:01,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:06:01,826 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 155 transitions. [2018-02-04 03:06:01,826 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 03:06:01,826 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 155 transitions. [2018-02-04 03:06:01,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-04 03:06:01,827 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:06:01,827 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:06:01,827 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_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:06:01,827 INFO L82 PathProgramCache]: Analyzing trace with hash -833465104, now seen corresponding path program 1 times [2018-02-04 03:06:01,828 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:06:01,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:06:01,895 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:06:04,576 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:06:04,576 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:06:04,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-02-04 03:06:04,577 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:06:04,577 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:06:04,577 INFO L182 omatonBuilderFactory]: Interpolants [9411#true, 9412#false, 9413#(= 0 |ldv_malloc_#t~malloc4.offset|), 9414#(= 0 |ldv_malloc_#res.offset|), 9415#(= 0 |ldv_kobject_create_#t~ret14.offset|), 9416#(= 0 ldv_kobject_create_~kobj~1.offset), 9417#(or (= |#Ultimate.C_memset_#t~loopctr17| 0) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 9418#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (not (= |#Ultimate.C_memset_#value| 0)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 0) (and (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0)) (<= |#Ultimate.C_memset_#t~loopctr17| 1))), 9419#(or (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 1) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (not (= |#Ultimate.C_memset_#value| 0)) (and (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0)) (<= |#Ultimate.C_memset_#t~loopctr17| 2))), 9420#(or (and (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0)) (<= |#Ultimate.C_memset_#t~loopctr17| 3)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (not (= |#Ultimate.C_memset_#value| 0)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 2)), 9421#(or (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 3) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (not (= |#Ultimate.C_memset_#value| 0)) (and (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0)) (<= |#Ultimate.C_memset_#t~loopctr17| 4))), 9422#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (not (= |#Ultimate.C_memset_#value| 0)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 4) (and (<= |#Ultimate.C_memset_#t~loopctr17| 5) (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0)))), 9423#(or (and (<= |#Ultimate.C_memset_#t~loopctr17| 6) (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr17| |#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)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 5)), 9424#(or (<= |#Ultimate.C_memset_#t~loopctr17| 6) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (not (= |#Ultimate.C_memset_#value| 0)) (and (<= |#Ultimate.C_memset_#t~loopctr17| 7) (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0)))), 9425#(or (and (<= |#Ultimate.C_memset_#t~loopctr17| 8) (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr17| |#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)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 7)), 9426#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (not (= |#Ultimate.C_memset_#value| 0)) (and (<= |#Ultimate.C_memset_#t~loopctr17| 9) (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0))) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 8)), 9427#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 9) (not (= |#Ultimate.C_memset_#value| 0)) (and (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0)) (<= |#Ultimate.C_memset_#t~loopctr17| 10))), 9428#(or (and (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0)) (<= |#Ultimate.C_memset_#t~loopctr17| 11)) (<= |#Ultimate.C_memset_#t~loopctr17| 10) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (not (= |#Ultimate.C_memset_#value| 0))), 9429#(or (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) (+ |#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)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 11)), 9430#(or (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) (+ |#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)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 12)), 9431#(or (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0)) (<= |#Ultimate.C_memset_#t~loopctr17| 13) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (not (= |#Ultimate.C_memset_#value| 0))), 9432#(or (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) (+ |#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)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 14)), 9433#(or (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)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 15)), 9434#(or (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)) (<= |#Ultimate.C_memset_#amount| 15)), 9435#(and (= 0 ldv_kobject_create_~kobj~1.offset) (= 0 (select (select |#memory_$Pointer$.offset| ldv_kobject_create_~kobj~1.base) 0))), 9436#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 9437#(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)), 9438#(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)))), 9439#(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)))), 9440#(and (<= |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)|)), 9441#(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|))), 9442#(and (or (and (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)))) (= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~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)))))) (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)))), 9443#(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)|)), 9444#(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)) (not (= (+ LDV_INIT_LIST_HEAD_~list.offset 4) 0)) (<= |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|)), 9445#(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|)))) (not (= (+ |LDV_INIT_LIST_HEAD_#in~list.offset| 4) 0)) (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|))))), 9446#(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))), 9447#(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))), 9448#(and (= 0 (select (select |#memory_$Pointer$.offset| |ldv_kobject_create_#res.base|) 0)) (= 0 |ldv_kobject_create_#res.offset|)), 9449#(and (= 0 (select (select |#memory_$Pointer$.offset| |entry_point_#t~ret16.base|) 0)) (= 0 |entry_point_#t~ret16.offset|)), 9450#(and (= 0 entry_point_~kobj~2.offset) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~kobj~2.base) 0))), 9451#(and (= 0 |ldv_kobject_put_#in~kobj.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ldv_kobject_put_#in~kobj.base|) 0))), 9452#(and (= ldv_kobject_put_~kobj.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| ldv_kobject_put_~kobj.base) 0))), 9453#(and (<= 12 |ldv_kref_put_#in~kref.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ldv_kref_put_#in~kref.base|) 0))), 9454#(and (<= 12 ldv_kref_put_~kref.offset) (= 0 (select (select |#memory_$Pointer$.offset| ldv_kref_put_~kref.base) 0))), 9455#(and (<= 12 |ldv_kref_sub_#in~kref.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ldv_kref_sub_#in~kref.base|) 0))), 9456#(and (= 0 (select (select |#memory_$Pointer$.offset| ldv_kref_sub_~kref.base) 0)) (<= 12 ldv_kref_sub_~kref.offset)), 9457#(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) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ldv_atomic_sub_return_~v.base |ldv_atomic_sub_return_#in~v.base|)), 9458#(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|))))), 9459#(= 0 (select (select |#memory_$Pointer$.offset| ldv_kref_sub_~kref.base) 0)), 9460#(= 0 (select (select |#memory_$Pointer$.offset| |##fun~$Pointer$~TO~VOID_#in~kref.base|) 0)), 9461#(= 0 (select (select |#memory_$Pointer$.offset| |##fun~$Pointer$~TO~VOID_#~kref.base|) 0)), 9462#(= 0 (select (select |#memory_$Pointer$.offset| |ldv_kobject_release_#in~kref.base|) 0)), 9463#(= 0 (select (select |#memory_$Pointer$.offset| ldv_kobject_release_~kobj~0.base) 0)), 9464#(= 0 (select (select |#memory_$Pointer$.offset| |ldv_kobject_cleanup_#in~kobj.base|) 0)), 9465#(or (not (= 0 ldv_kobject_cleanup_~kobj.offset)) (= 0 (select (select |#memory_$Pointer$.offset| ldv_kobject_cleanup_~kobj.base) ldv_kobject_cleanup_~kobj.offset))), 9466#(or (= 0 |ldv_kobject_cleanup_#t~mem12.offset|) (not (= 0 ldv_kobject_cleanup_~kobj.offset))), 9467#(or (not (= 0 ldv_kobject_cleanup_~kobj.offset)) (= 0 ldv_kobject_cleanup_~name~0.offset)), 9468#(= 0 ldv_kobject_cleanup_~name~0.offset)] [2018-02-04 03:06:04,578 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:06:04,578 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-02-04 03:06:04,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-02-04 03:06:04,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=3023, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 03:06:04,579 INFO L87 Difference]: Start difference. First operand 146 states and 155 transitions. Second operand 58 states. [2018-02-04 03:06:07,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:06:07,485 INFO L93 Difference]: Finished difference Result 160 states and 166 transitions. [2018-02-04 03:06:07,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-04 03:06:07,485 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 94 [2018-02-04 03:06:07,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:06:07,486 INFO L225 Difference]: With dead ends: 160 [2018-02-04 03:06:07,486 INFO L226 Difference]: Without dead ends: 160 [2018-02-04 03:06:07,487 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1726 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=817, Invalid=8495, Unknown=0, NotChecked=0, Total=9312 [2018-02-04 03:06:07,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-02-04 03:06:07,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2018-02-04 03:06:07,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-04 03:06:07,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 166 transitions. [2018-02-04 03:06:07,490 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 166 transitions. Word has length 94 [2018-02-04 03:06:07,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:06:07,490 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 166 transitions. [2018-02-04 03:06:07,490 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-02-04 03:06:07,490 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 166 transitions. [2018-02-04 03:06:07,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-04 03:06:07,491 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:06:07,491 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:06:07,491 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_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:06:07,491 INFO L82 PathProgramCache]: Analyzing trace with hash -833465103, now seen corresponding path program 1 times [2018-02-04 03:06:07,492 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:06:07,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:06:07,533 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:06:09,657 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:06:09,657 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:06:09,657 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-02-04 03:06:09,657 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:06:09,657 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:06:09,658 INFO L182 omatonBuilderFactory]: Interpolants [9866#true, 9867#false, 9868#(= 0 |ldv_malloc_#t~malloc4.offset|), 9869#(= 0 |ldv_malloc_#res.offset|), 9870#(= 0 |ldv_kobject_create_#t~ret14.offset|), 9871#(= 0 ldv_kobject_create_~kobj~1.offset), 9872#(or (= |#Ultimate.C_memset_#t~loopctr17| 0) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 9873#(or (and (not (= 1 (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|))) (<= |#Ultimate.C_memset_#t~loopctr17| 1)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (and (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) 0) 0)) (<= |#Ultimate.C_memset_#t~loopctr17| 1))), 9874#(or (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 1) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (and (<= |#Ultimate.C_memset_#t~loopctr17| 2) (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) 0) 0)))), 9875#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (and (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) 0) 0)) (<= |#Ultimate.C_memset_#t~loopctr17| 3)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 2)), 9876#(or (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 3) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (and (<= |#Ultimate.C_memset_#t~loopctr17| 4) (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) 0) 0)))), 9877#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 4) (and (<= |#Ultimate.C_memset_#t~loopctr17| 5) (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 0) 0)))), 9878#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 5) (and (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 0) 0)) (<= |#Ultimate.C_memset_#t~loopctr17| 6))), 9879#(or (and (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 0) 0)) (<= |#Ultimate.C_memset_#t~loopctr17| 7)) (<= |#Ultimate.C_memset_#t~loopctr17| 6) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 9880#(or (and (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 0) 0)) (<= |#Ultimate.C_memset_#t~loopctr17| 8)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 7)), 9881#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (and (<= |#Ultimate.C_memset_#t~loopctr17| 9) (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 0) 0))) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 8)), 9882#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 9) (and (<= |#Ultimate.C_memset_#t~loopctr17| 10) (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) 0) 0)))), 9883#(or (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 10) (and (<= |#Ultimate.C_memset_#t~loopctr17| 11) (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) 0) 0))) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 9884#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 11)), 9885#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 12)), 9886#(or (<= |#Ultimate.C_memset_#t~loopctr17| 13) (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 9887#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 14)), 9888#(or (= 0 (select (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= |#Ultimate.C_memset_#t~loopctr17| 15)), 9889#(or (= 0 (select (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= |#Ultimate.C_memset_#amount| 15)), 9890#(and (= 0 ldv_kobject_create_~kobj~1.offset) (= 0 (select (select |#memory_$Pointer$.base| ldv_kobject_create_~kobj~1.base) 0))), 9891#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 9892#(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)), 9893#(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))), 9894#(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)))), 9895#(and (= |#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|)), 9896#(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|))), 9897#(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_#in~kobj.base| ldv_kobject_init_internal_~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)))), 9898#(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|)), 9899#(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|)), 9900#(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|))))))), 9901#(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))), 9902#(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))), 9903#(and (= 0 (select (select |#memory_$Pointer$.base| |ldv_kobject_create_#res.base|) 0)) (= 0 |ldv_kobject_create_#res.offset|)), 9904#(and (= 0 (select (select |#memory_$Pointer$.base| |entry_point_#t~ret16.base|) 0)) (= 0 |entry_point_#t~ret16.offset|)), 9905#(and (= 0 entry_point_~kobj~2.offset) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~kobj~2.base) 0))), 9906#(and (= 0 |ldv_kobject_put_#in~kobj.offset|) (= 0 (select (select |#memory_$Pointer$.base| |ldv_kobject_put_#in~kobj.base|) 0))), 9907#(and (= ldv_kobject_put_~kobj.offset 0) (= 0 (select (select |#memory_$Pointer$.base| ldv_kobject_put_~kobj.base) 0))), 9908#(and (<= 12 |ldv_kref_put_#in~kref.offset|) (= 0 (select (select |#memory_$Pointer$.base| |ldv_kref_put_#in~kref.base|) 0))), 9909#(and (<= 12 ldv_kref_put_~kref.offset) (= 0 (select (select |#memory_$Pointer$.base| ldv_kref_put_~kref.base) 0))), 9910#(and (<= 12 |ldv_kref_sub_#in~kref.offset|) (= 0 (select (select |#memory_$Pointer$.base| |ldv_kref_sub_#in~kref.base|) 0))), 9911#(and (= 0 (select (select |#memory_$Pointer$.base| ldv_kref_sub_~kref.base) 0)) (<= 12 ldv_kref_sub_~kref.offset)), 9912#(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) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ldv_atomic_sub_return_~v.base |ldv_atomic_sub_return_#in~v.base|)), 9913#(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|)))))), 9914#(= 0 (select (select |#memory_$Pointer$.base| ldv_kref_sub_~kref.base) 0)), 9915#(= 0 (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~kref.base|) 0)), 9916#(= 0 (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#~kref.base|) 0)), 9917#(= 0 (select (select |#memory_$Pointer$.base| |ldv_kobject_release_#in~kref.base|) 0)), 9918#(= 0 (select (select |#memory_$Pointer$.base| ldv_kobject_release_~kobj~0.base) 0)), 9919#(= 0 (select (select |#memory_$Pointer$.base| |ldv_kobject_cleanup_#in~kobj.base|) 0)), 9920#(or (not (= 0 ldv_kobject_cleanup_~kobj.offset)) (= 0 (select (select |#memory_$Pointer$.base| ldv_kobject_cleanup_~kobj.base) ldv_kobject_cleanup_~kobj.offset))), 9921#(or (= 0 |ldv_kobject_cleanup_#t~mem12.base|) (not (= 0 ldv_kobject_cleanup_~kobj.offset))), 9922#(or (not (= 0 ldv_kobject_cleanup_~kobj.offset)) (= ldv_kobject_cleanup_~name~0.base 0)), 9923#(= ldv_kobject_cleanup_~name~0.base 0)] [2018-02-04 03:06:09,658 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:06:09,658 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-02-04 03:06:09,658 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-02-04 03:06:09,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=3017, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 03:06:09,659 INFO L87 Difference]: Start difference. First operand 159 states and 166 transitions. Second operand 58 states. [2018-02-04 03:06:12,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:06:12,160 INFO L93 Difference]: Finished difference Result 161 states and 167 transitions. [2018-02-04 03:06:12,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-04 03:06:12,160 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 94 [2018-02-04 03:06:12,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:06:12,161 INFO L225 Difference]: With dead ends: 161 [2018-02-04 03:06:12,161 INFO L226 Difference]: Without dead ends: 161 [2018-02-04 03:06:12,162 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1749 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=845, Invalid=8467, Unknown=0, NotChecked=0, Total=9312 [2018-02-04 03:06:12,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-04 03:06:12,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2018-02-04 03:06:12,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-04 03:06:12,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 165 transitions. [2018-02-04 03:06:12,165 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 165 transitions. Word has length 94 [2018-02-04 03:06:12,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:06:12,165 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 165 transitions. [2018-02-04 03:06:12,165 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-02-04 03:06:12,165 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 165 transitions. [2018-02-04 03:06:12,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-02-04 03:06:12,166 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:06:12,166 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] [2018-02-04 03:06:12,166 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_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:06:12,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1169429601, now seen corresponding path program 1 times [2018-02-04 03:06:12,167 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:06:12,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:06:12,184 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:06:12,392 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:06:12,392 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:06:12,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 03:06:12,393 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:06:12,393 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:06:12,393 INFO L182 omatonBuilderFactory]: Interpolants [10336#(= 1 (select |#valid| |ldv_kobject_put_#in~kobj.base|)), 10337#(= 1 (select |#valid| ldv_kobject_put_~kobj.base)), 10338#(= 1 (select |#valid| |ldv_kref_put_#in~kref.base|)), 10339#(= 1 (select |#valid| ldv_kref_put_~kref.base)), 10340#(= 1 (select |#valid| |ldv_kref_sub_#in~kref.base|)), 10341#(= 1 (select |#valid| ldv_kref_sub_~kref.base)), 10342#(= 1 (select |#valid| |ldv_atomic_sub_return_#in~v.base|)), 10343#(= 1 (select |#valid| ldv_atomic_sub_return_~v.base)), 10322#true, 10323#false, 10324#(= ldv_kobject_init_~kobj.base |ldv_kobject_init_#in~kobj.base|), 10325#(= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|), 10326#(= LDV_INIT_LIST_HEAD_~list.base |LDV_INIT_LIST_HEAD_#in~list.base|), 10327#(and (= 1 (select |#valid| LDV_INIT_LIST_HEAD_~list.base)) (= LDV_INIT_LIST_HEAD_~list.base |LDV_INIT_LIST_HEAD_#in~list.base|)), 10328#(= 1 (select |#valid| |LDV_INIT_LIST_HEAD_#in~list.base|)), 10329#(= 1 (select |#valid| |ldv_kobject_init_internal_#in~kobj.base|)), 10330#(= 1 (select |#valid| |ldv_kobject_init_#in~kobj.base|)), 10331#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base)), 10332#(= 1 (select |#valid| |ldv_kobject_create_#res.base|)), 10333#(= 1 (select |#valid| |entry_point_#t~ret16.base|)), 10334#(= 1 (select |#valid| entry_point_~kobj~2.base)), 10335#(= |#valid| |old(#valid)|)] [2018-02-04 03:06:12,393 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:06:12,393 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 03:06:12,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 03:06:12,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2018-02-04 03:06:12,393 INFO L87 Difference]: Start difference. First operand 159 states and 165 transitions. Second operand 22 states. [2018-02-04 03:06:12,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:06:12,895 INFO L93 Difference]: Finished difference Result 195 states and 207 transitions. [2018-02-04 03:06:12,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 03:06:12,895 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 101 [2018-02-04 03:06:12,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:06:12,896 INFO L225 Difference]: With dead ends: 195 [2018-02-04 03:06:12,896 INFO L226 Difference]: Without dead ends: 195 [2018-02-04 03:06:12,897 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=1283, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 03:06:12,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-02-04 03:06:12,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2018-02-04 03:06:12,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-02-04 03:06:12,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 203 transitions. [2018-02-04 03:06:12,899 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 203 transitions. Word has length 101 [2018-02-04 03:06:12,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:06:12,899 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 203 transitions. [2018-02-04 03:06:12,900 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 03:06:12,900 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 203 transitions. [2018-02-04 03:06:12,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-02-04 03:06:12,900 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:06:12,900 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] [2018-02-04 03:06:12,900 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_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:06:12,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1585104435, now seen corresponding path program 1 times [2018-02-04 03:06:12,901 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:06:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:06:12,911 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:06:13,187 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:06:13,187 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:06:13,187 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 03:06:13,187 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:06:13,187 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:06:13,187 INFO L182 omatonBuilderFactory]: Interpolants [10763#true, 10764#false, 10765#(= ldv_kobject_init_~kobj.base |ldv_kobject_init_#in~kobj.base|), 10766#(= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|), 10767#(= LDV_INIT_LIST_HEAD_~list.base |LDV_INIT_LIST_HEAD_#in~list.base|), 10768#(and (= 1 (select |#valid| LDV_INIT_LIST_HEAD_~list.base)) (= LDV_INIT_LIST_HEAD_~list.base |LDV_INIT_LIST_HEAD_#in~list.base|)), 10769#(= 1 (select |#valid| |LDV_INIT_LIST_HEAD_#in~list.base|)), 10770#(= 1 (select |#valid| |ldv_kobject_init_internal_#in~kobj.base|)), 10771#(= 1 (select |#valid| |ldv_kobject_init_#in~kobj.base|)), 10772#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base)), 10773#(= 1 (select |#valid| |ldv_kobject_create_#res.base|)), 10774#(= 1 (select |#valid| |entry_point_#t~ret16.base|)), 10775#(= 1 (select |#valid| entry_point_~kobj~2.base)), 10776#(= |#valid| |old(#valid)|), 10777#(= 1 (select |#valid| |ldv_kobject_put_#in~kobj.base|)), 10778#(= 1 (select |#valid| ldv_kobject_put_~kobj.base)), 10779#(= 1 (select |#valid| |ldv_kref_put_#in~kref.base|)), 10780#(= 1 (select |#valid| ldv_kref_put_~kref.base)), 10781#(= 1 (select |#valid| |ldv_kref_sub_#in~kref.base|)), 10782#(= 1 (select |#valid| ldv_kref_sub_~kref.base)), 10783#(= 1 (select |#valid| |##fun~$Pointer$~TO~VOID_#in~kref.base|)), 10784#(= 1 (select |#valid| |##fun~$Pointer$~TO~VOID_#~kref.base|)), 10785#(= 1 (select |#valid| |ldv_kobject_release_#in~kref.base|)), 10786#(= 1 (select |#valid| ldv_kobject_release_~kobj~0.base)), 10787#(= 1 (select |#valid| |ldv_kobject_cleanup_#in~kobj.base|)), 10788#(= 1 (select |#valid| ldv_kobject_cleanup_~kobj.base))] [2018-02-04 03:06:13,188 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:06:13,188 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 03:06:13,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 03:06:13,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2018-02-04 03:06:13,188 INFO L87 Difference]: Start difference. First operand 192 states and 203 transitions. Second operand 26 states. [2018-02-04 03:06:13,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:06:13,885 INFO L93 Difference]: Finished difference Result 203 states and 217 transitions. [2018-02-04 03:06:13,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 03:06:13,885 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 115 [2018-02-04 03:06:13,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:06:13,886 INFO L225 Difference]: With dead ends: 203 [2018-02-04 03:06:13,886 INFO L226 Difference]: Without dead ends: 203 [2018-02-04 03:06:13,886 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=1919, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 03:06:13,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-02-04 03:06:13,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 199. [2018-02-04 03:06:13,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-04 03:06:13,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 213 transitions. [2018-02-04 03:06:13,889 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 213 transitions. Word has length 115 [2018-02-04 03:06:13,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:06:13,889 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 213 transitions. [2018-02-04 03:06:13,889 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 03:06:13,889 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 213 transitions. [2018-02-04 03:06:13,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-02-04 03:06:13,890 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:06:13,890 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] [2018-02-04 03:06:13,890 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_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:06:13,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1688670762, now seen corresponding path program 1 times [2018-02-04 03:06:13,890 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:06:13,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 03:06:13,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 03:06:13,965 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 03:06:13,979 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-02-04 03:06:14,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 03:06:14 BoogieIcfgContainer [2018-02-04 03:06:14,000 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 03:06:14,001 INFO L168 Benchmark]: Toolchain (without parser) took 20475.54 ms. Allocated memory was 402.7 MB in the beginning and 1.4 GB in the end (delta: 1.0 GB). Free memory was 356.7 MB in the beginning and 1.2 GB in the end (delta: -837.2 MB). Peak memory consumption was 172.5 MB. Max. memory is 5.3 GB. [2018-02-04 03:06:14,002 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 402.7 MB. Free memory is still 365.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 03:06:14,002 INFO L168 Benchmark]: CACSL2BoogieTranslator took 177.68 ms. Allocated memory is still 402.7 MB. Free memory was 356.7 MB in the beginning and 342.2 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:06:14,002 INFO L168 Benchmark]: Boogie Preprocessor took 31.10 ms. Allocated memory is still 402.7 MB. Free memory was 342.2 MB in the beginning and 340.8 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:06:14,002 INFO L168 Benchmark]: RCFGBuilder took 311.24 ms. Allocated memory is still 402.7 MB. Free memory was 340.8 MB in the beginning and 307.7 MB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 5.3 GB. [2018-02-04 03:06:14,003 INFO L168 Benchmark]: TraceAbstraction took 19953.14 ms. Allocated memory was 402.7 MB in the beginning and 1.4 GB in the end (delta: 1.0 GB). Free memory was 307.7 MB in the beginning and 1.2 GB in the end (delta: -886.2 MB). Peak memory consumption was 123.5 MB. Max. memory is 5.3 GB. [2018-02-04 03:06:14,004 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.10 ms. Allocated memory is still 402.7 MB. Free memory is still 365.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 177.68 ms. Allocated memory is still 402.7 MB. Free memory was 356.7 MB in the beginning and 342.2 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.10 ms. Allocated memory is still 402.7 MB. Free memory was 342.2 MB in the beginning and 340.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 311.24 ms. Allocated memory is still 402.7 MB. Free memory was 340.8 MB in the beginning and 307.7 MB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 19953.14 ms. Allocated memory was 402.7 MB in the beginning and 1.4 GB in the end (delta: 1.0 GB). Free memory was 307.7 MB in the beginning and 1.2 GB in the end (delta: -886.2 MB). Peak memory consumption was 123.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L1444] CALL entry_point() [L1436] struct ldv_kobject *kobj; [L1437] CALL, EXPR ldv_kobject_create() [L1406] struct ldv_kobject *kobj; [L1408] CALL, EXPR ldv_malloc(sizeof(*kobj)) VAL [\old(size)=16] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=16, malloc(size)={19:0}, size=16] [L1074] RET return malloc(size); VAL [\old(size)=16, \result={19:0}, malloc(size)={19:0}, size=16] [L1408] EXPR ldv_malloc(sizeof(*kobj)) VAL [ldv_malloc(sizeof(*kobj))={19:0}] [L1408] kobj = ldv_malloc(sizeof(*kobj)) [L1409] COND FALSE !(!kobj) VAL [kobj={19:0}] [L1411] FCALL memset(kobj, 0, sizeof(*kobj)) VAL [kobj={19:0}, memset(kobj, 0, sizeof(*kobj))={19:0}] [L1413] CALL ldv_kobject_init(kobj) VAL [kobj={19:0}] [L1394] COND FALSE !(!kobj) VAL [kobj={19:0}, kobj={19:0}] [L1398] CALL ldv_kobject_init_internal(kobj) VAL [kobj={19:0}] [L1380] COND FALSE !(!kobj) VAL [kobj={19:0}, kobj={19:0}] [L1382] CALL ldv_kref_init(&kobj->kref) VAL [kref={19:12}] [L1294] RET, FCALL ((&kref->refcount)->counter) = (1) VAL [kref={19:12}, kref={19:12}] [L1382] ldv_kref_init(&kobj->kref) VAL [kobj={19:0}, kobj={19:0}] [L1383] CALL LDV_INIT_LIST_HEAD(&kobj->entry) VAL [list={19:4}] [L1099] FCALL list->next = list VAL [list={19:4}, list={19:4}] [L1100] FCALL list->prev = list VAL [list={19:4}, list={19:4}] [L1383] RET, FCALL LDV_INIT_LIST_HEAD(&kobj->entry) VAL [kobj={19:0}, kobj={19:0}] [L1413] ldv_kobject_init(kobj) VAL [kobj={19:0}] [L1414] RET return kobj; VAL [\result={19:0}, kobj={19:0}] [L1437] EXPR ldv_kobject_create() VAL [ldv_kobject_create()={19:0}] [L1437] kobj = ldv_kobject_create() [L1438] CALL ldv_kobject_put(kobj) VAL [kobj={19:0}] [L1361] COND TRUE \read(*kobj) VAL [kobj={19:0}, kobj={19:0}] [L1363] CALL ldv_kref_put(&kobj->kref, ldv_kobject_release) VAL [kref={19:12}, release={-1:0}] [L1313] CALL, EXPR ldv_kref_sub(kref, 1, release) VAL [\old(count)=1, kref={19:12}, release={-1:0}] [L1281] CALL, EXPR ldv_atomic_sub_return(((int) count), (&kref->refcount)) VAL [\old(i)=1, v={19:12}] [L1264] int temp; VAL [\old(i)=1, i=1, v={19:12}, v={19:12}] [L1265] EXPR, FCALL v->counter VAL [\old(i)=1, i=1, v={19:12}, v={19:12}, v->counter=1] [L1265] temp = v->counter [L1266] temp -= i VAL [\old(i)=1, i=1, temp=0, v={19:12}, v={19:12}] [L1267] FCALL v->counter = temp VAL [\old(i)=1, i=1, temp=0, v={19:12}, v={19:12}] [L1268] RET return temp; VAL [\old(i)=1, \result=0, i=1, temp=0, v={19:12}, v={19:12}] [L1281] EXPR ldv_atomic_sub_return(((int) count), (&kref->refcount)) VAL [\old(count)=1, count=1, kref={19:12}, kref={19:12}, ldv_atomic_sub_return(((int) count), (&kref->refcount))=0, release={-1:0}, release={-1:0}] [L1281] COND TRUE (ldv_atomic_sub_return(((int) count), (&kref->refcount)) == 0) [L1282] CALL release(kref) [L1349] const typeof( ((struct ldv_kobject *)0)->kref ) *__mptr = (kref); [L1349] struct ldv_kobject *kobj = ({ const typeof( ((struct ldv_kobject *)0)->kref ) *__mptr = (kref); (struct ldv_kobject *)( (char *)__mptr - ((size_t) &((struct ldv_kobject *)0)->kref) );}); VAL [__mptr={19:12}, kobj={19:0}, kref={19:12}, kref={19:12}] [L1350] CALL ldv_kobject_cleanup(kobj) VAL [kobj={19:0}] [L1339] EXPR, FCALL kobj->name VAL [kobj={19:0}, kobj={19:0}, kobj->name={0:0}] [L1339] char *name = kobj->name; [L1340] FCALL free(kobj) VAL [kobj={19:0}, kobj={19:0}, name={0:0}] [L1343] COND FALSE !(\read(*name)) VAL [kobj={19:0}, kobj={19:0}, name={0:0}] [L1350] FCALL ldv_kobject_cleanup(kobj) VAL [\old(count)=1, count=1, kref={19:12}, kref={19:12}, release={-1:0}, release={-1:0}] [L1283] RET return 1; VAL [\old(count)=1, \result=1, count=1, kref={19:12}, kref={19:12}, release={-1:0}, release={-1:0}] [L1313] EXPR ldv_kref_sub(kref, 1, release) VAL [kref={19:12}, kref={19:12}, ldv_kref_sub(kref, 1, release)=1, release={-1:0}, release={-1:0}] [L1313] RET return ldv_kref_sub(kref, 1, release); [L1363] RET ldv_kref_put(&kobj->kref, ldv_kobject_release) VAL [kobj={19:0}, kobj={19:0}, ldv_kref_put(&kobj->kref, ldv_kobject_release)=1] [L1438] ldv_kobject_put(kobj) VAL [kobj={19:0}] [L1440] CALL ldv_kobject_put(kobj) VAL [kobj={19:0}] [L1361] COND TRUE \read(*kobj) VAL [kobj={19:0}, kobj={19:0}] [L1363] CALL ldv_kref_put(&kobj->kref, ldv_kobject_release) VAL [kref={19:12}, release={-1:0}] [L1313] CALL ldv_kref_sub(kref, 1, release) VAL [\old(count)=1, kref={19:12}, release={-1:0}] [L1281] CALL ldv_atomic_sub_return(((int) count), (&kref->refcount)) VAL [\old(i)=1, v={19:12}] [L1264] int temp; VAL [\old(i)=1, i=1, v={19:12}, v={19:12}] [L1265] FCALL v->counter VAL [\old(i)=1, i=1, v={19:12}, v={19:12}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 18 procedures, 119 locations, 19 error locations. UNSAFE Result, 19.9s OverallTime, 39 OverallIterations, 16 TraceHistogramMax, 10.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4015 SDtfs, 881 SDslu, 34067 SDs, 0 SdLazy, 15257 SolverSat, 350 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 798 GetRequests, 103 SyntacticMatches, 2 SemanticMatches, 693 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4313 ImplicationChecksByTransitivity, 9.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=199occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 1786/2757 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 38 MinimizatonAttempts, 37 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 2158 NumberOfCodeBlocks, 2158 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 2002 ConstructedInterpolants, 0 QuantifiedInterpolants, 943398 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 18 PerfectInterpolantSequences, 1786/2757 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_03-06-14-010.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_03-06-14-010.csv Received shutdown request...