java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_3_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 04:14:39,867 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 04:14:39,869 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 04:14:39,881 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 04:14:39,881 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 04:14:39,882 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 04:14:39,882 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 04:14:39,884 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 04:14:39,885 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 04:14:39,886 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 04:14:39,887 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 04:14:39,887 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 04:14:39,887 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 04:14:39,888 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 04:14:39,889 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 04:14:39,891 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 04:14:39,892 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 04:14:39,894 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 04:14:39,895 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 04:14:39,896 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 04:14:39,897 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 04:14:39,898 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 04:14:39,898 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 04:14:39,899 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 04:14:39,899 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 04:14:39,900 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 04:14:39,900 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 04:14:39,901 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 04:14:39,901 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 04:14:39,901 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 04:14:39,901 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 04:14:39,902 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 04:14:39,911 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 04:14:39,911 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 04:14:39,912 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 04:14:39,912 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 04:14:39,912 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 04:14:39,913 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 04:14:39,913 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 04:14:39,913 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 04:14:39,913 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 04:14:39,913 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 04:14:39,913 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 04:14:39,913 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 04:14:39,914 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 04:14:39,914 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 04:14:39,914 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 04:14:39,914 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 04:14:39,914 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 04:14:39,914 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 04:14:39,914 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 04:14:39,915 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 04:14:39,915 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 04:14:39,915 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 04:14:39,915 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 04:14:39,915 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 04:14:39,915 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 04:14:39,943 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 04:14:39,952 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 04:14:39,955 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 04:14:39,957 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 04:14:39,957 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 04:14:39,958 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_3_false-valid-deref.i [2018-02-04 04:14:40,108 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 04:14:40,109 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 04:14:40,110 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 04:14:40,110 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 04:14:40,115 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 04:14:40,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:14:40" (1/1) ... [2018-02-04 04:14:40,118 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f13972f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:14:40, skipping insertion in model container [2018-02-04 04:14:40,119 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:14:40" (1/1) ... [2018-02-04 04:14:40,132 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:14:40,166 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:14:40,255 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:14:40,271 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:14:40,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:14:40 WrapperNode [2018-02-04 04:14:40,279 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 04:14:40,279 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 04:14:40,279 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 04:14:40,279 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 04:14:40,292 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:14:40" (1/1) ... [2018-02-04 04:14:40,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:14:40" (1/1) ... [2018-02-04 04:14:40,303 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:14:40" (1/1) ... [2018-02-04 04:14:40,303 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:14:40" (1/1) ... [2018-02-04 04:14:40,308 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:14:40" (1/1) ... [2018-02-04 04:14:40,310 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:14:40" (1/1) ... [2018-02-04 04:14:40,312 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:14:40" (1/1) ... [2018-02-04 04:14:40,315 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 04:14:40,315 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 04:14:40,315 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 04:14:40,316 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 04:14:40,316 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:14:40" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 04:14:40,351 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 04:14:40,352 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 04:14:40,352 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-02-04 04:14:40,352 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 04:14:40,352 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-02-04 04:14:40,352 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-02-04 04:14:40,352 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-02-04 04:14:40,352 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-02-04 04:14:40,352 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-02-04 04:14:40,352 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-02-04 04:14:40,352 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-02-04 04:14:40,352 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-02-04 04:14:40,352 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-02-04 04:14:40,352 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-02-04 04:14:40,352 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-02-04 04:14:40,353 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 04:14:40,353 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 04:14:40,353 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 04:14:40,353 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 04:14:40,353 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 04:14:40,353 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 04:14:40,353 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 04:14:40,353 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 04:14:40,353 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 04:14:40,353 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-04 04:14:40,353 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-04 04:14:40,353 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 04:14:40,353 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 04:14:40,353 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 04:14:40,353 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-04 04:14:40,354 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 04:14:40,354 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-02-04 04:14:40,354 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-02-04 04:14:40,354 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-02-04 04:14:40,354 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-02-04 04:14:40,354 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-02-04 04:14:40,354 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-02-04 04:14:40,355 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-02-04 04:14:40,355 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-02-04 04:14:40,355 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-02-04 04:14:40,355 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-02-04 04:14:40,355 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-02-04 04:14:40,355 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-02-04 04:14:40,355 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 04:14:40,355 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 04:14:40,356 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 04:14:40,356 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 04:14:40,533 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-04 04:14:40,655 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 04:14:40,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:14:40 BoogieIcfgContainer [2018-02-04 04:14:40,655 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 04:14:40,656 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 04:14:40,656 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 04:14:40,658 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 04:14:40,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 04:14:40" (1/3) ... [2018-02-04 04:14:40,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ef85f80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:14:40, skipping insertion in model container [2018-02-04 04:14:40,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:14:40" (2/3) ... [2018-02-04 04:14:40,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ef85f80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:14:40, skipping insertion in model container [2018-02-04 04:14:40,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:14:40" (3/3) ... [2018-02-04 04:14:40,660 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test22_3_false-valid-deref.i [2018-02-04 04:14:40,665 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 04:14:40,670 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-02-04 04:14:40,694 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 04:14:40,695 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 04:14:40,695 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 04:14:40,695 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 04:14:40,695 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 04:14:40,695 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 04:14:40,695 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 04:14:40,695 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 04:14:40,696 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 04:14:40,706 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states. [2018-02-04 04:14:40,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 04:14:40,714 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:40,715 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:14:40,715 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:14:40,717 INFO L82 PathProgramCache]: Analyzing trace with hash 556227080, now seen corresponding path program 1 times [2018-02-04 04:14:40,718 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:40,719 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:40,756 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:40,756 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:40,756 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:40,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:40,798 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:40,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:40,887 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:14:40,888 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 04:14:40,953 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:14:40,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:14:40,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:14:40,969 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 5 states. [2018-02-04 04:14:41,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:41,028 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2018-02-04 04:14:41,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:14:41,029 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 04:14:41,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:41,040 INFO L225 Difference]: With dead ends: 125 [2018-02-04 04:14:41,040 INFO L226 Difference]: Without dead ends: 122 [2018-02-04 04:14:41,042 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:14:41,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-04 04:14:41,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2018-02-04 04:14:41,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-04 04:14:41,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-02-04 04:14:41,083 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 17 [2018-02-04 04:14:41,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:41,084 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-02-04 04:14:41,084 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:14:41,084 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-02-04 04:14:41,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 04:14:41,084 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:41,085 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:14:41,085 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:14:41,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1895274134, now seen corresponding path program 1 times [2018-02-04 04:14:41,085 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:41,085 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:41,087 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:41,087 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:41,087 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:41,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:41,104 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:41,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:41,153 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:14:41,153 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 04:14:41,154 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:14:41,154 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:14:41,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:14:41,154 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 6 states. [2018-02-04 04:14:41,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:41,275 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2018-02-04 04:14:41,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:14:41,276 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 04:14:41,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:41,277 INFO L225 Difference]: With dead ends: 121 [2018-02-04 04:14:41,278 INFO L226 Difference]: Without dead ends: 121 [2018-02-04 04:14:41,278 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:14:41,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-04 04:14:41,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-02-04 04:14:41,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-04 04:14:41,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2018-02-04 04:14:41,286 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 19 [2018-02-04 04:14:41,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:41,286 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2018-02-04 04:14:41,286 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:14:41,287 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2018-02-04 04:14:41,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 04:14:41,287 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:41,287 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:14:41,287 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:14:41,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1895274133, now seen corresponding path program 1 times [2018-02-04 04:14:41,288 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:41,288 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:41,289 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:41,289 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:41,289 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:41,305 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:41,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:41,442 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:14:41,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 04:14:41,442 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 04:14:41,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 04:14:41,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:14:41,443 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 7 states. [2018-02-04 04:14:41,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:41,606 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2018-02-04 04:14:41,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 04:14:41,609 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-02-04 04:14:41,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:41,610 INFO L225 Difference]: With dead ends: 120 [2018-02-04 04:14:41,610 INFO L226 Difference]: Without dead ends: 120 [2018-02-04 04:14:41,611 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-04 04:14:41,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-04 04:14:41,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-02-04 04:14:41,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-04 04:14:41,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2018-02-04 04:14:41,620 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 19 [2018-02-04 04:14:41,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:41,620 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2018-02-04 04:14:41,620 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 04:14:41,620 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2018-02-04 04:14:41,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 04:14:41,621 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:41,621 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:14:41,621 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:14:41,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1715794329, now seen corresponding path program 1 times [2018-02-04 04:14:41,621 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:41,621 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:41,623 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:41,623 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:41,623 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:41,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:41,647 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:41,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:41,715 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:14:41,715 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 04:14:41,715 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 04:14:41,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 04:14:41,716 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:14:41,716 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand 7 states. [2018-02-04 04:14:41,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:41,753 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2018-02-04 04:14:41,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 04:14:41,753 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-02-04 04:14:41,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:41,754 INFO L225 Difference]: With dead ends: 131 [2018-02-04 04:14:41,754 INFO L226 Difference]: Without dead ends: 131 [2018-02-04 04:14:41,755 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 04:14:41,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-04 04:14:41,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2018-02-04 04:14:41,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-04 04:14:41,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 136 transitions. [2018-02-04 04:14:41,764 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 136 transitions. Word has length 29 [2018-02-04 04:14:41,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:41,764 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 136 transitions. [2018-02-04 04:14:41,764 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 04:14:41,764 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 136 transitions. [2018-02-04 04:14:41,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 04:14:41,765 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:41,766 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:14:41,766 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:14:41,766 INFO L82 PathProgramCache]: Analyzing trace with hash -785661208, now seen corresponding path program 1 times [2018-02-04 04:14:41,766 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:41,766 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:41,767 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:41,767 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:41,767 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:41,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:41,782 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:41,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:41,864 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:14:41,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 04:14:41,865 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 04:14:41,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 04:14:41,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 04:14:41,865 INFO L87 Difference]: Start difference. First operand 127 states and 136 transitions. Second operand 10 states. [2018-02-04 04:14:42,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:42,036 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2018-02-04 04:14:42,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 04:14:42,037 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-02-04 04:14:42,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:42,037 INFO L225 Difference]: With dead ends: 126 [2018-02-04 04:14:42,037 INFO L226 Difference]: Without dead ends: 126 [2018-02-04 04:14:42,038 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-04 04:14:42,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-04 04:14:42,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-02-04 04:14:42,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-04 04:14:42,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2018-02-04 04:14:42,042 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 34 [2018-02-04 04:14:42,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:42,043 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2018-02-04 04:14:42,043 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 04:14:42,043 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2018-02-04 04:14:42,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 04:14:42,043 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:42,043 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:14:42,043 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:14:42,043 INFO L82 PathProgramCache]: Analyzing trace with hash -785661207, now seen corresponding path program 1 times [2018-02-04 04:14:42,044 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:42,044 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:42,044 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:42,045 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:42,045 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:42,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:42,057 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:42,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:42,088 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:14:42,088 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 04:14:42,088 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 04:14:42,089 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 04:14:42,089 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 04:14:42,089 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand 4 states. [2018-02-04 04:14:42,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:42,104 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2018-02-04 04:14:42,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 04:14:42,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-02-04 04:14:42,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:42,106 INFO L225 Difference]: With dead ends: 129 [2018-02-04 04:14:42,106 INFO L226 Difference]: Without dead ends: 127 [2018-02-04 04:14:42,106 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:14:42,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-04 04:14:42,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-02-04 04:14:42,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-04 04:14:42,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 136 transitions. [2018-02-04 04:14:42,112 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 136 transitions. Word has length 34 [2018-02-04 04:14:42,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:42,112 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 136 transitions. [2018-02-04 04:14:42,112 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 04:14:42,112 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 136 transitions. [2018-02-04 04:14:42,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 04:14:42,113 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:42,113 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:14:42,113 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:14:42,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1322241719, now seen corresponding path program 1 times [2018-02-04 04:14:42,114 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:42,114 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:42,115 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:42,115 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:42,115 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:42,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:42,123 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:42,146 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 04:14:42,147 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:14:42,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 04:14:42,147 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 04:14:42,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 04:14:42,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:14:42,147 INFO L87 Difference]: Start difference. First operand 127 states and 136 transitions. Second operand 3 states. [2018-02-04 04:14:42,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:42,236 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2018-02-04 04:14:42,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 04:14:42,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-02-04 04:14:42,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:42,237 INFO L225 Difference]: With dead ends: 143 [2018-02-04 04:14:42,237 INFO L226 Difference]: Without dead ends: 131 [2018-02-04 04:14:42,237 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:14:42,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-04 04:14:42,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2018-02-04 04:14:42,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-04 04:14:42,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2018-02-04 04:14:42,244 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 32 [2018-02-04 04:14:42,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:42,244 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2018-02-04 04:14:42,244 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 04:14:42,244 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2018-02-04 04:14:42,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 04:14:42,245 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:42,245 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:14:42,245 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:14:42,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1082750419, now seen corresponding path program 1 times [2018-02-04 04:14:42,245 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:42,245 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:42,246 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:42,246 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:42,246 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:42,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:42,258 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:42,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:42,289 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:14:42,289 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:14:42,290 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:42,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:42,320 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:14:42,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:42,346 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:14:42,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-02-04 04:14:42,346 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:14:42,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:14:42,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:14:42,347 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand 6 states. [2018-02-04 04:14:42,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:42,364 INFO L93 Difference]: Finished difference Result 126 states and 134 transitions. [2018-02-04 04:14:42,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:14:42,371 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-02-04 04:14:42,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:42,371 INFO L225 Difference]: With dead ends: 126 [2018-02-04 04:14:42,372 INFO L226 Difference]: Without dead ends: 124 [2018-02-04 04:14:42,372 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:14:42,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-04 04:14:42,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-02-04 04:14:42,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-04 04:14:42,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2018-02-04 04:14:42,381 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 35 [2018-02-04 04:14:42,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:42,381 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2018-02-04 04:14:42,381 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:14:42,381 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2018-02-04 04:14:42,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 04:14:42,382 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:42,382 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:14:42,382 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:14:42,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1962528345, now seen corresponding path program 1 times [2018-02-04 04:14:42,383 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:42,383 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:42,384 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:42,384 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:42,384 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:42,391 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:42,420 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 04:14:42,420 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:14:42,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 04:14:42,420 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:14:42,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:14:42,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:14:42,421 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand 6 states. [2018-02-04 04:14:42,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:42,442 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2018-02-04 04:14:42,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:14:42,443 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-02-04 04:14:42,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:42,443 INFO L225 Difference]: With dead ends: 115 [2018-02-04 04:14:42,444 INFO L226 Difference]: Without dead ends: 115 [2018-02-04 04:14:42,444 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:14:42,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-04 04:14:42,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-02-04 04:14:42,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-04 04:14:42,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2018-02-04 04:14:42,448 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 34 [2018-02-04 04:14:42,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:42,448 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2018-02-04 04:14:42,448 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:14:42,448 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2018-02-04 04:14:42,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 04:14:42,449 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:42,449 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:14:42,449 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:14:42,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1126031319, now seen corresponding path program 2 times [2018-02-04 04:14:42,449 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:42,449 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:42,450 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:42,451 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:42,451 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:42,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:42,461 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:42,488 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:42,488 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:14:42,489 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:14:42,489 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:14:42,510 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 04:14:42,510 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:14:42,514 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:14:42,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-02-04 04:14:42,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:14:42,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-02-04 04:14:42,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 04:14:42,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 04:14:42,585 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 04:14:42,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 04:14:42,858 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:14:42,858 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [6] total 20 [2018-02-04 04:14:42,859 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 04:14:42,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 04:14:42,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2018-02-04 04:14:42,859 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand 20 states. [2018-02-04 04:14:43,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:43,416 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2018-02-04 04:14:43,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 04:14:43,416 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-02-04 04:14:43,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:43,417 INFO L225 Difference]: With dead ends: 117 [2018-02-04 04:14:43,417 INFO L226 Difference]: Without dead ends: 115 [2018-02-04 04:14:43,418 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=708, Unknown=0, NotChecked=0, Total=812 [2018-02-04 04:14:43,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-04 04:14:43,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-02-04 04:14:43,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-04 04:14:43,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2018-02-04 04:14:43,420 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 36 [2018-02-04 04:14:43,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:43,421 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2018-02-04 04:14:43,421 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 04:14:43,421 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2018-02-04 04:14:43,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 04:14:43,422 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:43,422 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, 1, 1, 1, 1, 1] [2018-02-04 04:14:43,422 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:14:43,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1693572500, now seen corresponding path program 1 times [2018-02-04 04:14:43,422 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:43,423 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:43,424 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:43,424 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:14:43,424 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:43,434 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:43,502 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 04:14:43,502 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:14:43,502 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 04:14:43,502 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 04:14:43,503 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 04:14:43,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 04:14:43,503 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand 10 states. [2018-02-04 04:14:43,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:43,702 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2018-02-04 04:14:43,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 04:14:43,703 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-02-04 04:14:43,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:43,704 INFO L225 Difference]: With dead ends: 113 [2018-02-04 04:14:43,704 INFO L226 Difference]: Without dead ends: 113 [2018-02-04 04:14:43,704 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-04 04:14:43,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-04 04:14:43,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-02-04 04:14:43,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 04:14:43,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2018-02-04 04:14:43,708 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 42 [2018-02-04 04:14:43,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:43,708 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2018-02-04 04:14:43,708 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 04:14:43,708 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-02-04 04:14:43,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 04:14:43,709 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:43,709 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, 1, 1, 1, 1, 1] [2018-02-04 04:14:43,709 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:14:43,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1693572501, now seen corresponding path program 1 times [2018-02-04 04:14:43,710 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:43,710 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:43,711 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:43,711 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:43,711 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:43,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:43,722 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:43,755 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:43,756 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:14:43,756 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:14:43,757 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:43,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:43,776 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:14:43,787 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:43,787 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:14:43,787 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-02-04 04:14:43,787 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 04:14:43,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 04:14:43,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-02-04 04:14:43,788 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand 8 states. [2018-02-04 04:14:43,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:43,803 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2018-02-04 04:14:43,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 04:14:43,803 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-02-04 04:14:43,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:43,804 INFO L225 Difference]: With dead ends: 116 [2018-02-04 04:14:43,804 INFO L226 Difference]: Without dead ends: 114 [2018-02-04 04:14:43,804 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-04 04:14:43,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-04 04:14:43,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-02-04 04:14:43,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-04 04:14:43,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 120 transitions. [2018-02-04 04:14:43,806 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 120 transitions. Word has length 42 [2018-02-04 04:14:43,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:43,807 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 120 transitions. [2018-02-04 04:14:43,807 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 04:14:43,807 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions. [2018-02-04 04:14:43,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 04:14:43,807 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:43,807 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, 1, 1, 1, 1, 1] [2018-02-04 04:14:43,807 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:14:43,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1124796031, now seen corresponding path program 2 times [2018-02-04 04:14:43,808 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:43,808 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:43,809 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:43,809 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:43,809 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:43,818 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:43,849 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:43,849 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:14:43,849 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:14:43,850 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:14:43,861 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 04:14:43,861 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:14:43,864 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:14:43,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-02-04 04:14:43,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:14:43,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-02-04 04:14:43,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 04:14:43,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 04:14:43,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 04:14:44,159 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 04:14:44,159 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:14:44,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 22 [2018-02-04 04:14:44,160 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 04:14:44,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 04:14:44,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2018-02-04 04:14:44,160 INFO L87 Difference]: Start difference. First operand 114 states and 120 transitions. Second operand 22 states. [2018-02-04 04:14:44,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:44,693 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2018-02-04 04:14:44,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 04:14:44,694 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 43 [2018-02-04 04:14:44,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:44,694 INFO L225 Difference]: With dead ends: 115 [2018-02-04 04:14:44,694 INFO L226 Difference]: Without dead ends: 113 [2018-02-04 04:14:44,695 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=917, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 04:14:44,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-04 04:14:44,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-02-04 04:14:44,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 04:14:44,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2018-02-04 04:14:44,697 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 43 [2018-02-04 04:14:44,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:44,698 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2018-02-04 04:14:44,698 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 04:14:44,698 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-02-04 04:14:44,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 04:14:44,698 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:44,698 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:14:44,698 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:14:44,699 INFO L82 PathProgramCache]: Analyzing trace with hash -889747813, now seen corresponding path program 1 times [2018-02-04 04:14:44,699 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:44,699 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:44,699 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:44,699 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:14:44,700 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:44,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:44,706 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:44,743 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-04 04:14:44,743 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:14:44,743 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 04:14:44,743 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 04:14:44,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 04:14:44,744 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 04:14:44,744 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand 8 states. [2018-02-04 04:14:44,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:44,764 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2018-02-04 04:14:44,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 04:14:44,764 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-02-04 04:14:44,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:44,765 INFO L225 Difference]: With dead ends: 115 [2018-02-04 04:14:44,765 INFO L226 Difference]: Without dead ends: 113 [2018-02-04 04:14:44,765 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-04 04:14:44,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-04 04:14:44,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-02-04 04:14:44,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 04:14:44,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 118 transitions. [2018-02-04 04:14:44,768 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 118 transitions. Word has length 49 [2018-02-04 04:14:44,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:44,768 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 118 transitions. [2018-02-04 04:14:44,768 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 04:14:44,768 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2018-02-04 04:14:44,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 04:14:44,769 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:44,769 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:14:44,769 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:14:44,770 INFO L82 PathProgramCache]: Analyzing trace with hash 2041611084, now seen corresponding path program 1 times [2018-02-04 04:14:44,770 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:44,770 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:44,771 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:44,771 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:44,771 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:44,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:44,780 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:44,844 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-04 04:14:44,845 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:14:44,845 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 04:14:44,845 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 04:14:44,845 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 04:14:44,845 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 04:14:44,845 INFO L87 Difference]: Start difference. First operand 113 states and 118 transitions. Second operand 10 states. [2018-02-04 04:14:44,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:44,892 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2018-02-04 04:14:44,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 04:14:44,892 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-02-04 04:14:44,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:44,893 INFO L225 Difference]: With dead ends: 117 [2018-02-04 04:14:44,893 INFO L226 Difference]: Without dead ends: 113 [2018-02-04 04:14:44,893 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-04 04:14:44,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-04 04:14:44,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-02-04 04:14:44,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 04:14:44,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2018-02-04 04:14:44,895 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 54 [2018-02-04 04:14:44,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:44,895 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2018-02-04 04:14:44,895 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 04:14:44,895 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2018-02-04 04:14:44,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-04 04:14:44,896 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:44,896 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:14:44,896 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:14:44,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1648870102, now seen corresponding path program 1 times [2018-02-04 04:14:44,896 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:44,896 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:44,897 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:44,897 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:44,897 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:44,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:44,907 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:45,092 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-04 04:14:45,092 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:14:45,092 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-02-04 04:14:45,093 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 04:14:45,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 04:14:45,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-02-04 04:14:45,093 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand 21 states. [2018-02-04 04:14:45,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:45,410 INFO L93 Difference]: Finished difference Result 141 states and 152 transitions. [2018-02-04 04:14:45,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 04:14:45,410 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 65 [2018-02-04 04:14:45,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:45,411 INFO L225 Difference]: With dead ends: 141 [2018-02-04 04:14:45,411 INFO L226 Difference]: Without dead ends: 141 [2018-02-04 04:14:45,411 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2018-02-04 04:14:45,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-04 04:14:45,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 136. [2018-02-04 04:14:45,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-02-04 04:14:45,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2018-02-04 04:14:45,414 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 65 [2018-02-04 04:14:45,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:45,414 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2018-02-04 04:14:45,414 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 04:14:45,414 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2018-02-04 04:14:45,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-04 04:14:45,415 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:45,415 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:14:45,415 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:14:45,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1648870101, now seen corresponding path program 1 times [2018-02-04 04:14:45,415 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:45,415 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:45,415 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:45,416 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:45,416 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:45,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:45,429 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:45,476 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:45,476 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:14:45,476 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:14:45,477 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:45,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:45,500 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:14:45,515 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:45,515 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:14:45,515 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-02-04 04:14:45,515 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 04:14:45,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 04:14:45,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-02-04 04:14:45,516 INFO L87 Difference]: Start difference. First operand 136 states and 148 transitions. Second operand 10 states. [2018-02-04 04:14:45,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:45,537 INFO L93 Difference]: Finished difference Result 139 states and 151 transitions. [2018-02-04 04:14:45,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 04:14:45,541 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2018-02-04 04:14:45,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:45,542 INFO L225 Difference]: With dead ends: 139 [2018-02-04 04:14:45,542 INFO L226 Difference]: Without dead ends: 137 [2018-02-04 04:14:45,542 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-02-04 04:14:45,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-02-04 04:14:45,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-02-04 04:14:45,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-04 04:14:45,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2018-02-04 04:14:45,545 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 149 transitions. Word has length 65 [2018-02-04 04:14:45,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:45,545 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 149 transitions. [2018-02-04 04:14:45,545 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 04:14:45,546 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 149 transitions. [2018-02-04 04:14:45,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-04 04:14:45,546 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:45,546 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:14:45,546 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:14:45,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1958826751, now seen corresponding path program 2 times [2018-02-04 04:14:45,546 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:45,546 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:45,547 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:45,547 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:45,547 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:45,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:45,556 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:45,633 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:45,634 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:14:45,634 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:14:45,635 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:14:45,654 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 04:14:45,655 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:14:45,666 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:14:45,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-02-04 04:14:45,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:14:45,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-02-04 04:14:45,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 04:14:45,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 04:14:45,768 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 04:14:46,153 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-02-04 04:14:46,153 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:14:46,154 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [10] total 29 [2018-02-04 04:14:46,154 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 04:14:46,154 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 04:14:46,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=720, Unknown=0, NotChecked=0, Total=812 [2018-02-04 04:14:46,154 INFO L87 Difference]: Start difference. First operand 137 states and 149 transitions. Second operand 29 states. [2018-02-04 04:14:46,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:46,802 INFO L93 Difference]: Finished difference Result 138 states and 148 transitions. [2018-02-04 04:14:46,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 04:14:46,803 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 66 [2018-02-04 04:14:46,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:46,803 INFO L225 Difference]: With dead ends: 138 [2018-02-04 04:14:46,803 INFO L226 Difference]: Without dead ends: 136 [2018-02-04 04:14:46,804 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=212, Invalid=1680, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 04:14:46,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-02-04 04:14:46,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-02-04 04:14:46,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-02-04 04:14:46,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 146 transitions. [2018-02-04 04:14:46,806 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 146 transitions. Word has length 66 [2018-02-04 04:14:46,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:46,807 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 146 transitions. [2018-02-04 04:14:46,807 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 04:14:46,807 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 146 transitions. [2018-02-04 04:14:46,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-04 04:14:46,807 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:46,807 INFO L351 BasicCegarLoop]: trace histogram [7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:14:46,807 INFO L371 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:14:46,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1967521112, now seen corresponding path program 1 times [2018-02-04 04:14:46,808 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:46,808 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:46,809 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:46,809 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:14:46,809 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:46,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:46,818 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:46,883 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-02-04 04:14:46,973 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:14:46,973 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:14:46,974 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:46,993 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:14:47,106 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 04:14:47,107 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:14:47,107 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-02-04 04:14:47,107 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 04:14:47,108 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 04:14:47,108 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2018-02-04 04:14:47,108 INFO L87 Difference]: Start difference. First operand 136 states and 146 transitions. Second operand 20 states. [2018-02-04 04:14:47,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:47,272 INFO L93 Difference]: Finished difference Result 140 states and 146 transitions. [2018-02-04 04:14:47,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 04:14:47,273 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 70 [2018-02-04 04:14:47,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:47,274 INFO L225 Difference]: With dead ends: 140 [2018-02-04 04:14:47,274 INFO L226 Difference]: Without dead ends: 134 [2018-02-04 04:14:47,274 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2018-02-04 04:14:47,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-04 04:14:47,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-02-04 04:14:47,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-04 04:14:47,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 140 transitions. [2018-02-04 04:14:47,278 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 140 transitions. Word has length 70 [2018-02-04 04:14:47,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:47,280 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 140 transitions. [2018-02-04 04:14:47,280 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 04:14:47,280 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 140 transitions. [2018-02-04 04:14:47,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-04 04:14:47,281 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:47,281 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:14:47,281 INFO L371 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:14:47,282 INFO L82 PathProgramCache]: Analyzing trace with hash -170218834, now seen corresponding path program 1 times [2018-02-04 04:14:47,282 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:47,282 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:47,283 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:47,283 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:47,283 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:47,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:47,301 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:47,527 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-04 04:14:47,527 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:14:47,527 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-02-04 04:14:47,527 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 04:14:47,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 04:14:47,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2018-02-04 04:14:47,528 INFO L87 Difference]: Start difference. First operand 134 states and 140 transitions. Second operand 25 states. [2018-02-04 04:14:47,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:47,924 INFO L93 Difference]: Finished difference Result 144 states and 153 transitions. [2018-02-04 04:14:47,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 04:14:47,924 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 82 [2018-02-04 04:14:47,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:47,925 INFO L225 Difference]: With dead ends: 144 [2018-02-04 04:14:47,925 INFO L226 Difference]: Without dead ends: 144 [2018-02-04 04:14:47,925 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 04:14:47,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-02-04 04:14:47,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 140. [2018-02-04 04:14:47,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-04 04:14:47,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 150 transitions. [2018-02-04 04:14:47,929 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 150 transitions. Word has length 82 [2018-02-04 04:14:47,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:47,930 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 150 transitions. [2018-02-04 04:14:47,930 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 04:14:47,930 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 150 transitions. [2018-02-04 04:14:47,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-04 04:14:47,931 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:47,931 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:14:47,931 INFO L371 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:14:47,931 INFO L82 PathProgramCache]: Analyzing trace with hash -170218833, now seen corresponding path program 1 times [2018-02-04 04:14:47,931 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:47,931 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:47,932 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:47,932 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:47,932 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:47,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:47,949 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:48,038 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:48,038 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:14:48,038 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:14:48,039 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:48,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:48,058 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:14:48,077 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:48,077 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:14:48,078 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-02-04 04:14:48,078 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 04:14:48,078 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 04:14:48,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-04 04:14:48,079 INFO L87 Difference]: Start difference. First operand 140 states and 150 transitions. Second operand 13 states. [2018-02-04 04:14:48,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:48,099 INFO L93 Difference]: Finished difference Result 143 states and 153 transitions. [2018-02-04 04:14:48,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 04:14:48,099 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 82 [2018-02-04 04:14:48,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:48,099 INFO L225 Difference]: With dead ends: 143 [2018-02-04 04:14:48,099 INFO L226 Difference]: Without dead ends: 141 [2018-02-04 04:14:48,100 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2018-02-04 04:14:48,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-04 04:14:48,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-02-04 04:14:48,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-02-04 04:14:48,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 151 transitions. [2018-02-04 04:14:48,104 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 151 transitions. Word has length 82 [2018-02-04 04:14:48,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:48,104 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 151 transitions. [2018-02-04 04:14:48,104 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 04:14:48,104 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 151 transitions. [2018-02-04 04:14:48,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-04 04:14:48,104 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:48,105 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:14:48,105 INFO L371 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:14:48,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1743576679, now seen corresponding path program 2 times [2018-02-04 04:14:48,105 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:48,105 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:48,105 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:48,105 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:48,105 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:48,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:48,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:48,201 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:48,202 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:14:48,202 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:14:48,203 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:14:48,245 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 04:14:48,245 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:14:48,251 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:14:48,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-02-04 04:14:48,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:14:48,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-02-04 04:14:48,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 04:14:48,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 04:14:48,296 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 04:14:48,789 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-02-04 04:14:48,789 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:14:48,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [13] total 36 [2018-02-04 04:14:48,790 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 04:14:48,790 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 04:14:48,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1126, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 04:14:48,790 INFO L87 Difference]: Start difference. First operand 141 states and 151 transitions. Second operand 36 states. [2018-02-04 04:14:49,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:49,641 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2018-02-04 04:14:49,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 04:14:49,643 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 83 [2018-02-04 04:14:49,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:49,644 INFO L225 Difference]: With dead ends: 142 [2018-02-04 04:14:49,644 INFO L226 Difference]: Without dead ends: 140 [2018-02-04 04:14:49,645 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=327, Invalid=2753, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 04:14:49,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-02-04 04:14:49,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-02-04 04:14:49,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-04 04:14:49,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 149 transitions. [2018-02-04 04:14:49,649 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 149 transitions. Word has length 83 [2018-02-04 04:14:49,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:49,649 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 149 transitions. [2018-02-04 04:14:49,649 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 04:14:49,650 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 149 transitions. [2018-02-04 04:14:49,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-04 04:14:49,650 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:49,650 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:14:49,651 INFO L371 AbstractCegarLoop]: === Iteration 23 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:14:49,651 INFO L82 PathProgramCache]: Analyzing trace with hash 470121776, now seen corresponding path program 1 times [2018-02-04 04:14:49,651 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:49,651 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:49,652 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:49,652 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:14:49,652 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:49,667 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:49,762 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:49,763 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:14:49,763 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:14:49,763 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:49,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:49,788 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:14:49,801 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:49,801 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:14:49,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-02-04 04:14:49,802 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 04:14:49,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 04:14:49,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-02-04 04:14:49,802 INFO L87 Difference]: Start difference. First operand 140 states and 149 transitions. Second operand 15 states. [2018-02-04 04:14:49,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:49,834 INFO L93 Difference]: Finished difference Result 143 states and 152 transitions. [2018-02-04 04:14:49,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 04:14:49,834 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 88 [2018-02-04 04:14:49,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:49,835 INFO L225 Difference]: With dead ends: 143 [2018-02-04 04:14:49,835 INFO L226 Difference]: Without dead ends: 141 [2018-02-04 04:14:49,835 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=97, Invalid=143, Unknown=0, NotChecked=0, Total=240 [2018-02-04 04:14:49,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-04 04:14:49,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-02-04 04:14:49,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-02-04 04:14:49,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 150 transitions. [2018-02-04 04:14:49,839 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 150 transitions. Word has length 88 [2018-02-04 04:14:49,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:49,840 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 150 transitions. [2018-02-04 04:14:49,840 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 04:14:49,840 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 150 transitions. [2018-02-04 04:14:49,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-04 04:14:49,840 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:49,841 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:14:49,841 INFO L371 AbstractCegarLoop]: === Iteration 24 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:14:49,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1375757158, now seen corresponding path program 2 times [2018-02-04 04:14:49,841 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:49,841 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:49,842 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:49,842 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:49,842 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:49,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:49,857 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:49,963 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:49,963 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:14:49,963 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:14:49,964 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:14:49,996 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:14:49,996 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:14:50,001 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:14:50,014 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:50,014 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:14:50,014 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-02-04 04:14:50,015 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 04:14:50,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 04:14:50,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2018-02-04 04:14:50,015 INFO L87 Difference]: Start difference. First operand 141 states and 150 transitions. Second operand 16 states. [2018-02-04 04:14:50,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:50,057 INFO L93 Difference]: Finished difference Result 144 states and 153 transitions. [2018-02-04 04:14:50,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 04:14:50,057 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 89 [2018-02-04 04:14:50,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:50,058 INFO L225 Difference]: With dead ends: 144 [2018-02-04 04:14:50,058 INFO L226 Difference]: Without dead ends: 142 [2018-02-04 04:14:50,059 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=111, Invalid=161, Unknown=0, NotChecked=0, Total=272 [2018-02-04 04:14:50,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-02-04 04:14:50,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-02-04 04:14:50,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-04 04:14:50,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 151 transitions. [2018-02-04 04:14:50,063 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 151 transitions. Word has length 89 [2018-02-04 04:14:50,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:50,063 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 151 transitions. [2018-02-04 04:14:50,063 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 04:14:50,063 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2018-02-04 04:14:50,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-02-04 04:14:50,064 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:50,064 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:14:50,064 INFO L371 AbstractCegarLoop]: === Iteration 25 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:14:50,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1531538032, now seen corresponding path program 3 times [2018-02-04 04:14:50,064 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:50,064 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:50,065 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:50,065 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:14:50,065 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:50,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:50,081 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:50,190 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:50,190 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:14:50,190 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:14:50,191 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:14:50,235 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-02-04 04:14:50,235 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:14:50,240 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:14:50,263 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:50,263 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:14:50,263 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-02-04 04:14:50,264 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 04:14:50,264 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 04:14:50,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-02-04 04:14:50,264 INFO L87 Difference]: Start difference. First operand 142 states and 151 transitions. Second operand 17 states. [2018-02-04 04:14:50,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:50,297 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2018-02-04 04:14:50,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 04:14:50,297 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 90 [2018-02-04 04:14:50,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:50,298 INFO L225 Difference]: With dead ends: 145 [2018-02-04 04:14:50,298 INFO L226 Difference]: Without dead ends: 143 [2018-02-04 04:14:50,298 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=126, Invalid=180, Unknown=0, NotChecked=0, Total=306 [2018-02-04 04:14:50,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-04 04:14:50,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-02-04 04:14:50,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-04 04:14:50,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 152 transitions. [2018-02-04 04:14:50,301 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 152 transitions. Word has length 90 [2018-02-04 04:14:50,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:50,302 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 152 transitions. [2018-02-04 04:14:50,302 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 04:14:50,302 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 152 transitions. [2018-02-04 04:14:50,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-02-04 04:14:50,303 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:50,303 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:14:50,303 INFO L371 AbstractCegarLoop]: === Iteration 26 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:14:50,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1463375706, now seen corresponding path program 4 times [2018-02-04 04:14:50,303 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:50,303 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:50,304 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:50,304 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:14:50,304 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:50,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:50,320 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:50,451 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:50,452 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:14:50,452 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:14:50,453 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:14:50,486 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:14:50,487 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:14:50,492 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:14:50,528 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:50,528 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:14:50,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-02-04 04:14:50,529 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 04:14:50,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 04:14:50,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-02-04 04:14:50,529 INFO L87 Difference]: Start difference. First operand 143 states and 152 transitions. Second operand 18 states. [2018-02-04 04:14:50,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:50,562 INFO L93 Difference]: Finished difference Result 146 states and 155 transitions. [2018-02-04 04:14:50,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 04:14:50,562 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 91 [2018-02-04 04:14:50,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:50,563 INFO L225 Difference]: With dead ends: 146 [2018-02-04 04:14:50,563 INFO L226 Difference]: Without dead ends: 144 [2018-02-04 04:14:50,564 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=200, Unknown=0, NotChecked=0, Total=342 [2018-02-04 04:14:50,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-02-04 04:14:50,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-02-04 04:14:50,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-04 04:14:50,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 153 transitions. [2018-02-04 04:14:50,567 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 153 transitions. Word has length 91 [2018-02-04 04:14:50,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:50,568 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 153 transitions. [2018-02-04 04:14:50,568 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 04:14:50,568 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2018-02-04 04:14:50,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-04 04:14:50,569 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:50,569 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:14:50,569 INFO L371 AbstractCegarLoop]: === Iteration 27 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:14:50,569 INFO L82 PathProgramCache]: Analyzing trace with hash -649656400, now seen corresponding path program 5 times [2018-02-04 04:14:50,569 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:50,569 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:50,570 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:50,570 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:14:50,570 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:50,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:50,587 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:50,729 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:50,729 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:14:50,729 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:14:50,730 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:14:50,760 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-02-04 04:14:50,761 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:14:50,765 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:14:50,778 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:50,778 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:14:50,779 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-02-04 04:14:50,779 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 04:14:50,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 04:14:50,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-02-04 04:14:50,779 INFO L87 Difference]: Start difference. First operand 144 states and 153 transitions. Second operand 19 states. [2018-02-04 04:14:50,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:50,817 INFO L93 Difference]: Finished difference Result 147 states and 156 transitions. [2018-02-04 04:14:50,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 04:14:50,817 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2018-02-04 04:14:50,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:50,818 INFO L225 Difference]: With dead ends: 147 [2018-02-04 04:14:50,818 INFO L226 Difference]: Without dead ends: 145 [2018-02-04 04:14:50,818 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=159, Invalid=221, Unknown=0, NotChecked=0, Total=380 [2018-02-04 04:14:50,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-04 04:14:50,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-02-04 04:14:50,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-04 04:14:50,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 154 transitions. [2018-02-04 04:14:50,822 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 154 transitions. Word has length 92 [2018-02-04 04:14:50,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:50,822 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 154 transitions. [2018-02-04 04:14:50,822 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 04:14:50,822 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 154 transitions. [2018-02-04 04:14:50,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-04 04:14:50,823 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:50,823 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:14:50,823 INFO L371 AbstractCegarLoop]: === Iteration 28 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:14:50,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1729142246, now seen corresponding path program 6 times [2018-02-04 04:14:50,824 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:50,824 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:50,824 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:50,825 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:14:50,825 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:50,840 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:50,994 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:50,994 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:14:50,994 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:14:50,995 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:14:51,036 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-02-04 04:14:51,037 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:14:51,041 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:14:51,067 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:51,068 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:14:51,068 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-02-04 04:14:51,068 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 04:14:51,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 04:14:51,069 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2018-02-04 04:14:51,069 INFO L87 Difference]: Start difference. First operand 145 states and 154 transitions. Second operand 20 states. [2018-02-04 04:14:51,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:51,108 INFO L93 Difference]: Finished difference Result 148 states and 157 transitions. [2018-02-04 04:14:51,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 04:14:51,109 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 93 [2018-02-04 04:14:51,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:51,110 INFO L225 Difference]: With dead ends: 148 [2018-02-04 04:14:51,110 INFO L226 Difference]: Without dead ends: 146 [2018-02-04 04:14:51,110 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=177, Invalid=243, Unknown=0, NotChecked=0, Total=420 [2018-02-04 04:14:51,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-04 04:14:51,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-02-04 04:14:51,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-04 04:14:51,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 155 transitions. [2018-02-04 04:14:51,114 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 155 transitions. Word has length 93 [2018-02-04 04:14:51,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:51,114 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 155 transitions. [2018-02-04 04:14:51,114 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 04:14:51,114 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 155 transitions. [2018-02-04 04:14:51,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-04 04:14:51,115 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:51,115 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:14:51,115 INFO L371 AbstractCegarLoop]: === Iteration 29 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:14:51,115 INFO L82 PathProgramCache]: Analyzing trace with hash -833465104, now seen corresponding path program 7 times [2018-02-04 04:14:51,115 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:51,116 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:51,116 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:51,116 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:14:51,116 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:51,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:51,163 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:51,178 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.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:222) 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-04 04:14:51,181 INFO L168 Benchmark]: Toolchain (without parser) took 11072.87 ms. Allocated memory was 401.1 MB in the beginning and 850.4 MB in the end (delta: 449.3 MB). Free memory was 358.0 MB in the beginning and 536.4 MB in the end (delta: -178.4 MB). Peak memory consumption was 270.9 MB. Max. memory is 5.3 GB. [2018-02-04 04:14:51,182 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-04 04:14:51,183 INFO L168 Benchmark]: CACSL2BoogieTranslator took 169.43 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-04 04:14:51,183 INFO L168 Benchmark]: Boogie Preprocessor took 35.75 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-04 04:14:51,183 INFO L168 Benchmark]: RCFGBuilder took 340.18 ms. Allocated memory is still 401.1 MB. Free memory was 342.1 MB in the beginning and 309.5 MB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 5.3 GB. [2018-02-04 04:14:51,183 INFO L168 Benchmark]: TraceAbstraction took 10524.58 ms. Allocated memory was 401.1 MB in the beginning and 850.4 MB in the end (delta: 449.3 MB). Free memory was 309.5 MB in the beginning and 536.4 MB in the end (delta: -226.9 MB). Peak memory consumption was 222.4 MB. Max. memory is 5.3 GB. [2018-02-04 04:14:51,185 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 169.43 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 35.75 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 340.18 ms. Allocated memory is still 401.1 MB. Free memory was 342.1 MB in the beginning and 309.5 MB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 10524.58 ms. Allocated memory was 401.1 MB in the beginning and 850.4 MB in the end (delta: 449.3 MB). Free memory was 309.5 MB in the beginning and 536.4 MB in the end (delta: -226.9 MB). Peak memory consumption was 222.4 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_3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_04-14-51-191.csv Received shutdown request...