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_5_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 16:20:07,385 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 16:20:07,386 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 16:20:07,399 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 16:20:07,399 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 16:20:07,400 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 16:20:07,401 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 16:20:07,402 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 16:20:07,404 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 16:20:07,404 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 16:20:07,405 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 16:20:07,405 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 16:20:07,406 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 16:20:07,407 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 16:20:07,408 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 16:20:07,409 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 16:20:07,411 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 16:20:07,412 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 16:20:07,413 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 16:20:07,414 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 16:20:07,416 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 16:20:07,416 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 16:20:07,416 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 16:20:07,417 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 16:20:07,418 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 16:20:07,419 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 16:20:07,419 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 16:20:07,419 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 16:20:07,419 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 16:20:07,419 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 16:20:07,420 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 16:20:07,420 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 16:20:07,429 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 16:20:07,429 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 16:20:07,430 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 16:20:07,430 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 16:20:07,430 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 16:20:07,430 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 16:20:07,430 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 16:20:07,431 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 16:20:07,431 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 16:20:07,431 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 16:20:07,431 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 16:20:07,431 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 16:20:07,431 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 16:20:07,431 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 16:20:07,431 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 16:20:07,432 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 16:20:07,432 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 16:20:07,432 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 16:20:07,432 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 16:20:07,432 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 16:20:07,432 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 16:20:07,433 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 16:20:07,457 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 16:20:07,465 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 16:20:07,467 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 16:20:07,468 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 16:20:07,469 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 16:20:07,469 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_5_false-valid-deref.i [2018-02-04 16:20:07,607 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 16:20:07,607 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 16:20:07,608 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 16:20:07,608 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 16:20:07,612 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 16:20:07,613 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:20:07" (1/1) ... [2018-02-04 16:20:07,615 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b089594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:20:07, skipping insertion in model container [2018-02-04 16:20:07,615 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:20:07" (1/1) ... [2018-02-04 16:20:07,624 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 16:20:07,658 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 16:20:07,758 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 16:20:07,777 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 16:20:07,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:20:07 WrapperNode [2018-02-04 16:20:07,786 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 16:20:07,787 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 16:20:07,788 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 16:20:07,788 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 16:20:07,796 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:20:07" (1/1) ... [2018-02-04 16:20:07,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:20:07" (1/1) ... [2018-02-04 16:20:07,805 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:20:07" (1/1) ... [2018-02-04 16:20:07,805 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:20:07" (1/1) ... [2018-02-04 16:20:07,812 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:20:07" (1/1) ... [2018-02-04 16:20:07,815 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:20:07" (1/1) ... [2018-02-04 16:20:07,817 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:20:07" (1/1) ... [2018-02-04 16:20:07,819 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 16:20:07,820 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 16:20:07,820 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 16:20:07,820 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 16:20:07,821 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:20:07" (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 16:20:07,857 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 16:20:07,858 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 16:20:07,858 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-02-04 16:20:07,858 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 16:20:07,858 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-02-04 16:20:07,858 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-02-04 16:20:07,858 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-02-04 16:20:07,858 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-02-04 16:20:07,858 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-02-04 16:20:07,858 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-02-04 16:20:07,858 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-02-04 16:20:07,858 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-02-04 16:20:07,859 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-02-04 16:20:07,859 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-02-04 16:20:07,859 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-02-04 16:20:07,859 INFO L136 BoogieDeclarations]: Found implementation of procedure f_22_put [2018-02-04 16:20:07,859 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 16:20:07,859 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 16:20:07,859 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 16:20:07,859 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 16:20:07,859 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 16:20:07,859 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 16:20:07,859 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 16:20:07,859 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 16:20:07,859 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 16:20:07,859 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-04 16:20:07,860 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-04 16:20:07,860 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 16:20:07,860 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 16:20:07,860 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 16:20:07,860 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-04 16:20:07,860 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 16:20:07,860 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-02-04 16:20:07,860 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-02-04 16:20:07,860 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-02-04 16:20:07,860 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-02-04 16:20:07,860 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-02-04 16:20:07,860 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-02-04 16:20:07,860 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-02-04 16:20:07,860 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-02-04 16:20:07,861 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-02-04 16:20:07,861 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-02-04 16:20:07,861 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-02-04 16:20:07,861 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-02-04 16:20:07,861 INFO L128 BoogieDeclarations]: Found specification of procedure f_22_put [2018-02-04 16:20:07,861 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 16:20:07,861 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 16:20:07,861 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 16:20:07,861 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 16:20:08,057 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-04 16:20:08,158 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 16:20:08,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:20:08 BoogieIcfgContainer [2018-02-04 16:20:08,159 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 16:20:08,159 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 16:20:08,160 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 16:20:08,161 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 16:20:08,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 04:20:07" (1/3) ... [2018-02-04 16:20:08,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@699d5b57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:20:08, skipping insertion in model container [2018-02-04 16:20:08,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:20:07" (2/3) ... [2018-02-04 16:20:08,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@699d5b57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:20:08, skipping insertion in model container [2018-02-04 16:20:08,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:20:08" (3/3) ... [2018-02-04 16:20:08,163 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test22_5_false-valid-deref.i [2018-02-04 16:20:08,168 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 16:20:08,173 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-02-04 16:20:08,196 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 16:20:08,196 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 16:20:08,197 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 16:20:08,197 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 16:20:08,197 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 16:20:08,197 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 16:20:08,197 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 16:20:08,197 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 16:20:08,197 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 16:20:08,206 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states. [2018-02-04 16:20:08,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 16:20:08,211 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:20:08,212 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 16:20:08,212 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 16:20:08,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1211515492, now seen corresponding path program 1 times [2018-02-04 16:20:08,251 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:20:08,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:20:08,288 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:20:08,380 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 16:20:08,383 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:20:08,383 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 16:20:08,384 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:20:08,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:20:08,385 INFO L182 omatonBuilderFactory]: Interpolants [128#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 129#(and (= 0 |ldv_kobject_create_#t~ret14.base|) (= 0 |ldv_kobject_create_#t~ret14.offset|)), 130#(and (= ldv_kobject_create_~kobj~1.offset 0) (= ldv_kobject_create_~kobj~1.base 0)), 126#true, 127#false] [2018-02-04 16:20:08,385 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 16:20:08,386 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 16:20:08,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 16:20:08,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 16:20:08,475 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 5 states. [2018-02-04 16:20:08,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:20:08,522 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2018-02-04 16:20:08,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 16:20:08,524 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 16:20:08,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:20:08,533 INFO L225 Difference]: With dead ends: 129 [2018-02-04 16:20:08,534 INFO L226 Difference]: Without dead ends: 126 [2018-02-04 16:20:08,535 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 16:20:08,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-04 16:20:08,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2018-02-04 16:20:08,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-04 16:20:08,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2018-02-04 16:20:08,565 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 17 [2018-02-04 16:20:08,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:20:08,565 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2018-02-04 16:20:08,565 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 16:20:08,565 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2018-02-04 16:20:08,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 16:20:08,566 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:20:08,566 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 16:20:08,566 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 16:20:08,567 INFO L82 PathProgramCache]: Analyzing trace with hash 774524518, now seen corresponding path program 1 times [2018-02-04 16:20:08,568 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:20:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:20:08,583 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:20:08,630 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 16:20:08,630 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:20:08,630 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 16:20:08,631 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:20:08,631 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 16:20:08,631 INFO L182 omatonBuilderFactory]: Interpolants [384#true, 385#false, 386#(= 1 (select |#valid| |ldv_malloc_#t~malloc4.base|)), 387#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 388#(= 1 (select |#valid| |ldv_kobject_create_#t~ret14.base|)), 389#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base))] [2018-02-04 16:20:08,631 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 16:20:08,632 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 16:20:08,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 16:20:08,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 16:20:08,633 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand 6 states. [2018-02-04 16:20:08,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:20:08,733 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2018-02-04 16:20:08,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 16:20:08,734 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 16:20:08,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:20:08,735 INFO L225 Difference]: With dead ends: 125 [2018-02-04 16:20:08,736 INFO L226 Difference]: Without dead ends: 125 [2018-02-04 16:20:08,736 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 16:20:08,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-04 16:20:08,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-02-04 16:20:08,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-04 16:20:08,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2018-02-04 16:20:08,745 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 19 [2018-02-04 16:20:08,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:20:08,745 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2018-02-04 16:20:08,746 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 16:20:08,746 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2018-02-04 16:20:08,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 16:20:08,746 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:20:08,746 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 16:20:08,746 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 16:20:08,747 INFO L82 PathProgramCache]: Analyzing trace with hash 774524519, now seen corresponding path program 1 times [2018-02-04 16:20:08,748 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:20:08,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:20:08,765 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:20:08,899 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 16:20:08,899 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:20:08,900 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 16:20:08,900 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:20:08,900 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 16:20:08,900 INFO L182 omatonBuilderFactory]: Interpolants [640#true, 641#false, 642#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 643#(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|))), 644#(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|))), 645#(and (<= 16 (select |#length| |ldv_kobject_create_#t~ret14.base|)) (= 0 |ldv_kobject_create_#t~ret14.offset|)), 646#(and (= ldv_kobject_create_~kobj~1.offset 0) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base)))] [2018-02-04 16:20:08,900 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 16:20:08,901 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 16:20:08,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 16:20:08,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 16:20:08,901 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand 7 states. [2018-02-04 16:20:09,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:20:09,070 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions. [2018-02-04 16:20:09,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 16:20:09,070 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-02-04 16:20:09,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:20:09,071 INFO L225 Difference]: With dead ends: 124 [2018-02-04 16:20:09,071 INFO L226 Difference]: Without dead ends: 124 [2018-02-04 16:20:09,071 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 16:20:09,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-04 16:20:09,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-02-04 16:20:09,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-04 16:20:09,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2018-02-04 16:20:09,076 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 19 [2018-02-04 16:20:09,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:20:09,076 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2018-02-04 16:20:09,077 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 16:20:09,077 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2018-02-04 16:20:09,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 16:20:09,077 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:20:09,077 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] [2018-02-04 16:20:09,077 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 16:20:09,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1886266821, now seen corresponding path program 1 times [2018-02-04 16:20:09,078 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:20:09,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:20:09,095 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:20:09,168 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 16:20:09,169 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:20:09,169 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 16:20:09,169 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:20:09,169 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 16:20:09,169 INFO L182 omatonBuilderFactory]: Interpolants [897#true, 898#false, 899#(and (= 0 |ldv_kobject_create_#res.base|) (= 0 |ldv_kobject_create_#res.offset|)), 900#(and (= 0 |entry_point_#t~ret16.base|) (= 0 |entry_point_#t~ret16.offset|)), 901#(and (= 0 entry_point_~kobj~2.base) (= 0 entry_point_~kobj~2.offset)), 902#(and (= 0 |f_22_put_#in~kobj.offset|) (= 0 |f_22_put_#in~kobj.base|)), 903#(and (= 0 f_22_put_~kobj.base) (= 0 f_22_put_~kobj.offset)), 904#(and (= 0 |ldv_kobject_put_#in~kobj.offset|) (= 0 |ldv_kobject_put_#in~kobj.base|)), 905#(and (= ldv_kobject_put_~kobj.offset 0) (= 0 ldv_kobject_put_~kobj.base))] [2018-02-04 16:20:09,169 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 16:20:09,170 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 16:20:09,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 16:20:09,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-04 16:20:09,170 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand 9 states. [2018-02-04 16:20:09,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:20:09,252 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions. [2018-02-04 16:20:09,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 16:20:09,253 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-02-04 16:20:09,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:20:09,254 INFO L225 Difference]: With dead ends: 139 [2018-02-04 16:20:09,254 INFO L226 Difference]: Without dead ends: 139 [2018-02-04 16:20:09,255 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-04 16:20:09,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-04 16:20:09,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2018-02-04 16:20:09,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-04 16:20:09,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 144 transitions. [2018-02-04 16:20:09,265 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 144 transitions. Word has length 31 [2018-02-04 16:20:09,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:20:09,265 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 144 transitions. [2018-02-04 16:20:09,265 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 16:20:09,265 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 144 transitions. [2018-02-04 16:20:09,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 16:20:09,266 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:20:09,266 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 16:20:09,266 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 16:20:09,267 INFO L82 PathProgramCache]: Analyzing trace with hash 107698799, now seen corresponding path program 1 times [2018-02-04 16:20:09,268 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:20:09,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:20:09,280 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:20:09,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:20:09,356 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:20:09,356 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 16:20:09,356 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:20:09,357 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 16:20:09,357 INFO L182 omatonBuilderFactory]: Interpolants [1184#true, 1185#false, 1186#(= 1 (select |#valid| |#Ultimate.C_memset_#ptr.base|)), 1187#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base)), 1188#(= 1 (select |#valid| |ldv_kobject_init_#in~kobj.base|)), 1189#(= 1 (select |#valid| ldv_kobject_init_~kobj.base)), 1190#(= 1 (select |#valid| |ldv_kobject_init_internal_#in~kobj.base|)), 1191#(= 1 (select |#valid| ldv_kobject_init_internal_~kobj.base)), 1192#(= 1 (select |#valid| |ldv_kref_init_#in~kref.base|)), 1193#(= 1 (select |#valid| ldv_kref_init_~kref.base))] [2018-02-04 16:20:09,357 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 16:20:09,357 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 16:20:09,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 16:20:09,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 16:20:09,358 INFO L87 Difference]: Start difference. First operand 135 states and 144 transitions. Second operand 10 states. [2018-02-04 16:20:09,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:20:09,519 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2018-02-04 16:20:09,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 16:20:09,519 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-02-04 16:20:09,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:20:09,520 INFO L225 Difference]: With dead ends: 134 [2018-02-04 16:20:09,520 INFO L226 Difference]: Without dead ends: 134 [2018-02-04 16:20:09,520 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 16:20:09,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-04 16:20:09,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-02-04 16:20:09,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-04 16:20:09,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 143 transitions. [2018-02-04 16:20:09,526 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 143 transitions. Word has length 34 [2018-02-04 16:20:09,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:20:09,526 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 143 transitions. [2018-02-04 16:20:09,526 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 16:20:09,526 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 143 transitions. [2018-02-04 16:20:09,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 16:20:09,527 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:20:09,527 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 16:20:09,527 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 16:20:09,528 INFO L82 PathProgramCache]: Analyzing trace with hash 107698800, now seen corresponding path program 1 times [2018-02-04 16:20:09,529 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:20:09,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:20:09,540 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:20:09,569 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 16:20:09,569 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:20:09,570 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 16:20:09,570 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:20:09,570 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 16:20:09,570 INFO L182 omatonBuilderFactory]: Interpolants [1468#true, 1469#false, 1470#(= |#Ultimate.C_memset_#t~loopctr17| 0), 1471#(<= |#Ultimate.C_memset_#amount| 0)] [2018-02-04 16:20:09,570 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 16:20:09,570 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 16:20:09,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 16:20:09,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 16:20:09,570 INFO L87 Difference]: Start difference. First operand 134 states and 143 transitions. Second operand 4 states. [2018-02-04 16:20:09,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:20:09,581 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2018-02-04 16:20:09,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 16:20:09,581 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-02-04 16:20:09,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:20:09,582 INFO L225 Difference]: With dead ends: 137 [2018-02-04 16:20:09,583 INFO L226 Difference]: Without dead ends: 135 [2018-02-04 16:20:09,583 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 16:20:09,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-04 16:20:09,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-02-04 16:20:09,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-04 16:20:09,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 144 transitions. [2018-02-04 16:20:09,589 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 144 transitions. Word has length 34 [2018-02-04 16:20:09,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:20:09,589 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 144 transitions. [2018-02-04 16:20:09,589 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 16:20:09,589 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 144 transitions. [2018-02-04 16:20:09,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 16:20:09,590 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:20:09,590 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 16:20:09,590 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 16:20:09,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1590593736, now seen corresponding path program 1 times [2018-02-04 16:20:09,592 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:20:09,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:20:09,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:20:09,629 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 16:20:09,629 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:20:09,629 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-04 16:20:09,630 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:20:09,630 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 16:20:09,630 INFO L182 omatonBuilderFactory]: Interpolants [1746#true, 1747#false, 1748#(= |#Ultimate.C_memset_#t~loopctr17| 0), 1749#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 1750#(<= |#Ultimate.C_memset_#amount| 1)] [2018-02-04 16:20:09,630 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 16:20:09,630 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 16:20:09,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 16:20:09,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-04 16:20:09,631 INFO L87 Difference]: Start difference. First operand 135 states and 144 transitions. Second operand 5 states. [2018-02-04 16:20:09,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:20:09,650 INFO L93 Difference]: Finished difference Result 138 states and 147 transitions. [2018-02-04 16:20:09,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 16:20:09,652 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-02-04 16:20:09,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:20:09,653 INFO L225 Difference]: With dead ends: 138 [2018-02-04 16:20:09,653 INFO L226 Difference]: Without dead ends: 136 [2018-02-04 16:20:09,653 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 16:20:09,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-02-04 16:20:09,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-02-04 16:20:09,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-02-04 16:20:09,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 145 transitions. [2018-02-04 16:20:09,658 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 145 transitions. Word has length 35 [2018-02-04 16:20:09,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:20:09,658 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 145 transitions. [2018-02-04 16:20:09,659 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 16:20:09,659 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 145 transitions. [2018-02-04 16:20:09,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 16:20:09,659 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:20:09,660 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 16:20:09,660 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 16:20:09,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1596912496, now seen corresponding path program 2 times [2018-02-04 16:20:09,661 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:20:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:20:09,673 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:20:09,703 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 16:20:09,703 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:20:09,704 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 16:20:09,704 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:20:09,704 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 16:20:09,704 INFO L182 omatonBuilderFactory]: Interpolants [2032#(<= |#Ultimate.C_memset_#amount| 2), 2027#true, 2028#false, 2029#(= |#Ultimate.C_memset_#t~loopctr17| 0), 2030#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 2031#(<= |#Ultimate.C_memset_#t~loopctr17| 2)] [2018-02-04 16:20:09,704 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 16:20:09,705 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 16:20:09,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 16:20:09,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-04 16:20:09,705 INFO L87 Difference]: Start difference. First operand 136 states and 145 transitions. Second operand 6 states. [2018-02-04 16:20:09,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:20:09,722 INFO L93 Difference]: Finished difference Result 139 states and 148 transitions. [2018-02-04 16:20:09,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 16:20:09,723 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-02-04 16:20:09,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:20:09,724 INFO L225 Difference]: With dead ends: 139 [2018-02-04 16:20:09,724 INFO L226 Difference]: Without dead ends: 137 [2018-02-04 16:20:09,724 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 16:20:09,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-02-04 16:20:09,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-02-04 16:20:09,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-04 16:20:09,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 146 transitions. [2018-02-04 16:20:09,729 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 146 transitions. Word has length 36 [2018-02-04 16:20:09,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:20:09,729 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 146 transitions. [2018-02-04 16:20:09,729 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 16:20:09,729 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 146 transitions. [2018-02-04 16:20:09,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 16:20:09,730 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:20:09,730 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 16:20:09,730 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 16:20:09,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1625357880, now seen corresponding path program 3 times [2018-02-04 16:20:09,731 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:20:09,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:20:09,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:20:09,783 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 16:20:09,784 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:20:09,784 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 16:20:09,784 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:20:09,784 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 16:20:09,784 INFO L182 omatonBuilderFactory]: Interpolants [2311#true, 2312#false, 2313#(= |#Ultimate.C_memset_#t~loopctr17| 0), 2314#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 2315#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 2316#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 2317#(<= |#Ultimate.C_memset_#amount| 3)] [2018-02-04 16:20:09,784 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 16:20:09,785 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 16:20:09,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 16:20:09,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 16:20:09,785 INFO L87 Difference]: Start difference. First operand 137 states and 146 transitions. Second operand 7 states. [2018-02-04 16:20:09,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:20:09,801 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2018-02-04 16:20:09,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 16:20:09,801 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-02-04 16:20:09,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:20:09,802 INFO L225 Difference]: With dead ends: 140 [2018-02-04 16:20:09,802 INFO L226 Difference]: Without dead ends: 138 [2018-02-04 16:20:09,802 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 16:20:09,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-04 16:20:09,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-02-04 16:20:09,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-02-04 16:20:09,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 147 transitions. [2018-02-04 16:20:09,806 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 147 transitions. Word has length 37 [2018-02-04 16:20:09,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:20:09,807 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 147 transitions. [2018-02-04 16:20:09,807 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 16:20:09,807 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 147 transitions. [2018-02-04 16:20:09,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 16:20:09,808 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:20:09,808 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:20:09,808 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 16:20:09,808 INFO L82 PathProgramCache]: Analyzing trace with hash 2040634480, now seen corresponding path program 1 times [2018-02-04 16:20:09,809 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:20:09,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:20:09,816 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:20:09,846 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 16:20:09,846 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:20:09,846 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 16:20:09,846 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:20:09,847 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 16:20:09,847 INFO L182 omatonBuilderFactory]: Interpolants [2598#true, 2599#false, 2600#(= |#valid| |old(#valid)|)] [2018-02-04 16:20:09,847 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 16:20:09,847 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 16:20:09,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 16:20:09,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 16:20:09,848 INFO L87 Difference]: Start difference. First operand 138 states and 147 transitions. Second operand 3 states. [2018-02-04 16:20:09,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:20:09,932 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2018-02-04 16:20:09,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 16:20:09,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-02-04 16:20:09,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:20:09,934 INFO L225 Difference]: With dead ends: 156 [2018-02-04 16:20:09,934 INFO L226 Difference]: Without dead ends: 144 [2018-02-04 16:20:09,934 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 16:20:09,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-02-04 16:20:09,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 134. [2018-02-04 16:20:09,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-04 16:20:09,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 142 transitions. [2018-02-04 16:20:09,939 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 142 transitions. Word has length 36 [2018-02-04 16:20:09,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:20:09,939 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 142 transitions. [2018-02-04 16:20:09,940 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 16:20:09,940 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 142 transitions. [2018-02-04 16:20:09,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 16:20:09,940 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:20:09,940 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 16:20:09,941 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 16:20:09,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1787802512, now seen corresponding path program 4 times [2018-02-04 16:20:09,942 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:20:09,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:20:09,957 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:20:09,998 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 16:20:09,998 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:20:09,998 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 16:20:09,998 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:20:09,999 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 16:20:09,999 INFO L182 omatonBuilderFactory]: Interpolants [2896#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 2897#(<= |#Ultimate.C_memset_#t~loopctr17| 4), 2898#(<= |#Ultimate.C_memset_#amount| 4), 2891#true, 2892#false, 2893#(= |#Ultimate.C_memset_#t~loopctr17| 0), 2894#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 2895#(<= |#Ultimate.C_memset_#t~loopctr17| 2)] [2018-02-04 16:20:09,999 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 16:20:09,999 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 16:20:09,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 16:20:09,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-02-04 16:20:10,000 INFO L87 Difference]: Start difference. First operand 134 states and 142 transitions. Second operand 8 states. [2018-02-04 16:20:10,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:20:10,020 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2018-02-04 16:20:10,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 16:20:10,021 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-02-04 16:20:10,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:20:10,021 INFO L225 Difference]: With dead ends: 137 [2018-02-04 16:20:10,022 INFO L226 Difference]: Without dead ends: 135 [2018-02-04 16:20:10,022 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 16:20:10,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-04 16:20:10,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-02-04 16:20:10,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-04 16:20:10,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 143 transitions. [2018-02-04 16:20:10,026 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 143 transitions. Word has length 38 [2018-02-04 16:20:10,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:20:10,026 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 143 transitions. [2018-02-04 16:20:10,026 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 16:20:10,026 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 143 transitions. [2018-02-04 16:20:10,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 16:20:10,027 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:20:10,027 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:20:10,027 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 16:20:10,027 INFO L82 PathProgramCache]: Analyzing trace with hash 746437934, now seen corresponding path program 1 times [2018-02-04 16:20:10,028 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:20:10,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:20:10,034 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:20:10,058 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 16:20:10,058 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:20:10,058 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 16:20:10,059 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:20:10,059 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 16:20:10,059 INFO L182 omatonBuilderFactory]: Interpolants [3173#true, 3174#false, 3175#(not (= |ldv_malloc_#t~malloc4.base| 0)), 3176#(not (= |ldv_malloc_#res.base| 0)), 3177#(not (= |ldv_kobject_create_#t~ret14.base| 0)), 3178#(not (= ldv_kobject_create_~kobj~1.base 0))] [2018-02-04 16:20:10,059 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 16:20:10,059 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 16:20:10,059 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 16:20:10,059 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 16:20:10,059 INFO L87 Difference]: Start difference. First operand 135 states and 143 transitions. Second operand 6 states. [2018-02-04 16:20:10,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:20:10,071 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2018-02-04 16:20:10,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 16:20:10,071 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-02-04 16:20:10,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:20:10,072 INFO L225 Difference]: With dead ends: 122 [2018-02-04 16:20:10,072 INFO L226 Difference]: Without dead ends: 122 [2018-02-04 16:20:10,072 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 16:20:10,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-04 16:20:10,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-02-04 16:20:10,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-04 16:20:10,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 128 transitions. [2018-02-04 16:20:10,074 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 128 transitions. Word has length 38 [2018-02-04 16:20:10,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:20:10,074 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 128 transitions. [2018-02-04 16:20:10,074 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 16:20:10,074 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 128 transitions. [2018-02-04 16:20:10,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 16:20:10,074 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:20:10,074 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 16:20:10,075 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 16:20:10,075 INFO L82 PathProgramCache]: Analyzing trace with hash -221592264, now seen corresponding path program 5 times [2018-02-04 16:20:10,075 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:20:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:20:10,082 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:20:10,118 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:20:10,118 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:20:10,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 16:20:10,118 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:20:10,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:20:10,118 INFO L182 omatonBuilderFactory]: Interpolants [3425#true, 3426#false, 3427#(= |#Ultimate.C_memset_#t~loopctr17| 0), 3428#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 3429#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 3430#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 3431#(<= |#Ultimate.C_memset_#t~loopctr17| 4), 3432#(<= |#Ultimate.C_memset_#t~loopctr17| 5), 3433#(<= |#Ultimate.C_memset_#amount| 5)] [2018-02-04 16:20:10,119 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 16:20:10,119 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 16:20:10,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 16:20:10,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-02-04 16:20:10,119 INFO L87 Difference]: Start difference. First operand 122 states and 128 transitions. Second operand 9 states. [2018-02-04 16:20:10,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:20:10,140 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2018-02-04 16:20:10,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 16:20:10,141 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-02-04 16:20:10,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:20:10,141 INFO L225 Difference]: With dead ends: 125 [2018-02-04 16:20:10,141 INFO L226 Difference]: Without dead ends: 123 [2018-02-04 16:20:10,141 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 16:20:10,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-04 16:20:10,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-02-04 16:20:10,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-04 16:20:10,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 129 transitions. [2018-02-04 16:20:10,145 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 129 transitions. Word has length 39 [2018-02-04 16:20:10,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:20:10,145 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 129 transitions. [2018-02-04 16:20:10,145 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 16:20:10,145 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 129 transitions. [2018-02-04 16:20:10,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 16:20:10,146 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:20:10,146 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 16:20:10,146 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 16:20:10,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1086285168, now seen corresponding path program 6 times [2018-02-04 16:20:10,147 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:20:10,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:20:10,156 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:20:10,212 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 16:20:10,212 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:20:10,212 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 16:20:10,213 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:20:10,213 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 16:20:10,213 INFO L182 omatonBuilderFactory]: Interpolants [3684#true, 3685#false, 3686#(= |#Ultimate.C_memset_#t~loopctr17| 0), 3687#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 3688#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 3689#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 3690#(<= |#Ultimate.C_memset_#t~loopctr17| 4), 3691#(<= |#Ultimate.C_memset_#t~loopctr17| 5), 3692#(<= |#Ultimate.C_memset_#t~loopctr17| 6), 3693#(<= |#Ultimate.C_memset_#amount| 6)] [2018-02-04 16:20:10,213 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 16:20:10,214 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 16:20:10,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 16:20:10,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-02-04 16:20:10,214 INFO L87 Difference]: Start difference. First operand 123 states and 129 transitions. Second operand 10 states. [2018-02-04 16:20:10,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:20:10,252 INFO L93 Difference]: Finished difference Result 126 states and 132 transitions. [2018-02-04 16:20:10,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 16:20:10,254 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2018-02-04 16:20:10,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:20:10,255 INFO L225 Difference]: With dead ends: 126 [2018-02-04 16:20:10,255 INFO L226 Difference]: Without dead ends: 124 [2018-02-04 16:20:10,255 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 16:20:10,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-04 16:20:10,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-02-04 16:20:10,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-04 16:20:10,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 130 transitions. [2018-02-04 16:20:10,261 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 130 transitions. Word has length 40 [2018-02-04 16:20:10,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:20:10,262 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 130 transitions. [2018-02-04 16:20:10,262 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 16:20:10,262 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2018-02-04 16:20:10,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 16:20:10,262 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:20:10,262 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 16:20:10,263 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 16:20:10,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1319187400, now seen corresponding path program 7 times [2018-02-04 16:20:10,264 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:20:10,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:20:10,277 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:20:10,354 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 16:20:10,354 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:20:10,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 16:20:10,354 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:20:10,355 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 16:20:10,355 INFO L182 omatonBuilderFactory]: Interpolants [3952#(<= |#Ultimate.C_memset_#t~loopctr17| 4), 3953#(<= |#Ultimate.C_memset_#t~loopctr17| 5), 3954#(<= |#Ultimate.C_memset_#t~loopctr17| 6), 3955#(<= |#Ultimate.C_memset_#t~loopctr17| 7), 3956#(<= |#Ultimate.C_memset_#amount| 7), 3946#true, 3947#false, 3948#(= |#Ultimate.C_memset_#t~loopctr17| 0), 3949#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 3950#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 3951#(<= |#Ultimate.C_memset_#t~loopctr17| 3)] [2018-02-04 16:20:10,355 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 16:20:10,355 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 16:20:10,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 16:20:10,356 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-02-04 16:20:10,356 INFO L87 Difference]: Start difference. First operand 124 states and 130 transitions. Second operand 11 states. [2018-02-04 16:20:10,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:20:10,389 INFO L93 Difference]: Finished difference Result 127 states and 133 transitions. [2018-02-04 16:20:10,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 16:20:10,389 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-02-04 16:20:10,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:20:10,390 INFO L225 Difference]: With dead ends: 127 [2018-02-04 16:20:10,390 INFO L226 Difference]: Without dead ends: 125 [2018-02-04 16:20:10,391 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 16:20:10,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-04 16:20:10,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-02-04 16:20:10,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-04 16:20:10,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 131 transitions. [2018-02-04 16:20:10,394 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 131 transitions. Word has length 41 [2018-02-04 16:20:10,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:20:10,395 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 131 transitions. [2018-02-04 16:20:10,395 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 16:20:10,395 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 131 transitions. [2018-02-04 16:20:10,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 16:20:10,395 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:20:10,395 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 16:20:10,395 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 16:20:10,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1420574320, now seen corresponding path program 8 times [2018-02-04 16:20:10,397 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:20:10,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:20:10,408 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:20:10,480 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 16:20:10,480 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:20:10,481 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 16:20:10,481 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:20:10,481 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 16:20:10,481 INFO L182 omatonBuilderFactory]: Interpolants [4211#true, 4212#false, 4213#(= |#Ultimate.C_memset_#t~loopctr17| 0), 4214#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 4215#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 4216#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 4217#(<= |#Ultimate.C_memset_#t~loopctr17| 4), 4218#(<= |#Ultimate.C_memset_#t~loopctr17| 5), 4219#(<= |#Ultimate.C_memset_#t~loopctr17| 6), 4220#(<= |#Ultimate.C_memset_#t~loopctr17| 7), 4221#(<= |#Ultimate.C_memset_#t~loopctr17| 8), 4222#(<= |#Ultimate.C_memset_#amount| 8)] [2018-02-04 16:20:10,482 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 16:20:10,482 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 16:20:10,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 16:20:10,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-02-04 16:20:10,483 INFO L87 Difference]: Start difference. First operand 125 states and 131 transitions. Second operand 12 states. [2018-02-04 16:20:10,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:20:10,507 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2018-02-04 16:20:10,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 16:20:10,508 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-02-04 16:20:10,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:20:10,508 INFO L225 Difference]: With dead ends: 128 [2018-02-04 16:20:10,509 INFO L226 Difference]: Without dead ends: 126 [2018-02-04 16:20:10,509 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 16:20:10,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-04 16:20:10,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-02-04 16:20:10,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-04 16:20:10,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 132 transitions. [2018-02-04 16:20:10,512 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 132 transitions. Word has length 42 [2018-02-04 16:20:10,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:20:10,512 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 132 transitions. [2018-02-04 16:20:10,513 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 16:20:10,513 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 132 transitions. [2018-02-04 16:20:10,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 16:20:10,513 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:20:10,513 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 16:20:10,513 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 16:20:10,513 INFO L82 PathProgramCache]: Analyzing trace with hash 453841720, now seen corresponding path program 9 times [2018-02-04 16:20:10,514 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:20:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:20:10,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:20:10,612 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 16:20:10,613 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:20:10,613 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 16:20:10,613 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:20:10,613 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 16:20:10,613 INFO L182 omatonBuilderFactory]: Interpolants [4480#false, 4481#(= |#Ultimate.C_memset_#t~loopctr17| 0), 4482#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 4483#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 4484#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 4485#(<= |#Ultimate.C_memset_#t~loopctr17| 4), 4486#(<= |#Ultimate.C_memset_#t~loopctr17| 5), 4487#(<= |#Ultimate.C_memset_#t~loopctr17| 6), 4488#(<= |#Ultimate.C_memset_#t~loopctr17| 7), 4489#(<= |#Ultimate.C_memset_#t~loopctr17| 8), 4490#(<= |#Ultimate.C_memset_#t~loopctr17| 9), 4491#(<= |#Ultimate.C_memset_#amount| 9), 4479#true] [2018-02-04 16:20:10,613 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 16:20:10,614 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 16:20:10,614 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 16:20:10,614 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-04 16:20:10,614 INFO L87 Difference]: Start difference. First operand 126 states and 132 transitions. Second operand 13 states. [2018-02-04 16:20:10,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:20:10,638 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2018-02-04 16:20:10,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 16:20:10,638 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-02-04 16:20:10,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:20:10,639 INFO L225 Difference]: With dead ends: 129 [2018-02-04 16:20:10,639 INFO L226 Difference]: Without dead ends: 127 [2018-02-04 16:20:10,639 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 16:20:10,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-04 16:20:10,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-02-04 16:20:10,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-04 16:20:10,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 133 transitions. [2018-02-04 16:20:10,643 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 133 transitions. Word has length 43 [2018-02-04 16:20:10,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:20:10,643 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 133 transitions. [2018-02-04 16:20:10,643 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 16:20:10,643 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 133 transitions. [2018-02-04 16:20:10,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 16:20:10,644 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:20:10,644 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 16:20:10,644 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 16:20:10,644 INFO L82 PathProgramCache]: Analyzing trace with hash 549902192, now seen corresponding path program 10 times [2018-02-04 16:20:10,645 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:20:10,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:20:10,659 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:20:10,753 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 16:20:10,754 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:20:10,754 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 16:20:10,754 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:20:10,754 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 16:20:10,754 INFO L182 omatonBuilderFactory]: Interpolants [4750#true, 4751#false, 4752#(= |#Ultimate.C_memset_#t~loopctr17| 0), 4753#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 4754#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 4755#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 4756#(<= |#Ultimate.C_memset_#t~loopctr17| 4), 4757#(<= |#Ultimate.C_memset_#t~loopctr17| 5), 4758#(<= |#Ultimate.C_memset_#t~loopctr17| 6), 4759#(<= |#Ultimate.C_memset_#t~loopctr17| 7), 4760#(<= |#Ultimate.C_memset_#t~loopctr17| 8), 4761#(<= |#Ultimate.C_memset_#t~loopctr17| 9), 4762#(<= |#Ultimate.C_memset_#t~loopctr17| 10), 4763#(<= |#Ultimate.C_memset_#amount| 10)] [2018-02-04 16:20:10,754 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 16:20:10,755 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 16:20:10,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 16:20:10,755 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2018-02-04 16:20:10,755 INFO L87 Difference]: Start difference. First operand 127 states and 133 transitions. Second operand 14 states. [2018-02-04 16:20:10,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:20:10,799 INFO L93 Difference]: Finished difference Result 130 states and 136 transitions. [2018-02-04 16:20:10,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 16:20:10,800 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-02-04 16:20:10,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:20:10,800 INFO L225 Difference]: With dead ends: 130 [2018-02-04 16:20:10,801 INFO L226 Difference]: Without dead ends: 128 [2018-02-04 16:20:10,801 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 16:20:10,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-04 16:20:10,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-02-04 16:20:10,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-02-04 16:20:10,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 134 transitions. [2018-02-04 16:20:10,805 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 134 transitions. Word has length 44 [2018-02-04 16:20:10,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:20:10,805 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 134 transitions. [2018-02-04 16:20:10,805 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 16:20:10,806 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 134 transitions. [2018-02-04 16:20:10,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 16:20:10,806 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:20:10,806 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 16:20:10,806 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 16:20:10,807 INFO L82 PathProgramCache]: Analyzing trace with hash -767190472, now seen corresponding path program 11 times [2018-02-04 16:20:10,807 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:20:10,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:20:10,820 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:20:10,917 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 16:20:10,918 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:20:10,918 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 16:20:10,918 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:20:10,918 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 16:20:10,918 INFO L182 omatonBuilderFactory]: Interpolants [5024#true, 5025#false, 5026#(= |#Ultimate.C_memset_#t~loopctr17| 0), 5027#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 5028#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 5029#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 5030#(<= |#Ultimate.C_memset_#t~loopctr17| 4), 5031#(<= |#Ultimate.C_memset_#t~loopctr17| 5), 5032#(<= |#Ultimate.C_memset_#t~loopctr17| 6), 5033#(<= |#Ultimate.C_memset_#t~loopctr17| 7), 5034#(<= |#Ultimate.C_memset_#t~loopctr17| 8), 5035#(<= |#Ultimate.C_memset_#t~loopctr17| 9), 5036#(<= |#Ultimate.C_memset_#t~loopctr17| 10), 5037#(<= |#Ultimate.C_memset_#t~loopctr17| 11), 5038#(<= |#Ultimate.C_memset_#amount| 11)] [2018-02-04 16:20:10,918 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 16:20:10,919 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 16:20:10,919 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 16:20:10,919 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-02-04 16:20:10,919 INFO L87 Difference]: Start difference. First operand 128 states and 134 transitions. Second operand 15 states. [2018-02-04 16:20:10,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:20:10,946 INFO L93 Difference]: Finished difference Result 131 states and 137 transitions. [2018-02-04 16:20:10,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 16:20:10,947 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2018-02-04 16:20:10,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:20:10,947 INFO L225 Difference]: With dead ends: 131 [2018-02-04 16:20:10,947 INFO L226 Difference]: Without dead ends: 129 [2018-02-04 16:20:10,948 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 16:20:10,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-04 16:20:10,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-02-04 16:20:10,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-04 16:20:10,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 135 transitions. [2018-02-04 16:20:10,950 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 135 transitions. Word has length 45 [2018-02-04 16:20:10,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:20:10,951 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 135 transitions. [2018-02-04 16:20:10,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 16:20:10,951 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions. [2018-02-04 16:20:10,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 16:20:10,951 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:20:10,951 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 16:20:10,952 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 16:20:10,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1352609904, now seen corresponding path program 12 times [2018-02-04 16:20:10,952 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:20:10,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:20:10,963 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:20:11,073 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 16:20:11,073 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:20:11,073 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 16:20:11,073 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:20:11,073 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 16:20:11,074 INFO L182 omatonBuilderFactory]: Interpolants [5312#(<= |#Ultimate.C_memset_#t~loopctr17| 9), 5313#(<= |#Ultimate.C_memset_#t~loopctr17| 10), 5314#(<= |#Ultimate.C_memset_#t~loopctr17| 11), 5315#(<= |#Ultimate.C_memset_#t~loopctr17| 12), 5316#(<= |#Ultimate.C_memset_#amount| 12), 5301#true, 5302#false, 5303#(= |#Ultimate.C_memset_#t~loopctr17| 0), 5304#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 5305#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 5306#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 5307#(<= |#Ultimate.C_memset_#t~loopctr17| 4), 5308#(<= |#Ultimate.C_memset_#t~loopctr17| 5), 5309#(<= |#Ultimate.C_memset_#t~loopctr17| 6), 5310#(<= |#Ultimate.C_memset_#t~loopctr17| 7), 5311#(<= |#Ultimate.C_memset_#t~loopctr17| 8)] [2018-02-04 16:20:11,074 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 16:20:11,074 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 16:20:11,074 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 16:20:11,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2018-02-04 16:20:11,074 INFO L87 Difference]: Start difference. First operand 129 states and 135 transitions. Second operand 16 states. [2018-02-04 16:20:11,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:20:11,099 INFO L93 Difference]: Finished difference Result 132 states and 138 transitions. [2018-02-04 16:20:11,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 16:20:11,100 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2018-02-04 16:20:11,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:20:11,101 INFO L225 Difference]: With dead ends: 132 [2018-02-04 16:20:11,101 INFO L226 Difference]: Without dead ends: 130 [2018-02-04 16:20:11,101 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 16:20:11,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-04 16:20:11,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-02-04 16:20:11,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-04 16:20:11,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 136 transitions. [2018-02-04 16:20:11,103 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 136 transitions. Word has length 46 [2018-02-04 16:20:11,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:20:11,103 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 136 transitions. [2018-02-04 16:20:11,103 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 16:20:11,103 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 136 transitions. [2018-02-04 16:20:11,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 16:20:11,103 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:20:11,104 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 16:20:11,104 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 16:20:11,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1653055176, now seen corresponding path program 13 times [2018-02-04 16:20:11,104 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:20:11,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:20:11,112 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:20:11,188 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 16:20:11,189 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:20:11,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 16:20:11,189 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:20:11,189 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 16:20:11,189 INFO L182 omatonBuilderFactory]: Interpolants [5581#true, 5582#false, 5583#(= |#Ultimate.C_memset_#t~loopctr17| 0), 5584#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 5585#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 5586#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 5587#(<= |#Ultimate.C_memset_#t~loopctr17| 4), 5588#(<= |#Ultimate.C_memset_#t~loopctr17| 5), 5589#(<= |#Ultimate.C_memset_#t~loopctr17| 6), 5590#(<= |#Ultimate.C_memset_#t~loopctr17| 7), 5591#(<= |#Ultimate.C_memset_#t~loopctr17| 8), 5592#(<= |#Ultimate.C_memset_#t~loopctr17| 9), 5593#(<= |#Ultimate.C_memset_#t~loopctr17| 10), 5594#(<= |#Ultimate.C_memset_#t~loopctr17| 11), 5595#(<= |#Ultimate.C_memset_#t~loopctr17| 12), 5596#(<= |#Ultimate.C_memset_#t~loopctr17| 13), 5597#(<= |#Ultimate.C_memset_#amount| 13)] [2018-02-04 16:20:11,189 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 16:20:11,189 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 16:20:11,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 16:20:11,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-02-04 16:20:11,190 INFO L87 Difference]: Start difference. First operand 130 states and 136 transitions. Second operand 17 states. [2018-02-04 16:20:11,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:20:11,216 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions. [2018-02-04 16:20:11,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 16:20:11,217 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2018-02-04 16:20:11,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:20:11,217 INFO L225 Difference]: With dead ends: 133 [2018-02-04 16:20:11,217 INFO L226 Difference]: Without dead ends: 131 [2018-02-04 16:20:11,217 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 16:20:11,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-04 16:20:11,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-02-04 16:20:11,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-02-04 16:20:11,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 137 transitions. [2018-02-04 16:20:11,220 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 137 transitions. Word has length 47 [2018-02-04 16:20:11,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:20:11,220 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 137 transitions. [2018-02-04 16:20:11,220 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 16:20:11,220 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 137 transitions. [2018-02-04 16:20:11,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 16:20:11,220 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:20:11,220 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 16:20:11,220 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 16:20:11,220 INFO L82 PathProgramCache]: Analyzing trace with hash -339392144, now seen corresponding path program 14 times [2018-02-04 16:20:11,221 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:20:11,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:20:11,228 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:20:11,345 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 16:20:11,345 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:20:11,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 16:20:11,346 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:20:11,346 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 16:20:11,346 INFO L182 omatonBuilderFactory]: Interpolants [5864#true, 5865#false, 5866#(= |#Ultimate.C_memset_#t~loopctr17| 0), 5867#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 5868#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 5869#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 5870#(<= |#Ultimate.C_memset_#t~loopctr17| 4), 5871#(<= |#Ultimate.C_memset_#t~loopctr17| 5), 5872#(<= |#Ultimate.C_memset_#t~loopctr17| 6), 5873#(<= |#Ultimate.C_memset_#t~loopctr17| 7), 5874#(<= |#Ultimate.C_memset_#t~loopctr17| 8), 5875#(<= |#Ultimate.C_memset_#t~loopctr17| 9), 5876#(<= |#Ultimate.C_memset_#t~loopctr17| 10), 5877#(<= |#Ultimate.C_memset_#t~loopctr17| 11), 5878#(<= |#Ultimate.C_memset_#t~loopctr17| 12), 5879#(<= |#Ultimate.C_memset_#t~loopctr17| 13), 5880#(<= |#Ultimate.C_memset_#t~loopctr17| 14), 5881#(<= |#Ultimate.C_memset_#amount| 14)] [2018-02-04 16:20:11,346 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 16:20:11,347 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 16:20:11,347 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 16:20:11,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-02-04 16:20:11,347 INFO L87 Difference]: Start difference. First operand 131 states and 137 transitions. Second operand 18 states. [2018-02-04 16:20:11,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:20:11,394 INFO L93 Difference]: Finished difference Result 134 states and 140 transitions. [2018-02-04 16:20:11,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 16:20:11,396 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2018-02-04 16:20:11,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:20:11,397 INFO L225 Difference]: With dead ends: 134 [2018-02-04 16:20:11,397 INFO L226 Difference]: Without dead ends: 132 [2018-02-04 16:20:11,398 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 16:20:11,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-04 16:20:11,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-02-04 16:20:11,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-02-04 16:20:11,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 138 transitions. [2018-02-04 16:20:11,401 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 138 transitions. Word has length 48 [2018-02-04 16:20:11,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:20:11,401 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 138 transitions. [2018-02-04 16:20:11,401 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 16:20:11,401 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 138 transitions. [2018-02-04 16:20:11,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 16:20:11,402 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:20:11,402 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 16:20:11,402 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 16:20:11,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1729456184, now seen corresponding path program 15 times [2018-02-04 16:20:11,403 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:20:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:20:11,416 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:20:11,580 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 16:20:11,581 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:20:11,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 16:20:11,581 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:20:11,581 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 16:20:11,581 INFO L182 omatonBuilderFactory]: Interpolants [6150#true, 6151#false, 6152#(= |#Ultimate.C_memset_#t~loopctr17| 0), 6153#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 6154#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 6155#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 6156#(<= |#Ultimate.C_memset_#t~loopctr17| 4), 6157#(<= |#Ultimate.C_memset_#t~loopctr17| 5), 6158#(<= |#Ultimate.C_memset_#t~loopctr17| 6), 6159#(<= |#Ultimate.C_memset_#t~loopctr17| 7), 6160#(<= |#Ultimate.C_memset_#t~loopctr17| 8), 6161#(<= |#Ultimate.C_memset_#t~loopctr17| 9), 6162#(<= |#Ultimate.C_memset_#t~loopctr17| 10), 6163#(<= |#Ultimate.C_memset_#t~loopctr17| 11), 6164#(<= |#Ultimate.C_memset_#t~loopctr17| 12), 6165#(<= |#Ultimate.C_memset_#t~loopctr17| 13), 6166#(<= |#Ultimate.C_memset_#t~loopctr17| 14), 6167#(<= |#Ultimate.C_memset_#t~loopctr17| 15), 6168#(<= |#Ultimate.C_memset_#amount| 15)] [2018-02-04 16:20:11,581 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 16:20:11,582 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 16:20:11,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 16:20:11,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-02-04 16:20:11,582 INFO L87 Difference]: Start difference. First operand 132 states and 138 transitions. Second operand 19 states. [2018-02-04 16:20:11,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:20:11,622 INFO L93 Difference]: Finished difference Result 135 states and 141 transitions. [2018-02-04 16:20:11,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 16:20:11,623 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-02-04 16:20:11,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:20:11,624 INFO L225 Difference]: With dead ends: 135 [2018-02-04 16:20:11,624 INFO L226 Difference]: Without dead ends: 133 [2018-02-04 16:20:11,624 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 16:20:11,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-04 16:20:11,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-02-04 16:20:11,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-02-04 16:20:11,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 139 transitions. [2018-02-04 16:20:11,627 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 139 transitions. Word has length 49 [2018-02-04 16:20:11,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:20:11,627 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 139 transitions. [2018-02-04 16:20:11,627 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 16:20:11,628 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 139 transitions. [2018-02-04 16:20:11,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-04 16:20:11,628 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:20:11,628 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 16:20:11,628 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 16:20:11,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1439244912, now seen corresponding path program 16 times [2018-02-04 16:20:11,629 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:20:11,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:20:11,644 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:20:11,845 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 16:20:11,846 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:20:11,846 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-04 16:20:11,846 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:20:11,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:20:11,846 INFO L182 omatonBuilderFactory]: Interpolants [6439#true, 6440#false, 6441#(= 0 |ldv_malloc_#t~malloc4.offset|), 6442#(= 0 |ldv_malloc_#res.offset|), 6443#(= 0 |ldv_kobject_create_#t~ret14.offset|), 6444#(= 0 ldv_kobject_create_~kobj~1.offset), 6445#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 6446#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 6447#(and (= 0 |ldv_kobject_init_#in~kobj.offset|) (<= 16 (select |#length| |ldv_kobject_init_#in~kobj.base|))), 6448#(and (= 0 ldv_kobject_init_~kobj.offset) (<= 16 (select |#length| ldv_kobject_init_~kobj.base))), 6449#(and (<= 16 (select |#length| |ldv_kobject_init_internal_#in~kobj.base|)) (= 0 |ldv_kobject_init_internal_#in~kobj.offset|)), 6450#(and (<= 16 (select |#length| ldv_kobject_init_internal_~kobj.base)) (= ldv_kobject_init_internal_~kobj.offset 0)), 6451#(and (<= (+ |ldv_kref_init_#in~kref.offset| 4) (select |#length| |ldv_kref_init_#in~kref.base|)) (<= 12 |ldv_kref_init_#in~kref.offset|)), 6452#(and (<= 12 ldv_kref_init_~kref.offset) (<= (+ ldv_kref_init_~kref.offset 4) (select |#length| ldv_kref_init_~kref.base)))] [2018-02-04 16:20:11,846 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 16:20:11,847 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 16:20:11,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 16:20:11,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-04 16:20:11,847 INFO L87 Difference]: Start difference. First operand 133 states and 139 transitions. Second operand 14 states. [2018-02-04 16:20:12,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:20:12,055 INFO L93 Difference]: Finished difference Result 132 states and 138 transitions. [2018-02-04 16:20:12,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 16:20:12,055 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2018-02-04 16:20:12,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:20:12,056 INFO L225 Difference]: With dead ends: 132 [2018-02-04 16:20:12,056 INFO L226 Difference]: Without dead ends: 132 [2018-02-04 16:20:12,056 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 16:20:12,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-04 16:20:12,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-02-04 16:20:12,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-02-04 16:20:12,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 138 transitions. [2018-02-04 16:20:12,058 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 138 transitions. Word has length 50 [2018-02-04 16:20:12,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:20:12,058 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 138 transitions. [2018-02-04 16:20:12,058 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 16:20:12,058 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 138 transitions. [2018-02-04 16:20:12,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 16:20:12,059 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:20:12,059 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 16:20:12,059 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 16:20:12,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1539537353, now seen corresponding path program 1 times [2018-02-04 16:20:12,060 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:20:12,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:20:12,073 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:20:12,142 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 16:20:12,143 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:20:12,143 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 16:20:12,143 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:20:12,143 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 16:20:12,143 INFO L182 omatonBuilderFactory]: Interpolants [6725#true, 6726#false, 6727#(= 1 (select |#valid| |#Ultimate.C_memset_#ptr.base|)), 6728#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base)), 6729#(= 1 (select |#valid| |ldv_kobject_init_#in~kobj.base|)), 6730#(= 1 (select |#valid| ldv_kobject_init_~kobj.base)), 6731#(= 1 (select |#valid| |ldv_kobject_init_internal_#in~kobj.base|)), 6732#(= 1 (select |#valid| ldv_kobject_init_internal_~kobj.base)), 6733#(= 1 (select |#valid| |LDV_INIT_LIST_HEAD_#in~list.base|)), 6734#(= 1 (select |#valid| LDV_INIT_LIST_HEAD_~list.base))] [2018-02-04 16:20:12,144 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 16:20:12,144 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 16:20:12,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 16:20:12,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 16:20:12,144 INFO L87 Difference]: Start difference. First operand 132 states and 138 transitions. Second operand 10 states. [2018-02-04 16:20:12,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:20:12,295 INFO L93 Difference]: Finished difference Result 130 states and 136 transitions. [2018-02-04 16:20:12,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 16:20:12,295 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-02-04 16:20:12,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:20:12,295 INFO L225 Difference]: With dead ends: 130 [2018-02-04 16:20:12,295 INFO L226 Difference]: Without dead ends: 130 [2018-02-04 16:20:12,296 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 16:20:12,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-04 16:20:12,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-02-04 16:20:12,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-04 16:20:12,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 136 transitions. [2018-02-04 16:20:12,298 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 136 transitions. Word has length 55 [2018-02-04 16:20:12,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:20:12,298 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 136 transitions. [2018-02-04 16:20:12,298 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 16:20:12,298 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 136 transitions. [2018-02-04 16:20:12,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 16:20:12,299 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:20:12,299 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 16:20:12,299 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 16:20:12,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1539537352, now seen corresponding path program 1 times [2018-02-04 16:20:12,300 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:20:12,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:20:12,315 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:20:12,493 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 16:20:12,494 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:20:12,494 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-04 16:20:12,494 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:20:12,494 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 16:20:12,494 INFO L182 omatonBuilderFactory]: Interpolants [7008#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 7009#(and (= 0 |ldv_kobject_init_#in~kobj.offset|) (<= 16 (select |#length| |ldv_kobject_init_#in~kobj.base|))), 7010#(and (= 0 ldv_kobject_init_~kobj.offset) (<= 16 (select |#length| ldv_kobject_init_~kobj.base))), 7011#(and (<= 16 (select |#length| |ldv_kobject_init_internal_#in~kobj.base|)) (= 0 |ldv_kobject_init_internal_#in~kobj.offset|)), 7012#(and (<= 16 (select |#length| ldv_kobject_init_internal_~kobj.base)) (= ldv_kobject_init_internal_~kobj.offset 0)), 7013#(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|))), 7014#(and (<= (+ LDV_INIT_LIST_HEAD_~list.offset 12) (select |#length| LDV_INIT_LIST_HEAD_~list.base)) (<= 4 LDV_INIT_LIST_HEAD_~list.offset)), 7001#true, 7002#false, 7003#(= 0 |ldv_malloc_#t~malloc4.offset|), 7004#(= 0 |ldv_malloc_#res.offset|), 7005#(= 0 |ldv_kobject_create_#t~ret14.offset|), 7006#(= 0 ldv_kobject_create_~kobj~1.offset), 7007#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)))] [2018-02-04 16:20:12,495 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 16:20:12,495 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 16:20:12,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 16:20:12,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-04 16:20:12,495 INFO L87 Difference]: Start difference. First operand 130 states and 136 transitions. Second operand 14 states. [2018-02-04 16:20:12,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:20:12,768 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2018-02-04 16:20:12,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 16:20:12,769 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2018-02-04 16:20:12,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:20:12,770 INFO L225 Difference]: With dead ends: 128 [2018-02-04 16:20:12,770 INFO L226 Difference]: Without dead ends: 128 [2018-02-04 16:20:12,770 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 16:20:12,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-04 16:20:12,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-02-04 16:20:12,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-02-04 16:20:12,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 134 transitions. [2018-02-04 16:20:12,773 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 134 transitions. Word has length 55 [2018-02-04 16:20:12,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:20:12,773 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 134 transitions. [2018-02-04 16:20:12,773 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 16:20:12,773 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 134 transitions. [2018-02-04 16:20:12,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-04 16:20:12,774 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:20:12,774 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] [2018-02-04 16:20:12,774 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 16:20:12,774 INFO L82 PathProgramCache]: Analyzing trace with hash -2081152149, now seen corresponding path program 1 times [2018-02-04 16:20:12,777 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:20:12,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:20:12,788 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:20:12,831 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 16:20:12,831 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:20:12,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 16:20:12,831 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:20:12,832 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 16:20:12,832 INFO L182 omatonBuilderFactory]: Interpolants [7280#false, 7281#(not (= |ldv_malloc_#t~malloc4.base| 0)), 7282#(not (= |ldv_malloc_#res.base| 0)), 7283#(not (= |ldv_kobject_create_#t~ret14.base| 0)), 7284#(not (= ldv_kobject_create_~kobj~1.base 0)), 7285#(= ldv_kobject_init_~kobj.base |ldv_kobject_init_#in~kobj.base|), 7286#(= 0 |ldv_kobject_init_#in~kobj.base|), 7279#true] [2018-02-04 16:20:12,832 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 16:20:12,832 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 16:20:12,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 16:20:12,833 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 16:20:12,833 INFO L87 Difference]: Start difference. First operand 128 states and 134 transitions. Second operand 8 states. [2018-02-04 16:20:12,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:20:12,867 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2018-02-04 16:20:12,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 16:20:12,867 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2018-02-04 16:20:12,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:20:12,868 INFO L225 Difference]: With dead ends: 130 [2018-02-04 16:20:12,868 INFO L226 Difference]: Without dead ends: 128 [2018-02-04 16:20:12,868 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 16:20:12,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-04 16:20:12,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-02-04 16:20:12,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-02-04 16:20:12,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 133 transitions. [2018-02-04 16:20:12,871 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 133 transitions. Word has length 62 [2018-02-04 16:20:12,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:20:12,871 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 133 transitions. [2018-02-04 16:20:12,871 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 16:20:12,871 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 133 transitions. [2018-02-04 16:20:12,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 16:20:12,872 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:20:12,872 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] [2018-02-04 16:20:12,872 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 16:20:12,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1026617864, now seen corresponding path program 1 times [2018-02-04 16:20:12,873 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:20:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:20:12,887 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:20:12,962 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 16:20:12,962 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:20:12,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 16:20:12,963 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:20:12,963 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 16:20:12,963 INFO L182 omatonBuilderFactory]: Interpolants [7552#(not (= |ldv_malloc_#res.base| 0)), 7553#(not (= |ldv_kobject_create_#t~ret14.base| 0)), 7554#(not (= ldv_kobject_create_~kobj~1.base 0)), 7555#(= ldv_kobject_init_~kobj.base |ldv_kobject_init_#in~kobj.base|), 7556#(= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|), 7557#(= 0 |ldv_kobject_init_internal_#in~kobj.base|), 7558#(= 0 |ldv_kobject_init_#in~kobj.base|), 7549#true, 7550#false, 7551#(not (= |ldv_malloc_#t~malloc4.base| 0))] [2018-02-04 16:20:12,963 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 16:20:12,963 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 16:20:12,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 16:20:12,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 16:20:12,964 INFO L87 Difference]: Start difference. First operand 128 states and 133 transitions. Second operand 10 states. [2018-02-04 16:20:13,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:20:13,016 INFO L93 Difference]: Finished difference Result 132 states and 136 transitions. [2018-02-04 16:20:13,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 16:20:13,017 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2018-02-04 16:20:13,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:20:13,017 INFO L225 Difference]: With dead ends: 132 [2018-02-04 16:20:13,017 INFO L226 Difference]: Without dead ends: 128 [2018-02-04 16:20:13,018 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 16:20:13,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-04 16:20:13,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-02-04 16:20:13,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-02-04 16:20:13,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 132 transitions. [2018-02-04 16:20:13,020 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 132 transitions. Word has length 67 [2018-02-04 16:20:13,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:20:13,021 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 132 transitions. [2018-02-04 16:20:13,021 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 16:20:13,021 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 132 transitions. [2018-02-04 16:20:13,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-04 16:20:13,022 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:20:13,022 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] [2018-02-04 16:20:13,022 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 16:20:13,022 INFO L82 PathProgramCache]: Analyzing trace with hash 918138560, now seen corresponding path program 1 times [2018-02-04 16:20:13,023 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:20:13,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:20:13,037 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:20:13,259 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 16:20:13,259 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:20:13,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-02-04 16:20:13,260 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:20:13,260 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 16:20:13,260 INFO L182 omatonBuilderFactory]: Interpolants [7840#(= 1 (select |#valid| |ldv_kobject_put_#in~kobj.base|)), 7841#(= 1 (select |#valid| ldv_kobject_put_~kobj.base)), 7842#(= 1 (select |#valid| |ldv_kref_put_#in~kref.base|)), 7843#(= 1 (select |#valid| ldv_kref_put_~kref.base)), 7844#(= 1 (select |#valid| |ldv_kref_sub_#in~kref.base|)), 7845#(= 1 (select |#valid| ldv_kref_sub_~kref.base)), 7846#(= 1 (select |#valid| |ldv_atomic_sub_return_#in~v.base|)), 7847#(= 1 (select |#valid| ldv_atomic_sub_return_~v.base)), 7825#true, 7826#false, 7827#(= ldv_kobject_init_~kobj.base |ldv_kobject_init_#in~kobj.base|), 7828#(= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|), 7829#(= LDV_INIT_LIST_HEAD_~list.base |LDV_INIT_LIST_HEAD_#in~list.base|), 7830#(and (= 1 (select |#valid| LDV_INIT_LIST_HEAD_~list.base)) (= LDV_INIT_LIST_HEAD_~list.base |LDV_INIT_LIST_HEAD_#in~list.base|)), 7831#(= 1 (select |#valid| |LDV_INIT_LIST_HEAD_#in~list.base|)), 7832#(= 1 (select |#valid| |ldv_kobject_init_internal_#in~kobj.base|)), 7833#(= 1 (select |#valid| |ldv_kobject_init_#in~kobj.base|)), 7834#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base)), 7835#(= 1 (select |#valid| |ldv_kobject_create_#res.base|)), 7836#(= 1 (select |#valid| |entry_point_#t~ret16.base|)), 7837#(= 1 (select |#valid| entry_point_~kobj~2.base)), 7838#(= 1 (select |#valid| |f_22_put_#in~kobj.base|)), 7839#(= 1 (select |#valid| f_22_put_~kobj.base))] [2018-02-04 16:20:13,260 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 16:20:13,261 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 16:20:13,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 16:20:13,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2018-02-04 16:20:13,261 INFO L87 Difference]: Start difference. First operand 128 states and 132 transitions. Second operand 23 states. [2018-02-04 16:20:13,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:20:13,632 INFO L93 Difference]: Finished difference Result 155 states and 164 transitions. [2018-02-04 16:20:13,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 16:20:13,632 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 78 [2018-02-04 16:20:13,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:20:13,633 INFO L225 Difference]: With dead ends: 155 [2018-02-04 16:20:13,633 INFO L226 Difference]: Without dead ends: 155 [2018-02-04 16:20:13,633 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=853, Unknown=0, NotChecked=0, Total=930 [2018-02-04 16:20:13,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-02-04 16:20:13,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 150. [2018-02-04 16:20:13,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-04 16:20:13,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 160 transitions. [2018-02-04 16:20:13,637 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 160 transitions. Word has length 78 [2018-02-04 16:20:13,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:20:13,637 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 160 transitions. [2018-02-04 16:20:13,637 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 16:20:13,637 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 160 transitions. [2018-02-04 16:20:13,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-04 16:20:13,638 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:20:13,638 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] [2018-02-04 16:20:13,638 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 16:20:13,638 INFO L82 PathProgramCache]: Analyzing trace with hash 918138561, now seen corresponding path program 1 times [2018-02-04 16:20:13,639 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:20:13,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:20:13,655 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:20:13,984 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 16:20:13,985 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:20:13,985 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-02-04 16:20:13,985 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:20:13,985 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 16:20:13,986 INFO L182 omatonBuilderFactory]: Interpolants [8169#true, 8170#false, 8171#(= 0 |ldv_malloc_#t~malloc4.offset|), 8172#(= 0 |ldv_malloc_#res.offset|), 8173#(= 0 |ldv_kobject_create_#t~ret14.offset|), 8174#(= 0 ldv_kobject_create_~kobj~1.offset), 8175#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 8176#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 8177#(and (= 0 |ldv_kobject_create_#res.offset|) (<= 16 (select |#length| |ldv_kobject_create_#res.base|))), 8178#(and (<= 16 (select |#length| |entry_point_#t~ret16.base|)) (= 0 |entry_point_#t~ret16.offset|)), 8179#(and (= 0 entry_point_~kobj~2.offset) (<= 16 (select |#length| entry_point_~kobj~2.base))), 8180#(and (<= 16 (select |#length| |f_22_put_#in~kobj.base|)) (= 0 |f_22_put_#in~kobj.offset|)), 8181#(and (= 0 f_22_put_~kobj.offset) (<= 16 (select |#length| f_22_put_~kobj.base))), 8182#(and (<= 16 (select |#length| |ldv_kobject_put_#in~kobj.base|)) (= 0 |ldv_kobject_put_#in~kobj.offset|)), 8183#(and (= ldv_kobject_put_~kobj.offset 0) (<= 16 (select |#length| ldv_kobject_put_~kobj.base))), 8184#(and (<= 12 |ldv_kref_put_#in~kref.offset|) (<= (+ |ldv_kref_put_#in~kref.offset| 4) (select |#length| |ldv_kref_put_#in~kref.base|))), 8185#(and (<= 12 ldv_kref_put_~kref.offset) (<= (+ ldv_kref_put_~kref.offset 4) (select |#length| ldv_kref_put_~kref.base))), 8186#(and (<= (+ |ldv_kref_sub_#in~kref.offset| 4) (select |#length| |ldv_kref_sub_#in~kref.base|)) (<= 12 |ldv_kref_sub_#in~kref.offset|)), 8187#(and (<= (+ ldv_kref_sub_~kref.offset 4) (select |#length| ldv_kref_sub_~kref.base)) (<= 12 ldv_kref_sub_~kref.offset)), 8188#(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|)), 8189#(and (<= (+ ldv_atomic_sub_return_~v.offset 4) (select |#length| ldv_atomic_sub_return_~v.base)) (<= 12 ldv_atomic_sub_return_~v.offset))] [2018-02-04 16:20:13,986 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 16:20:13,986 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 16:20:13,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 16:20:13,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2018-02-04 16:20:13,987 INFO L87 Difference]: Start difference. First operand 150 states and 160 transitions. Second operand 21 states. [2018-02-04 16:20:14,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:20:14,438 INFO L93 Difference]: Finished difference Result 148 states and 156 transitions. [2018-02-04 16:20:14,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 16:20:14,438 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 78 [2018-02-04 16:20:14,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:20:14,439 INFO L225 Difference]: With dead ends: 148 [2018-02-04 16:20:14,439 INFO L226 Difference]: Without dead ends: 148 [2018-02-04 16:20:14,440 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2018-02-04 16:20:14,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-02-04 16:20:14,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-02-04 16:20:14,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-04 16:20:14,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 156 transitions. [2018-02-04 16:20:14,443 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 156 transitions. Word has length 78 [2018-02-04 16:20:14,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:20:14,443 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 156 transitions. [2018-02-04 16:20:14,444 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 16:20:14,444 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 156 transitions. [2018-02-04 16:20:14,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-04 16:20:14,444 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:20:14,444 INFO L351 BasicCegarLoop]: trace histogram [16, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:20:14,444 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 16:20:14,445 INFO L82 PathProgramCache]: Analyzing trace with hash 404728909, now seen corresponding path program 1 times [2018-02-04 16:20:14,445 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:20:14,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:20:14,460 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:20:14,557 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-04 16:20:14,557 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:20:14,558 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-04 16:20:14,558 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:20:14,558 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 16:20:14,558 INFO L182 omatonBuilderFactory]: Interpolants [8512#(= 0 |f_22_put_#in~kobj.base|), 8500#true, 8501#false, 8502#(not (= |ldv_malloc_#t~malloc4.base| 0)), 8503#(not (= |ldv_malloc_#res.base| 0)), 8504#(not (= |ldv_kobject_create_#t~ret14.base| 0)), 8505#(not (= ldv_kobject_create_~kobj~1.base 0)), 8506#(not (= |ldv_kobject_create_#res.base| 0)), 8507#(not (= |entry_point_#t~ret16.base| 0)), 8508#(not (= entry_point_~kobj~2.base 0)), 8509#(= f_22_put_~kobj.base |f_22_put_#in~kobj.base|), 8510#(= ldv_kobject_put_~kobj.base |ldv_kobject_put_#in~kobj.base|), 8511#(= 0 |ldv_kobject_put_#in~kobj.base|)] [2018-02-04 16:20:14,558 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-04 16:20:14,558 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 16:20:14,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 16:20:14,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-02-04 16:20:14,559 INFO L87 Difference]: Start difference. First operand 148 states and 156 transitions. Second operand 13 states. [2018-02-04 16:20:14,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:20:14,621 INFO L93 Difference]: Finished difference Result 152 states and 158 transitions. [2018-02-04 16:20:14,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 16:20:14,621 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 85 [2018-02-04 16:20:14,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:20:14,621 INFO L225 Difference]: With dead ends: 152 [2018-02-04 16:20:14,621 INFO L226 Difference]: Without dead ends: 146 [2018-02-04 16:20:14,622 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-02-04 16:20:14,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-04 16:20:14,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-02-04 16:20:14,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-04 16:20:14,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 152 transitions. [2018-02-04 16:20:14,624 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 152 transitions. Word has length 85 [2018-02-04 16:20:14,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:20:14,624 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 152 transitions. [2018-02-04 16:20:14,624 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 16:20:14,625 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 152 transitions. [2018-02-04 16:20:14,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-04 16:20:14,625 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:20:14,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:20:14,625 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 16:20:14,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1910258156, now seen corresponding path program 1 times [2018-02-04 16:20:14,626 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:20:14,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:20:14,636 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:20:14,924 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 16:20:14,924 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:20:14,924 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2018-02-04 16:20:14,925 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:20:14,925 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 16:20:14,925 INFO L182 omatonBuilderFactory]: Interpolants [8832#(= 1 (select |#valid| |f_22_put_#in~kobj.base|)), 8833#(= 1 (select |#valid| f_22_put_~kobj.base)), 8834#(= 1 (select |#valid| |ldv_kobject_put_#in~kobj.base|)), 8835#(= 1 (select |#valid| ldv_kobject_put_~kobj.base)), 8836#(= 1 (select |#valid| |ldv_kref_put_#in~kref.base|)), 8837#(= 1 (select |#valid| ldv_kref_put_~kref.base)), 8838#(= 1 (select |#valid| |ldv_kref_sub_#in~kref.base|)), 8839#(= 1 (select |#valid| ldv_kref_sub_~kref.base)), 8840#(= 1 (select |#valid| |##fun~$Pointer$~TO~VOID_#in~kref.base|)), 8841#(= 1 (select |#valid| |##fun~$Pointer$~TO~VOID_#~kref.base|)), 8842#(= 1 (select |#valid| |ldv_kobject_release_#in~kref.base|)), 8843#(= 1 (select |#valid| ldv_kobject_release_~kobj~0.base)), 8844#(= 1 (select |#valid| |ldv_kobject_cleanup_#in~kobj.base|)), 8845#(= 1 (select |#valid| ldv_kobject_cleanup_~kobj.base)), 8819#true, 8820#false, 8821#(= ldv_kobject_init_~kobj.base |ldv_kobject_init_#in~kobj.base|), 8822#(= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|), 8823#(= LDV_INIT_LIST_HEAD_~list.base |LDV_INIT_LIST_HEAD_#in~list.base|), 8824#(and (= 1 (select |#valid| LDV_INIT_LIST_HEAD_~list.base)) (= LDV_INIT_LIST_HEAD_~list.base |LDV_INIT_LIST_HEAD_#in~list.base|)), 8825#(= 1 (select |#valid| |LDV_INIT_LIST_HEAD_#in~list.base|)), 8826#(= 1 (select |#valid| |ldv_kobject_init_internal_#in~kobj.base|)), 8827#(= 1 (select |#valid| |ldv_kobject_init_#in~kobj.base|)), 8828#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base)), 8829#(= 1 (select |#valid| |ldv_kobject_create_#res.base|)), 8830#(= 1 (select |#valid| |entry_point_#t~ret16.base|)), 8831#(= 1 (select |#valid| entry_point_~kobj~2.base))] [2018-02-04 16:20:14,925 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 16:20:14,925 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 16:20:14,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 16:20:14,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2018-02-04 16:20:14,925 INFO L87 Difference]: Start difference. First operand 146 states and 152 transitions. Second operand 27 states. [2018-02-04 16:20:15,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:20:15,387 INFO L93 Difference]: Finished difference Result 156 states and 165 transitions. [2018-02-04 16:20:15,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 16:20:15,387 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 92 [2018-02-04 16:20:15,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:20:15,388 INFO L225 Difference]: With dead ends: 156 [2018-02-04 16:20:15,388 INFO L226 Difference]: Without dead ends: 156 [2018-02-04 16:20:15,388 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=1239, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 16:20:15,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-02-04 16:20:15,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2018-02-04 16:20:15,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-04 16:20:15,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 162 transitions. [2018-02-04 16:20:15,392 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 162 transitions. Word has length 92 [2018-02-04 16:20:15,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:20:15,392 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 162 transitions. [2018-02-04 16:20:15,392 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 16:20:15,392 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 162 transitions. [2018-02-04 16:20:15,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-04 16:20:15,392 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:20:15,393 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 16:20:15,393 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 16:20:15,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1910258155, now seen corresponding path program 1 times [2018-02-04 16:20:15,393 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:20:15,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:20:15,408 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:20:15,819 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-04 16:20:15,819 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:20:15,819 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-02-04 16:20:15,820 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:20:15,820 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 16:20:15,820 INFO L182 omatonBuilderFactory]: Interpolants [9174#true, 9175#false, 9176#(= 0 |ldv_malloc_#t~malloc4.offset|), 9177#(= 0 |ldv_malloc_#res.offset|), 9178#(= 0 |ldv_kobject_create_#t~ret14.offset|), 9179#(= 0 ldv_kobject_create_~kobj~1.offset), 9180#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 9181#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 9182#(and (= 0 |ldv_kobject_create_#res.offset|) (<= 16 (select |#length| |ldv_kobject_create_#res.base|))), 9183#(and (<= 16 (select |#length| |entry_point_#t~ret16.base|)) (= 0 |entry_point_#t~ret16.offset|)), 9184#(and (= 0 entry_point_~kobj~2.offset) (<= 16 (select |#length| entry_point_~kobj~2.base))), 9185#(and (<= 16 (select |#length| |f_22_put_#in~kobj.base|)) (= 0 |f_22_put_#in~kobj.offset|)), 9186#(and (= 0 f_22_put_~kobj.offset) (<= 16 (select |#length| f_22_put_~kobj.base))), 9187#(and (<= 16 (select |#length| |ldv_kobject_put_#in~kobj.base|)) (= 0 |ldv_kobject_put_#in~kobj.offset|)), 9188#(and (= ldv_kobject_put_~kobj.offset 0) (<= 16 (select |#length| ldv_kobject_put_~kobj.base))), 9189#(and (<= 12 |ldv_kref_put_#in~kref.offset|) (<= (+ |ldv_kref_put_#in~kref.offset| 4) (select |#length| |ldv_kref_put_#in~kref.base|))), 9190#(and (<= 12 ldv_kref_put_~kref.offset) (<= (+ ldv_kref_put_~kref.offset 4) (select |#length| ldv_kref_put_~kref.base))), 9191#(and (<= (+ |ldv_kref_sub_#in~kref.offset| 4) (select |#length| |ldv_kref_sub_#in~kref.base|)) (<= 12 |ldv_kref_sub_#in~kref.offset|)), 9192#(and (<= (+ ldv_kref_sub_~kref.offset 4) (select |#length| ldv_kref_sub_~kref.base)) (<= 12 ldv_kref_sub_~kref.offset)), 9193#(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|))), 9194#(and (<= 12 |##fun~$Pointer$~TO~VOID_#~kref.offset|) (<= (+ |##fun~$Pointer$~TO~VOID_#~kref.offset| 4) (select |#length| |##fun~$Pointer$~TO~VOID_#~kref.base|))), 9195#(and (<= 12 |ldv_kobject_release_#in~kref.offset|) (<= (+ |ldv_kobject_release_#in~kref.offset| 4) (select |#length| |ldv_kobject_release_#in~kref.base|))), 9196#(and (<= (+ ldv_kobject_release_~kobj~0.offset 16) (select |#length| ldv_kobject_release_~kobj~0.base)) (<= 0 ldv_kobject_release_~kobj~0.offset)), 9197#(and (<= (+ |ldv_kobject_cleanup_#in~kobj.offset| 16) (select |#length| |ldv_kobject_cleanup_#in~kobj.base|)) (<= 0 |ldv_kobject_cleanup_#in~kobj.offset|)), 9198#(and (<= 0 ldv_kobject_cleanup_~kobj.offset) (<= (+ ldv_kobject_cleanup_~kobj.offset 16) (select |#length| ldv_kobject_cleanup_~kobj.base)))] [2018-02-04 16:20:15,820 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 16:20:15,820 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 16:20:15,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 16:20:15,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2018-02-04 16:20:15,821 INFO L87 Difference]: Start difference. First operand 152 states and 162 transitions. Second operand 25 states. [2018-02-04 16:20:16,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:20:16,398 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2018-02-04 16:20:16,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 16:20:16,398 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 92 [2018-02-04 16:20:16,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:20:16,399 INFO L225 Difference]: With dead ends: 151 [2018-02-04 16:20:16,399 INFO L226 Difference]: Without dead ends: 151 [2018-02-04 16:20:16,399 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 16:20:16,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-04 16:20:16,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-02-04 16:20:16,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-04 16:20:16,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2018-02-04 16:20:16,402 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 92 [2018-02-04 16:20:16,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:20:16,402 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2018-02-04 16:20:16,402 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 16:20:16,402 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2018-02-04 16:20:16,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-04 16:20:16,403 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:20:16,403 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 16:20:16,403 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 16:20:16,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1807050507, now seen corresponding path program 1 times [2018-02-04 16:20:16,404 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:20:16,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:20:16,414 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:20:16,634 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 16:20:16,634 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:20:16,634 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-02-04 16:20:16,635 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:20:16,635 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 16:20:16,635 INFO L182 omatonBuilderFactory]: Interpolants [9536#(<= |##fun~$Pointer$~TO~VOID_#in~kref.offset| 12), 9537#(<= |##fun~$Pointer$~TO~VOID_#~kref.offset| 12), 9538#(<= |ldv_kobject_release_#in~kref.offset| 12), 9539#(<= ldv_kobject_release_~kobj~0.offset 0), 9540#(<= |ldv_kobject_cleanup_#in~kobj.offset| 0), 9541#(<= ldv_kobject_cleanup_~kobj.offset 0), 9542#(and (<= 0 ldv_kobject_cleanup_~kobj.offset) (<= ldv_kobject_cleanup_~kobj.offset 0)), 9519#true, 9520#false, 9521#(= 0 |ldv_malloc_#t~malloc4.offset|), 9522#(= 0 |ldv_malloc_#res.offset|), 9523#(= 0 |ldv_kobject_create_#t~ret14.offset|), 9524#(= 0 ldv_kobject_create_~kobj~1.offset), 9525#(= 0 |ldv_kobject_create_#res.offset|), 9526#(= 0 |entry_point_#t~ret16.offset|), 9527#(= 0 entry_point_~kobj~2.offset), 9528#(= 0 |f_22_put_#in~kobj.offset|), 9529#(= 0 f_22_put_~kobj.offset), 9530#(= 0 |ldv_kobject_put_#in~kobj.offset|), 9531#(= ldv_kobject_put_~kobj.offset 0), 9532#(<= |ldv_kref_put_#in~kref.offset| 12), 9533#(<= ldv_kref_put_~kref.offset 12), 9534#(<= |ldv_kref_sub_#in~kref.offset| 12), 9535#(<= ldv_kref_sub_~kref.offset 12)] [2018-02-04 16:20:16,635 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 16:20:16,635 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 16:20:16,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 16:20:16,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2018-02-04 16:20:16,636 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand 24 states. [2018-02-04 16:20:16,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:20:16,857 INFO L93 Difference]: Finished difference Result 150 states and 159 transitions. [2018-02-04 16:20:16,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 16:20:16,857 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 94 [2018-02-04 16:20:16,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:20:16,858 INFO L225 Difference]: With dead ends: 150 [2018-02-04 16:20:16,858 INFO L226 Difference]: Without dead ends: 150 [2018-02-04 16:20:16,858 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=1034, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 16:20:16,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-04 16:20:16,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-02-04 16:20:16,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-04 16:20:16,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 159 transitions. [2018-02-04 16:20:16,860 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 159 transitions. Word has length 94 [2018-02-04 16:20:16,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:20:16,860 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 159 transitions. [2018-02-04 16:20:16,860 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 16:20:16,861 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 159 transitions. [2018-02-04 16:20:16,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-02-04 16:20:16,861 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:20:16,861 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:20:16,861 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 16:20:16,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1408747434, now seen corresponding path program 1 times [2018-02-04 16:20:16,862 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:20:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:20:16,925 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:20:19,626 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 16:20:19,626 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:20:19,626 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-02-04 16:20:19,626 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:20:19,626 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 16:20:19,627 INFO L182 omatonBuilderFactory]: Interpolants [9863#true, 9864#false, 9865#(= 0 |ldv_malloc_#t~malloc4.offset|), 9866#(= 0 |ldv_malloc_#res.offset|), 9867#(= 0 |ldv_kobject_create_#t~ret14.offset|), 9868#(= 0 ldv_kobject_create_~kobj~1.offset), 9869#(or (= |#Ultimate.C_memset_#t~loopctr17| 0) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 9870#(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)) (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)) (not (= |#Ultimate.C_memset_#value| 0))), 9871#(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| |#Ultimate.C_memset_#ptr.offset|) 1) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (not (= |#Ultimate.C_memset_#value| 0))), 9872#(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|) 2)), 9873#(or (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 3) (= 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))), 9874#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (not (= |#Ultimate.C_memset_#value| 0)) (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#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|) 4)), 9875#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (not (= |#Ultimate.C_memset_#value| 0)) (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#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|) 5)), 9876#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (not (= |#Ultimate.C_memset_#value| 0)) (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#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|) 6)), 9877#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (not (= |#Ultimate.C_memset_#value| 0)) (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#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|) 7)), 9878#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (not (= |#Ultimate.C_memset_#value| 0)) (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#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)), 9879#(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)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 9) (not (= |#Ultimate.C_memset_#value| 0))), 9880#(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| |#Ultimate.C_memset_#ptr.offset|) 10) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (not (= |#Ultimate.C_memset_#value| 0))), 9881#(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)), 9882#(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)), 9883#(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| |#Ultimate.C_memset_#ptr.offset|) 13) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (not (= |#Ultimate.C_memset_#value| 0))), 9884#(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)), 9885#(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)), 9886#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) 15) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (= 0 (select (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) 0)) (not (= |#Ultimate.C_memset_#value| 0))), 9887#(and (= 0 ldv_kobject_create_~kobj~1.offset) (= 0 (select (select |#memory_$Pointer$.offset| ldv_kobject_create_~kobj~1.base) 0))), 9888#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 9889#(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)), 9890#(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)))), 9891#(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)))), 9892#(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)|)), 9893#(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|))), 9894#(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)))), 9895#(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) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 9896#(and (= LDV_INIT_LIST_HEAD_~list.base |LDV_INIT_LIST_HEAD_#in~list.base|) (= (store (select |old(#memory_$Pointer$.offset)| LDV_INIT_LIST_HEAD_~list.base) LDV_INIT_LIST_HEAD_~list.offset (select (select |#memory_$Pointer$.offset| LDV_INIT_LIST_HEAD_~list.base) LDV_INIT_LIST_HEAD_~list.offset)) (select |#memory_$Pointer$.offset| LDV_INIT_LIST_HEAD_~list.base)) (<= |LDV_INIT_LIST_HEAD_#in~list.offset| LDV_INIT_LIST_HEAD_~list.offset)), 9897#(and (= (store (store (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|)))) (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|)))) (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|)))) (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|)) (or (= (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|) (store (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|))))) (<= |LDV_INIT_LIST_HEAD_#in~list.offset| (@diff (store (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|)))) (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|)))) (or (= (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|)) (<= |LDV_INIT_LIST_HEAD_#in~list.offset| (@diff (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|))))), 9898#(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))), 9899#(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))), 9900#(and (= 0 (select (select |#memory_$Pointer$.offset| |ldv_kobject_create_#res.base|) 0)) (= 0 |ldv_kobject_create_#res.offset|)), 9901#(and (= 0 (select (select |#memory_$Pointer$.offset| |entry_point_#t~ret16.base|) 0)) (= 0 |entry_point_#t~ret16.offset|)), 9902#(and (= 0 entry_point_~kobj~2.offset) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~kobj~2.base) 0))), 9903#(and (= 0 (select (select |#memory_$Pointer$.offset| |f_22_put_#in~kobj.base|) 0)) (= 0 |f_22_put_#in~kobj.offset|)), 9904#(and (= 0 (select (select |#memory_$Pointer$.offset| f_22_put_~kobj.base) 0)) (= 0 f_22_put_~kobj.offset)), 9905#(and (= 0 |ldv_kobject_put_#in~kobj.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ldv_kobject_put_#in~kobj.base|) 0))), 9906#(and (= ldv_kobject_put_~kobj.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| ldv_kobject_put_~kobj.base) 0))), 9907#(and (<= 12 |ldv_kref_put_#in~kref.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ldv_kref_put_#in~kref.base|) 0))), 9908#(and (<= 12 ldv_kref_put_~kref.offset) (= 0 (select (select |#memory_$Pointer$.offset| ldv_kref_put_~kref.base) 0))), 9909#(and (<= 12 |ldv_kref_sub_#in~kref.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ldv_kref_sub_#in~kref.base|) 0))), 9910#(and (= 0 (select (select |#memory_$Pointer$.offset| ldv_kref_sub_~kref.base) 0)) (<= 12 ldv_kref_sub_~kref.offset)), 9911#(and (<= |ldv_atomic_sub_return_#in~v.offset| ldv_atomic_sub_return_~v.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ldv_atomic_sub_return_~v.base |ldv_atomic_sub_return_#in~v.base|)), 9912#(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|))))), 9913#(= 0 (select (select |#memory_$Pointer$.offset| ldv_kref_sub_~kref.base) 0)), 9914#(= 0 (select (select |#memory_$Pointer$.offset| |##fun~$Pointer$~TO~VOID_#in~kref.base|) 0)), 9915#(= 0 (select (select |#memory_$Pointer$.offset| |##fun~$Pointer$~TO~VOID_#~kref.base|) 0)), 9916#(= 0 (select (select |#memory_$Pointer$.offset| |ldv_kobject_release_#in~kref.base|) 0)), 9917#(= 0 (select (select |#memory_$Pointer$.offset| ldv_kobject_release_~kobj~0.base) 0)), 9918#(= 0 (select (select |#memory_$Pointer$.offset| |ldv_kobject_cleanup_#in~kobj.base|) 0)), 9919#(or (not (= 0 ldv_kobject_cleanup_~kobj.offset)) (= 0 (select (select |#memory_$Pointer$.offset| ldv_kobject_cleanup_~kobj.base) ldv_kobject_cleanup_~kobj.offset))), 9920#(or (= 0 |ldv_kobject_cleanup_#t~mem12.offset|) (not (= 0 ldv_kobject_cleanup_~kobj.offset))), 9921#(or (not (= 0 ldv_kobject_cleanup_~kobj.offset)) (= 0 ldv_kobject_cleanup_~name~0.offset)), 9922#(= 0 ldv_kobject_cleanup_~name~0.offset)] [2018-02-04 16:20:19,628 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 16:20:19,628 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-02-04 16:20:19,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-02-04 16:20:19,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=3247, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 16:20:19,630 INFO L87 Difference]: Start difference. First operand 150 states and 159 transitions. Second operand 60 states. [2018-02-04 16:20:22,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:20:22,091 INFO L93 Difference]: Finished difference Result 164 states and 170 transitions. [2018-02-04 16:20:22,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-04 16:20:22,091 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 96 [2018-02-04 16:20:22,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:20:22,092 INFO L225 Difference]: With dead ends: 164 [2018-02-04 16:20:22,092 INFO L226 Difference]: Without dead ends: 164 [2018-02-04 16:20:22,093 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=584, Invalid=6726, Unknown=0, NotChecked=0, Total=7310 [2018-02-04 16:20:22,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-02-04 16:20:22,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2018-02-04 16:20:22,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-02-04 16:20:22,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 170 transitions. [2018-02-04 16:20:22,096 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 170 transitions. Word has length 96 [2018-02-04 16:20:22,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:20:22,097 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 170 transitions. [2018-02-04 16:20:22,097 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-02-04 16:20:22,097 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 170 transitions. [2018-02-04 16:20:22,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-02-04 16:20:22,097 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:20:22,098 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:20:22,098 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 16:20:22,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1408747433, now seen corresponding path program 1 times [2018-02-04 16:20:22,099 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:20:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:20:22,156 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:20:24,942 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 16 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:20:24,943 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:20:24,943 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-02-04 16:20:24,943 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:20:24,943 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 16:20:24,944 INFO L182 omatonBuilderFactory]: Interpolants [10302#true, 10303#false, 10304#(= 0 |ldv_malloc_#t~malloc4.offset|), 10305#(= 0 |ldv_malloc_#res.offset|), 10306#(= 0 |ldv_kobject_create_#t~ret14.offset|), 10307#(= 0 ldv_kobject_create_~kobj~1.offset), 10308#(or (<= 2 (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|)) (= 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|) 0)), 10309#(or (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 1) (<= 3 (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|)) (= 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))), 10310#(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)) (<= 4 (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 2)), 10311#(or (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 3) (<= 5 (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|)) (= 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))), 10312#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 0) 0)) (<= 6 (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 4)), 10313#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 0) 0)) (<= 7 (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 5)), 10314#(or (<= 8 (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|)) (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 6)), 10315#(or (<= 9 (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|)) (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 7)), 10316#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 0) 0)) (<= 10 (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 8)), 10317#(or (<= 11 (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|)) (= 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|) 9)), 10318#(or (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 10) (<= 12 (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|)) (= 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))), 10319#(or (<= 13 (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|)) (= 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)), 10320#(or (<= 14 (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|)) (= 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)), 10321#(or (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 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)) (<= 15 (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|))), 10322#(or (<= 16 (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|)) (= 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)), 10323#(or (<= 17 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|)) (and (= 0 (select (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) 0)) (<= |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#amount|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 15)), 10324#(or (<= 17 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) 15) (= 0 (select (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 10325#(and (= 0 ldv_kobject_create_~kobj~1.offset) (= 0 (select (select |#memory_$Pointer$.base| ldv_kobject_create_~kobj~1.base) 0))), 10326#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 10327#(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)), 10328#(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))), 10329#(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)))), 10330#(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|)), 10331#(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|))), 10332#(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)))), 10333#(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|)), 10334#(and (= LDV_INIT_LIST_HEAD_~list.base |LDV_INIT_LIST_HEAD_#in~list.base|) (not (= (+ LDV_INIT_LIST_HEAD_~list.offset 4) 0)) (= (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|)), 10335#(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|)) (not (= (@diff (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|)) 0))) (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|))))) (not (= (@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|)) 0))) (= (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|)))))), 10336#(or (and (or (= (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (not (= (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) 0))) (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|))))) (not (= (@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|)) 0))) (= (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 (= (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|)) (not (= (@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|)) 0)))) (not (= |ldv_kobject_init_internal_#in~kobj.offset| 0))), 10337#(or (and (or (not (= (@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|)) 0)) (= (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|))) (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|))))) (not (= (@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|)) 0))) (or (not (= (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) 0)) (= (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|))) (not (= |ldv_kobject_init_#in~kobj.offset| 0))), 10338#(and (= 0 (select (select |#memory_$Pointer$.base| |ldv_kobject_create_#res.base|) 0)) (= 0 |ldv_kobject_create_#res.offset|)), 10339#(and (= 0 (select (select |#memory_$Pointer$.base| |entry_point_#t~ret16.base|) 0)) (= 0 |entry_point_#t~ret16.offset|)), 10340#(and (= 0 entry_point_~kobj~2.offset) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~kobj~2.base) 0))), 10341#(and (= 0 |f_22_put_#in~kobj.offset|) (= 0 (select (select |#memory_$Pointer$.base| |f_22_put_#in~kobj.base|) 0))), 10342#(and (= 0 (select (select |#memory_$Pointer$.base| f_22_put_~kobj.base) 0)) (= 0 f_22_put_~kobj.offset)), 10343#(and (= 0 |ldv_kobject_put_#in~kobj.offset|) (= 0 (select (select |#memory_$Pointer$.base| |ldv_kobject_put_#in~kobj.base|) 0))), 10344#(and (= ldv_kobject_put_~kobj.offset 0) (= 0 (select (select |#memory_$Pointer$.base| ldv_kobject_put_~kobj.base) 0))), 10345#(and (<= 12 |ldv_kref_put_#in~kref.offset|) (= 0 (select (select |#memory_$Pointer$.base| |ldv_kref_put_#in~kref.base|) 0))), 10346#(and (<= 12 ldv_kref_put_~kref.offset) (= 0 (select (select |#memory_$Pointer$.base| ldv_kref_put_~kref.base) 0))), 10347#(and (<= 12 |ldv_kref_sub_#in~kref.offset|) (= 0 (select (select |#memory_$Pointer$.base| |ldv_kref_sub_#in~kref.base|) 0))), 10348#(and (= 0 (select (select |#memory_$Pointer$.base| ldv_kref_sub_~kref.base) 0)) (<= 12 ldv_kref_sub_~kref.offset)), 10349#(and (<= |ldv_atomic_sub_return_#in~v.offset| ldv_atomic_sub_return_~v.offset) (or (and (<= ldv_atomic_sub_return_~v.offset |ldv_atomic_sub_return_#in~v.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ldv_atomic_sub_return_~v.base |ldv_atomic_sub_return_#in~v.base|)) (= ldv_atomic_sub_return_~v.offset 0))), 10350#(or (<= |ldv_atomic_sub_return_#in~v.offset| 11) (and (or (= (select |old(#memory_$Pointer$.base)| |ldv_atomic_sub_return_#in~v.base|) (select |#memory_$Pointer$.base| |ldv_atomic_sub_return_#in~v.base|)) (not (= (@diff (select |old(#memory_$Pointer$.base)| |ldv_atomic_sub_return_#in~v.base|) (select |#memory_$Pointer$.base| |ldv_atomic_sub_return_#in~v.base|)) 0))) (= (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|))))))), 10351#(= 0 (select (select |#memory_$Pointer$.base| ldv_kref_sub_~kref.base) 0)), 10352#(= 0 (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~kref.base|) 0)), 10353#(= 0 (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#~kref.base|) 0)), 10354#(= 0 (select (select |#memory_$Pointer$.base| |ldv_kobject_release_#in~kref.base|) 0)), 10355#(= 0 (select (select |#memory_$Pointer$.base| ldv_kobject_release_~kobj~0.base) 0)), 10356#(= 0 (select (select |#memory_$Pointer$.base| |ldv_kobject_cleanup_#in~kobj.base|) 0)), 10357#(or (not (= 0 ldv_kobject_cleanup_~kobj.offset)) (= 0 (select (select |#memory_$Pointer$.base| ldv_kobject_cleanup_~kobj.base) ldv_kobject_cleanup_~kobj.offset))), 10358#(or (= 0 |ldv_kobject_cleanup_#t~mem12.base|) (not (= 0 ldv_kobject_cleanup_~kobj.offset))), 10359#(or (not (= 0 ldv_kobject_cleanup_~kobj.offset)) (= ldv_kobject_cleanup_~name~0.base 0)), 10360#(= ldv_kobject_cleanup_~name~0.base 0)] [2018-02-04 16:20:24,944 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 16 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:20:24,944 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-02-04 16:20:24,944 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-02-04 16:20:24,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=3273, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 16:20:24,945 INFO L87 Difference]: Start difference. First operand 163 states and 170 transitions. Second operand 59 states. [2018-02-04 16:20:25,757 WARN L146 SmtUtils]: Spent 154ms on a formula simplification. DAG size of input: 90 DAG size of output 89 [2018-02-04 16:20:27,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:20:27,493 INFO L93 Difference]: Finished difference Result 165 states and 171 transitions. [2018-02-04 16:20:27,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-04 16:20:27,493 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 96 [2018-02-04 16:20:27,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:20:27,494 INFO L225 Difference]: With dead ends: 165 [2018-02-04 16:20:27,494 INFO L226 Difference]: Without dead ends: 165 [2018-02-04 16:20:27,496 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 730 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=468, Invalid=7014, Unknown=0, NotChecked=0, Total=7482 [2018-02-04 16:20:27,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-02-04 16:20:27,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2018-02-04 16:20:27,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-02-04 16:20:27,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 169 transitions. [2018-02-04 16:20:27,498 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 169 transitions. Word has length 96 [2018-02-04 16:20:27,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:20:27,499 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 169 transitions. [2018-02-04 16:20:27,499 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-02-04 16:20:27,499 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 169 transitions. [2018-02-04 16:20:27,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-02-04 16:20:27,499 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:20:27,499 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] [2018-02-04 16:20:27,499 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 16:20:27,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1534097731, now seen corresponding path program 1 times [2018-02-04 16:20:27,500 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:20:27,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:20:27,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:20:27,756 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 16:20:27,757 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:20:27,757 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 16:20:27,757 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:20:27,757 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 16:20:27,757 INFO L182 omatonBuilderFactory]: Interpolants [10752#(= 1 (select |#valid| |ldv_kobject_init_internal_#in~kobj.base|)), 10753#(= 1 (select |#valid| |ldv_kobject_init_#in~kobj.base|)), 10754#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base)), 10755#(= 1 (select |#valid| |ldv_kobject_create_#res.base|)), 10756#(= 1 (select |#valid| |entry_point_#t~ret16.base|)), 10757#(= 1 (select |#valid| entry_point_~kobj~2.base)), 10758#(= |#valid| |old(#valid)|), 10759#(= 1 (select |#valid| |ldv_kobject_put_#in~kobj.base|)), 10760#(= 1 (select |#valid| ldv_kobject_put_~kobj.base)), 10761#(= 1 (select |#valid| |ldv_kref_put_#in~kref.base|)), 10762#(= 1 (select |#valid| ldv_kref_put_~kref.base)), 10763#(= 1 (select |#valid| |ldv_kref_sub_#in~kref.base|)), 10764#(= 1 (select |#valid| ldv_kref_sub_~kref.base)), 10765#(= 1 (select |#valid| |ldv_atomic_sub_return_#in~v.base|)), 10766#(= 1 (select |#valid| ldv_atomic_sub_return_~v.base)), 10745#true, 10746#false, 10747#(= ldv_kobject_init_~kobj.base |ldv_kobject_init_#in~kobj.base|), 10748#(= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|), 10749#(= LDV_INIT_LIST_HEAD_~list.base |LDV_INIT_LIST_HEAD_#in~list.base|), 10750#(and (= 1 (select |#valid| LDV_INIT_LIST_HEAD_~list.base)) (= LDV_INIT_LIST_HEAD_~list.base |LDV_INIT_LIST_HEAD_#in~list.base|)), 10751#(= 1 (select |#valid| |LDV_INIT_LIST_HEAD_#in~list.base|))] [2018-02-04 16:20:27,758 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 16:20:27,758 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 16:20:27,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 16:20:27,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2018-02-04 16:20:27,758 INFO L87 Difference]: Start difference. First operand 163 states and 169 transitions. Second operand 22 states. [2018-02-04 16:20:28,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:20:28,373 INFO L93 Difference]: Finished difference Result 201 states and 213 transitions. [2018-02-04 16:20:28,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 16:20:28,374 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 105 [2018-02-04 16:20:28,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:20:28,374 INFO L225 Difference]: With dead ends: 201 [2018-02-04 16:20:28,374 INFO L226 Difference]: Without dead ends: 201 [2018-02-04 16:20:28,375 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=1283, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 16:20:28,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-02-04 16:20:28,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2018-02-04 16:20:28,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-02-04 16:20:28,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 209 transitions. [2018-02-04 16:20:28,379 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 209 transitions. Word has length 105 [2018-02-04 16:20:28,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:20:28,379 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 209 transitions. [2018-02-04 16:20:28,379 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 16:20:28,379 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 209 transitions. [2018-02-04 16:20:28,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-02-04 16:20:28,380 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:20:28,380 INFO L351 BasicCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:20:28,380 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 16:20:28,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1219666095, now seen corresponding path program 1 times [2018-02-04 16:20:28,381 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:20:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:20:28,398 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:20:28,650 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 16:20:28,650 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:20:28,650 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 16:20:28,650 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:20:28,651 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 16:20:28,651 INFO L182 omatonBuilderFactory]: Interpolants [11200#(= ldv_kobject_init_~kobj.base |ldv_kobject_init_#in~kobj.base|), 11201#(= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|), 11202#(= LDV_INIT_LIST_HEAD_~list.base |LDV_INIT_LIST_HEAD_#in~list.base|), 11203#(and (= 1 (select |#valid| LDV_INIT_LIST_HEAD_~list.base)) (= LDV_INIT_LIST_HEAD_~list.base |LDV_INIT_LIST_HEAD_#in~list.base|)), 11204#(= 1 (select |#valid| |LDV_INIT_LIST_HEAD_#in~list.base|)), 11205#(= 1 (select |#valid| |ldv_kobject_init_internal_#in~kobj.base|)), 11206#(= 1 (select |#valid| |ldv_kobject_init_#in~kobj.base|)), 11207#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base)), 11208#(= 1 (select |#valid| |ldv_kobject_create_#res.base|)), 11209#(= 1 (select |#valid| |entry_point_#t~ret16.base|)), 11210#(= 1 (select |#valid| entry_point_~kobj~2.base)), 11211#(= |#valid| |old(#valid)|), 11212#(= 1 (select |#valid| |ldv_kobject_put_#in~kobj.base|)), 11213#(= 1 (select |#valid| ldv_kobject_put_~kobj.base)), 11214#(= 1 (select |#valid| |ldv_kref_put_#in~kref.base|)), 11215#(= 1 (select |#valid| ldv_kref_put_~kref.base)), 11216#(= 1 (select |#valid| |ldv_kref_sub_#in~kref.base|)), 11217#(= 1 (select |#valid| ldv_kref_sub_~kref.base)), 11218#(= 1 (select |#valid| |##fun~$Pointer$~TO~VOID_#in~kref.base|)), 11219#(= 1 (select |#valid| |##fun~$Pointer$~TO~VOID_#~kref.base|)), 11220#(= 1 (select |#valid| |ldv_kobject_release_#in~kref.base|)), 11221#(= 1 (select |#valid| ldv_kobject_release_~kobj~0.base)), 11222#(= 1 (select |#valid| |ldv_kobject_cleanup_#in~kobj.base|)), 11223#(= 1 (select |#valid| ldv_kobject_cleanup_~kobj.base)), 11198#true, 11199#false] [2018-02-04 16:20:28,651 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 16:20:28,651 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 16:20:28,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 16:20:28,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2018-02-04 16:20:28,652 INFO L87 Difference]: Start difference. First operand 198 states and 209 transitions. Second operand 26 states. [2018-02-04 16:20:29,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:20:29,396 INFO L93 Difference]: Finished difference Result 209 states and 223 transitions. [2018-02-04 16:20:29,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 16:20:29,396 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 119 [2018-02-04 16:20:29,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:20:29,397 INFO L225 Difference]: With dead ends: 209 [2018-02-04 16:20:29,397 INFO L226 Difference]: Without dead ends: 209 [2018-02-04 16:20:29,398 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=1919, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 16:20:29,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-02-04 16:20:29,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 205. [2018-02-04 16:20:29,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-02-04 16:20:29,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 219 transitions. [2018-02-04 16:20:29,405 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 219 transitions. Word has length 119 [2018-02-04 16:20:29,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:20:29,405 INFO L432 AbstractCegarLoop]: Abstraction has 205 states and 219 transitions. [2018-02-04 16:20:29,405 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 16:20:29,405 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 219 transitions. [2018-02-04 16:20:29,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-02-04 16:20:29,406 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:20:29,406 INFO L351 BasicCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:20:29,406 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 16:20:29,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1476939602, now seen corresponding path program 1 times [2018-02-04 16:20:29,407 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:20:29,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 16:20:29,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 16:20:29,485 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 16:20:29,501 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-02-04 16:20:29,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 04:20:29 BoogieIcfgContainer [2018-02-04 16:20:29,522 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 16:20:29,523 INFO L168 Benchmark]: Toolchain (without parser) took 21915.89 ms. Allocated memory was 411.6 MB in the beginning and 1.3 GB in the end (delta: 907.5 MB). Free memory was 368.4 MB in the beginning and 453.8 MB in the end (delta: -85.4 MB). Peak memory consumption was 822.2 MB. Max. memory is 5.3 GB. [2018-02-04 16:20:29,524 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 411.6 MB. Free memory is still 375.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 16:20:29,524 INFO L168 Benchmark]: CACSL2BoogieTranslator took 179.16 ms. Allocated memory is still 411.6 MB. Free memory was 368.4 MB in the beginning and 353.9 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. [2018-02-04 16:20:29,524 INFO L168 Benchmark]: Boogie Preprocessor took 32.21 ms. Allocated memory is still 411.6 MB. Free memory was 353.9 MB in the beginning and 352.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 16:20:29,524 INFO L168 Benchmark]: RCFGBuilder took 339.08 ms. Allocated memory is still 411.6 MB. Free memory was 352.6 MB in the beginning and 320.0 MB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 5.3 GB. [2018-02-04 16:20:29,525 INFO L168 Benchmark]: TraceAbstraction took 21362.85 ms. Allocated memory was 411.6 MB in the beginning and 1.3 GB in the end (delta: 907.5 MB). Free memory was 318.7 MB in the beginning and 453.8 MB in the end (delta: -135.1 MB). Peak memory consumption was 772.4 MB. Max. memory is 5.3 GB. [2018-02-04 16:20:29,526 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 411.6 MB. Free memory is still 375.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 179.16 ms. Allocated memory is still 411.6 MB. Free memory was 368.4 MB in the beginning and 353.9 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.21 ms. Allocated memory is still 411.6 MB. Free memory was 353.9 MB in the beginning and 352.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 339.08 ms. Allocated memory is still 411.6 MB. Free memory was 352.6 MB in the beginning and 320.0 MB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 21362.85 ms. Allocated memory was 411.6 MB in the beginning and 1.3 GB in the end (delta: 907.5 MB). Free memory was 318.7 MB in the beginning and 453.8 MB in the end (delta: -135.1 MB). Peak memory consumption was 772.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) * 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: [L1453] CALL entry_point() [L1445] struct ldv_kobject *kobj; [L1446] 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}] [L1446] EXPR ldv_kobject_create() VAL [ldv_kobject_create()={19:0}] [L1446] kobj = ldv_kobject_create() [L1448] CALL f_22_put(kobj) VAL [kobj={19:0}] [L1441] 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] ldv_kref_put(&kobj->kref, ldv_kobject_release) VAL [kobj={19:0}, kobj={19:0}, ldv_kref_put(&kobj->kref, ldv_kobject_release)=1] [L1441] FCALL ldv_kobject_put(kobj) VAL [kobj={19:0}] [L1449] 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 19 procedures, 123 locations, 19 error locations. UNSAFE Result, 21.3s OverallTime, 39 OverallIterations, 16 TraceHistogramMax, 10.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4194 SDtfs, 897 SDslu, 39093 SDs, 0 SdLazy, 16813 SolverSat, 331 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 800 GetRequests, 108 SyntacticMatches, 3 SemanticMatches, 689 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2911 ImplicationChecksByTransitivity, 9.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=205occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 1803/2755 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, 39 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 2204 NumberOfCodeBlocks, 2204 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 2044 ConstructedInterpolants, 0 QuantifiedInterpolants, 1013730 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 19 PerfectInterpolantSequences, 1803/2755 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_5_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_16-20-29-532.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_5_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_16-20-29-532.csv Received shutdown request...