java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_1_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 09:25:39,637 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 09:25:39,639 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 09:25:39,652 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 09:25:39,652 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 09:25:39,653 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 09:25:39,654 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 09:25:39,655 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 09:25:39,657 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 09:25:39,658 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 09:25:39,659 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 09:25:39,659 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 09:25:39,659 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 09:25:39,661 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 09:25:39,661 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 09:25:39,663 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 09:25:39,665 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 09:25:39,666 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 09:25:39,667 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 09:25:39,668 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 09:25:39,669 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 09:25:39,670 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 09:25:39,670 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 09:25:39,671 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 09:25:39,671 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 09:25:39,672 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 09:25:39,672 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 09:25:39,673 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 09:25:39,673 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 09:25:39,673 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 09:25:39,674 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 09:25:39,674 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 09:25:39,684 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 09:25:39,684 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 09:25:39,685 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 09:25:39,685 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 09:25:39,686 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 09:25:39,686 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 09:25:39,686 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 09:25:39,686 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 09:25:39,686 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 09:25:39,686 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 09:25:39,687 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 09:25:39,687 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 09:25:39,687 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 09:25:39,687 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 09:25:39,687 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 09:25:39,687 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 09:25:39,687 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 09:25:39,688 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 09:25:39,688 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 09:25:39,688 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 09:25:39,688 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 09:25:39,688 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 09:25:39,688 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 09:25:39,688 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 09:25:39,689 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 09:25:39,717 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 09:25:39,727 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 09:25:39,730 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 09:25:39,731 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 09:25:39,732 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 09:25:39,732 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_1_false-valid-memtrack_true-termination.i [2018-02-02 09:25:39,883 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 09:25:39,884 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 09:25:39,885 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 09:25:39,885 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 09:25:39,891 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 09:25:39,891 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:25:39" (1/1) ... [2018-02-02 09:25:39,894 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c2b8cf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:25:39, skipping insertion in model container [2018-02-02 09:25:39,894 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:25:39" (1/1) ... [2018-02-02 09:25:39,908 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:25:39,941 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:25:40,032 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:25:40,048 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:25:40,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:25:40 WrapperNode [2018-02-02 09:25:40,056 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 09:25:40,056 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 09:25:40,056 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 09:25:40,057 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 09:25:40,065 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:25:40" (1/1) ... [2018-02-02 09:25:40,065 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:25:40" (1/1) ... [2018-02-02 09:25:40,072 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:25:40" (1/1) ... [2018-02-02 09:25:40,072 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:25:40" (1/1) ... [2018-02-02 09:25:40,078 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:25:40" (1/1) ... [2018-02-02 09:25:40,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:25:40" (1/1) ... [2018-02-02 09:25:40,082 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:25:40" (1/1) ... [2018-02-02 09:25:40,085 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 09:25:40,086 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 09:25:40,086 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 09:25:40,086 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 09:25:40,087 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:25: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-02 09:25:40,118 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 09:25:40,118 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 09:25:40,118 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-02-02 09:25:40,118 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 09:25:40,118 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-02-02 09:25:40,119 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2018-02-02 09:25:40,119 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-02-02 09:25:40,119 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-02-02 09:25:40,119 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-02-02 09:25:40,119 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2018-02-02 09:25:40,119 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-02-02 09:25:40,119 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-02-02 09:25:40,119 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-02-02 09:25:40,120 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-02-02 09:25:40,120 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2018-02-02 09:25:40,120 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-02-02 09:25:40,120 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-02-02 09:25:40,120 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-02-02 09:25:40,120 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 09:25:40,120 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 09:25:40,120 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 09:25:40,121 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 09:25:40,121 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 09:25:40,121 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 09:25:40,121 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 09:25:40,121 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 09:25:40,121 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 09:25:40,121 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-02 09:25:40,121 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-02 09:25:40,121 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 09:25:40,122 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 09:25:40,122 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 09:25:40,122 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-02 09:25:40,122 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 09:25:40,122 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-02-02 09:25:40,122 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2018-02-02 09:25:40,122 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-02-02 09:25:40,123 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-02-02 09:25:40,123 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-02-02 09:25:40,123 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-02-02 09:25:40,123 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2018-02-02 09:25:40,123 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-02-02 09:25:40,123 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-02-02 09:25:40,123 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-02-02 09:25:40,123 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-02-02 09:25:40,124 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2018-02-02 09:25:40,124 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-02-02 09:25:40,124 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-02-02 09:25:40,124 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-02-02 09:25:40,124 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 09:25:40,124 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 09:25:40,124 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 09:25:40,124 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 09:25:40,300 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-02 09:25:40,439 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 09:25:40,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:25:40 BoogieIcfgContainer [2018-02-02 09:25:40,439 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 09:25:40,440 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 09:25:40,440 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 09:25:40,442 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 09:25:40,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:25:39" (1/3) ... [2018-02-02 09:25:40,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f0459df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:25:40, skipping insertion in model container [2018-02-02 09:25:40,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:25:40" (2/3) ... [2018-02-02 09:25:40,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f0459df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:25:40, skipping insertion in model container [2018-02-02 09:25:40,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:25:40" (3/3) ... [2018-02-02 09:25:40,444 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test22_1_false-valid-memtrack_true-termination.i [2018-02-02 09:25:40,449 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 09:25:40,454 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-02-02 09:25:40,485 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 09:25:40,485 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 09:25:40,486 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 09:25:40,486 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 09:25:40,486 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 09:25:40,486 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 09:25:40,486 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 09:25:40,486 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 09:25:40,487 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 09:25:40,500 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states. [2018-02-02 09:25:40,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 09:25:40,508 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:25:40,509 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:25:40,509 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 09:25:40,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1956546830, now seen corresponding path program 1 times [2018-02-02 09:25:40,514 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:25:40,515 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:25:40,563 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:25:40,563 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:25:40,563 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:25:40,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:25:40,611 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:25:40,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:25:40,698 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:25:40,698 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:25:40,772 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:25:40,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:25:40,784 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:25:40,785 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 5 states. [2018-02-02 09:25:40,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:25:40,831 INFO L93 Difference]: Finished difference Result 148 states and 156 transitions. [2018-02-02 09:25:40,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:25:40,832 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 09:25:40,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:25:40,841 INFO L225 Difference]: With dead ends: 148 [2018-02-02 09:25:40,842 INFO L226 Difference]: Without dead ends: 145 [2018-02-02 09:25:40,843 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:25:40,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-02 09:25:40,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2018-02-02 09:25:40,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-02 09:25:40,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 151 transitions. [2018-02-02 09:25:40,878 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 151 transitions. Word has length 17 [2018-02-02 09:25:40,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:25:40,878 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 151 transitions. [2018-02-02 09:25:40,878 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:25:40,878 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 151 transitions. [2018-02-02 09:25:40,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 09:25:40,879 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:25:40,879 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:25:40,879 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 09:25:40,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1123892084, now seen corresponding path program 1 times [2018-02-02 09:25:40,879 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:25:40,879 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:25:40,880 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:25:40,880 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:25:40,881 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:25:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:25:40,894 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:25:40,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:25:40,938 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:25:40,938 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:25:40,939 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:25:40,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:25:40,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:25:40,940 INFO L87 Difference]: Start difference. First operand 143 states and 151 transitions. Second operand 6 states. [2018-02-02 09:25:41,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:25:41,085 INFO L93 Difference]: Finished difference Result 144 states and 152 transitions. [2018-02-02 09:25:41,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:25:41,086 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 09:25:41,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:25:41,087 INFO L225 Difference]: With dead ends: 144 [2018-02-02 09:25:41,087 INFO L226 Difference]: Without dead ends: 144 [2018-02-02 09:25:41,087 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:25:41,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-02-02 09:25:41,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2018-02-02 09:25:41,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-02 09:25:41,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 150 transitions. [2018-02-02 09:25:41,096 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 150 transitions. Word has length 19 [2018-02-02 09:25:41,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:25:41,096 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 150 transitions. [2018-02-02 09:25:41,096 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:25:41,096 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 150 transitions. [2018-02-02 09:25:41,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 09:25:41,096 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:25:41,096 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:25:41,096 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 09:25:41,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1123892085, now seen corresponding path program 1 times [2018-02-02 09:25:41,097 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:25:41,097 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:25:41,097 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:25:41,097 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:25:41,098 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:25:41,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:25:41,113 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:25:41,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:25:41,275 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:25:41,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 09:25:41,276 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 09:25:41,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 09:25:41,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:25:41,276 INFO L87 Difference]: Start difference. First operand 142 states and 150 transitions. Second operand 7 states. [2018-02-02 09:25:41,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:25:41,483 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2018-02-02 09:25:41,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 09:25:41,483 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-02-02 09:25:41,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:25:41,484 INFO L225 Difference]: With dead ends: 143 [2018-02-02 09:25:41,484 INFO L226 Difference]: Without dead ends: 143 [2018-02-02 09:25:41,485 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:25:41,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-02 09:25:41,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2018-02-02 09:25:41,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-02-02 09:25:41,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 149 transitions. [2018-02-02 09:25:41,491 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 149 transitions. Word has length 19 [2018-02-02 09:25:41,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:25:41,492 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 149 transitions. [2018-02-02 09:25:41,492 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 09:25:41,492 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 149 transitions. [2018-02-02 09:25:41,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 09:25:41,493 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:25:41,493 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:25:41,493 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 09:25:41,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1414777661, now seen corresponding path program 1 times [2018-02-02 09:25:41,493 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:25:41,493 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:25:41,495 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:25:41,495 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:25:41,495 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:25:41,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:25:41,508 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:25:41,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:25:41,571 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:25:41,571 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 09:25:41,572 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 09:25:41,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 09:25:41,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:25:41,573 INFO L87 Difference]: Start difference. First operand 141 states and 149 transitions. Second operand 7 states. [2018-02-02 09:25:41,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:25:41,611 INFO L93 Difference]: Finished difference Result 157 states and 166 transitions. [2018-02-02 09:25:41,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:25:41,612 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-02-02 09:25:41,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:25:41,614 INFO L225 Difference]: With dead ends: 157 [2018-02-02 09:25:41,614 INFO L226 Difference]: Without dead ends: 157 [2018-02-02 09:25:41,614 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:25:41,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-02-02 09:25:41,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 150. [2018-02-02 09:25:41,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-02 09:25:41,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 158 transitions. [2018-02-02 09:25:41,626 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 158 transitions. Word has length 27 [2018-02-02 09:25:41,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:25:41,626 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 158 transitions. [2018-02-02 09:25:41,626 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 09:25:41,627 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 158 transitions. [2018-02-02 09:25:41,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 09:25:41,627 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:25:41,627 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:25:41,627 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 09:25:41,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1439517623, now seen corresponding path program 1 times [2018-02-02 09:25:41,627 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:25:41,628 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:25:41,628 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:25:41,629 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:25:41,629 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:25:41,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:25:41,643 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:25:41,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:25:41,713 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:25:41,713 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 09:25:41,713 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 09:25:41,714 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 09:25:41,714 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:25:41,714 INFO L87 Difference]: Start difference. First operand 150 states and 158 transitions. Second operand 10 states. [2018-02-02 09:25:41,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:25:41,893 INFO L93 Difference]: Finished difference Result 149 states and 157 transitions. [2018-02-02 09:25:41,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:25:41,893 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-02-02 09:25:41,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:25:41,894 INFO L225 Difference]: With dead ends: 149 [2018-02-02 09:25:41,894 INFO L226 Difference]: Without dead ends: 149 [2018-02-02 09:25:41,894 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:25:41,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-02-02 09:25:41,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-02-02 09:25:41,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-02-02 09:25:41,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 157 transitions. [2018-02-02 09:25:41,899 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 157 transitions. Word has length 34 [2018-02-02 09:25:41,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:25:41,900 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 157 transitions. [2018-02-02 09:25:41,900 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 09:25:41,900 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 157 transitions. [2018-02-02 09:25:41,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 09:25:41,900 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:25:41,900 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:25:41,900 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 09:25:41,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1439517624, now seen corresponding path program 1 times [2018-02-02 09:25:41,901 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:25:41,901 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:25:41,901 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:25:41,902 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:25:41,902 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:25:41,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:25:41,914 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:25:41,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:25:41,944 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:25:41,945 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:25:41,945 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:25:41,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:25:41,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:25:41,945 INFO L87 Difference]: Start difference. First operand 149 states and 157 transitions. Second operand 4 states. [2018-02-02 09:25:41,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:25:41,959 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2018-02-02 09:25:41,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:25:41,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-02-02 09:25:41,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:25:41,960 INFO L225 Difference]: With dead ends: 152 [2018-02-02 09:25:41,960 INFO L226 Difference]: Without dead ends: 150 [2018-02-02 09:25:41,961 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:25:41,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-02 09:25:41,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-02-02 09:25:41,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-02 09:25:41,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 158 transitions. [2018-02-02 09:25:41,966 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 158 transitions. Word has length 34 [2018-02-02 09:25:41,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:25:41,967 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 158 transitions. [2018-02-02 09:25:41,967 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:25:41,967 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 158 transitions. [2018-02-02 09:25:41,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 09:25:41,968 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:25:41,968 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:25:41,968 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 09:25:41,969 INFO L82 PathProgramCache]: Analyzing trace with hash -204456797, now seen corresponding path program 1 times [2018-02-02 09:25:41,969 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:25:41,969 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:25:41,970 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:25:41,970 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:25:41,970 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:25:41,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:25:41,986 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:25:42,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:25:42,019 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:25:42,019 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:25:42,028 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:25:42,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:25:42,072 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:25:42,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:25:42,115 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:25:42,115 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-02-02 09:25:42,116 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:25:42,116 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:25:42,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:25:42,116 INFO L87 Difference]: Start difference. First operand 150 states and 158 transitions. Second operand 6 states. [2018-02-02 09:25:42,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:25:42,130 INFO L93 Difference]: Finished difference Result 153 states and 161 transitions. [2018-02-02 09:25:42,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:25:42,135 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-02-02 09:25:42,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:25:42,135 INFO L225 Difference]: With dead ends: 153 [2018-02-02 09:25:42,135 INFO L226 Difference]: Without dead ends: 151 [2018-02-02 09:25:42,136 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-02 09:25:42,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-02 09:25:42,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-02-02 09:25:42,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-02 09:25:42,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 159 transitions. [2018-02-02 09:25:42,144 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 159 transitions. Word has length 35 [2018-02-02 09:25:42,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:25:42,144 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 159 transitions. [2018-02-02 09:25:42,144 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:25:42,144 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 159 transitions. [2018-02-02 09:25:42,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 09:25:42,144 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:25:42,144 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:25:42,145 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 09:25:42,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1829139958, now seen corresponding path program 1 times [2018-02-02 09:25:42,145 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:25:42,145 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:25:42,146 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:25:42,146 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:25:42,146 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:25:42,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:25:42,158 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:25:42,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:25:42,201 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:25:42,201 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 09:25:42,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 09:25:42,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 09:25:42,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:25:42,202 INFO L87 Difference]: Start difference. First operand 151 states and 159 transitions. Second operand 7 states. [2018-02-02 09:25:42,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:25:42,225 INFO L93 Difference]: Finished difference Result 161 states and 169 transitions. [2018-02-02 09:25:42,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:25:42,226 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-02-02 09:25:42,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:25:42,227 INFO L225 Difference]: With dead ends: 161 [2018-02-02 09:25:42,227 INFO L226 Difference]: Without dead ends: 161 [2018-02-02 09:25:42,227 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:25:42,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-02 09:25:42,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 157. [2018-02-02 09:25:42,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-02-02 09:25:42,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 165 transitions. [2018-02-02 09:25:42,231 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 165 transitions. Word has length 36 [2018-02-02 09:25:42,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:25:42,231 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 165 transitions. [2018-02-02 09:25:42,231 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 09:25:42,231 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 165 transitions. [2018-02-02 09:25:42,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 09:25:42,232 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:25:42,232 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:25:42,232 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 09:25:42,233 INFO L82 PathProgramCache]: Analyzing trace with hash 371943704, now seen corresponding path program 2 times [2018-02-02 09:25:42,233 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:25:42,233 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:25:42,234 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:25:42,234 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:25:42,234 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:25:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:25:42,243 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:25:42,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:25:42,285 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:25:42,285 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:25:42,298 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 09:25:42,325 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:25:42,328 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:25:42,332 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:25:42,363 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-02 09:25:42,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:25:42,382 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-02 09:25:42,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:25:42,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-02 09:25:42,394 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-02-02 09:25:46,307 WARN L143 SmtUtils]: Spent 3726ms on a formula simplification that was a NOOP. DAG size: 27 [2018-02-02 09:25:46,582 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-02 09:25:46,598 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:25:46,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 19 [2018-02-02 09:25:46,599 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 09:25:46,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 09:25:46,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-02-02 09:25:46,599 INFO L87 Difference]: Start difference. First operand 157 states and 165 transitions. Second operand 19 states. [2018-02-02 09:25:47,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:25:47,572 INFO L93 Difference]: Finished difference Result 178 states and 185 transitions. [2018-02-02 09:25:47,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 09:25:47,572 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-02-02 09:25:47,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:25:47,573 INFO L225 Difference]: With dead ends: 178 [2018-02-02 09:25:47,573 INFO L226 Difference]: Without dead ends: 176 [2018-02-02 09:25:47,574 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2018-02-02 09:25:47,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-02 09:25:47,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 157. [2018-02-02 09:25:47,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-02-02 09:25:47,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 165 transitions. [2018-02-02 09:25:47,579 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 165 transitions. Word has length 36 [2018-02-02 09:25:47,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:25:47,579 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 165 transitions. [2018-02-02 09:25:47,579 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 09:25:47,580 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 165 transitions. [2018-02-02 09:25:47,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 09:25:47,580 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:25:47,580 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:25:47,580 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 09:25:47,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1983848104, now seen corresponding path program 1 times [2018-02-02 09:25:47,581 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:25:47,581 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:25:47,581 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:25:47,582 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:25:47,582 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:25:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:25:47,586 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:25:47,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:25:47,611 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:25:47,611 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 09:25:47,615 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 09:25:47,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 09:25:47,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:25:47,616 INFO L87 Difference]: Start difference. First operand 157 states and 165 transitions. Second operand 3 states. [2018-02-02 09:25:47,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:25:47,717 INFO L93 Difference]: Finished difference Result 174 states and 183 transitions. [2018-02-02 09:25:47,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 09:25:47,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-02-02 09:25:47,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:25:47,717 INFO L225 Difference]: With dead ends: 174 [2018-02-02 09:25:47,718 INFO L226 Difference]: Without dead ends: 161 [2018-02-02 09:25:47,718 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:25:47,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-02 09:25:47,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 153. [2018-02-02 09:25:47,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-02-02 09:25:47,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 160 transitions. [2018-02-02 09:25:47,723 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 160 transitions. Word has length 34 [2018-02-02 09:25:47,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:25:47,723 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 160 transitions. [2018-02-02 09:25:47,723 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 09:25:47,723 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 160 transitions. [2018-02-02 09:25:47,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 09:25:47,724 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:25:47,724 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:25:47,724 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 09:25:47,724 INFO L82 PathProgramCache]: Analyzing trace with hash 515535126, now seen corresponding path program 1 times [2018-02-02 09:25:47,724 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:25:47,724 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:25:47,725 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:25:47,726 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:25:47,726 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:25:47,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:25:47,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:25:47,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:25:47,749 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:25:47,749 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 09:25:47,749 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:25:47,749 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:25:47,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:25:47,750 INFO L87 Difference]: Start difference. First operand 153 states and 160 transitions. Second operand 6 states. [2018-02-02 09:25:47,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:25:47,761 INFO L93 Difference]: Finished difference Result 138 states and 144 transitions. [2018-02-02 09:25:47,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:25:47,761 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-02-02 09:25:47,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:25:47,762 INFO L225 Difference]: With dead ends: 138 [2018-02-02 09:25:47,762 INFO L226 Difference]: Without dead ends: 138 [2018-02-02 09:25:47,762 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:25:47,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-02 09:25:47,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-02-02 09:25:47,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-02-02 09:25:47,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 144 transitions. [2018-02-02 09:25:47,765 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 144 transitions. Word has length 36 [2018-02-02 09:25:47,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:25:47,765 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 144 transitions. [2018-02-02 09:25:47,765 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:25:47,765 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 144 transitions. [2018-02-02 09:25:47,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 09:25:47,765 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:25:47,766 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-02 09:25:47,766 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 09:25:47,766 INFO L82 PathProgramCache]: Analyzing trace with hash -723967063, now seen corresponding path program 1 times [2018-02-02 09:25:47,766 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:25:47,766 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:25:47,766 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:25:47,767 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:25:47,767 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:25:47,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:25:47,778 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:25:47,868 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-02 09:25:47,868 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:25:47,868 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 09:25:47,868 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 09:25:47,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 09:25:47,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:25:47,869 INFO L87 Difference]: Start difference. First operand 138 states and 144 transitions. Second operand 10 states. [2018-02-02 09:25:48,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:25:48,069 INFO L93 Difference]: Finished difference Result 136 states and 142 transitions. [2018-02-02 09:25:48,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:25:48,069 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-02-02 09:25:48,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:25:48,070 INFO L225 Difference]: With dead ends: 136 [2018-02-02 09:25:48,070 INFO L226 Difference]: Without dead ends: 136 [2018-02-02 09:25:48,070 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:25:48,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-02-02 09:25:48,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-02-02 09:25:48,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-02-02 09:25:48,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 142 transitions. [2018-02-02 09:25:48,072 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 142 transitions. Word has length 42 [2018-02-02 09:25:48,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:25:48,072 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 142 transitions. [2018-02-02 09:25:48,073 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 09:25:48,073 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 142 transitions. [2018-02-02 09:25:48,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 09:25:48,073 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:25:48,073 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-02 09:25:48,073 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 09:25:48,073 INFO L82 PathProgramCache]: Analyzing trace with hash -723967062, now seen corresponding path program 1 times [2018-02-02 09:25:48,073 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:25:48,073 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:25:48,074 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:25:48,074 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:25:48,074 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:25:48,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:25:48,082 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:25:48,107 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:25:48,107 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:25:48,107 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:25:48,120 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:25:48,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:25:48,146 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:25:48,154 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:25:48,183 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:25:48,183 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-02-02 09:25:48,183 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:25:48,184 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:25:48,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:25:48,184 INFO L87 Difference]: Start difference. First operand 136 states and 142 transitions. Second operand 8 states. [2018-02-02 09:25:48,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:25:48,204 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2018-02-02 09:25:48,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 09:25:48,204 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-02-02 09:25:48,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:25:48,205 INFO L225 Difference]: With dead ends: 139 [2018-02-02 09:25:48,205 INFO L226 Difference]: Without dead ends: 137 [2018-02-02 09:25:48,205 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-02 09:25:48,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-02-02 09:25:48,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-02-02 09:25:48,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-02 09:25:48,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 143 transitions. [2018-02-02 09:25:48,208 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 143 transitions. Word has length 42 [2018-02-02 09:25:48,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:25:48,208 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 143 transitions. [2018-02-02 09:25:48,208 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:25:48,208 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 143 transitions. [2018-02-02 09:25:48,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 09:25:48,209 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:25:48,209 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-02 09:25:48,209 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 09:25:48,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1816266347, now seen corresponding path program 2 times [2018-02-02 09:25:48,209 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:25:48,209 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:25:48,210 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:25:48,210 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:25:48,210 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:25:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:25:48,219 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:25:48,251 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:25:48,251 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:25:48,251 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:25:48,260 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 09:25:48,278 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:25:48,280 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:25:48,283 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:25:48,292 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-02 09:25:48,292 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:25:48,304 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-02 09:25:48,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:25:48,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-02 09:25:48,316 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-02-02 09:25:50,494 WARN L143 SmtUtils]: Spent 2032ms on a formula simplification that was a NOOP. DAG size: 27 [2018-02-02 09:25:50,750 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-02 09:25:50,766 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:25:50,766 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 22 [2018-02-02 09:25:50,766 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 09:25:50,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 09:25:50,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2018-02-02 09:25:50,766 INFO L87 Difference]: Start difference. First operand 137 states and 143 transitions. Second operand 22 states. [2018-02-02 09:25:51,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:25:51,589 INFO L93 Difference]: Finished difference Result 138 states and 144 transitions. [2018-02-02 09:25:51,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 09:25:51,589 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 43 [2018-02-02 09:25:51,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:25:51,589 INFO L225 Difference]: With dead ends: 138 [2018-02-02 09:25:51,589 INFO L226 Difference]: Without dead ends: 136 [2018-02-02 09:25:51,590 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=147, Invalid=845, Unknown=0, NotChecked=0, Total=992 [2018-02-02 09:25:51,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-02-02 09:25:51,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-02-02 09:25:51,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-02-02 09:25:51,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 142 transitions. [2018-02-02 09:25:51,592 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 142 transitions. Word has length 43 [2018-02-02 09:25:51,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:25:51,592 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 142 transitions. [2018-02-02 09:25:51,592 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 09:25:51,592 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 142 transitions. [2018-02-02 09:25:51,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 09:25:51,593 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:25:51,593 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] [2018-02-02 09:25:51,593 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 09:25:51,593 INFO L82 PathProgramCache]: Analyzing trace with hash -2123180192, now seen corresponding path program 1 times [2018-02-02 09:25:51,594 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:25:51,594 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:25:51,594 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:25:51,595 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:25:51,595 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:25:51,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:25:51,604 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:25:51,640 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-02 09:25:51,640 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:25:51,640 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 09:25:51,640 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:25:51,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:25:51,640 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:25:51,641 INFO L87 Difference]: Start difference. First operand 136 states and 142 transitions. Second operand 8 states. [2018-02-02 09:25:51,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:25:51,664 INFO L93 Difference]: Finished difference Result 138 states and 143 transitions. [2018-02-02 09:25:51,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:25:51,675 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-02-02 09:25:51,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:25:51,675 INFO L225 Difference]: With dead ends: 138 [2018-02-02 09:25:51,675 INFO L226 Difference]: Without dead ends: 136 [2018-02-02 09:25:51,676 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:25:51,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-02-02 09:25:51,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-02-02 09:25:51,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-02-02 09:25:51,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 141 transitions. [2018-02-02 09:25:51,678 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 141 transitions. Word has length 47 [2018-02-02 09:25:51,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:25:51,678 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 141 transitions. [2018-02-02 09:25:51,678 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:25:51,678 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 141 transitions. [2018-02-02 09:25:51,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 09:25:51,678 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:25:51,679 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] [2018-02-02 09:25:51,679 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 09:25:51,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1684319326, now seen corresponding path program 1 times [2018-02-02 09:25:51,679 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:25:51,679 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:25:51,679 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:25:51,680 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:25:51,680 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:25:51,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:25:51,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:25:51,733 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-02 09:25:51,733 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:25:51,733 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 09:25:51,733 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 09:25:51,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 09:25:51,734 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:25:51,734 INFO L87 Difference]: Start difference. First operand 136 states and 141 transitions. Second operand 10 states. [2018-02-02 09:25:51,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:25:51,773 INFO L93 Difference]: Finished difference Result 140 states and 144 transitions. [2018-02-02 09:25:51,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:25:51,774 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2018-02-02 09:25:51,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:25:51,774 INFO L225 Difference]: With dead ends: 140 [2018-02-02 09:25:51,775 INFO L226 Difference]: Without dead ends: 136 [2018-02-02 09:25:51,775 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:25:51,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-02-02 09:25:51,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-02-02 09:25:51,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-02-02 09:25:51,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 140 transitions. [2018-02-02 09:25:51,777 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 140 transitions. Word has length 52 [2018-02-02 09:25:51,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:25:51,777 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 140 transitions. [2018-02-02 09:25:51,777 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 09:25:51,778 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 140 transitions. [2018-02-02 09:25:51,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 09:25:51,778 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:25:51,778 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] [2018-02-02 09:25:51,778 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 09:25:51,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1703813979, now seen corresponding path program 1 times [2018-02-02 09:25:51,778 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:25:51,778 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:25:51,779 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:25:51,779 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:25:51,779 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:25:51,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:25:51,789 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:25:51,896 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-02 09:25:51,896 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:25:51,896 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 09:25:51,896 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 09:25:51,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 09:25:51,896 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:25:51,897 INFO L87 Difference]: Start difference. First operand 136 states and 140 transitions. Second operand 13 states. [2018-02-02 09:25:52,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:25:52,068 INFO L93 Difference]: Finished difference Result 134 states and 138 transitions. [2018-02-02 09:25:52,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 09:25:52,069 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 63 [2018-02-02 09:25:52,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:25:52,069 INFO L225 Difference]: With dead ends: 134 [2018-02-02 09:25:52,069 INFO L226 Difference]: Without dead ends: 134 [2018-02-02 09:25:52,070 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-02-02 09:25:52,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-02 09:25:52,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-02-02 09:25:52,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-02 09:25:52,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 138 transitions. [2018-02-02 09:25:52,073 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 138 transitions. Word has length 63 [2018-02-02 09:25:52,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:25:52,073 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 138 transitions. [2018-02-02 09:25:52,073 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 09:25:52,073 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 138 transitions. [2018-02-02 09:25:52,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 09:25:52,074 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:25:52,074 INFO L351 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:25:52,074 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 09:25:52,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1703813980, now seen corresponding path program 1 times [2018-02-02 09:25:52,074 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:25:52,075 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:25:52,075 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:25:52,075 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:25:52,075 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:25:52,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:25:52,089 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:25:52,145 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:25:52,145 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:25:52,145 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:25:52,150 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:25:52,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:25:52,174 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:25:52,184 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:25:52,204 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:25:52,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-02-02 09:25:52,205 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 09:25:52,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 09:25:52,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:25:52,205 INFO L87 Difference]: Start difference. First operand 134 states and 138 transitions. Second operand 10 states. [2018-02-02 09:25:52,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:25:52,222 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2018-02-02 09:25:52,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 09:25:52,222 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2018-02-02 09:25:52,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:25:52,223 INFO L225 Difference]: With dead ends: 137 [2018-02-02 09:25:52,223 INFO L226 Difference]: Without dead ends: 135 [2018-02-02 09:25:52,223 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 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-02 09:25:52,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-02 09:25:52,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-02-02 09:25:52,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-02 09:25:52,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2018-02-02 09:25:52,226 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 63 [2018-02-02 09:25:52,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:25:52,226 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2018-02-02 09:25:52,226 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 09:25:52,226 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2018-02-02 09:25:52,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 09:25:52,227 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:25:52,227 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] [2018-02-02 09:25:52,227 INFO L371 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 09:25:52,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1580383825, now seen corresponding path program 2 times [2018-02-02 09:25:52,227 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:25:52,227 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:25:52,228 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:25:52,228 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:25:52,228 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:25:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:25:52,241 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:25:52,321 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:25:52,321 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:25:52,321 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:25:52,327 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 09:25:52,355 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:25:52,360 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:25:52,364 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:25:52,374 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-02 09:25:52,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:25:52,424 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-02 09:25:52,425 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:25:52,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-02 09:25:52,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-02-02 09:25:53,011 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-02 09:25:53,028 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:25:53,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [10] total 27 [2018-02-02 09:25:53,045 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 09:25:53,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 09:25:53,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2018-02-02 09:25:53,046 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand 27 states. [2018-02-02 09:25:57,394 WARN L143 SmtUtils]: Spent 4031ms on a formula simplification that was a NOOP. DAG size: 32 [2018-02-02 09:25:58,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:25:58,047 INFO L93 Difference]: Finished difference Result 136 states and 140 transitions. [2018-02-02 09:25:58,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 09:25:58,048 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 64 [2018-02-02 09:25:58,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:25:58,048 INFO L225 Difference]: With dead ends: 136 [2018-02-02 09:25:58,048 INFO L226 Difference]: Without dead ends: 134 [2018-02-02 09:25:58,049 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=213, Invalid=1347, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 09:25:58,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-02 09:25:58,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-02-02 09:25:58,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-02 09:25:58,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 138 transitions. [2018-02-02 09:25:58,051 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 138 transitions. Word has length 64 [2018-02-02 09:25:58,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:25:58,051 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 138 transitions. [2018-02-02 09:25:58,051 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 09:25:58,051 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 138 transitions. [2018-02-02 09:25:58,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 09:25:58,051 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:25:58,051 INFO L351 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:25:58,052 INFO L371 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 09:25:58,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1086612526, now seen corresponding path program 1 times [2018-02-02 09:25:58,052 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:25:58,052 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:25:58,053 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:25:58,053 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:25:58,053 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:25:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:25:58,061 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:25:58,139 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-02-02 09:25:58,139 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:25:58,139 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 09:25:58,140 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 09:25:58,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 09:25:58,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-02 09:25:58,140 INFO L87 Difference]: Start difference. First operand 134 states and 138 transitions. Second operand 11 states. [2018-02-02 09:25:58,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:25:58,200 INFO L93 Difference]: Finished difference Result 137 states and 140 transitions. [2018-02-02 09:25:58,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 09:25:58,200 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2018-02-02 09:25:58,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:25:58,201 INFO L225 Difference]: With dead ends: 137 [2018-02-02 09:25:58,201 INFO L226 Difference]: Without dead ends: 134 [2018-02-02 09:25:58,201 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:25:58,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-02 09:25:58,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-02-02 09:25:58,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-02 09:25:58,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 137 transitions. [2018-02-02 09:25:58,204 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 137 transitions. Word has length 74 [2018-02-02 09:25:58,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:25:58,204 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 137 transitions. [2018-02-02 09:25:58,204 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 09:25:58,204 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 137 transitions. [2018-02-02 09:25:58,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 09:25:58,205 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:25:58,205 INFO L351 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:25:58,205 INFO L371 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 09:25:58,205 INFO L82 PathProgramCache]: Analyzing trace with hash 27384906, now seen corresponding path program 1 times [2018-02-02 09:25:58,206 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:25:58,206 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:25:58,206 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:25:58,206 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:25:58,207 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:25:58,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:25:58,224 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:25:58,387 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-02-02 09:25:58,388 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:25:58,388 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-02 09:25:58,388 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 09:25:58,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 09:25:58,388 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-02-02 09:25:58,388 INFO L87 Difference]: Start difference. First operand 134 states and 137 transitions. Second operand 18 states. [2018-02-02 09:25:58,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:25:58,658 INFO L93 Difference]: Finished difference Result 141 states and 144 transitions. [2018-02-02 09:25:58,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 09:25:58,658 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2018-02-02 09:25:58,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:25:58,659 INFO L225 Difference]: With dead ends: 141 [2018-02-02 09:25:58,659 INFO L226 Difference]: Without dead ends: 141 [2018-02-02 09:25:58,659 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2018-02-02 09:25:58,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-02 09:25:58,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 132. [2018-02-02 09:25:58,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-02-02 09:25:58,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 135 transitions. [2018-02-02 09:25:58,661 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 135 transitions. Word has length 87 [2018-02-02 09:25:58,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:25:58,661 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 135 transitions. [2018-02-02 09:25:58,661 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 09:25:58,661 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 135 transitions. [2018-02-02 09:25:58,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 09:25:58,661 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:25:58,662 INFO L351 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:25:58,662 INFO L371 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 09:25:58,662 INFO L82 PathProgramCache]: Analyzing trace with hash 27384907, now seen corresponding path program 1 times [2018-02-02 09:25:58,662 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:25:58,662 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:25:58,663 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:25:58,663 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:25:58,663 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:25:58,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:25:58,679 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:25:58,758 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:25:58,758 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:25:58,758 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:25:58,780 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:25:58,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:25:58,828 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:25:58,844 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:25:58,873 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:25:58,874 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-02-02 09:25:58,874 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 09:25:58,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 09:25:58,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:25:58,874 INFO L87 Difference]: Start difference. First operand 132 states and 135 transitions. Second operand 12 states. [2018-02-02 09:25:58,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:25:58,910 INFO L93 Difference]: Finished difference Result 135 states and 138 transitions. [2018-02-02 09:25:58,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 09:25:58,912 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 87 [2018-02-02 09:25:58,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:25:58,913 INFO L225 Difference]: With dead ends: 135 [2018-02-02 09:25:58,913 INFO L226 Difference]: Without dead ends: 133 [2018-02-02 09:25:58,914 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:25:58,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-02 09:25:58,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-02-02 09:25:58,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-02-02 09:25:58,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 136 transitions. [2018-02-02 09:25:58,916 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 136 transitions. Word has length 87 [2018-02-02 09:25:58,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:25:58,917 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 136 transitions. [2018-02-02 09:25:58,917 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 09:25:58,917 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2018-02-02 09:25:58,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-02 09:25:58,917 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:25:58,918 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, 1, 1, 1, 1, 1, 1] [2018-02-02 09:25:58,918 INFO L371 AbstractCegarLoop]: === Iteration 23 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 09:25:58,918 INFO L82 PathProgramCache]: Analyzing trace with hash -556652480, now seen corresponding path program 2 times [2018-02-02 09:25:58,918 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:25:58,918 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:25:58,919 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:25:58,919 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:25:58,919 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:25:58,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:25:58,934 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:25:59,017 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:25:59,017 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:25:59,017 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:25:59,025 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 09:25:59,062 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:25:59,066 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:25:59,069 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:25:59,076 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-02 09:25:59,076 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:25:59,085 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-02 09:25:59,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:25:59,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-02 09:25:59,095 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-02-02 09:25:59,830 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-02 09:25:59,859 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:25:59,860 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [12] total 31 [2018-02-02 09:25:59,860 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 09:25:59,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 09:25:59,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=804, Unknown=0, NotChecked=0, Total=930 [2018-02-02 09:25:59,861 INFO L87 Difference]: Start difference. First operand 133 states and 136 transitions. Second operand 31 states. [2018-02-02 09:26:04,362 WARN L143 SmtUtils]: Spent 4032ms on a formula simplification that was a NOOP. DAG size: 36 [2018-02-02 09:26:05,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:26:05,202 INFO L93 Difference]: Finished difference Result 134 states and 137 transitions. [2018-02-02 09:26:05,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 09:26:05,203 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 88 [2018-02-02 09:26:05,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:26:05,203 INFO L225 Difference]: With dead ends: 134 [2018-02-02 09:26:05,203 INFO L226 Difference]: Without dead ends: 132 [2018-02-02 09:26:05,204 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=286, Invalid=1876, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 09:26:05,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-02 09:26:05,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-02-02 09:26:05,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-02-02 09:26:05,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 135 transitions. [2018-02-02 09:26:05,207 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 135 transitions. Word has length 88 [2018-02-02 09:26:05,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:26:05,207 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 135 transitions. [2018-02-02 09:26:05,207 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 09:26:05,208 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 135 transitions. [2018-02-02 09:26:05,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 09:26:05,208 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:26:05,209 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, 1, 1, 1, 1] [2018-02-02 09:26:05,209 INFO L371 AbstractCegarLoop]: === Iteration 24 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 09:26:05,209 INFO L82 PathProgramCache]: Analyzing trace with hash -2005833160, now seen corresponding path program 1 times [2018-02-02 09:26:05,209 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:26:05,209 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:26:05,210 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:26:05,210 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:26:05,210 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:26:05,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:26:05,223 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:26:05,311 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-02 09:26:05,312 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:26:05,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 09:26:05,312 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 09:26:05,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 09:26:05,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-02 09:26:05,313 INFO L87 Difference]: Start difference. First operand 132 states and 135 transitions. Second operand 11 states. [2018-02-02 09:26:05,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:26:05,379 INFO L93 Difference]: Finished difference Result 134 states and 136 transitions. [2018-02-02 09:26:05,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 09:26:05,379 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 87 [2018-02-02 09:26:05,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:26:05,380 INFO L225 Difference]: With dead ends: 134 [2018-02-02 09:26:05,380 INFO L226 Difference]: Without dead ends: 132 [2018-02-02 09:26:05,380 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:26:05,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-02 09:26:05,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-02-02 09:26:05,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-02-02 09:26:05,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 134 transitions. [2018-02-02 09:26:05,383 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 134 transitions. Word has length 87 [2018-02-02 09:26:05,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:26:05,383 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 134 transitions. [2018-02-02 09:26:05,383 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 09:26:05,383 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 134 transitions. [2018-02-02 09:26:05,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-02-02 09:26:05,384 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:26:05,384 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:26:05,385 INFO L371 AbstractCegarLoop]: === Iteration 25 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 09:26:05,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1275758021, now seen corresponding path program 1 times [2018-02-02 09:26:05,385 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:26:05,385 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:26:05,386 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:26:05,386 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:26:05,386 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:26:05,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:26:05,405 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:26:05,660 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-02 09:26:05,660 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:26:05,660 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-02-02 09:26:05,661 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 09:26:05,661 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 09:26:05,661 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2018-02-02 09:26:05,661 INFO L87 Difference]: Start difference. First operand 132 states and 134 transitions. Second operand 22 states. [2018-02-02 09:26:06,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:26:06,048 INFO L93 Difference]: Finished difference Result 135 states and 137 transitions. [2018-02-02 09:26:06,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 09:26:06,049 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 103 [2018-02-02 09:26:06,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:26:06,049 INFO L225 Difference]: With dead ends: 135 [2018-02-02 09:26:06,049 INFO L226 Difference]: Without dead ends: 135 [2018-02-02 09:26:06,050 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2018-02-02 09:26:06,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-02 09:26:06,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 130. [2018-02-02 09:26:06,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-02 09:26:06,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 132 transitions. [2018-02-02 09:26:06,052 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 132 transitions. Word has length 103 [2018-02-02 09:26:06,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:26:06,053 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 132 transitions. [2018-02-02 09:26:06,053 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 09:26:06,053 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 132 transitions. [2018-02-02 09:26:06,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-02-02 09:26:06,054 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:26:06,054 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:26:06,054 INFO L371 AbstractCegarLoop]: === Iteration 26 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 09:26:06,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1275758020, now seen corresponding path program 1 times [2018-02-02 09:26:06,054 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:26:06,054 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:26:06,055 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:26:06,055 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:26:06,055 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:26:06,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:26:06,073 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:26:06,185 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:26:06,185 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:26:06,185 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:26:06,190 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:26:06,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:26:06,239 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:26:06,252 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:26:06,269 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:26:06,269 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-02-02 09:26:06,269 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 09:26:06,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 09:26:06,270 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:26:06,270 INFO L87 Difference]: Start difference. First operand 130 states and 132 transitions. Second operand 14 states. [2018-02-02 09:26:06,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:26:06,291 INFO L93 Difference]: Finished difference Result 133 states and 135 transitions. [2018-02-02 09:26:06,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 09:26:06,292 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 103 [2018-02-02 09:26:06,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:26:06,293 INFO L225 Difference]: With dead ends: 133 [2018-02-02 09:26:06,293 INFO L226 Difference]: Without dead ends: 131 [2018-02-02 09:26:06,293 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2018-02-02 09:26:06,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-02 09:26:06,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-02-02 09:26:06,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-02-02 09:26:06,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 133 transitions. [2018-02-02 09:26:06,296 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 133 transitions. Word has length 103 [2018-02-02 09:26:06,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:26:06,296 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 133 transitions. [2018-02-02 09:26:06,297 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 09:26:06,297 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 133 transitions. [2018-02-02 09:26:06,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-02-02 09:26:06,297 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:26:06,297 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:26:06,297 INFO L371 AbstractCegarLoop]: === Iteration 27 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 09:26:06,298 INFO L82 PathProgramCache]: Analyzing trace with hash 666975281, now seen corresponding path program 2 times [2018-02-02 09:26:06,298 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:26:06,298 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:26:06,299 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:26:06,299 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:26:06,299 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:26:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:26:06,318 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:26:06,498 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:26:06,498 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:26:06,498 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:26:06,503 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 09:26:06,534 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:26:06,539 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:26:06,543 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:26:06,547 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-02 09:26:06,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:26:06,557 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-02 09:26:06,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:26:06,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-02 09:26:06,566 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-02-02 09:26:08,812 WARN L146 SmtUtils]: Spent 2038ms on a formula simplification. DAG size of input: 46 DAG size of output 17 [2018-02-02 09:26:09,409 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-02-02 09:26:09,427 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:26:09,427 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [14] total 37 [2018-02-02 09:26:09,427 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-02 09:26:09,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-02 09:26:09,428 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1167, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 09:26:09,428 INFO L87 Difference]: Start difference. First operand 131 states and 133 transitions. Second operand 37 states. [2018-02-02 09:26:11,791 WARN L143 SmtUtils]: Spent 2022ms on a formula simplification that was a NOOP. DAG size: 35 [2018-02-02 09:26:13,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:26:13,026 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2018-02-02 09:26:13,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 09:26:13,026 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 104 [2018-02-02 09:26:13,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:26:13,026 INFO L225 Difference]: With dead ends: 132 [2018-02-02 09:26:13,027 INFO L226 Difference]: Without dead ends: 130 [2018-02-02 09:26:13,027 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 77 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=385, Invalid=2807, Unknown=0, NotChecked=0, Total=3192 [2018-02-02 09:26:13,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-02 09:26:13,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-02-02 09:26:13,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-02 09:26:13,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 132 transitions. [2018-02-02 09:26:13,029 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 132 transitions. Word has length 104 [2018-02-02 09:26:13,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:26:13,030 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 132 transitions. [2018-02-02 09:26:13,030 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-02 09:26:13,030 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 132 transitions. [2018-02-02 09:26:13,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-02-02 09:26:13,030 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:26:13,031 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:26:13,031 INFO L371 AbstractCegarLoop]: === Iteration 28 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 09:26:13,031 INFO L82 PathProgramCache]: Analyzing trace with hash -603686051, now seen corresponding path program 1 times [2018-02-02 09:26:13,031 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:26:13,031 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:26:13,032 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:26:13,032 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:26:13,032 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:26:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:26:13,050 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:26:13,167 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:26:13,168 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:26:13,168 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:26:13,175 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:26:13,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:26:13,239 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:26:13,249 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:26:13,276 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:26:13,276 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-02-02 09:26:13,276 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 09:26:13,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 09:26:13,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:26:13,277 INFO L87 Difference]: Start difference. First operand 130 states and 132 transitions. Second operand 16 states. [2018-02-02 09:26:13,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:26:13,301 INFO L93 Difference]: Finished difference Result 133 states and 135 transitions. [2018-02-02 09:26:13,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 09:26:13,301 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 109 [2018-02-02 09:26:13,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:26:13,301 INFO L225 Difference]: With dead ends: 133 [2018-02-02 09:26:13,301 INFO L226 Difference]: Without dead ends: 131 [2018-02-02 09:26:13,302 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 109 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-02 09:26:13,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-02 09:26:13,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-02-02 09:26:13,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-02-02 09:26:13,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 133 transitions. [2018-02-02 09:26:13,303 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 133 transitions. Word has length 109 [2018-02-02 09:26:13,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:26:13,303 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 133 transitions. [2018-02-02 09:26:13,303 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 09:26:13,304 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 133 transitions. [2018-02-02 09:26:13,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-02-02 09:26:13,304 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:26:13,304 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:26:13,304 INFO L371 AbstractCegarLoop]: === Iteration 29 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 09:26:13,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1049768338, now seen corresponding path program 2 times [2018-02-02 09:26:13,304 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:26:13,304 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:26:13,305 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:26:13,305 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:26:13,305 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:26:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:26:13,316 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:26:13,447 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:26:13,447 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:26:13,447 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:26:13,454 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 09:26:13,493 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:26:13,498 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:26:13,503 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:26:13,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 09:26:13,564 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 8 treesize of output 7 [2018-02-02 09:26:13,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:26:13,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:26:13,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:26:13,565 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-02-02 09:26:13,624 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:26:13,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:26:13,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 09:26:13,629 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:26 [2018-02-02 09:26:13,631 WARN L1033 $PredicateComparison]: unable to prove that (exists ((LDV_INIT_LIST_HEAD_~list.offset Int) (v_DerPreprocessor_2 Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (let ((.cse0 (+ LDV_INIT_LIST_HEAD_~list.offset 4))) (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) LDV_INIT_LIST_HEAD_~list.offset v_DerPreprocessor_2) .cse0 (select (select |c_#memory_int| |c_LDV_INIT_LIST_HEAD_#in~list.base|) .cse0))))) (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) is different from true [2018-02-02 09:26:13,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2018-02-02 09:26:13,637 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:26:13,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-02-02 09:26:13,648 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:26:13,649 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:26:13,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-02-02 09:26:13,652 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 09:26:13,656 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:26:13,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:26:13,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:26:13,661 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:37, output treesize:9 [2018-02-02 09:26:13,911 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:26:13,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 36 [2018-02-02 09:26:13,913 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:26:13,913 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:26:13,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2018-02-02 09:26:13,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:26:13,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:26:13,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:26:13,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:13 [2018-02-02 09:26:14,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-02-02 09:26:14,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 13 treesize of output 5 [2018-02-02 09:26:14,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:26:14,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:26:14,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:26:14,236 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-02-02 09:26:14,278 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-02-02 09:26:14,309 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:26:14,309 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [41] imperfect sequences [16] total 55 [2018-02-02 09:26:14,310 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-02-02 09:26:14,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-02-02 09:26:14,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2668, Unknown=1, NotChecked=104, Total=2970 [2018-02-02 09:26:14,311 INFO L87 Difference]: Start difference. First operand 131 states and 133 transitions. Second operand 55 states. [2018-02-02 09:26:15,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:26:15,747 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-02-02 09:26:15,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-02 09:26:15,748 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 110 [2018-02-02 09:26:15,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:26:15,748 INFO L225 Difference]: With dead ends: 114 [2018-02-02 09:26:15,748 INFO L226 Difference]: Without dead ends: 112 [2018-02-02 09:26:15,750 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=309, Invalid=5394, Unknown=1, NotChecked=148, Total=5852 [2018-02-02 09:26:15,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-02 09:26:15,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-02-02 09:26:15,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-02 09:26:15,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-02-02 09:26:15,752 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2018-02-02 09:26:15,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:26:15,752 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-02-02 09:26:15,752 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-02-02 09:26:15,752 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-02-02 09:26:15,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-02-02 09:26:15,753 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:26:15,753 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:26:15,753 INFO L371 AbstractCegarLoop]: === Iteration 30 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 09:26:15,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1499710248, now seen corresponding path program 1 times [2018-02-02 09:26:15,753 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:26:15,753 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:26:15,754 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:26:15,754 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:26:15,754 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:26:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:26:15,772 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:26:15,902 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:26:15,902 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:26:15,902 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:26:15,907 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:26:15,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:26:15,955 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:26:15,967 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:26:15,984 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:26:15,984 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-02-02 09:26:15,985 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 09:26:15,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 09:26:15,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-02-02 09:26:15,985 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 18 states. [2018-02-02 09:26:16,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:26:16,011 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-02-02 09:26:16,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 09:26:16,012 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 111 [2018-02-02 09:26:16,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:26:16,012 INFO L225 Difference]: With dead ends: 115 [2018-02-02 09:26:16,012 INFO L226 Difference]: Without dead ends: 113 [2018-02-02 09:26:16,013 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=142, Invalid=200, Unknown=0, NotChecked=0, Total=342 [2018-02-02 09:26:16,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-02 09:26:16,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-02-02 09:26:16,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-02 09:26:16,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-02-02 09:26:16,015 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2018-02-02 09:26:16,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:26:16,015 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-02-02 09:26:16,015 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 09:26:16,015 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-02-02 09:26:16,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-02-02 09:26:16,015 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:26:16,015 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:26:16,015 INFO L371 AbstractCegarLoop]: === Iteration 31 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 09:26:16,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1331478557, now seen corresponding path program 2 times [2018-02-02 09:26:16,016 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:26:16,016 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:26:16,016 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:26:16,016 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:26:16,016 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:26:16,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:26:16,028 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:26:16,171 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:26:16,172 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:26:16,172 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:26:16,180 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 09:26:16,226 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:26:16,265 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:26:16,267 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:26:16,269 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:26:16,284 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:26:16,314 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:26:16,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-02-02 09:26:16,315 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 09:26:16,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 09:26:16,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-02-02 09:26:16,316 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 19 states. [2018-02-02 09:26:16,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:26:16,343 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-02-02 09:26:16,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 09:26:16,343 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 112 [2018-02-02 09:26:16,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:26:16,344 INFO L225 Difference]: With dead ends: 116 [2018-02-02 09:26:16,344 INFO L226 Difference]: Without dead ends: 114 [2018-02-02 09:26:16,344 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 112 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-02 09:26:16,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-02 09:26:16,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-02-02 09:26:16,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 09:26:16,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-02-02 09:26:16,346 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2018-02-02 09:26:16,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:26:16,346 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-02-02 09:26:16,346 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 09:26:16,346 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-02-02 09:26:16,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-02-02 09:26:16,346 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:26:16,346 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:26:16,347 INFO L371 AbstractCegarLoop]: === Iteration 32 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 09:26:16,347 INFO L82 PathProgramCache]: Analyzing trace with hash 411263432, now seen corresponding path program 3 times [2018-02-02 09:26:16,347 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:26:16,347 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:26:16,348 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:26:16,348 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:26:16,348 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:26:16,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:26:16,366 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:26:16,507 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:26:16,507 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:26:16,507 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:26:16,514 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 09:26:16,548 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 09:26:16,571 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 09:26:16,627 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 09:26:16,870 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 09:26:17,272 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 09:26:18,390 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 09:26:19,065 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 09:26:23,086 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 09:26:25,333 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 09:26:25,335 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:26:25,342 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:26:25,530 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:26:25,549 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:26:25,550 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 24] total 41 [2018-02-02 09:26:25,550 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-02 09:26:25,550 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-02 09:26:25,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=1168, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 09:26:25,551 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 41 states. [2018-02-02 09:26:25,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:26:25,673 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-02-02 09:26:25,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 09:26:25,675 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 113 [2018-02-02 09:26:25,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:26:25,675 INFO L225 Difference]: With dead ends: 117 [2018-02-02 09:26:25,675 INFO L226 Difference]: Without dead ends: 115 [2018-02-02 09:26:25,676 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=518, Invalid=1374, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 09:26:25,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-02 09:26:25,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-02-02 09:26:25,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-02 09:26:25,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-02-02 09:26:25,677 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2018-02-02 09:26:25,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:26:25,677 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-02-02 09:26:25,677 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-02 09:26:25,677 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-02-02 09:26:25,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-02-02 09:26:25,678 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:26:25,678 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:26:25,678 INFO L371 AbstractCegarLoop]: === Iteration 33 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 09:26:25,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1949365629, now seen corresponding path program 4 times [2018-02-02 09:26:25,678 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:26:25,678 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:26:25,679 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:26:25,679 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:26:25,679 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:26:25,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-02 09:26:25,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-02 09:26:25,810 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-02 09:26:25,826 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-02-02 09:26:25,831 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-02 09:26:25,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:26:25 BoogieIcfgContainer [2018-02-02 09:26:25,847 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 09:26:25,848 INFO L168 Benchmark]: Toolchain (without parser) took 45964.82 ms. Allocated memory was 399.5 MB in the beginning and 870.3 MB in the end (delta: 470.8 MB). Free memory was 356.2 MB in the beginning and 440.3 MB in the end (delta: -84.1 MB). Peak memory consumption was 386.7 MB. Max. memory is 5.3 GB. [2018-02-02 09:26:25,849 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 399.5 MB. Free memory is still 362.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 09:26:25,849 INFO L168 Benchmark]: CACSL2BoogieTranslator took 171.24 ms. Allocated memory is still 399.5 MB. Free memory was 356.2 MB in the beginning and 341.7 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. [2018-02-02 09:26:25,850 INFO L168 Benchmark]: Boogie Preprocessor took 28.96 ms. Allocated memory is still 399.5 MB. Free memory was 341.7 MB in the beginning and 340.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 09:26:25,850 INFO L168 Benchmark]: RCFGBuilder took 353.65 ms. Allocated memory is still 399.5 MB. Free memory was 340.3 MB in the beginning and 303.2 MB in the end (delta: 37.1 MB). Peak memory consumption was 37.1 MB. Max. memory is 5.3 GB. [2018-02-02 09:26:25,850 INFO L168 Benchmark]: TraceAbstraction took 45407.79 ms. Allocated memory was 399.5 MB in the beginning and 870.3 MB in the end (delta: 470.8 MB). Free memory was 303.2 MB in the beginning and 440.3 MB in the end (delta: -137.1 MB). Peak memory consumption was 333.7 MB. Max. memory is 5.3 GB. [2018-02-02 09:26:25,851 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.16 ms. Allocated memory is still 399.5 MB. Free memory is still 362.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 171.24 ms. Allocated memory is still 399.5 MB. Free memory was 356.2 MB in the beginning and 341.7 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.96 ms. Allocated memory is still 399.5 MB. Free memory was 341.7 MB in the beginning and 340.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 353.65 ms. Allocated memory is still 399.5 MB. Free memory was 340.3 MB in the beginning and 303.2 MB in the end (delta: 37.1 MB). Peak memory consumption was 37.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 45407.79 ms. Allocated memory was 399.5 MB in the beginning and 870.3 MB in the end (delta: 470.8 MB). Free memory was 303.2 MB in the beginning and 440.3 MB in the end (delta: -137.1 MB). Peak memory consumption was 333.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1443]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1443. Possible FailurePath: [L1444] CALL entry_point() [L1436] struct ldv_kobject *kobj; [L1437] CALL, EXPR ldv_kobject_create() [L1406] struct ldv_kobject *kobj; [L1408] CALL, EXPR ldv_malloc(sizeof(*kobj)) VAL [\old(size)=16] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=16, malloc(size)={19:0}, size=16] [L1074] RET return malloc(size); VAL [\old(size)=16, \result={19:0}, malloc(size)={19:0}, size=16] [L1408] EXPR ldv_malloc(sizeof(*kobj)) VAL [ldv_malloc(sizeof(*kobj))={19:0}] [L1408] kobj = ldv_malloc(sizeof(*kobj)) [L1409] COND FALSE !(!kobj) VAL [kobj={19:0}] [L1411] FCALL memset(kobj, 0, sizeof(*kobj)) VAL [kobj={19:0}, memset(kobj, 0, sizeof(*kobj))={19:0}] [L1413] CALL ldv_kobject_init(kobj) VAL [kobj={19:0}] [L1394] COND FALSE !(!kobj) VAL [kobj={19:0}, kobj={19:0}] [L1398] CALL ldv_kobject_init_internal(kobj) VAL [kobj={19:0}] [L1380] COND FALSE !(!kobj) VAL [kobj={19:0}, kobj={19:0}] [L1382] CALL ldv_kref_init(&kobj->kref) VAL [kref={19:12}] [L1294] RET, FCALL ((&kref->refcount)->counter) = (1) VAL [kref={19:12}, kref={19:12}] [L1382] ldv_kref_init(&kobj->kref) VAL [kobj={19:0}, kobj={19:0}] [L1383] CALL LDV_INIT_LIST_HEAD(&kobj->entry) VAL [list={19:4}] [L1099] FCALL list->next = list VAL [list={19:4}, list={19:4}] [L1100] FCALL list->prev = list VAL [list={19:4}, list={19:4}] [L1383] RET, FCALL LDV_INIT_LIST_HEAD(&kobj->entry) VAL [kobj={19:0}, kobj={19:0}] [L1413] ldv_kobject_init(kobj) VAL [kobj={19:0}] [L1414] RET return kobj; VAL [\result={19:0}, kobj={19:0}] [L1437] EXPR ldv_kobject_create() VAL [ldv_kobject_create()={19:0}] [L1437] kobj = ldv_kobject_create() [L1438] CALL ldv_kobject_get(kobj) VAL [kobj={19:0}] [L1373] COND TRUE \read(*kobj) VAL [kobj={19:0}, kobj={19:0}] [L1374] CALL ldv_kref_get(&kobj->kref) VAL [kref={19:12}] [L1308] CALL ldv_atomic_add_return(1, (&kref->refcount)) VAL [\old(i)=1, v={19:12}] [L1255] int temp; VAL [\old(i)=1, i=1, v={19:12}, v={19:12}] [L1256] EXPR, FCALL v->counter VAL [\old(i)=1, i=1, v={19:12}, v={19:12}, v->counter=1] [L1256] temp = v->counter [L1257] temp += i VAL [\old(i)=1, i=1, temp=2, v={19:12}, v={19:12}] [L1258] FCALL v->counter = temp VAL [\old(i)=1, i=1, temp=2, v={19:12}, v={19:12}] [L1259] RET return temp; VAL [\old(i)=1, \result=2, i=1, temp=2, v={19:12}, v={19:12}] [L1308] RET ldv_atomic_add_return(1, (&kref->refcount)) VAL [kref={19:12}, kref={19:12}, ldv_atomic_add_return(1, (&kref->refcount))=2] [L1374] ldv_kref_get(&kobj->kref) VAL [kobj={19:0}, kobj={19:0}] [L1375] RET return kobj; VAL [\result={19:0}, kobj={19:0}, kobj={19:0}] [L1438] ldv_kobject_get(kobj) VAL [kobj={19:0}, ldv_kobject_get(kobj)={19:0}] [L1440] CALL ldv_kobject_put(kobj) VAL [kobj={19:0}] [L1361] COND TRUE \read(*kobj) VAL [kobj={19:0}, kobj={19:0}] [L1363] CALL ldv_kref_put(&kobj->kref, ldv_kobject_release) VAL [kref={19:12}, release={-1:0}] [L1313] CALL, EXPR ldv_kref_sub(kref, 1, release) VAL [\old(count)=1, kref={19:12}, release={-1:0}] [L1281] CALL, EXPR ldv_atomic_sub_return(((int) count), (&kref->refcount)) VAL [\old(i)=1, v={19:12}] [L1264] int temp; VAL [\old(i)=1, i=1, v={19:12}, v={19:12}] [L1265] EXPR, FCALL v->counter VAL [\old(i)=1, i=1, v={19:12}, v={19:12}, v->counter=2] [L1265] temp = v->counter [L1266] temp -= i VAL [\old(i)=1, i=1, temp=1, v={19:12}, v={19:12}] [L1267] FCALL v->counter = temp VAL [\old(i)=1, i=1, temp=1, v={19:12}, v={19:12}] [L1268] RET return temp; VAL [\old(i)=1, \result=1, i=1, temp=1, v={19:12}, v={19:12}] [L1281] EXPR ldv_atomic_sub_return(((int) count), (&kref->refcount)) VAL [\old(count)=1, count=1, kref={19:12}, kref={19:12}, ldv_atomic_sub_return(((int) count), (&kref->refcount))=1, release={-1:0}, release={-1:0}] [L1281] COND FALSE !((ldv_atomic_sub_return(((int) count), (&kref->refcount)) == 0)) [L1285] RET return 0; VAL [\old(count)=1, \result=0, count=1, kref={19:12}, kref={19:12}, release={-1:0}, release={-1:0}] [L1313] EXPR ldv_kref_sub(kref, 1, release) VAL [kref={19:12}, kref={19:12}, ldv_kref_sub(kref, 1, release)=0, release={-1:0}, release={-1:0}] [L1313] RET return ldv_kref_sub(kref, 1, release); [L1363] ldv_kref_put(&kobj->kref, ldv_kobject_release) VAL [kobj={19:0}, kobj={19:0}, ldv_kref_put(&kobj->kref, ldv_kobject_release)=0] [L1440] FCALL ldv_kobject_put(kobj) - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 142 locations, 23 error locations. UNSAFE Result, 45.3s OverallTime, 33 OverallIterations, 16 TraceHistogramMax, 19.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3827 SDtfs, 1063 SDslu, 33462 SDs, 0 SdLazy, 11534 SolverSat, 301 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1686 GetRequests, 1105 SyntacticMatches, 10 SemanticMatches, 571 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3758 ImplicationChecksByTransitivity, 25.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=157occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 32 MinimizatonAttempts, 58 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 9.5s SatisfiabilityAnalysisTime, 14.8s InterpolantComputationTime, 3365 NumberOfCodeBlocks, 3323 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 3204 ConstructedInterpolants, 272 QuantifiedInterpolants, 1011115 SizeOfPredicates, 113 NumberOfNonLiveVariables, 5589 ConjunctsInSsa, 581 ConjunctsInUnsatCore, 47 InterpolantComputations, 23 PerfectInterpolantSequences, 400/1557 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_09-26-25-857.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_09-26-25-857.csv Received shutdown request...