java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_2_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:48:20,502 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:48:20,504 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:48:20,517 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:48:20,517 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:48:20,518 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:48:20,519 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:48:20,520 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:48:20,522 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:48:20,523 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:48:20,523 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:48:20,524 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:48:20,524 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:48:20,525 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:48:20,526 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:48:20,528 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:48:20,529 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:48:20,531 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:48:20,532 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:48:20,533 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:48:20,534 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:48:20,535 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:48:20,535 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:48:20,536 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:48:20,536 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:48:20,537 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:48:20,538 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:48:20,538 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:48:20,538 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:48:20,538 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:48:20,539 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:48:20,539 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-02 10:48:20,549 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:48:20,549 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:48:20,550 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:48:20,551 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:48:20,551 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:48:20,551 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:48:20,551 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:48:20,551 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:48:20,551 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:48:20,551 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:48:20,551 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:48:20,551 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:48:20,552 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:48:20,552 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:48:20,552 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:48:20,552 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:48:20,552 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:48:20,552 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:48:20,552 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:48:20,552 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:48:20,552 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:48:20,552 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:48:20,553 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:48:20,553 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol_NoArrayInterpol [2018-02-02 10:48:20,579 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:48:20,587 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:48:20,590 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:48:20,591 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:48:20,591 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:48:20,592 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_2_true-valid-memsafety_true-termination.i [2018-02-02 10:48:20,742 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:48:20,743 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:48:20,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:48:20,744 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:48:20,747 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:48:20,748 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:48:20" (1/1) ... [2018-02-02 10:48:20,750 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6eabcc5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:20, skipping insertion in model container [2018-02-02 10:48:20,750 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:48:20" (1/1) ... [2018-02-02 10:48:20,761 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:48:20,797 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:48:20,899 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:48:20,922 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:48:20,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:20 WrapperNode [2018-02-02 10:48:20,934 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:48:20,934 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:48:20,934 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:48:20,935 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:48:20,949 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:20" (1/1) ... [2018-02-02 10:48:20,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:20" (1/1) ... [2018-02-02 10:48:20,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:20" (1/1) ... [2018-02-02 10:48:20,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:20" (1/1) ... [2018-02-02 10:48:20,964 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:20" (1/1) ... [2018-02-02 10:48:20,967 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:20" (1/1) ... [2018-02-02 10:48:20,968 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:20" (1/1) ... [2018-02-02 10:48:20,970 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:48:20,971 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:48:20,971 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:48:20,971 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:48:20,972 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:20" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:48:21,008 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:48:21,008 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:48:21,009 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-02-02 10:48:21,009 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 10:48:21,009 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-02-02 10:48:21,009 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2018-02-02 10:48:21,009 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-02-02 10:48:21,009 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-02-02 10:48:21,009 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-02-02 10:48:21,009 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2018-02-02 10:48:21,009 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-02-02 10:48:21,009 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-02-02 10:48:21,009 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-02-02 10:48:21,010 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-02-02 10:48:21,010 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2018-02-02 10:48:21,010 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-02-02 10:48:21,010 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-02-02 10:48:21,010 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-02-02 10:48:21,010 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 10:48:21,010 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:48:21,010 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:48:21,010 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:48:21,010 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:48:21,010 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:48:21,010 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:48:21,010 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:48:21,011 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:48:21,011 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-02 10:48:21,011 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-02 10:48:21,011 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:48:21,011 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:48:21,011 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:48:21,011 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-02 10:48:21,011 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 10:48:21,011 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-02-02 10:48:21,011 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2018-02-02 10:48:21,011 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-02-02 10:48:21,011 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-02-02 10:48:21,012 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-02-02 10:48:21,012 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-02-02 10:48:21,012 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2018-02-02 10:48:21,012 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-02-02 10:48:21,012 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-02-02 10:48:21,012 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-02-02 10:48:21,012 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-02-02 10:48:21,012 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2018-02-02 10:48:21,012 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-02-02 10:48:21,012 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-02-02 10:48:21,012 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-02-02 10:48:21,012 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 10:48:21,012 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:48:21,012 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:48:21,012 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:48:21,242 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-02 10:48:21,392 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:48:21,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:48:21 BoogieIcfgContainer [2018-02-02 10:48:21,393 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:48:21,394 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:48:21,394 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:48:21,396 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:48:21,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:48:20" (1/3) ... [2018-02-02 10:48:21,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d8e83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:48:21, skipping insertion in model container [2018-02-02 10:48:21,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:20" (2/3) ... [2018-02-02 10:48:21,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d8e83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:48:21, skipping insertion in model container [2018-02-02 10:48:21,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:48:21" (3/3) ... [2018-02-02 10:48:21,398 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test22_2_true-valid-memsafety_true-termination.i [2018-02-02 10:48:21,404 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:48:21,411 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-02-02 10:48:21,444 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:48:21,445 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:48:21,445 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:48:21,445 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:48:21,445 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:48:21,445 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:48:21,445 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:48:21,445 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:48:21,446 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:48:21,460 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2018-02-02 10:48:21,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:48:21,469 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:21,470 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:21,470 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:21,475 INFO L82 PathProgramCache]: Analyzing trace with hash -998986606, now seen corresponding path program 1 times [2018-02-02 10:48:21,524 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:21,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:21,573 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:21,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:21,710 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:21,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:48:21,710 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:21,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:21,711 INFO L182 omatonBuilderFactory]: Interpolants [146#true, 147#false, 148#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 149#(and (= 0 |ldv_kobject_create_#t~ret17.base|) (= 0 |ldv_kobject_create_#t~ret17.offset|)), 150#(and (= ldv_kobject_create_~kobj~1.offset 0) (= ldv_kobject_create_~kobj~1.base 0))] [2018-02-02 10:48:21,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:21,712 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:48:21,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:48:21,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:48:21,723 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 5 states. [2018-02-02 10:48:21,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:21,776 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2018-02-02 10:48:21,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:48:21,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 10:48:21,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:21,786 INFO L225 Difference]: With dead ends: 149 [2018-02-02 10:48:21,786 INFO L226 Difference]: Without dead ends: 146 [2018-02-02 10:48:21,787 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:48:21,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-02 10:48:21,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2018-02-02 10:48:21,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-02 10:48:21,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 153 transitions. [2018-02-02 10:48:21,825 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 153 transitions. Word has length 17 [2018-02-02 10:48:21,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:21,825 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 153 transitions. [2018-02-02 10:48:21,825 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:48:21,825 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2018-02-02 10:48:21,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:48:21,826 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:21,826 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:21,826 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:21,826 INFO L82 PathProgramCache]: Analyzing trace with hash -2077747980, now seen corresponding path program 1 times [2018-02-02 10:48:21,829 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:21,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:21,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:21,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:21,893 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:21,893 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:48:21,893 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:21,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:21,893 INFO L182 omatonBuilderFactory]: Interpolants [448#(= 1 (select |#valid| |ldv_kobject_create_#t~ret17.base|)), 449#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base)), 444#true, 445#false, 446#(= 1 (select |#valid| |ldv_malloc_#t~malloc4.base|)), 447#(= 1 (select |#valid| |ldv_malloc_#res.base|))] [2018-02-02 10:48:21,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:21,894 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:48:21,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:48:21,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:48:21,895 INFO L87 Difference]: Start difference. First operand 144 states and 153 transitions. Second operand 6 states. [2018-02-02 10:48:22,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:22,057 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2018-02-02 10:48:22,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:48:22,057 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 10:48:22,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:22,058 INFO L225 Difference]: With dead ends: 145 [2018-02-02 10:48:22,059 INFO L226 Difference]: Without dead ends: 145 [2018-02-02 10:48:22,059 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:48:22,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-02 10:48:22,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2018-02-02 10:48:22,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-02 10:48:22,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 152 transitions. [2018-02-02 10:48:22,068 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 152 transitions. Word has length 19 [2018-02-02 10:48:22,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:22,068 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 152 transitions. [2018-02-02 10:48:22,068 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:48:22,068 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 152 transitions. [2018-02-02 10:48:22,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:48:22,069 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:22,069 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:22,069 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:22,069 INFO L82 PathProgramCache]: Analyzing trace with hash -2077747979, now seen corresponding path program 1 times [2018-02-02 10:48:22,070 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:22,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:22,087 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:22,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:22,244 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:22,244 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:48:22,245 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:22,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:22,245 INFO L182 omatonBuilderFactory]: Interpolants [740#true, 741#false, 742#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0))), 743#(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|))), 744#(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|))), 745#(and (<= 16 (select |#length| |ldv_kobject_create_#t~ret17.base|)) (= 0 |ldv_kobject_create_#t~ret17.offset|)), 746#(and (= ldv_kobject_create_~kobj~1.offset 0) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base)))] [2018-02-02 10:48:22,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:22,246 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:48:22,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:48:22,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:48:22,246 INFO L87 Difference]: Start difference. First operand 143 states and 152 transitions. Second operand 7 states. [2018-02-02 10:48:22,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:22,461 INFO L93 Difference]: Finished difference Result 144 states and 153 transitions. [2018-02-02 10:48:22,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:48:22,461 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-02-02 10:48:22,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:22,463 INFO L225 Difference]: With dead ends: 144 [2018-02-02 10:48:22,463 INFO L226 Difference]: Without dead ends: 144 [2018-02-02 10:48:22,463 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:48:22,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-02-02 10:48:22,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2018-02-02 10:48:22,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-02 10:48:22,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 151 transitions. [2018-02-02 10:48:22,471 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 151 transitions. Word has length 19 [2018-02-02 10:48:22,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:22,471 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 151 transitions. [2018-02-02 10:48:22,471 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:48:22,471 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2018-02-02 10:48:22,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 10:48:22,472 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:22,472 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:22,472 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:22,472 INFO L82 PathProgramCache]: Analyzing trace with hash -471802203, now seen corresponding path program 1 times [2018-02-02 10:48:22,474 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:22,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:22,487 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:22,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:22,533 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:22,533 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:48:22,533 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:22,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:22,534 INFO L182 omatonBuilderFactory]: Interpolants [1040#(and (= 0 |entry_point_#t~ret19.base|) (= 0 |entry_point_#t~ret19.offset|)), 1041#(and (= 0 entry_point_~kobj~2.base) (= 0 entry_point_~kobj~2.offset)), 1042#(and (= 0 |ldv_kobject_get_#in~kobj.base|) (= 0 |ldv_kobject_get_#in~kobj.offset|)), 1043#(and (= 0 ldv_kobject_get_~kobj.offset) (= ldv_kobject_get_~kobj.base 0)), 1037#true, 1038#false, 1039#(and (= 0 |ldv_kobject_create_#res.base|) (= 0 |ldv_kobject_create_#res.offset|))] [2018-02-02 10:48:22,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:22,534 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:48:22,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:48:22,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:48:22,534 INFO L87 Difference]: Start difference. First operand 142 states and 151 transitions. Second operand 7 states. [2018-02-02 10:48:22,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:22,567 INFO L93 Difference]: Finished difference Result 159 states and 170 transitions. [2018-02-02 10:48:22,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:48:22,570 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-02-02 10:48:22,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:22,571 INFO L225 Difference]: With dead ends: 159 [2018-02-02 10:48:22,571 INFO L226 Difference]: Without dead ends: 159 [2018-02-02 10:48:22,571 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:48:22,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-02-02 10:48:22,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 151. [2018-02-02 10:48:22,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-02 10:48:22,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2018-02-02 10:48:22,582 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 27 [2018-02-02 10:48:22,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:22,582 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2018-02-02 10:48:22,582 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:48:22,582 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2018-02-02 10:48:22,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:48:22,583 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:22,583 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:22,583 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:22,584 INFO L82 PathProgramCache]: Analyzing trace with hash 131109242, now seen corresponding path program 1 times [2018-02-02 10:48:22,585 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:22,600 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:22,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:22,674 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:22,674 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:48:22,675 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:22,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:22,675 INFO L182 omatonBuilderFactory]: Interpolants [1360#(= 1 (select |#valid| |ldv_kobject_init_#in~kobj.base|)), 1361#(= 1 (select |#valid| ldv_kobject_init_~kobj.base)), 1362#(= 1 (select |#valid| |ldv_kobject_init_internal_#in~kobj.base|)), 1363#(= 1 (select |#valid| ldv_kobject_init_internal_~kobj.base)), 1364#(= 1 (select |#valid| |ldv_kref_init_#in~kref.base|)), 1365#(= 1 (select |#valid| ldv_kref_init_~kref.base)), 1356#true, 1357#false, 1358#(= 1 (select |#valid| |#Ultimate.C_memset_#ptr.base|)), 1359#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base))] [2018-02-02 10:48:22,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:22,675 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:48:22,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:48:22,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:48:22,675 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand 10 states. [2018-02-02 10:48:22,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:22,844 INFO L93 Difference]: Finished difference Result 150 states and 159 transitions. [2018-02-02 10:48:22,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:48:22,845 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-02-02 10:48:22,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:22,846 INFO L225 Difference]: With dead ends: 150 [2018-02-02 10:48:22,846 INFO L226 Difference]: Without dead ends: 150 [2018-02-02 10:48:22,846 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:48:22,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-02 10:48:22,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-02-02 10:48:22,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-02 10:48:22,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 159 transitions. [2018-02-02 10:48:22,851 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 159 transitions. Word has length 34 [2018-02-02 10:48:22,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:22,851 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 159 transitions. [2018-02-02 10:48:22,851 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:48:22,851 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 159 transitions. [2018-02-02 10:48:22,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:48:22,852 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:22,852 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:22,852 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:22,852 INFO L82 PathProgramCache]: Analyzing trace with hash 131109243, now seen corresponding path program 1 times [2018-02-02 10:48:22,853 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:22,866 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:22,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:22,894 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:22,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:48:22,895 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:22,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:22,895 INFO L182 omatonBuilderFactory]: Interpolants [1672#true, 1673#false, 1674#(= |#Ultimate.C_memset_#t~loopctr21| 0), 1675#(<= |#Ultimate.C_memset_#amount| 0)] [2018-02-02 10:48:22,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:22,895 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:48:22,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:48:22,896 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:48:22,896 INFO L87 Difference]: Start difference. First operand 150 states and 159 transitions. Second operand 4 states. [2018-02-02 10:48:22,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:22,907 INFO L93 Difference]: Finished difference Result 153 states and 162 transitions. [2018-02-02 10:48:22,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:48:22,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-02-02 10:48:22,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:22,909 INFO L225 Difference]: With dead ends: 153 [2018-02-02 10:48:22,909 INFO L226 Difference]: Without dead ends: 151 [2018-02-02 10:48:22,909 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:48:22,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-02 10:48:22,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-02-02 10:48:22,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-02 10:48:22,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2018-02-02 10:48:22,916 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 34 [2018-02-02 10:48:22,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:22,917 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2018-02-02 10:48:22,917 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:48:22,917 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2018-02-02 10:48:22,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 10:48:22,918 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:22,919 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:22,919 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:22,919 INFO L82 PathProgramCache]: Analyzing trace with hash -2110897305, now seen corresponding path program 1 times [2018-02-02 10:48:22,920 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:22,936 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:22,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:22,972 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:22,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:48:22,972 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:22,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:22,972 INFO L182 omatonBuilderFactory]: Interpolants [1984#(= |#Ultimate.C_memset_#t~loopctr21| 0), 1985#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 1986#(<= |#Ultimate.C_memset_#amount| 1), 1982#true, 1983#false] [2018-02-02 10:48:22,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:22,973 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:48:22,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:48:22,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:48:22,973 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand 5 states. [2018-02-02 10:48:22,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:22,989 INFO L93 Difference]: Finished difference Result 154 states and 163 transitions. [2018-02-02 10:48:22,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:48:22,990 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-02-02 10:48:22,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:22,991 INFO L225 Difference]: With dead ends: 154 [2018-02-02 10:48:22,991 INFO L226 Difference]: Without dead ends: 152 [2018-02-02 10:48:22,992 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:48:22,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-02 10:48:22,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-02-02 10:48:22,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-02 10:48:22,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 161 transitions. [2018-02-02 10:48:22,998 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 161 transitions. Word has length 35 [2018-02-02 10:48:22,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:22,998 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 161 transitions. [2018-02-02 10:48:22,999 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:48:22,999 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 161 transitions. [2018-02-02 10:48:23,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 10:48:23,000 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:23,000 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:23,000 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:23,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1181841647, now seen corresponding path program 1 times [2018-02-02 10:48:23,001 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:23,015 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:23,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:23,085 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:23,085 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:48:23,085 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:23,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:23,086 INFO L182 omatonBuilderFactory]: Interpolants [2295#true, 2296#false, 2297#(and (= 0 |ldv_kobject_create_#res.base|) (= 0 |ldv_kobject_create_#res.offset|)), 2298#(and (= 0 |entry_point_#t~ret19.base|) (= 0 |entry_point_#t~ret19.offset|)), 2299#(and (= 0 entry_point_~kobj~2.base) (= 0 entry_point_~kobj~2.offset)), 2300#(and (= 0 |ldv_kobject_put_#in~kobj.offset|) (= 0 |ldv_kobject_put_#in~kobj.base|)), 2301#(and (= ldv_kobject_put_~kobj.offset 0) (= 0 ldv_kobject_put_~kobj.base))] [2018-02-02 10:48:23,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:23,087 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:48:23,087 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:48:23,087 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:48:23,087 INFO L87 Difference]: Start difference. First operand 152 states and 161 transitions. Second operand 7 states. [2018-02-02 10:48:23,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:23,129 INFO L93 Difference]: Finished difference Result 163 states and 174 transitions. [2018-02-02 10:48:23,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:48:23,129 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-02-02 10:48:23,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:23,130 INFO L225 Difference]: With dead ends: 163 [2018-02-02 10:48:23,130 INFO L226 Difference]: Without dead ends: 163 [2018-02-02 10:48:23,131 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:48:23,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-02 10:48:23,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2018-02-02 10:48:23,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-02 10:48:23,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 169 transitions. [2018-02-02 10:48:23,136 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 169 transitions. Word has length 36 [2018-02-02 10:48:23,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:23,136 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 169 transitions. [2018-02-02 10:48:23,137 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:48:23,137 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 169 transitions. [2018-02-02 10:48:23,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 10:48:23,138 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:23,138 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:23,138 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:23,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1401343739, now seen corresponding path program 2 times [2018-02-02 10:48:23,139 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:23,157 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:23,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:23,189 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:23,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:48:23,190 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:23,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:23,190 INFO L182 omatonBuilderFactory]: Interpolants [2626#true, 2627#false, 2628#(= |#Ultimate.C_memset_#t~loopctr21| 0), 2629#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 2630#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 2631#(<= |#Ultimate.C_memset_#amount| 2)] [2018-02-02 10:48:23,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:23,191 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:48:23,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:48:23,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:48:23,191 INFO L87 Difference]: Start difference. First operand 159 states and 169 transitions. Second operand 6 states. [2018-02-02 10:48:23,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:23,212 INFO L93 Difference]: Finished difference Result 162 states and 172 transitions. [2018-02-02 10:48:23,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:48:23,215 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-02-02 10:48:23,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:23,216 INFO L225 Difference]: With dead ends: 162 [2018-02-02 10:48:23,216 INFO L226 Difference]: Without dead ends: 160 [2018-02-02 10:48:23,216 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:48:23,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-02-02 10:48:23,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-02-02 10:48:23,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-02-02 10:48:23,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 170 transitions. [2018-02-02 10:48:23,221 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 170 transitions. Word has length 36 [2018-02-02 10:48:23,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:23,221 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 170 transitions. [2018-02-02 10:48:23,222 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:48:23,222 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 170 transitions. [2018-02-02 10:48:23,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 10:48:23,223 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:23,223 INFO L351 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:23,223 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:23,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1388333593, now seen corresponding path program 3 times [2018-02-02 10:48:23,224 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:23,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:23,236 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:23,273 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:23,273 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:23,273 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:48:23,274 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:23,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:23,274 INFO L182 omatonBuilderFactory]: Interpolants [2960#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 2961#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 2962#(<= |#Ultimate.C_memset_#amount| 3), 2956#true, 2957#false, 2958#(= |#Ultimate.C_memset_#t~loopctr21| 0), 2959#(<= |#Ultimate.C_memset_#t~loopctr21| 1)] [2018-02-02 10:48:23,274 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:23,274 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:48:23,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:48:23,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:48:23,275 INFO L87 Difference]: Start difference. First operand 160 states and 170 transitions. Second operand 7 states. [2018-02-02 10:48:23,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:23,302 INFO L93 Difference]: Finished difference Result 163 states and 173 transitions. [2018-02-02 10:48:23,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:48:23,309 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-02-02 10:48:23,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:23,310 INFO L225 Difference]: With dead ends: 163 [2018-02-02 10:48:23,310 INFO L226 Difference]: Without dead ends: 161 [2018-02-02 10:48:23,311 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:48:23,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-02 10:48:23,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-02-02 10:48:23,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-02-02 10:48:23,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 171 transitions. [2018-02-02 10:48:23,315 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 171 transitions. Word has length 37 [2018-02-02 10:48:23,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:23,315 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 171 transitions. [2018-02-02 10:48:23,315 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:48:23,315 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 171 transitions. [2018-02-02 10:48:23,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 10:48:23,316 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:23,316 INFO L351 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:23,316 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:23,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1968984965, now seen corresponding path program 4 times [2018-02-02 10:48:23,317 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:23,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:23,329 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:23,369 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:23,370 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:23,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:48:23,370 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:23,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:23,370 INFO L182 omatonBuilderFactory]: Interpolants [3296#(<= |#Ultimate.C_memset_#amount| 4), 3289#true, 3290#false, 3291#(= |#Ultimate.C_memset_#t~loopctr21| 0), 3292#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 3293#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 3294#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 3295#(<= |#Ultimate.C_memset_#t~loopctr21| 4)] [2018-02-02 10:48:23,371 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:23,371 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:48:23,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:48:23,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:48:23,371 INFO L87 Difference]: Start difference. First operand 161 states and 171 transitions. Second operand 8 states. [2018-02-02 10:48:23,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:23,395 INFO L93 Difference]: Finished difference Result 164 states and 174 transitions. [2018-02-02 10:48:23,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:48:23,399 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-02-02 10:48:23,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:23,400 INFO L225 Difference]: With dead ends: 164 [2018-02-02 10:48:23,400 INFO L226 Difference]: Without dead ends: 162 [2018-02-02 10:48:23,401 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:48:23,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-02 10:48:23,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-02-02 10:48:23,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-02-02 10:48:23,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 172 transitions. [2018-02-02 10:48:23,406 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 172 transitions. Word has length 38 [2018-02-02 10:48:23,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:23,406 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 172 transitions. [2018-02-02 10:48:23,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:48:23,406 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 172 transitions. [2018-02-02 10:48:23,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 10:48:23,407 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:23,407 INFO L351 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:23,409 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:23,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1505658983, now seen corresponding path program 5 times [2018-02-02 10:48:23,410 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:23,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:23,423 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:23,472 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:23,473 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:23,473 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:48:23,473 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:23,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:23,474 INFO L182 omatonBuilderFactory]: Interpolants [3632#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 3633#(<= |#Ultimate.C_memset_#amount| 5), 3625#true, 3626#false, 3627#(= |#Ultimate.C_memset_#t~loopctr21| 0), 3628#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 3629#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 3630#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 3631#(<= |#Ultimate.C_memset_#t~loopctr21| 4)] [2018-02-02 10:48:23,474 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:23,474 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:48:23,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:48:23,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:48:23,475 INFO L87 Difference]: Start difference. First operand 162 states and 172 transitions. Second operand 9 states. [2018-02-02 10:48:23,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:23,501 INFO L93 Difference]: Finished difference Result 165 states and 175 transitions. [2018-02-02 10:48:23,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:48:23,501 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-02-02 10:48:23,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:23,502 INFO L225 Difference]: With dead ends: 165 [2018-02-02 10:48:23,502 INFO L226 Difference]: Without dead ends: 163 [2018-02-02 10:48:23,503 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:48:23,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-02 10:48:23,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-02-02 10:48:23,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-02-02 10:48:23,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 173 transitions. [2018-02-02 10:48:23,507 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 173 transitions. Word has length 39 [2018-02-02 10:48:23,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:23,508 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 173 transitions. [2018-02-02 10:48:23,508 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:48:23,508 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 173 transitions. [2018-02-02 10:48:23,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 10:48:23,509 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:23,509 INFO L351 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:23,509 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:23,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1845438971, now seen corresponding path program 6 times [2018-02-02 10:48:23,510 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:23,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:23,523 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:23,588 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:23,588 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:23,588 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:48:23,588 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:23,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:23,589 INFO L182 omatonBuilderFactory]: Interpolants [3968#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 3969#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 3970#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 3971#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 3972#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 3973#(<= |#Ultimate.C_memset_#amount| 6), 3964#true, 3965#false, 3966#(= |#Ultimate.C_memset_#t~loopctr21| 0), 3967#(<= |#Ultimate.C_memset_#t~loopctr21| 1)] [2018-02-02 10:48:23,589 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:23,589 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:48:23,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:48:23,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:48:23,589 INFO L87 Difference]: Start difference. First operand 163 states and 173 transitions. Second operand 10 states. [2018-02-02 10:48:23,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:23,630 INFO L93 Difference]: Finished difference Result 166 states and 176 transitions. [2018-02-02 10:48:23,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:48:23,631 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2018-02-02 10:48:23,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:23,632 INFO L225 Difference]: With dead ends: 166 [2018-02-02 10:48:23,632 INFO L226 Difference]: Without dead ends: 164 [2018-02-02 10:48:23,632 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:48:23,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-02-02 10:48:23,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-02-02 10:48:23,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-02-02 10:48:23,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 174 transitions. [2018-02-02 10:48:23,639 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 174 transitions. Word has length 40 [2018-02-02 10:48:23,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:23,639 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 174 transitions. [2018-02-02 10:48:23,639 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:48:23,639 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 174 transitions. [2018-02-02 10:48:23,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 10:48:23,640 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:23,640 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:23,640 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:23,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1379512829, now seen corresponding path program 1 times [2018-02-02 10:48:23,641 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:23,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:23,666 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:23,694 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-02 10:48:23,694 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:23,694 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:48:23,694 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:23,695 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-02 10:48:23,695 INFO L182 omatonBuilderFactory]: Interpolants [4306#true, 4307#false, 4308#(= |#valid| |old(#valid)|)] [2018-02-02 10:48:23,695 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-02 10:48:23,695 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:48:23,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:48:23,696 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:48:23,696 INFO L87 Difference]: Start difference. First operand 164 states and 174 transitions. Second operand 3 states. [2018-02-02 10:48:23,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:23,796 INFO L93 Difference]: Finished difference Result 182 states and 195 transitions. [2018-02-02 10:48:23,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:48:23,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-02-02 10:48:23,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:23,798 INFO L225 Difference]: With dead ends: 182 [2018-02-02 10:48:23,798 INFO L226 Difference]: Without dead ends: 168 [2018-02-02 10:48:23,798 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:48:23,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-02-02 10:48:23,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 160. [2018-02-02 10:48:23,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-02-02 10:48:23,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 169 transitions. [2018-02-02 10:48:23,804 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 169 transitions. Word has length 39 [2018-02-02 10:48:23,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:23,804 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 169 transitions. [2018-02-02 10:48:23,804 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:48:23,805 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 169 transitions. [2018-02-02 10:48:23,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 10:48:23,805 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:23,805 INFO L351 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:23,805 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:23,806 INFO L82 PathProgramCache]: Analyzing trace with hash -506283289, now seen corresponding path program 7 times [2018-02-02 10:48:23,807 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:23,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:23,821 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:23,904 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:23,904 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:23,904 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:48:23,904 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:23,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:23,905 INFO L182 omatonBuilderFactory]: Interpolants [4656#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 4657#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 4658#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 4659#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 4660#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 4661#(<= |#Ultimate.C_memset_#amount| 7), 4651#true, 4652#false, 4653#(= |#Ultimate.C_memset_#t~loopctr21| 0), 4654#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 4655#(<= |#Ultimate.C_memset_#t~loopctr21| 2)] [2018-02-02 10:48:23,905 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:23,905 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:48:23,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:48:23,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:48:23,906 INFO L87 Difference]: Start difference. First operand 160 states and 169 transitions. Second operand 11 states. [2018-02-02 10:48:23,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:23,943 INFO L93 Difference]: Finished difference Result 163 states and 172 transitions. [2018-02-02 10:48:23,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:48:23,949 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-02-02 10:48:23,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:23,949 INFO L225 Difference]: With dead ends: 163 [2018-02-02 10:48:23,949 INFO L226 Difference]: Without dead ends: 161 [2018-02-02 10:48:23,950 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:48:23,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-02 10:48:23,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-02-02 10:48:23,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-02-02 10:48:23,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 170 transitions. [2018-02-02 10:48:23,955 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 170 transitions. Word has length 41 [2018-02-02 10:48:23,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:23,955 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 170 transitions. [2018-02-02 10:48:23,956 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:48:23,956 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 170 transitions. [2018-02-02 10:48:23,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 10:48:23,956 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:23,956 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:23,956 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:23,957 INFO L82 PathProgramCache]: Analyzing trace with hash -495427355, now seen corresponding path program 1 times [2018-02-02 10:48:23,957 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:23,963 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:23,990 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-02 10:48:23,990 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:23,990 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:48:23,990 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:23,991 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-02 10:48:23,991 INFO L182 omatonBuilderFactory]: Interpolants [4992#(not (= |ldv_kobject_create_#t~ret17.base| 0)), 4993#(not (= ldv_kobject_create_~kobj~1.base 0)), 4988#true, 4989#false, 4990#(not (= |ldv_malloc_#t~malloc4.base| 0)), 4991#(not (= |ldv_malloc_#res.base| 0))] [2018-02-02 10:48:23,991 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-02 10:48:23,991 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:48:23,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:48:23,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:48:23,992 INFO L87 Difference]: Start difference. First operand 161 states and 170 transitions. Second operand 6 states. [2018-02-02 10:48:24,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:24,011 INFO L93 Difference]: Finished difference Result 145 states and 152 transitions. [2018-02-02 10:48:24,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:48:24,012 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-02-02 10:48:24,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:24,013 INFO L225 Difference]: With dead ends: 145 [2018-02-02 10:48:24,013 INFO L226 Difference]: Without dead ends: 145 [2018-02-02 10:48:24,013 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:48:24,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-02 10:48:24,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-02-02 10:48:24,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-02 10:48:24,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 152 transitions. [2018-02-02 10:48:24,016 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 152 transitions. Word has length 41 [2018-02-02 10:48:24,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:24,016 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 152 transitions. [2018-02-02 10:48:24,017 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:48:24,017 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 152 transitions. [2018-02-02 10:48:24,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 10:48:24,017 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:24,017 INFO L351 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:24,017 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:24,017 INFO L82 PathProgramCache]: Analyzing trace with hash -395229317, now seen corresponding path program 8 times [2018-02-02 10:48:24,018 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:24,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:24,030 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:24,114 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:24,114 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:24,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:48:24,114 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:24,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:24,115 INFO L182 omatonBuilderFactory]: Interpolants [5296#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 5297#(<= |#Ultimate.C_memset_#amount| 8), 5286#true, 5287#false, 5288#(= |#Ultimate.C_memset_#t~loopctr21| 0), 5289#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 5290#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 5291#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 5292#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 5293#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 5294#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 5295#(<= |#Ultimate.C_memset_#t~loopctr21| 7)] [2018-02-02 10:48:24,115 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:24,115 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:48:24,116 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:48:24,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:48:24,116 INFO L87 Difference]: Start difference. First operand 145 states and 152 transitions. Second operand 12 states. [2018-02-02 10:48:24,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:24,168 INFO L93 Difference]: Finished difference Result 148 states and 155 transitions. [2018-02-02 10:48:24,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:48:24,168 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-02-02 10:48:24,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:24,169 INFO L225 Difference]: With dead ends: 148 [2018-02-02 10:48:24,169 INFO L226 Difference]: Without dead ends: 146 [2018-02-02 10:48:24,169 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:48:24,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-02 10:48:24,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-02-02 10:48:24,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-02 10:48:24,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 153 transitions. [2018-02-02 10:48:24,173 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 153 transitions. Word has length 42 [2018-02-02 10:48:24,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:24,173 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 153 transitions. [2018-02-02 10:48:24,173 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:48:24,173 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 153 transitions. [2018-02-02 10:48:24,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 10:48:24,173 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:24,174 INFO L351 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:24,174 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:24,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1247523481, now seen corresponding path program 9 times [2018-02-02 10:48:24,175 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:24,185 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:24,264 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:24,265 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:24,265 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:48:24,265 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:24,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:24,265 INFO L182 omatonBuilderFactory]: Interpolants [5600#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 5601#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 5602#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 5603#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 5604#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 5605#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 5606#(<= |#Ultimate.C_memset_#amount| 9), 5594#true, 5595#false, 5596#(= |#Ultimate.C_memset_#t~loopctr21| 0), 5597#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 5598#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 5599#(<= |#Ultimate.C_memset_#t~loopctr21| 3)] [2018-02-02 10:48:24,266 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:24,266 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:48:24,266 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:48:24,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:48:24,266 INFO L87 Difference]: Start difference. First operand 146 states and 153 transitions. Second operand 13 states. [2018-02-02 10:48:24,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:24,301 INFO L93 Difference]: Finished difference Result 149 states and 156 transitions. [2018-02-02 10:48:24,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:48:24,302 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-02-02 10:48:24,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:24,303 INFO L225 Difference]: With dead ends: 149 [2018-02-02 10:48:24,303 INFO L226 Difference]: Without dead ends: 147 [2018-02-02 10:48:24,304 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:48:24,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-02-02 10:48:24,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-02-02 10:48:24,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-02 10:48:24,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 154 transitions. [2018-02-02 10:48:24,307 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 154 transitions. Word has length 43 [2018-02-02 10:48:24,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:24,307 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 154 transitions. [2018-02-02 10:48:24,307 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:48:24,307 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 154 transitions. [2018-02-02 10:48:24,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 10:48:24,308 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:24,308 INFO L351 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:24,308 INFO L371 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:24,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1898838789, now seen corresponding path program 10 times [2018-02-02 10:48:24,309 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:24,321 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:24,398 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:24,398 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:24,398 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:48:24,398 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:24,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:24,398 INFO L182 omatonBuilderFactory]: Interpolants [5905#true, 5906#false, 5907#(= |#Ultimate.C_memset_#t~loopctr21| 0), 5908#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 5909#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 5910#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 5911#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 5912#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 5913#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 5914#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 5915#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 5916#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 5917#(<= |#Ultimate.C_memset_#t~loopctr21| 10), 5918#(<= |#Ultimate.C_memset_#amount| 10)] [2018-02-02 10:48:24,398 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:24,398 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:48:24,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:48:24,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:48:24,399 INFO L87 Difference]: Start difference. First operand 147 states and 154 transitions. Second operand 14 states. [2018-02-02 10:48:24,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:24,431 INFO L93 Difference]: Finished difference Result 150 states and 157 transitions. [2018-02-02 10:48:24,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:48:24,432 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-02-02 10:48:24,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:24,432 INFO L225 Difference]: With dead ends: 150 [2018-02-02 10:48:24,432 INFO L226 Difference]: Without dead ends: 148 [2018-02-02 10:48:24,433 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:48:24,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-02-02 10:48:24,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-02-02 10:48:24,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-02 10:48:24,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 155 transitions. [2018-02-02 10:48:24,436 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 155 transitions. Word has length 44 [2018-02-02 10:48:24,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:24,436 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 155 transitions. [2018-02-02 10:48:24,437 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:48:24,437 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 155 transitions. [2018-02-02 10:48:24,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 10:48:24,437 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:24,437 INFO L351 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:24,437 INFO L371 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:24,437 INFO L82 PathProgramCache]: Analyzing trace with hash -614776857, now seen corresponding path program 11 times [2018-02-02 10:48:24,439 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:24,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:24,452 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:24,563 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:24,563 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:24,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:48:24,563 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:24,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:24,564 INFO L182 omatonBuilderFactory]: Interpolants [6219#true, 6220#false, 6221#(= |#Ultimate.C_memset_#t~loopctr21| 0), 6222#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 6223#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 6224#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 6225#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 6226#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 6227#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 6228#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 6229#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 6230#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 6231#(<= |#Ultimate.C_memset_#t~loopctr21| 10), 6232#(<= |#Ultimate.C_memset_#t~loopctr21| 11), 6233#(<= |#Ultimate.C_memset_#amount| 11)] [2018-02-02 10:48:24,564 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:24,564 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:48:24,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:48:24,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:48:24,565 INFO L87 Difference]: Start difference. First operand 148 states and 155 transitions. Second operand 15 states. [2018-02-02 10:48:24,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:24,594 INFO L93 Difference]: Finished difference Result 151 states and 158 transitions. [2018-02-02 10:48:24,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:48:24,595 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2018-02-02 10:48:24,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:24,595 INFO L225 Difference]: With dead ends: 151 [2018-02-02 10:48:24,595 INFO L226 Difference]: Without dead ends: 149 [2018-02-02 10:48:24,596 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=97, Invalid=143, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:48:24,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-02-02 10:48:24,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-02-02 10:48:24,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-02-02 10:48:24,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 156 transitions. [2018-02-02 10:48:24,599 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 156 transitions. Word has length 45 [2018-02-02 10:48:24,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:24,599 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 156 transitions. [2018-02-02 10:48:24,599 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:48:24,599 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 156 transitions. [2018-02-02 10:48:24,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 10:48:24,600 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:24,600 INFO L351 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:24,600 INFO L371 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:24,600 INFO L82 PathProgramCache]: Analyzing trace with hash 536437371, now seen corresponding path program 12 times [2018-02-02 10:48:24,601 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:24,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:24,618 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:24,736 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:24,736 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:24,736 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:48:24,736 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:24,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:24,737 INFO L182 omatonBuilderFactory]: Interpolants [6536#true, 6537#false, 6538#(= |#Ultimate.C_memset_#t~loopctr21| 0), 6539#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 6540#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 6541#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 6542#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 6543#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 6544#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 6545#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 6546#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 6547#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 6548#(<= |#Ultimate.C_memset_#t~loopctr21| 10), 6549#(<= |#Ultimate.C_memset_#t~loopctr21| 11), 6550#(<= |#Ultimate.C_memset_#t~loopctr21| 12), 6551#(<= |#Ultimate.C_memset_#amount| 12)] [2018-02-02 10:48:24,737 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:24,737 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:48:24,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:48:24,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:48:24,738 INFO L87 Difference]: Start difference. First operand 149 states and 156 transitions. Second operand 16 states. [2018-02-02 10:48:24,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:24,783 INFO L93 Difference]: Finished difference Result 152 states and 159 transitions. [2018-02-02 10:48:24,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:48:24,783 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2018-02-02 10:48:24,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:24,784 INFO L225 Difference]: With dead ends: 152 [2018-02-02 10:48:24,784 INFO L226 Difference]: Without dead ends: 150 [2018-02-02 10:48:24,784 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=111, Invalid=161, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:48:24,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-02 10:48:24,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-02-02 10:48:24,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-02 10:48:24,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 157 transitions. [2018-02-02 10:48:24,788 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 157 transitions. Word has length 46 [2018-02-02 10:48:24,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:24,788 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 157 transitions. [2018-02-02 10:48:24,788 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:48:24,788 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 157 transitions. [2018-02-02 10:48:24,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:48:24,789 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:24,789 INFO L351 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:24,789 INFO L371 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:24,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1864340071, now seen corresponding path program 13 times [2018-02-02 10:48:24,790 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:24,803 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:24,930 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:24,930 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:24,930 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:48:24,930 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:24,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:24,931 INFO L182 omatonBuilderFactory]: Interpolants [6856#true, 6857#false, 6858#(= |#Ultimate.C_memset_#t~loopctr21| 0), 6859#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 6860#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 6861#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 6862#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 6863#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 6864#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 6865#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 6866#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 6867#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 6868#(<= |#Ultimate.C_memset_#t~loopctr21| 10), 6869#(<= |#Ultimate.C_memset_#t~loopctr21| 11), 6870#(<= |#Ultimate.C_memset_#t~loopctr21| 12), 6871#(<= |#Ultimate.C_memset_#t~loopctr21| 13), 6872#(<= |#Ultimate.C_memset_#amount| 13)] [2018-02-02 10:48:24,931 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:24,931 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:48:24,931 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:48:24,931 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:48:24,931 INFO L87 Difference]: Start difference. First operand 150 states and 157 transitions. Second operand 17 states. [2018-02-02 10:48:24,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:24,971 INFO L93 Difference]: Finished difference Result 153 states and 160 transitions. [2018-02-02 10:48:24,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:48:24,972 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2018-02-02 10:48:24,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:24,973 INFO L225 Difference]: With dead ends: 153 [2018-02-02 10:48:24,973 INFO L226 Difference]: Without dead ends: 151 [2018-02-02 10:48:24,974 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=180, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:48:24,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-02 10:48:24,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-02-02 10:48:24,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-02 10:48:24,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 158 transitions. [2018-02-02 10:48:24,977 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 158 transitions. Word has length 47 [2018-02-02 10:48:24,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:24,977 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 158 transitions. [2018-02-02 10:48:24,977 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:48:24,977 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 158 transitions. [2018-02-02 10:48:24,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 10:48:24,978 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:24,978 INFO L351 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:24,978 INFO L371 AbstractCegarLoop]: === Iteration 23 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:24,978 INFO L82 PathProgramCache]: Analyzing trace with hash 79650811, now seen corresponding path program 14 times [2018-02-02 10:48:24,979 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:24,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:24,991 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:25,110 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:25,110 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:25,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:48:25,110 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:25,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:25,111 INFO L182 omatonBuilderFactory]: Interpolants [7179#true, 7180#false, 7181#(= |#Ultimate.C_memset_#t~loopctr21| 0), 7182#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 7183#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 7184#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 7185#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 7186#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 7187#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 7188#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 7189#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 7190#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 7191#(<= |#Ultimate.C_memset_#t~loopctr21| 10), 7192#(<= |#Ultimate.C_memset_#t~loopctr21| 11), 7193#(<= |#Ultimate.C_memset_#t~loopctr21| 12), 7194#(<= |#Ultimate.C_memset_#t~loopctr21| 13), 7195#(<= |#Ultimate.C_memset_#t~loopctr21| 14), 7196#(<= |#Ultimate.C_memset_#amount| 14)] [2018-02-02 10:48:25,111 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:25,111 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:48:25,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:48:25,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:48:25,111 INFO L87 Difference]: Start difference. First operand 151 states and 158 transitions. Second operand 18 states. [2018-02-02 10:48:25,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:25,141 INFO L93 Difference]: Finished difference Result 154 states and 161 transitions. [2018-02-02 10:48:25,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:48:25,141 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2018-02-02 10:48:25,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:25,142 INFO L225 Difference]: With dead ends: 154 [2018-02-02 10:48:25,142 INFO L226 Difference]: Without dead ends: 152 [2018-02-02 10:48:25,142 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=142, Invalid=200, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:48:25,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-02 10:48:25,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-02-02 10:48:25,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-02 10:48:25,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 159 transitions. [2018-02-02 10:48:25,145 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 159 transitions. Word has length 48 [2018-02-02 10:48:25,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:25,145 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 159 transitions. [2018-02-02 10:48:25,145 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:48:25,145 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 159 transitions. [2018-02-02 10:48:25,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 10:48:25,145 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:25,146 INFO L351 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:25,146 INFO L371 AbstractCegarLoop]: === Iteration 24 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:25,146 INFO L82 PathProgramCache]: Analyzing trace with hash 588858599, now seen corresponding path program 15 times [2018-02-02 10:48:25,147 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:25,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:25,160 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:25,334 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:25,334 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:25,334 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:48:25,335 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:25,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:25,335 INFO L182 omatonBuilderFactory]: Interpolants [7520#(<= |#Ultimate.C_memset_#t~loopctr21| 13), 7521#(<= |#Ultimate.C_memset_#t~loopctr21| 14), 7522#(<= |#Ultimate.C_memset_#t~loopctr21| 15), 7523#(<= |#Ultimate.C_memset_#amount| 15), 7505#true, 7506#false, 7507#(= |#Ultimate.C_memset_#t~loopctr21| 0), 7508#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 7509#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 7510#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 7511#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 7512#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 7513#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 7514#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 7515#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 7516#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 7517#(<= |#Ultimate.C_memset_#t~loopctr21| 10), 7518#(<= |#Ultimate.C_memset_#t~loopctr21| 11), 7519#(<= |#Ultimate.C_memset_#t~loopctr21| 12)] [2018-02-02 10:48:25,335 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:25,335 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:48:25,335 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:48:25,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:48:25,336 INFO L87 Difference]: Start difference. First operand 152 states and 159 transitions. Second operand 19 states. [2018-02-02 10:48:25,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:25,363 INFO L93 Difference]: Finished difference Result 155 states and 162 transitions. [2018-02-02 10:48:25,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:48:25,363 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-02-02 10:48:25,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:25,364 INFO L225 Difference]: With dead ends: 155 [2018-02-02 10:48:25,364 INFO L226 Difference]: Without dead ends: 153 [2018-02-02 10:48:25,365 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-02 10:48:25,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-02-02 10:48:25,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-02-02 10:48:25,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-02-02 10:48:25,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 160 transitions. [2018-02-02 10:48:25,368 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 160 transitions. Word has length 49 [2018-02-02 10:48:25,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:25,369 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 160 transitions. [2018-02-02 10:48:25,369 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:48:25,369 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 160 transitions. [2018-02-02 10:48:25,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 10:48:25,369 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:25,370 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:25,370 INFO L371 AbstractCegarLoop]: === Iteration 25 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:25,370 INFO L82 PathProgramCache]: Analyzing trace with hash -805569157, now seen corresponding path program 16 times [2018-02-02 10:48:25,371 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:25,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:25,386 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:25,570 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:25,570 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:25,570 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 10:48:25,570 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:25,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:25,571 INFO L182 omatonBuilderFactory]: Interpolants [7840#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 7841#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 7842#(and (= 0 |ldv_kobject_init_#in~kobj.offset|) (<= 16 (select |#length| |ldv_kobject_init_#in~kobj.base|))), 7843#(and (= 0 ldv_kobject_init_~kobj.offset) (<= 16 (select |#length| ldv_kobject_init_~kobj.base))), 7844#(and (<= 16 (select |#length| |ldv_kobject_init_internal_#in~kobj.base|)) (= 0 |ldv_kobject_init_internal_#in~kobj.offset|)), 7845#(and (<= 16 (select |#length| ldv_kobject_init_internal_~kobj.base)) (= ldv_kobject_init_internal_~kobj.offset 0)), 7846#(and (<= (+ |ldv_kref_init_#in~kref.offset| 4) (select |#length| |ldv_kref_init_#in~kref.base|)) (<= 12 |ldv_kref_init_#in~kref.offset|)), 7847#(and (<= 12 ldv_kref_init_~kref.offset) (<= (+ ldv_kref_init_~kref.offset 4) (select |#length| ldv_kref_init_~kref.base))), 7834#true, 7835#false, 7836#(= 0 |ldv_malloc_#t~malloc4.offset|), 7837#(= 0 |ldv_malloc_#res.offset|), 7838#(= 0 |ldv_kobject_create_#t~ret17.offset|), 7839#(= 0 ldv_kobject_create_~kobj~1.offset)] [2018-02-02 10:48:25,571 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:25,571 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:48:25,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:48:25,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:48:25,572 INFO L87 Difference]: Start difference. First operand 153 states and 160 transitions. Second operand 14 states. [2018-02-02 10:48:25,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:25,762 INFO L93 Difference]: Finished difference Result 152 states and 159 transitions. [2018-02-02 10:48:25,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:48:25,763 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2018-02-02 10:48:25,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:25,763 INFO L225 Difference]: With dead ends: 152 [2018-02-02 10:48:25,763 INFO L226 Difference]: Without dead ends: 152 [2018-02-02 10:48:25,763 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:48:25,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-02 10:48:25,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-02-02 10:48:25,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-02 10:48:25,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 159 transitions. [2018-02-02 10:48:25,769 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 159 transitions. Word has length 50 [2018-02-02 10:48:25,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:25,769 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 159 transitions. [2018-02-02 10:48:25,769 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:48:25,769 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 159 transitions. [2018-02-02 10:48:25,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 10:48:25,769 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:25,769 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:25,769 INFO L371 AbstractCegarLoop]: === Iteration 26 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:25,770 INFO L82 PathProgramCache]: Analyzing trace with hash -2118052750, now seen corresponding path program 1 times [2018-02-02 10:48:25,770 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:25,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:25,778 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:25,862 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:25,863 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:25,863 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:48:25,863 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:25,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:25,863 INFO L182 omatonBuilderFactory]: Interpolants [8160#true, 8161#false, 8162#(= 1 (select |#valid| |#Ultimate.C_memset_#ptr.base|)), 8163#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base)), 8164#(= 1 (select |#valid| |ldv_kobject_init_#in~kobj.base|)), 8165#(= 1 (select |#valid| ldv_kobject_init_~kobj.base)), 8166#(= 1 (select |#valid| |ldv_kobject_init_internal_#in~kobj.base|)), 8167#(= 1 (select |#valid| ldv_kobject_init_internal_~kobj.base)), 8168#(= 1 (select |#valid| |LDV_INIT_LIST_HEAD_#in~list.base|)), 8169#(= 1 (select |#valid| LDV_INIT_LIST_HEAD_~list.base))] [2018-02-02 10:48:25,863 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:25,863 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:48:25,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:48:25,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:48:25,864 INFO L87 Difference]: Start difference. First operand 152 states and 159 transitions. Second operand 10 states. [2018-02-02 10:48:26,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:26,132 INFO L93 Difference]: Finished difference Result 150 states and 157 transitions. [2018-02-02 10:48:26,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:48:26,133 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-02-02 10:48:26,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:26,134 INFO L225 Difference]: With dead ends: 150 [2018-02-02 10:48:26,134 INFO L226 Difference]: Without dead ends: 150 [2018-02-02 10:48:26,134 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:48:26,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-02 10:48:26,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-02-02 10:48:26,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-02 10:48:26,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 157 transitions. [2018-02-02 10:48:26,137 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 157 transitions. Word has length 55 [2018-02-02 10:48:26,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:26,137 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 157 transitions. [2018-02-02 10:48:26,137 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:48:26,137 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 157 transitions. [2018-02-02 10:48:26,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 10:48:26,138 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:26,138 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:26,138 INFO L371 AbstractCegarLoop]: === Iteration 27 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:26,138 INFO L82 PathProgramCache]: Analyzing trace with hash -2118052749, now seen corresponding path program 1 times [2018-02-02 10:48:26,139 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:26,153 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:26,308 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:26,308 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:26,308 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 10:48:26,308 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:26,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:26,309 INFO L182 omatonBuilderFactory]: Interpolants [8480#(= 0 |ldv_kobject_create_#t~ret17.offset|), 8481#(= 0 ldv_kobject_create_~kobj~1.offset), 8482#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 8483#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 8484#(and (= 0 |ldv_kobject_init_#in~kobj.offset|) (<= 16 (select |#length| |ldv_kobject_init_#in~kobj.base|))), 8485#(and (= 0 ldv_kobject_init_~kobj.offset) (<= 16 (select |#length| ldv_kobject_init_~kobj.base))), 8486#(and (<= 16 (select |#length| |ldv_kobject_init_internal_#in~kobj.base|)) (= 0 |ldv_kobject_init_internal_#in~kobj.offset|)), 8487#(and (<= 16 (select |#length| ldv_kobject_init_internal_~kobj.base)) (= ldv_kobject_init_internal_~kobj.offset 0)), 8488#(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|))), 8489#(and (<= (+ LDV_INIT_LIST_HEAD_~list.offset 12) (select |#length| LDV_INIT_LIST_HEAD_~list.base)) (<= 4 LDV_INIT_LIST_HEAD_~list.offset)), 8476#true, 8477#false, 8478#(= 0 |ldv_malloc_#t~malloc4.offset|), 8479#(= 0 |ldv_malloc_#res.offset|)] [2018-02-02 10:48:26,309 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:26,309 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:48:26,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:48:26,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:48:26,309 INFO L87 Difference]: Start difference. First operand 150 states and 157 transitions. Second operand 14 states. [2018-02-02 10:48:26,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:26,507 INFO L93 Difference]: Finished difference Result 148 states and 155 transitions. [2018-02-02 10:48:26,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:48:26,507 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2018-02-02 10:48:26,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:26,508 INFO L225 Difference]: With dead ends: 148 [2018-02-02 10:48:26,508 INFO L226 Difference]: Without dead ends: 148 [2018-02-02 10:48:26,508 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:48:26,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-02-02 10:48:26,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-02-02 10:48:26,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-02 10:48:26,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 155 transitions. [2018-02-02 10:48:26,510 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 155 transitions. Word has length 55 [2018-02-02 10:48:26,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:26,510 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 155 transitions. [2018-02-02 10:48:26,510 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:48:26,511 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 155 transitions. [2018-02-02 10:48:26,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:48:26,511 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:26,511 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:26,511 INFO L371 AbstractCegarLoop]: === Iteration 28 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:26,511 INFO L82 PathProgramCache]: Analyzing trace with hash 533209049, now seen corresponding path program 1 times [2018-02-02 10:48:26,512 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:26,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:26,519 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:26,560 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:26,560 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:26,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:48:26,560 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:26,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:26,561 INFO L182 omatonBuilderFactory]: Interpolants [8800#(= ldv_kobject_init_~kobj.base |ldv_kobject_init_#in~kobj.base|), 8801#(= 0 |ldv_kobject_init_#in~kobj.base|), 8794#true, 8795#false, 8796#(not (= |ldv_malloc_#t~malloc4.base| 0)), 8797#(not (= |ldv_malloc_#res.base| 0)), 8798#(not (= |ldv_kobject_create_#t~ret17.base| 0)), 8799#(not (= ldv_kobject_create_~kobj~1.base 0))] [2018-02-02 10:48:26,561 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:26,561 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:48:26,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:48:26,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:48:26,561 INFO L87 Difference]: Start difference. First operand 148 states and 155 transitions. Second operand 8 states. [2018-02-02 10:48:26,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:26,600 INFO L93 Difference]: Finished difference Result 150 states and 156 transitions. [2018-02-02 10:48:26,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:48:26,600 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2018-02-02 10:48:26,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:26,601 INFO L225 Difference]: With dead ends: 150 [2018-02-02 10:48:26,601 INFO L226 Difference]: Without dead ends: 148 [2018-02-02 10:48:26,602 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:48:26,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-02-02 10:48:26,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-02-02 10:48:26,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-02 10:48:26,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 154 transitions. [2018-02-02 10:48:26,604 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 154 transitions. Word has length 58 [2018-02-02 10:48:26,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:26,604 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 154 transitions. [2018-02-02 10:48:26,604 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:48:26,604 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 154 transitions. [2018-02-02 10:48:26,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 10:48:26,605 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:26,605 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:26,605 INFO L371 AbstractCegarLoop]: === Iteration 29 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:26,605 INFO L82 PathProgramCache]: Analyzing trace with hash -793469840, now seen corresponding path program 1 times [2018-02-02 10:48:26,606 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:26,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:26,614 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:26,667 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:26,667 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:26,667 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 10:48:26,667 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:26,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:26,667 INFO L182 omatonBuilderFactory]: Interpolants [9104#true, 9105#false, 9106#(not (= |ldv_malloc_#t~malloc4.base| 0)), 9107#(not (= |ldv_malloc_#res.base| 0)), 9108#(not (= |ldv_kobject_create_#t~ret17.base| 0)), 9109#(not (= ldv_kobject_create_~kobj~1.base 0)), 9110#(= ldv_kobject_init_~kobj.base |ldv_kobject_init_#in~kobj.base|), 9111#(= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|), 9112#(= 0 |ldv_kobject_init_internal_#in~kobj.base|), 9113#(= 0 |ldv_kobject_init_#in~kobj.base|)] [2018-02-02 10:48:26,667 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:26,668 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:48:26,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:48:26,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:48:26,668 INFO L87 Difference]: Start difference. First operand 148 states and 154 transitions. Second operand 10 states. [2018-02-02 10:48:26,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:26,715 INFO L93 Difference]: Finished difference Result 152 states and 157 transitions. [2018-02-02 10:48:26,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:48:26,715 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2018-02-02 10:48:26,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:26,716 INFO L225 Difference]: With dead ends: 152 [2018-02-02 10:48:26,716 INFO L226 Difference]: Without dead ends: 148 [2018-02-02 10:48:26,716 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:48:26,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-02-02 10:48:26,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-02-02 10:48:26,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-02 10:48:26,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 153 transitions. [2018-02-02 10:48:26,720 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 153 transitions. Word has length 63 [2018-02-02 10:48:26,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:26,721 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 153 transitions. [2018-02-02 10:48:26,721 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:48:26,721 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 153 transitions. [2018-02-02 10:48:26,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 10:48:26,721 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:26,721 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:26,721 INFO L371 AbstractCegarLoop]: === Iteration 30 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:26,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1873730024, now seen corresponding path program 1 times [2018-02-02 10:48:26,722 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:26,733 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:26,830 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:26,830 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:26,830 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 10:48:26,830 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:26,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:26,831 INFO L182 omatonBuilderFactory]: Interpolants [9420#true, 9421#false, 9422#(= 1 (select |#valid| |#Ultimate.C_memset_#ptr.base|)), 9423#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base)), 9424#(= 1 (select |#valid| |ldv_kobject_create_#res.base|)), 9425#(= 1 (select |#valid| |entry_point_#t~ret19.base|)), 9426#(= 1 (select |#valid| entry_point_~kobj~2.base)), 9427#(= 1 (select |#valid| |ldv_kobject_get_#in~kobj.base|)), 9428#(= 1 (select |#valid| ldv_kobject_get_~kobj.base)), 9429#(= 1 (select |#valid| |ldv_kref_get_#in~kref.base|)), 9430#(= 1 (select |#valid| ldv_kref_get_~kref.base)), 9431#(= 1 (select |#valid| |ldv_atomic_add_return_#in~v.base|)), 9432#(= 1 (select |#valid| ldv_atomic_add_return_~v.base))] [2018-02-02 10:48:26,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-02 10:48:26,831 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:48:26,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:48:26,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:48:26,831 INFO L87 Difference]: Start difference. First operand 148 states and 153 transitions. Second operand 13 states. [2018-02-02 10:48:27,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:27,095 INFO L93 Difference]: Finished difference Result 146 states and 151 transitions. [2018-02-02 10:48:27,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:48:27,095 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 74 [2018-02-02 10:48:27,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:27,096 INFO L225 Difference]: With dead ends: 146 [2018-02-02 10:48:27,096 INFO L226 Difference]: Without dead ends: 146 [2018-02-02 10:48:27,096 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:48:27,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-02 10:48:27,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-02-02 10:48:27,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-02 10:48:27,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 151 transitions. [2018-02-02 10:48:27,100 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 151 transitions. Word has length 74 [2018-02-02 10:48:27,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:27,100 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 151 transitions. [2018-02-02 10:48:27,100 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:48:27,100 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 151 transitions. [2018-02-02 10:48:27,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 10:48:27,101 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:27,101 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:27,101 INFO L371 AbstractCegarLoop]: === Iteration 31 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:27,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1873730023, now seen corresponding path program 1 times [2018-02-02 10:48:27,102 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:27,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:27,118 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:27,356 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:27,356 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:27,356 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-02 10:48:27,357 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:27,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-02 10:48:27,357 INFO L182 omatonBuilderFactory]: Interpolants [9733#true, 9734#false, 9735#(= 0 |ldv_malloc_#t~malloc4.offset|), 9736#(= 0 |ldv_malloc_#res.offset|), 9737#(= 0 |ldv_kobject_create_#t~ret17.offset|), 9738#(= 0 ldv_kobject_create_~kobj~1.offset), 9739#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 9740#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 9741#(and (= 0 |ldv_kobject_create_#res.offset|) (<= 16 (select |#length| |ldv_kobject_create_#res.base|))), 9742#(and (= 0 |entry_point_#t~ret19.offset|) (<= 16 (select |#length| |entry_point_#t~ret19.base|))), 9743#(and (= 0 entry_point_~kobj~2.offset) (<= 16 (select |#length| entry_point_~kobj~2.base))), 9744#(and (<= 16 (select |#length| |ldv_kobject_get_#in~kobj.base|)) (= 0 |ldv_kobject_get_#in~kobj.offset|)), 9745#(and (<= 16 (select |#length| ldv_kobject_get_~kobj.base)) (= ldv_kobject_get_~kobj.offset 0)), 9746#(and (<= 12 |ldv_kref_get_#in~kref.offset|) (<= (+ |ldv_kref_get_#in~kref.offset| 4) (select |#length| |ldv_kref_get_#in~kref.base|))), 9747#(and (<= 12 ldv_kref_get_~kref.offset) (<= (+ ldv_kref_get_~kref.offset 4) (select |#length| ldv_kref_get_~kref.base))), 9748#(and (<= 12 |ldv_atomic_add_return_#in~v.offset|) (<= (+ |ldv_atomic_add_return_#in~v.offset| 4) (select |#length| |ldv_atomic_add_return_#in~v.base|))), 9749#(and (<= 12 ldv_atomic_add_return_~v.offset) (<= (+ ldv_atomic_add_return_~v.offset 4) (select |#length| ldv_atomic_add_return_~v.base)))] [2018-02-02 10:48:27,357 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:27,357 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:48:27,357 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:48:27,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:48:27,357 INFO L87 Difference]: Start difference. First operand 146 states and 151 transitions. Second operand 17 states. [2018-02-02 10:48:27,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:27,682 INFO L93 Difference]: Finished difference Result 144 states and 149 transitions. [2018-02-02 10:48:27,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:48:27,682 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 74 [2018-02-02 10:48:27,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:27,683 INFO L225 Difference]: With dead ends: 144 [2018-02-02 10:48:27,683 INFO L226 Difference]: Without dead ends: 144 [2018-02-02 10:48:27,683 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:48:27,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-02-02 10:48:27,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-02-02 10:48:27,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-02 10:48:27,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 149 transitions. [2018-02-02 10:48:27,686 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 149 transitions. Word has length 74 [2018-02-02 10:48:27,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:27,687 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 149 transitions. [2018-02-02 10:48:27,687 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:48:27,687 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 149 transitions. [2018-02-02 10:48:27,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-02 10:48:27,688 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:27,688 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:27,688 INFO L371 AbstractCegarLoop]: === Iteration 32 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:27,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1285627172, now seen corresponding path program 1 times [2018-02-02 10:48:27,689 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:27,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:27,705 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:27,790 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:27,790 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:27,790 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 10:48:27,791 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:27,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:27,791 INFO L182 omatonBuilderFactory]: Interpolants [10048#true, 10049#false, 10050#(not (= |ldv_malloc_#t~malloc4.base| 0)), 10051#(not (= |ldv_malloc_#res.base| 0)), 10052#(not (= |ldv_kobject_create_#t~ret17.base| 0)), 10053#(not (= ldv_kobject_create_~kobj~1.base 0)), 10054#(not (= |ldv_kobject_create_#res.base| 0)), 10055#(not (= |entry_point_#t~ret19.base| 0)), 10056#(not (= entry_point_~kobj~2.base 0)), 10057#(= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|), 10058#(= 0 |ldv_kobject_get_#in~kobj.base|)] [2018-02-02 10:48:27,791 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:27,792 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:48:27,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:48:27,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:48:27,792 INFO L87 Difference]: Start difference. First operand 144 states and 149 transitions. Second operand 11 states. [2018-02-02 10:48:27,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:27,844 INFO L93 Difference]: Finished difference Result 147 states and 151 transitions. [2018-02-02 10:48:27,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:48:27,844 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2018-02-02 10:48:27,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:27,845 INFO L225 Difference]: With dead ends: 147 [2018-02-02 10:48:27,845 INFO L226 Difference]: Without dead ends: 144 [2018-02-02 10:48:27,845 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:48:27,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-02-02 10:48:27,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-02-02 10:48:27,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-02 10:48:27,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 148 transitions. [2018-02-02 10:48:27,848 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 148 transitions. Word has length 83 [2018-02-02 10:48:27,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:27,848 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 148 transitions. [2018-02-02 10:48:27,848 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:48:27,848 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 148 transitions. [2018-02-02 10:48:27,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-02-02 10:48:27,848 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:27,848 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:27,848 INFO L371 AbstractCegarLoop]: === Iteration 33 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:27,849 INFO L82 PathProgramCache]: Analyzing trace with hash 101557868, now seen corresponding path program 1 times [2018-02-02 10:48:27,849 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:27,860 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:28,016 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:28,016 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:28,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-02 10:48:28,017 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:28,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:28,017 INFO L182 omatonBuilderFactory]: Interpolants [10368#(= 1 (select |#valid| |ldv_kref_put_#in~kref.base|)), 10369#(= 1 (select |#valid| ldv_kref_put_~kref.base)), 10370#(= 1 (select |#valid| |ldv_kref_sub_#in~kref.base|)), 10371#(= 1 (select |#valid| ldv_kref_sub_~kref.base)), 10372#(= 1 (select |#valid| |ldv_atomic_sub_return_#in~v.base|)), 10373#(= 1 (select |#valid| ldv_atomic_sub_return_~v.base)), 10356#true, 10357#false, 10358#(= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|), 10359#(= ldv_kref_get_~kref.base |ldv_kref_get_#in~kref.base|), 10360#(= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|), 10361#(and (= 1 (select |#valid| ldv_atomic_add_return_~v.base)) (= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|)), 10362#(= 1 (select |#valid| |ldv_atomic_add_return_#in~v.base|)), 10363#(= 1 (select |#valid| |ldv_kref_get_#in~kref.base|)), 10364#(= 1 (select |#valid| |ldv_kobject_get_#in~kobj.base|)), 10365#(= 1 (select |#valid| entry_point_~kobj~2.base)), 10366#(= 1 (select |#valid| |ldv_kobject_put_#in~kobj.base|)), 10367#(= 1 (select |#valid| ldv_kobject_put_~kobj.base))] [2018-02-02 10:48:28,017 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:28,018 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:48:28,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:48:28,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:48:28,018 INFO L87 Difference]: Start difference. First operand 144 states and 148 transitions. Second operand 18 states. [2018-02-02 10:48:28,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:28,285 INFO L93 Difference]: Finished difference Result 172 states and 183 transitions. [2018-02-02 10:48:28,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:48:28,285 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 96 [2018-02-02 10:48:28,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:28,286 INFO L225 Difference]: With dead ends: 172 [2018-02-02 10:48:28,286 INFO L226 Difference]: Without dead ends: 172 [2018-02-02 10:48:28,286 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:48:28,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-02-02 10:48:28,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 167. [2018-02-02 10:48:28,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-02-02 10:48:28,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 179 transitions. [2018-02-02 10:48:28,290 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 179 transitions. Word has length 96 [2018-02-02 10:48:28,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:28,290 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 179 transitions. [2018-02-02 10:48:28,290 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:48:28,290 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 179 transitions. [2018-02-02 10:48:28,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-02-02 10:48:28,291 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:28,291 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:28,291 INFO L371 AbstractCegarLoop]: === Iteration 34 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:28,291 INFO L82 PathProgramCache]: Analyzing trace with hash 101557869, now seen corresponding path program 1 times [2018-02-02 10:48:28,292 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:28,310 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:28,580 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:28,581 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:28,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-02 10:48:28,581 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:28,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-02 10:48:28,581 INFO L182 omatonBuilderFactory]: Interpolants [10725#true, 10726#false, 10727#(= 0 |ldv_malloc_#t~malloc4.offset|), 10728#(= 0 |ldv_malloc_#res.offset|), 10729#(= 0 |ldv_kobject_create_#t~ret17.offset|), 10730#(= 0 ldv_kobject_create_~kobj~1.offset), 10731#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 10732#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 10733#(and (= 0 |ldv_kobject_create_#res.offset|) (<= 16 (select |#length| |ldv_kobject_create_#res.base|))), 10734#(and (= 0 |entry_point_#t~ret19.offset|) (<= 16 (select |#length| |entry_point_#t~ret19.base|))), 10735#(and (= 0 entry_point_~kobj~2.offset) (<= 16 (select |#length| entry_point_~kobj~2.base))), 10736#(and (<= 16 (select |#length| |ldv_kobject_put_#in~kobj.base|)) (= 0 |ldv_kobject_put_#in~kobj.offset|)), 10737#(and (= ldv_kobject_put_~kobj.offset 0) (<= 16 (select |#length| ldv_kobject_put_~kobj.base))), 10738#(and (<= 12 |ldv_kref_put_#in~kref.offset|) (<= (+ |ldv_kref_put_#in~kref.offset| 4) (select |#length| |ldv_kref_put_#in~kref.base|))), 10739#(and (<= 12 ldv_kref_put_~kref.offset) (<= (+ ldv_kref_put_~kref.offset 4) (select |#length| ldv_kref_put_~kref.base))), 10740#(and (<= (+ |ldv_kref_sub_#in~kref.offset| 4) (select |#length| |ldv_kref_sub_#in~kref.base|)) (<= 12 |ldv_kref_sub_#in~kref.offset|)), 10741#(and (<= (+ ldv_kref_sub_~kref.offset 4) (select |#length| ldv_kref_sub_~kref.base)) (<= 12 ldv_kref_sub_~kref.offset)), 10742#(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|)), 10743#(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-02 10:48:28,582 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:28,582 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:48:28,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:48:28,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:48:28,582 INFO L87 Difference]: Start difference. First operand 167 states and 179 transitions. Second operand 19 states. [2018-02-02 10:48:28,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:28,976 INFO L93 Difference]: Finished difference Result 165 states and 175 transitions. [2018-02-02 10:48:28,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:48:28,977 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 96 [2018-02-02 10:48:28,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:28,977 INFO L225 Difference]: With dead ends: 165 [2018-02-02 10:48:28,977 INFO L226 Difference]: Without dead ends: 165 [2018-02-02 10:48:28,978 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:48:28,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-02-02 10:48:28,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-02-02 10:48:28,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-02 10:48:28,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 175 transitions. [2018-02-02 10:48:28,981 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 175 transitions. Word has length 96 [2018-02-02 10:48:28,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:28,981 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 175 transitions. [2018-02-02 10:48:28,981 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:48:28,981 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 175 transitions. [2018-02-02 10:48:28,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-02 10:48:28,982 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:28,982 INFO L351 BasicCegarLoop]: trace histogram [16, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:28,982 INFO L371 AbstractCegarLoop]: === Iteration 35 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:28,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1923624090, now seen corresponding path program 1 times [2018-02-02 10:48:28,983 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:28,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:28,997 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:29,100 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-02-02 10:48:29,100 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:29,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:48:29,100 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:29,101 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 10:48:29,101 INFO L182 omatonBuilderFactory]: Interpolants [11088#(not (= |ldv_malloc_#t~malloc4.base| 0)), 11089#(not (= |ldv_malloc_#res.base| 0)), 11090#(not (= |ldv_kobject_create_#t~ret17.base| 0)), 11091#(not (= ldv_kobject_create_~kobj~1.base 0)), 11092#(not (= |ldv_kobject_create_#res.base| 0)), 11093#(not (= |entry_point_#t~ret19.base| 0)), 11094#(not (= entry_point_~kobj~2.base 0)), 11095#(= ldv_kobject_put_~kobj.base |ldv_kobject_put_#in~kobj.base|), 11096#(= 0 |ldv_kobject_put_#in~kobj.base|), 11086#true, 11087#false] [2018-02-02 10:48:29,101 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-02-02 10:48:29,101 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:48:29,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:48:29,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:48:29,101 INFO L87 Difference]: Start difference. First operand 165 states and 175 transitions. Second operand 11 states. [2018-02-02 10:48:29,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:29,174 INFO L93 Difference]: Finished difference Result 166 states and 172 transitions. [2018-02-02 10:48:29,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:48:29,174 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2018-02-02 10:48:29,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:29,175 INFO L225 Difference]: With dead ends: 166 [2018-02-02 10:48:29,175 INFO L226 Difference]: Without dead ends: 162 [2018-02-02 10:48:29,175 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:48:29,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-02 10:48:29,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-02-02 10:48:29,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-02-02 10:48:29,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 168 transitions. [2018-02-02 10:48:29,178 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 168 transitions. Word has length 99 [2018-02-02 10:48:29,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:29,178 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 168 transitions. [2018-02-02 10:48:29,178 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:48:29,178 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 168 transitions. [2018-02-02 10:48:29,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-02-02 10:48:29,178 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:29,178 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:29,179 INFO L371 AbstractCegarLoop]: === Iteration 36 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:29,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1608011136, now seen corresponding path program 1 times [2018-02-02 10:48:29,179 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:29,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:29,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:29,471 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:29,471 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:29,471 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-02-02 10:48:29,471 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:29,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:29,471 INFO L182 omatonBuilderFactory]: Interpolants [11431#true, 11432#false, 11433#(= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|), 11434#(= ldv_kref_get_~kref.base |ldv_kref_get_#in~kref.base|), 11435#(= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|), 11436#(= 1 (select |#valid| |ldv_atomic_add_return_#in~v.base|)), 11437#(= 1 (select |#valid| |ldv_kref_get_#in~kref.base|)), 11438#(= 1 (select |#valid| |ldv_kobject_get_#in~kobj.base|)), 11439#(= 1 (select |#valid| entry_point_~kobj~2.base)), 11440#(= 1 (select |#valid| |ldv_kobject_put_#in~kobj.base|)), 11441#(= 1 (select |#valid| ldv_kobject_put_~kobj.base)), 11442#(= 1 (select |#valid| |ldv_kref_put_#in~kref.base|)), 11443#(= 1 (select |#valid| ldv_kref_put_~kref.base)), 11444#(= 1 (select |#valid| |ldv_kref_sub_#in~kref.base|)), 11445#(= 1 (select |#valid| ldv_kref_sub_~kref.base)), 11446#(= 1 (select |#valid| |##fun~$Pointer$~TO~VOID_#in~kref.base|)), 11447#(= 1 (select |#valid| |##fun~$Pointer$~TO~VOID_#~kref.base|)), 11448#(= 1 (select |#valid| |ldv_kobject_release_#in~kref.base|)), 11449#(= 1 (select |#valid| ldv_kobject_release_~kobj~0.base)), 11450#(= 1 (select |#valid| |ldv_kobject_cleanup_#in~kobj.base|)), 11451#(= 1 (select |#valid| ldv_kobject_cleanup_~kobj.base))] [2018-02-02 10:48:29,471 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:29,472 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:48:29,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:48:29,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:48:29,472 INFO L87 Difference]: Start difference. First operand 162 states and 168 transitions. Second operand 21 states. [2018-02-02 10:48:29,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:29,793 INFO L93 Difference]: Finished difference Result 172 states and 181 transitions. [2018-02-02 10:48:29,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:48:29,793 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 110 [2018-02-02 10:48:29,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:29,794 INFO L225 Difference]: With dead ends: 172 [2018-02-02 10:48:29,794 INFO L226 Difference]: Without dead ends: 172 [2018-02-02 10:48:29,795 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:48:29,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-02-02 10:48:29,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 168. [2018-02-02 10:48:29,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-02-02 10:48:29,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 178 transitions. [2018-02-02 10:48:29,797 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 178 transitions. Word has length 110 [2018-02-02 10:48:29,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:29,797 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 178 transitions. [2018-02-02 10:48:29,797 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:48:29,797 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 178 transitions. [2018-02-02 10:48:29,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-02-02 10:48:29,798 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:29,798 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:29,798 INFO L371 AbstractCegarLoop]: === Iteration 37 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:29,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1608011135, now seen corresponding path program 1 times [2018-02-02 10:48:29,799 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:29,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:30,245 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:30,245 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:30,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-02-02 10:48:30,246 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:30,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:30,246 INFO L182 omatonBuilderFactory]: Interpolants [11810#true, 11811#false, 11812#(= 0 |ldv_malloc_#t~malloc4.offset|), 11813#(= 0 |ldv_malloc_#res.offset|), 11814#(= 0 |ldv_kobject_create_#t~ret17.offset|), 11815#(= 0 ldv_kobject_create_~kobj~1.offset), 11816#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 11817#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 11818#(and (= 0 |ldv_kobject_create_#res.offset|) (<= 16 (select |#length| |ldv_kobject_create_#res.base|))), 11819#(and (= 0 |entry_point_#t~ret19.offset|) (<= 16 (select |#length| |entry_point_#t~ret19.base|))), 11820#(and (= 0 entry_point_~kobj~2.offset) (<= 16 (select |#length| entry_point_~kobj~2.base))), 11821#(and (<= 16 (select |#length| |ldv_kobject_put_#in~kobj.base|)) (= 0 |ldv_kobject_put_#in~kobj.offset|)), 11822#(and (= ldv_kobject_put_~kobj.offset 0) (<= 16 (select |#length| ldv_kobject_put_~kobj.base))), 11823#(and (<= 12 |ldv_kref_put_#in~kref.offset|) (<= (+ |ldv_kref_put_#in~kref.offset| 4) (select |#length| |ldv_kref_put_#in~kref.base|))), 11824#(and (<= 12 ldv_kref_put_~kref.offset) (<= (+ ldv_kref_put_~kref.offset 4) (select |#length| ldv_kref_put_~kref.base))), 11825#(and (<= (+ |ldv_kref_sub_#in~kref.offset| 4) (select |#length| |ldv_kref_sub_#in~kref.base|)) (<= 12 |ldv_kref_sub_#in~kref.offset|)), 11826#(and (<= (+ ldv_kref_sub_~kref.offset 4) (select |#length| ldv_kref_sub_~kref.base)) (<= 12 ldv_kref_sub_~kref.offset)), 11827#(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|))), 11828#(and (<= 12 |##fun~$Pointer$~TO~VOID_#~kref.offset|) (<= (+ |##fun~$Pointer$~TO~VOID_#~kref.offset| 4) (select |#length| |##fun~$Pointer$~TO~VOID_#~kref.base|))), 11829#(and (<= 12 |ldv_kobject_release_#in~kref.offset|) (<= (+ |ldv_kobject_release_#in~kref.offset| 4) (select |#length| |ldv_kobject_release_#in~kref.base|))), 11830#(and (<= (+ ldv_kobject_release_~kobj~0.offset 16) (select |#length| ldv_kobject_release_~kobj~0.base)) (<= 0 ldv_kobject_release_~kobj~0.offset)), 11831#(and (<= (+ |ldv_kobject_cleanup_#in~kobj.offset| 16) (select |#length| |ldv_kobject_cleanup_#in~kobj.base|)) (<= 0 |ldv_kobject_cleanup_#in~kobj.offset|)), 11832#(and (<= 0 ldv_kobject_cleanup_~kobj.offset) (<= (+ ldv_kobject_cleanup_~kobj.offset 16) (select |#length| ldv_kobject_cleanup_~kobj.base)))] [2018-02-02 10:48:30,246 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:30,246 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:48:30,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:48:30,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:48:30,246 INFO L87 Difference]: Start difference. First operand 168 states and 178 transitions. Second operand 23 states. [2018-02-02 10:48:30,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:30,692 INFO L93 Difference]: Finished difference Result 167 states and 176 transitions. [2018-02-02 10:48:30,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:48:30,692 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 110 [2018-02-02 10:48:30,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:30,693 INFO L225 Difference]: With dead ends: 167 [2018-02-02 10:48:30,693 INFO L226 Difference]: Without dead ends: 167 [2018-02-02 10:48:30,693 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=853, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:48:30,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-02-02 10:48:30,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-02-02 10:48:30,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-02-02 10:48:30,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 176 transitions. [2018-02-02 10:48:30,697 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 176 transitions. Word has length 110 [2018-02-02 10:48:30,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:30,697 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 176 transitions. [2018-02-02 10:48:30,697 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:48:30,697 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 176 transitions. [2018-02-02 10:48:30,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-02-02 10:48:30,698 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:30,698 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:30,698 INFO L371 AbstractCegarLoop]: === Iteration 38 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:30,699 INFO L82 PathProgramCache]: Analyzing trace with hash 889527393, now seen corresponding path program 1 times [2018-02-02 10:48:30,699 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:30,720 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:30,983 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:30,983 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:30,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-02-02 10:48:30,983 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:30,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:30,984 INFO L182 omatonBuilderFactory]: Interpolants [12192#(= 0 |ldv_kobject_put_#in~kobj.offset|), 12193#(= ldv_kobject_put_~kobj.offset 0), 12194#(<= |ldv_kref_put_#in~kref.offset| 12), 12195#(<= ldv_kref_put_~kref.offset 12), 12196#(<= |ldv_kref_sub_#in~kref.offset| 12), 12197#(<= ldv_kref_sub_~kref.offset 12), 12198#(<= |##fun~$Pointer$~TO~VOID_#in~kref.offset| 12), 12199#(<= |##fun~$Pointer$~TO~VOID_#~kref.offset| 12), 12200#(<= |ldv_kobject_release_#in~kref.offset| 12), 12201#(<= ldv_kobject_release_~kobj~0.offset 0), 12202#(<= |ldv_kobject_cleanup_#in~kobj.offset| 0), 12203#(<= ldv_kobject_cleanup_~kobj.offset 0), 12204#(and (<= 0 ldv_kobject_cleanup_~kobj.offset) (<= ldv_kobject_cleanup_~kobj.offset 0)), 12183#true, 12184#false, 12185#(= 0 |ldv_malloc_#t~malloc4.offset|), 12186#(= 0 |ldv_malloc_#res.offset|), 12187#(= 0 |ldv_kobject_create_#t~ret17.offset|), 12188#(= 0 ldv_kobject_create_~kobj~1.offset), 12189#(= 0 |ldv_kobject_create_#res.offset|), 12190#(= 0 |entry_point_#t~ret19.offset|), 12191#(= 0 entry_point_~kobj~2.offset)] [2018-02-02 10:48:30,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-02 10:48:30,984 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:48:30,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:48:30,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:48:30,984 INFO L87 Difference]: Start difference. First operand 167 states and 176 transitions. Second operand 22 states. [2018-02-02 10:48:31,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:31,303 INFO L93 Difference]: Finished difference Result 166 states and 175 transitions. [2018-02-02 10:48:31,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:48:31,304 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 112 [2018-02-02 10:48:31,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:31,305 INFO L225 Difference]: With dead ends: 166 [2018-02-02 10:48:31,305 INFO L226 Difference]: Without dead ends: 166 [2018-02-02 10:48:31,305 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=850, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:48:31,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-02-02 10:48:31,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-02-02 10:48:31,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-02-02 10:48:31,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 175 transitions. [2018-02-02 10:48:31,309 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 175 transitions. Word has length 112 [2018-02-02 10:48:31,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:31,310 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 175 transitions. [2018-02-02 10:48:31,310 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:48:31,310 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 175 transitions. [2018-02-02 10:48:31,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-02-02 10:48:31,310 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:31,310 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:31,311 INFO L371 AbstractCegarLoop]: === Iteration 39 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:31,311 INFO L82 PathProgramCache]: Analyzing trace with hash 137335490, now seen corresponding path program 1 times [2018-02-02 10:48:31,311 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:31,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:31,362 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:31,386 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: Unknown lemma type! at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedTraceAbstractionRefinementStrategy.getTraceCheck(FixedTraceAbstractionRefinementStrategy.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-02 10:48:31,390 INFO L168 Benchmark]: Toolchain (without parser) took 10647.80 ms. Allocated memory was 401.1 MB in the beginning and 870.8 MB in the end (delta: 469.8 MB). Free memory was 358.0 MB in the beginning and 588.2 MB in the end (delta: -230.2 MB). Peak memory consumption was 239.5 MB. Max. memory is 5.3 GB. [2018-02-02 10:48:31,391 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 401.1 MB. Free memory is still 364.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:48:31,391 INFO L168 Benchmark]: CACSL2BoogieTranslator took 190.60 ms. Allocated memory is still 401.1 MB. Free memory was 358.0 MB in the beginning and 343.4 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. [2018-02-02 10:48:31,392 INFO L168 Benchmark]: Boogie Preprocessor took 36.06 ms. Allocated memory is still 401.1 MB. Free memory was 343.4 MB in the beginning and 342.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:48:31,392 INFO L168 Benchmark]: RCFGBuilder took 422.08 ms. Allocated memory is still 401.1 MB. Free memory was 342.1 MB in the beginning and 305.5 MB in the end (delta: 36.6 MB). Peak memory consumption was 36.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:48:31,392 INFO L168 Benchmark]: TraceAbstraction took 9995.67 ms. Allocated memory was 401.1 MB in the beginning and 870.8 MB in the end (delta: 469.8 MB). Free memory was 304.2 MB in the beginning and 588.2 MB in the end (delta: -284.0 MB). Peak memory consumption was 185.8 MB. Max. memory is 5.3 GB. [2018-02-02 10:48:31,393 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 401.1 MB. Free memory is still 364.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 190.60 ms. Allocated memory is still 401.1 MB. Free memory was 358.0 MB in the beginning and 343.4 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.06 ms. Allocated memory is still 401.1 MB. Free memory was 343.4 MB in the beginning and 342.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 422.08 ms. Allocated memory is still 401.1 MB. Free memory was 342.1 MB in the beginning and 305.5 MB in the end (delta: 36.6 MB). Peak memory consumption was 36.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 9995.67 ms. Allocated memory was 401.1 MB in the beginning and 870.8 MB in the end (delta: 469.8 MB). Free memory was 304.2 MB in the beginning and 588.2 MB in the end (delta: -284.0 MB). Peak memory consumption was 185.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: Unknown lemma type! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Unknown lemma type!: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-48-31-400.csv Received shutdown request...